1023 Have Fun with Numbers (20分)
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
题解:
#include <iostream>
#include <string>
using namespace std;
int main() {
string s1,s2;
int num1[10]{ 0 }, num2[10]{0},flag = 0,k=0;
cin >> s1;
for (int i = s1.size() - 1; i >= 0; i--) {
num1[s1[i] - '0']++;
int temp = (s1[i] - '0') * 2 + flag;
s2.insert(0,1, (temp >= 10 ? temp - 10 + '0' : temp + '0'));
flag = temp >= 10 ? 1 : 0;
}
if(flag) s2.insert(0,1,'1');
for (int i = 0; i < s2.size(); i++)
num2[s2[i] - '0']++;
for (int i = 0; i < 10; i++)
if (num1[i] != num2[i]) {
k = 1; break;
}
if (s1.size() != s2.size() || k)
cout << "No" << endl<<s2<<endl;
else
cout<< "Yes" << endl << s2 << endl;
return 0;
}