卡片
卡片
/
代码
#include <iostream>
using namespace std;
int a[10] = { 2019,2019,2019,2019,2019,2019,2019,2019,2019 ,2019};
bool find(int k)
{int m;while (k != 0){m = k % 10;k = k / 10;a[m]--;if (a[m] < 0)return 0;}return 1;
}
int main()
{int i;for (i = 1;; i++)if(!find(i))break;cout << i;return 0;
}


发布评论