POJ-2196 Specialized Four-Digit Numbers-10,12,16进制的各个位数相加彼此相等的数
来源:互联网 发布:linux wexitstatus 编辑:程序博客网 时间:2024/06/08 06:10
Specialized Four-Digit Numbers
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 7636 Accepted: 5559
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...
Source
Pacific Northwest 2004
//输出从2992-9999之前满足10,12,16进制的各个位数相加彼此相等的数#include <iostream>#include <stdio.h>#include <cmath>using namespace std;int cal(int n,int b)//参数分别表示要进行计算的数和进制,这个函数用来计算各个位数之和{ int ans=0,a; a=n; while(a>0) { ans+=(a%b); a/=b; } return ans;}int main(){ int i; for(i=2992; i<=9999; ++i) if(cal(i,10)==cal(i,12)&&cal(i,12)==cal(i,16)&&cal(i,10)==cal(i,16)) cout<<i<<endl; return 0;}
0 0
- POJ-2196 Specialized Four-Digit Numbers-10,12,16进制的各个位数相加彼此相等的数
- (DS1.5.2)POJ 2196 Specialized Four-Digit Numbers(同意数字各个进制的表示方式)
- HDOJ 1197 Specialized Four-Digit Numbers 特别的四位数
- 【POJ-2196】Specialized Four-Digit Numbers
- POJ 2196Specialized Four-Digit Numbers
- POJ 2196 - Specialized Four-Digit Numbers
- POJ 2196 Specialized Four-Digit Numbers
- POJ 2196 Specialized Four-Digit Numbers
- POJ 2196 Specialized Four-Digit Numbers 水
- POJ 2196 Specialized Four-Digit Numbers
- [soj1014]Specialized Four-Dig(10进制,12进制和16进制各位相加相等)
- Specialized Four-Digit Numbers(进制转换)
- Specialized Four-Digit Numbers-2196
- HDU 1197 Specialized Four-Digit Numbers 特别的四位数整数
- POJ 2196Specialized Four-Digit Numbers 简单暴力
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- Specialized Four-Digit Numbers
- NSKeyedArchiver
- B. ZgukistringZ-简单字符串处理-Codeforces Round #307 (Div. 2)
- Java IO流--IO包中的其他类
- 杭电acm 2139 Calculate the formula
- Python简单爬虫
- POJ-2196 Specialized Four-Digit Numbers-10,12,16进制的各个位数相加彼此相等的数
- hdu 5363 Key Set(水)
- C++(13)STL实践与分析之再谈String类型
- Arduino入门知识
- IO流
- JavaScript——实现时间的动态显示
- maven使用私服(其他我没测试)无法导入jar文件问题
- A. GukiZ and Contest-Codeforces Round #307 (Div. 2)-简单水题
- 【CF245H】【Queries for Number of Palindromes】