L1-033 出生年 (15 分)
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<iomanip>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
#define mv 2147483648+30
using namespace std;
ll gcd (ll x, ll y ){
return x % y == 0 ? y : gcd(y , x%y);
}
int addition(int x[],int y[])//高精度加法
{
for(int i=0;i<100;i++)
{
y[i]+=x[i];
if(y[i]>9)
{
y[i+1]++;
y[i]-=10;
}
}
return *y;
}
int main(){
int x,y;
while(cin>>x>>y){
int i=x;
while(1){
set<int>s;
int z=i,j=4;
while(j--){
s.insert(z%10);
z/=10;
}
if(s.size()==y){
printf("%d %04d\n",i-x,i);break;
}
i++;
}
}
}