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:

1234567899

Sample Output:

Yes
2469135798

题意：输入一个不超过20位的数，乘2之后的结果是原来数字排列组合之后形成的，是的话输出Yes 否则输出No

long long 存不下20位，用大数

#include<iostream>  
#include<cstring>  
#include<cstdio>  
#include<queue>  
#include<stack>  
#include<algorithm>  
#include<vector> 
#include<set>
using namespace std;
int main(){
	char s[30];
	gets(s);
	int in[100];
	int cnt[20]={0};
	for(int i=0;i<strlen(s);i++){
	   in[i]=s[strlen(s)-1-i]-'0';
	   cnt[in[i]]++;	
	}
	int out[100]={0};
	int r=0;
	for(int i=0;i<strlen(s);i++){
		out[i]=(in[i]*2+r)%10;
		r=(in[i]*2+r)/10;
	}
	
	if(r!=0){
	   cnt[r]--;
	} 
	int i=30,j;
	while(out[i]==0) i--;
	for(;i>=0;i--) cnt[out[i]]--;
	for(j=0;j<20;j++) if(cnt[j]!=0) break;
	if(j==20) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
	
	if(r!=0){
	   cout<<r;
	} 
	i=30;
	while(out[i]==0) i--;
	for(;i>=0;i--) cout<<out[i];
	return 0;
}