hdu 1197
来源:互联网 发布:广告设计软件怎么安装 编辑:程序博客网 时间:2024/05/16 01:14
Specialized Four-Digit Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2360 Accepted Submission(s): 1722
Problem Description
Find and list all four-digit numbers in decimal notation that have the property that the sum of its four digits equals the sum of its digits when represented in hexadecimal (base 16) notation and also equals the sum of its digits when represented in duodecimal (base 12) notation.
For example, the number 2991 has the sum of (decimal) digits 2+9+9+1 = 21. Since 2991 = 1*1728 + 8*144 + 9*12 + 3, its duodecimal representation is 1893(12), and these digits also sum up to 21. But in hexadecimal 2991 is BAF16, and 11+10+15 = 36, so 2991 should be rejected by your program.
The next number (2992), however, has digits that sum to 22 in all three representations (including BB016), so 2992 should be on the listed output. (We don't want decimal numbers with fewer than four digits - excluding leading zeroes - so that 2992 is the first correct answer.)
For example, the number 2991 has the sum of (decimal) digits 2+9+9+1 = 21. Since 2991 = 1*1728 + 8*144 + 9*12 + 3, its duodecimal representation is 1893(12), and these digits also sum up to 21. But in hexadecimal 2991 is BAF16, and 11+10+15 = 36, so 2991 should be rejected by your program.
The next number (2992), however, has digits that sum to 22 in all three representations (including BB016), so 2992 should be on the listed output. (We don't want decimal numbers with fewer than four digits - excluding leading zeroes - so that 2992 is the first correct answer.)
Input
There is no input for this problem.
Output
Your output is to be 2992 and all larger four-digit numbers that satisfy the requirements (in strictly increasing order), each on a separate line with no leading or trailing blanks, ending with a new-line character. There are to be no blank lines in the output. The first few lines of the output are shown below.
Sample Input
There is no input for this problem.
Sample Output
29922993299429952996299729982999
Source
Pacific Northwest 2004
Recommend
Ignatius.L
#include <iostream>using namespace std;int fun(int n, int s){int i = 0;while(n){i += n%s;n /= s;}return i;}int main(){int i;for (i = 1000; i < 10000; i++) {if(fun(i, 10) == fun(i, 12) && fun(i, 10) == fun(i, 16))cout<<i<<endl;}return 0;}
- hdu 1197
- hdu 1197
- HDU 1197
- HDU 1197 JAVA
- hdu
- hdu
- HDU
- hdu ()
- hdu
- hdu
- HDU
- HDU
- hdu
- hdu
- HDU
- Hdu
- hdu
- hdu-
- linux 常见缩写
- hdu 1196
- 简单计算器代码
- assembly___经典函数调用printf___操作
- 新青年
- hdu 1197
- hdu 1201
- 离散制造与流程制造的区别
- Failed to fectch URl https://dl-ssl.google.com/android/repository/addons_list.xml, reason: Connectio
- 编译制作(arm格式的)jffs2文件系统工具(mtd-snapshot-20050519.tar.bz2)
- CSTO线下沙龙:教育领域的应用数字化
- JasperReport 学习必备手册
- Linux3.4.0 Yaffs2文件系统移植-支持Android4.0
- 高仿launcher和墨迹左右拖动效果