void Calculate(int a)

 {

 int pa = a;

 int count = ;

 int b[] = {};

 //将pa按位存储到数组b

 while(pa > )

 {

 b[count++] = pa%;

 pa = pa/;

 }

 bool flag = true; //是否有重复数

 bool carryFlag = false; //是否产生进位

 //从高位开始判断是否有重复数

 int i,j,k;

 count--;

 for(i=count;i>;i--)

 {

 if(b[i] == b[i-])

 {

 flag = false;

 b[i-]++; //有可能产生进位

 if(b[i-]>)

 carryFlag = true;

 break;

 }

 }

 if(!flag) //如果存在重复位

 {

 int c = ;

 //将低位重复数后面的数都变成0101....

 for(j = i-;j>;j--)

 {

 b[j-] = c;

 c = (c ==  ? :);

 }

 //处理进位

 if(carryFlag)

 {

 int carry = ;

 for(j = i-;j<=count + ;j++)

 {

 b[j] = b[j] + carry;

 if(b[j] >= )

 {

 carry = ;

 b[j] = b[j] - ;

 }

 }

 }

 pa = ;

 for(i = (count= ? count + :count);i >=;i--)

 {

 pa = pa * + b[i];

 }

 cout<<"the min no repeat number: "<<pa<<endl;

 }

 else

 {

 cout<<"the min no repeat number: "<<a<<endl;

 return;

 }

 }

 输入两个很大正数，输出它们的乘积

 void Multiply(const char *a,const char *b)

 {

 assert(a!=NULL && b!=NULL);

 int len_a = strlen(a);

 int len_b = strlen(b);

 int *c = new int[len_a+len_b];

 memset(c,,sizeof(int) *(len_a+len_b));

 for(int i=;i<len_a;i++)

 {

 for(int j=;j<len_b;j++)

 {

 c[i+j+] += (a[i]-'')*(b[j]-'');

 }

 }

 for(int i=len_a+len_b-;i>;i--)

 {

 if(c[i]>=)

 {

 int carry = c[i]/;

 c[i-] = c[i-] + carry;

 c[i] = c[i] % ;

 }

 }

 char *d = new char[len_a + len_b];

 int i=;

 while(c[i] == ) ++i;

 int j;

 for(j=;i<len_a+len_b;j++,i++)

 {

 d[j] = c[i] + '';

 }

 d[j] = '\0';

 for(int i=;i<len_a+len_b;i++)

 cout<<d[i];

 cout<<endl;

 }