L1-033. 出生年

转自:http://www.cnblogs.com/ZefengYao/p/6644240.html

 

#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int num[4];
int all[10];
int main() {
int Y, N;
int first;
while (scanf("%d%d", &Y, &N) != EOF) {
first = Y;
while (1) {
num[0] = Y / 1000;
num[1] = Y / 100 % 10;
num[2] = Y / 10 % 10;
num[3] = Y % 10;
for (int i = 0; i < 4; i++) {
all[num[i]]++;
}
int sum = 0;
for (int i = 0; i < 10; i++){
if (all[i])
sum++;
}
memset(all,0,sizeof(all));
if (sum == N)
break;
Y++;

}
printf("%d %04d\n",Y-first,Y);
}
return 0;
}

posted @ 2017-08-09 10:55  diamondDemand  阅读(100)  评论(0编辑  收藏  举报