杭电 ACM 1.2.6
来源:互联网 发布:linux swap free 0 编辑:程序博客网 时间:2024/05/22 09:43
Specialized Four-Digit Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1105 Accepted Submission(s): 754Problem 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<stdio.h>
int dtox(int m)
{
int count = 0;
while(m != 0)
{
count += m%16;
m = m/16;
}
return count;
}
int dtot(int m)
{
int count = 0;
while(m != 0)
{
count += m%12;
m = m/12;
}
return count;
}
int sum(int m)
{
int count = 0;
while(m != 0)
{
count += m%10;
m = m/10;
}
return count;
}
int main(void)
{
int i;
for(i = 1000;i < 9999;i++)
{
if(sum(i) == dtox(i) && sum(i) == dtot(i))
printf("%d\n", i);
}
getchar();
return 0;
}
- 杭电 ACM 1.2.6
- 杭电 acm steps1.1.2
- 杭电 ACM 1.2.2
- 杭电 ACM 1.2.1
- 杭电 ACM 1.2.4
- 杭电 ACM 1.2.3
- 杭电 ACM 1.2.5
- 杭电 ACM 1.2.7
- 杭电 ACM 1.2.8
- 杭电 ACM 1.3.6
- 杭电ACM 1.2.6 IBM Minus One
- 杭电acm 1.2.7 GPA
- 杭电 acm 1.2.8 Vowel Counting
- 杭电ACM ASCII 1.2.7
- 杭电ACM 1.2.4 GPA
- 杭电oj-acm steps-1.2
- 杭电acm step 1.3.6 Rank
- 杭电ACM 1003
- “环上的精彩”—以太环网保护技术发展纵论
- hibernate Criteria 的使用
- Android下运行c程序
- Android_launcher的源码详细分析
- 求s=1+1+2+1+2+3+1+2+3+4......+n
- 杭电 ACM 1.2.6
- QtCreator快捷键大全
- WhatAnalyzer开源分词项目参与方法(二)
- AS3中技能或物品CD时间案例(转)
- 对查询结果没有的情况下用零代替结果
- Oracle 管理员密码忘记解决方案
- Java 32问
- MySQL raid级别的随机IO性能差异对比
- perl的map函数