1023. Have Fun with Numbers (20)
来源:互联网 发布:java byte 0x00 编辑:程序博客网 时间:2024/06/02 06:50
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:
Yes2469135798
#include <cstdio>#include <cstring>using namespace std;void doubleNum(char *s){ int c = 0; int len = strlen(s); int sum[100]; memset(sum, 0, sizeof(sum)); int cnt = 0; int num[10]; memset(num, 0, sizeof(num)); for(int i = 0; i < len; i++) { num[s[i] - '0']++; } int flag = 1; for(int i = len - 1; i >= 0; i--) { sum[cnt++] = ((s[i] -'0')* 2 + c) % 10; c = ((s[i] -'0')* 2 + c) /10; num[sum[cnt - 1]]--; } if(c > 0) sum[cnt++] = c; for(int i = 0; i < 10; i++) if(num[i] != 0) { flag = 0; } if(flag == 1) printf("Yes\n"); else{ printf("No\n"); } for(int i = cnt - 1; i >= 0; i--) { printf("%d",sum[i]); }}int main(){ char s[100]; scanf("%s", s); doubleNum(s);}
- 1023. Have Fun with Numbers (20)
- 【PAT】1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- PAT: 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- PAT 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- PAT 1023. Have Fun with Numbers (20)
- PAT 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- 1023. Have Fun with Numbers (20)
- loadrunner Web_类函数之web_custom_request()
- 闭包的理解
- Python基本语法
- 使用dict和set
- mysql服务器密码忘记的解决方法之一
- 1023. Have Fun with Numbers (20)
- HTTP图片下载和本地指定文件删除
- 关于maven环境下使用pom.xml引入包名.lastUpdate包的解决办法
- 在二叉查找树中插入节点
- Win 常见问题
- exgcd知识完善
- 遍历二叉树
- String.charAt()
- JVM垃圾收集器与内存分配策略