G - Specialized Four-Digit Numbers(1.5.2)
来源:互联网 发布:java服务器有哪些 编辑:程序博客网 时间:2024/06/05 03:55
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 189312, 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 189312, 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...#include <iostream>#include <iomanip>#include <cmath>using namespace std;int calc(int n,int k){ int m=0; while (n != 0) { m += n % k; n = n / k; } return m;}int main(){ int m,m1,m2,i; for(i=2992;i<=9999;i++) { m = calc(i,10); m1 = calc(i,16); m2 = calc(i,12); if(m==m1&&m==m2) cout<<i<<endl; //cout<<m<<' '<<m1<<' '<<m2<<endl; } return 0;}
0 0
- G - Specialized Four-Digit Numbers(1.5.2)
- G - Specialized Four-Digit Numbers(1.5.2)
- G - Specialized Four-Digit Numbers(1.5.2)
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- 《数据结构编程实验》 1.5.2Specialized Four-Digit Numbers
- zoj2405 ------------Specialized Four-Digit Numbers
- HDU1197:Specialized Four-Digit Numbers
- hdu1197-Specialized Four-Digit Numbers
- HDU Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers-2196
- H - Specialized Four-Digit Numbers
- 1197 Specialized Four-Digit Numbers
- CListCtrl控件的标题栏添加checkbox
- leetCode :Validate Binary Search Tree
- linux系统中各个路由表的研究
- Ansible@一个高效的配置管理工具--Ansible configure management--翻译(四)
- 下载破解ZendStudio 10.5
- G - Specialized Four-Digit Numbers(1.5.2)
- opencv 2.x学习笔记(十)随机数发生器、绘制文字
- 说一说struts2 验证框架使用过程中遇到的问题
- php多表连接mysql数据库,输出相同的字段名
- 初见
- 远程桌面连接增加端口号
- 2014.7.13
- 数据结构学习之树---AVL树的实现
- vi/vim使用进阶: 剑不离手 – quickfix