http://pat.zju.edu.cn/contests/pat-practise/1023

1023. Have Fun with Numbers (20)

时间限制

400 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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 file 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

[cpp]  view plain copy

1. #include <iostream>  
2. #include <string>  
3. #include <algorithm>  
4. #include <memory.h>  
5. #include <cstdio>  
6. #include <cstdlib>  
7. #include <vector>  
8. using namespace std;  
9. #define MAX 0Xfffffff  
10. char s[25];  
11. int a[10];  
12. int b[30];  
13. string multi(){  
14.     string res;  
15.     int len = strlen(s);  
16.     memset(b, 0, sizeof(b));  
17.     int k = 0;  
18.     for(int i=len-1;i>=0;i--){  
19.         b[k++] = (s[i]-'0')*2;  
20.     }  
21.     for(int i=0;i<k;++i){  
22.         if(b[i]>=10){  
23.             b[i+1] += b[i]/10;  
24.             b[i] %= 10;  
25.         }  
26.     }  
27.     if(b[k]!=0)  
28.         k++;  
29.     for(int i=k-1;i>=0;--i)  
30.         res += (b[i]+'0');  
31.     return res;  
32. }  
33. bool assert(string str){  
34.     for(int i=0;i<str.length();i++){  
35.         a[str[i]-'0']--;  
36.     }  
37.     for(int i=0;i<10;++i)  
38.         if(a[i]!=0)  
39.             return false;  
40.     return true;  
41. }  
42. int main(){  
43.   
44.   //freopen("in.txt", "r", stdin);  
45.   
46.   cin>>s;  
47.   memset(a, 0, sizeof(a));  
48.   int len = strlen(s);  
49.   for(int i=0;i<len;++i){  
50.     a[s[i]-'0']++;  
51.   }  
52.   string s = multi();  
53.   if(assert(s)){  
54.     printf("Yes\n");  
55.   }else{  
56.     printf("No\n");  
57.   }  
58.   cout<<s<<endl;  
59.   
60.   
61.      
62.    //fclose(stdin);  
63. }