Happy Number

最新推荐文章于 2021-03-18 15:46:45 发布

原创最新推荐文章于 2021-03-18 15:46:45 发布 · 450 阅读

0 ·

CC 4.0 BY-SA版权

----- %d ------ 专栏收录该内容

54 篇文章

订阅专栏

Happy Number
Accepted : 121 Submit : 307
Time Limit : 1000 MS Memory Limit : 65536 KB 

Problem DescriptionRecently, Mr. Xie learn the concept of happy number. A happy number is a number contain all digit 7 or only 1 digit other than 7. For example, 777 is a happy number because 777 contail all digit 7, 7177 and 87777 both happy number because only 1 digit other
 than 7. Whereas 887,799 9807,12345, all of them are not happy number. Now Mr. xie want to know for a given integer n, how many number among [1,n] are happy numbers, but counting them one by one is slow, can you help him?
InputFirst line an integer t indicate there are t testcases(1≤t≤100). Then t lines follow, each line an integer n(1≤n≤106, n don't have leading zero).
OutputOutput case number first, then the answer.
Sample Input5
1
7
17
20
30
Sample OutputCase 1: 1
Case 2: 7
Case 3: 10
Case 4: 10
Case 5: 11
#include<stdio.h>
#include<string.h>
int a[1000100];
int main()
{
    int T,i,j;
    int pp = 0;
    int hh = 0;
     for(i=1;i<=1000000;i++)
    {
        int t = i;
        int p = 0,q = 0;
        int h = 0;
        while(t!=0)
        {
            q++;
            p = t%10;
            t = t/10;
            if(p == 7)
            {
                h++;
            }
        }
        if(h>=q-1)
        {
            hh++;
        }
        a[i] = hh;
    }
    scanf("%d",&T);
    while(T--)
    {
        pp++;
        int n;

        scanf("%d",&n);

    printf("Case %d: %d\n",pp,a[n]);
    }
    return 0;
}