10591 - Happy Number

来源：互联网发布：黑马java视频教程2017 编辑：程序博客网时间：2024/05/26 14:11

描述：判断是否循环就可以了#include <cstdio>#include <cstdlib>#include <cstring>#define N 10003int num[N];int main(){  //  freopen("a.txt","r",stdin);    int n,x,count,m=0,flag;    num[1]=1;    scanf("%d",&n);    while(m<n)    {        scanf("%d",&x);        flag=0;        count=x;        memset(num,0,sizeof(num));        while(1)        {            while(x>0)            {                int c=x%10;                x=x/10;                flag=flag+c*c;            }            x=flag;            if(x==1)            {                flag=1;                break;            }            if(num[x])            {                flag=0;                break;            }            num[x]=1;            flag=0;        }        if(flag) printf("Case #%d: %d is a Happy number.\n",m+1,count);        else printf("Case #%d: %d is an Unhappy number.\n",m+1,count);        m++;    }    return 0;}