zoukankan      html  css  js  c++  java
  • hdoj-1197-Specialized Four-Digit Numbers

    Specialized Four-Digit Numbers

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 4963 Accepted Submission(s): 3587


    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.)

    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
    2992 2993 2994 2995 2996 2997 2998 2999

    Source

    Recommend
    Ignatius.L | We have carefully selected several similar problems for you: 1205 1157 1194 1200 1202

    #include<stdio.h> 
    bool judge(int m){
    	int n=m,res1=0,res2=0,res3=0;
    	while(n){
    		res1+=n%12;
    		n/=12;
    	} n=m;
    	while(n){
    		res2+=n%10;
    		n/=10;
    	} n=m;
    	while(n){
    		res3+=n%16;
    		n/=16;
    	}
    	if(res1==res2&&res2==res3) return true;
    	return false;
    }
    int main(){
    	for(int i=2992;i<=9999;++i){
    		if(judge(i)) printf("%d
    ",i);
    	}
    	return 0;
    }

    还以为会超时,竟然过了。还是0ms
    Exe.Time Exe.Memory Code Len. Language Author
    0MS 1380K 408B G++      

  • 相关阅读:
    巴科斯范式和sql语言
    mysql 视图
    1503
    mysql SQL_CALC_FOUND_ROWS
    create table xxx as select 与 create table xxx like
    mysql 1030 Got error 28 from storage engine
    python -- 装饰器入门
    12C新特性 -- 共享asm口令文件
    MySQL子查询的优化
    MySQL的explain
  • 原文地址:https://www.cnblogs.com/wgwyanfs/p/6855878.html
Copyright © 2011-2022 走看看