大整数运算之——1023 Have Fun with Numbers

Notice that the number 123456789 is a 9-digit number consisting exactly the numbers from 1 to 9, with no duplication. Double it we will obtain 246913578, which happens to be another 9-digit number consisting exactly the numbers from 1 to 9, only in a different permutation. Check to see the result if we double it again!

Now you are suppose to check if there are more numbers with this property. That is, double a given number with k digits, you are to tell if the resulting number consists of only a permutation of the digits in the original number.

Input Specification:

Each input contains one test case. Each case contains one positive integer with no more than 20 digits.

Output Specification:

For each test case, first print in a line "Yes" if doubling the input number gives a number that consists of only a permutation of the digits in the original number, or "No" if not. Then in the next line, print the doubled number.

Sample Input:

1234567899

Sample Output:

Yes
2469135798

 知识点

permutation  排列

注意乘法是乘了以后再加上地位进位，而除法是高位进位*10然后再除

#include <iostream>
#include <string>
using namespace std;
int count[10]={0};
bool Judge(string s1,string s2){
	if(s1.length()!=s2.length())
	    return false;
	for(int i=0;i<s2.length();i++){
    	if(count[s2[i]-'0']>0)
    	   count[s2[i]-'0']--;
    	else
    		return false;
    }
    return true;
}
int main(){
	string s1,s2;
	cin>>s1;
    int c=0,cnt;
    for(int i=s1.length()-1;i>=0;i--){
    	count[s1[i]-'0']++;
    	c=(s1[i]-'0')*2+cnt;
    	s2+=c%10+'0';
    	cnt=c/10;
    }
    if(cnt!=0)
      s2+=cnt+'0';
    if(!Judge(s1,s2))
      printf("No\n");
    else
      printf("Yes\n");
    for(int i=s2.length()-1;i>=0;i--)
       cout<<s2[i];
    
}