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 <vector>
#include <math.h>
#include <algorithm>
#include <map>
#include <sstream>
#include <string.h>
using namespace std;
typedef long long ll;
struct bign
{
int d[1000];
int len;
bign()
{
memset(d,0,sizeof(d));
len=0;
}
};
bign change(string s)
{
bign c;
c.len=s.length();
for(int i=0; i<c.len; i++)
{
c.d[i]=s[c.len-1-i]-'0';
}
return c;
}
bign multi(bign a,int b)
{
bign c;
c.len=a.len;
int carry=0;
for(int i=0; i<a.len; i++)
{
int temp=a.d[i]*b+carry;
c.d[i]=temp%10;
carry=temp/10;
}
while(carry>0)
{
c.d[c.len++]=carry%10;
carry/=10;
}
return c;
}
int num[11];
int main()
{
string s;
cin>>s;
memset(num,0,sizeof(num));
bign c = change(s);
bign d = multi(c,2);
for(int i=0; i<c.len; i++)
{
num[c.d[i]]++;
}
for(int i=0; i<d.len; i++)
{
num[d.d[i]]--;
}
int flag=0;
for(int i=0; i<10; i++)
{
if(num[i]!=0)
{
flag=1;
break;
}
}
if(flag==1)
{
cout<<"No"<<endl;
}
else
{
cout<<"Yes"<<endl;
}
for(int i=0; i<d.len; i++)
{
cout<<d.d[d.len-1-i];
}
return 0;
}