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 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:1234567899Sample Output:
Yes 2469135798
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <stack>
using namespace std;
int book0[20]={0};//原数的book
int book[20]={0};//新数的book
int main()
{
string s;
stack<int> sta;
int i;
int flag=0;//当做进1缓存区使用
cin>>s;
int len = s.length();
for(i=len-1;i>=0;i--)
{
char tc=s[i];
int t=tc-'0';
book0[t]++;
}
for(i=len-1;i>=0;i--)
{
char tc=s[i];
int t=tc-'0';
t=t*2+flag;//将缓存区的进数读出
if(t>=10)
flag=1;
else
flag=0;
sta.push(t%10);
book[t%10]++;
}
if(flag==1)
{
sta.push(1);
book[1]++;
}
for(i=0;i<=9;i++)
{
if(book0[i]!=book[i])
break;
}
if(i==10)
printf("Yes\n");
else
printf("No\n");
while(!sta.empty())
{
printf("%d",sta.top());
sta.pop();
}
return 0;
}