1023. Have Fun with Numbers (20)

1023. Have Fun with Numbers (20)
 
 

  
  

   
   

    
    时间限制
   
   
   
   

    
    400 ms
    
    

   
   
  
  
  
  

   
   

    
    内存限制
   
   
   
   

    
    65536 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

  
  

   
   原数由0-9几个数组成，看这个数乘二以后是否也由同样个数的0-9的排列组合。
  
  
 
 

 评测结果
 
 
时间
结果
得分
题目
语言
用时(ms)
内存(kB)
用户
7月30日
 14:03
答案正确
20
1023
C++
 (g++ 4.7.2)
1
308
datrilla
测试点
 
 
测试点
结果
用时(ms)
内存(kB)
得分/满分
0
答案正确
1
308
3/3
1
答案正确
1
180
2/2
2
答案正确
1
308
2/2
3
答案正确
1
304
2/2
4
答案正确
1
308
2/2
5
答案正确
1
308
3/3
6
答案正确
1
308
3/3
7
答案正确
1
308
3/3
 
 


 
 
 
 

  
  
#include<iostream>     
#include<string>
using namespace std;  
int main()
{ 
  int digits[10] = {0},index,c;
  string strn,doublestr;
  char tempc;
  cin >> strn; 
  for (index = strn.size(),c=0; index > 0; )
  {
    index--;
    digits[strn[index] - '0']++;
    c += (strn[index] - '0')*2;
    digits[c % 10]--;
    tempc = c % 10 + '0';
    doublestr = tempc + doublestr;
    c = c / 10;
  }
  if (0 == c)
  {
    for (index = 0; index < 10&&0==c; index++)
    {
      if (0 != digits[index])c = 1;
    }
  }
  else
  { 
    tempc = c+ '0';
    doublestr = tempc + doublestr;
  }
  if (0 == c)cout << "Yes" << endl;
  else cout << "No" << endl;
  cout << doublestr << endl;
  system("pause");   
  return 0;
}