zoukankan      html  css  js  c++  java
  • G


    Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

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

    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
    ...
    #include <iostream>     
    #include<cmath> 
    #include<iomanip>               
    using namespace std;  
    int x,y;
    int sa(int i)
    {
    		y=0;
    	while(i!=0)
    	{
    
    	y+=i%10;
    	i=i/10;
    	}
    return y;
    }
    int sb(int i)
    {
    			y=0;
    	while(i!=0)
    	{
    
    	y+=i%12;
    	i=i/12;
    	}
    return y;
    }
    int sc(int i)
    {
    			y=0;
    	while(i!=0)
    	{
    
    	y+=i%16;
    	i=i/16;
    	}
    return y;
    }
    int main()
    {
    	int a,b,c,n,i,d;
    	
    for(i=2992;i<10000;i++)
    {
    	a=sa(i);
    	b=sb(i);
    	c=sc(i);
    	if(a==b&&b==c)
    		 printf("%d
    ",i);
    }
          
    
    return 0;
    }


  • 相关阅读:
    监督学习
    第一个应用:鸢尾花分类
    第一章 计算机系统漫游
    前言
    python批量下载验证码,用来做验证码处理
    windows下安装tesserocr
    python 爬虫之requests爬取页面图片的url,并将图片下载到本地
    electron实现透明点投的方法
    css之实现下拉框自上而下展开动画效果&&自下而上收起动画效果
    react项目中canvas之画形状(圆形,椭圆形,方形)
  • 原文地址:https://www.cnblogs.com/cxchanpin/p/6847249.html
Copyright © 2011-2022 走看看