Daffodil International University
Problem Link
//Please follow from main function
#include<stdio.h>
int main()
{
int m, s, i, n, l, k, p, j, q, t;
int arr[10], arr1[1000];
scanf("%d", &t);
for(p=1; p<=t; p++){
k=3;
scanf("%d", &n);
q=0;
l=n;
while(1){
s=0;
i=-1;
arr1[q]=n;
q++;
while(n!=0){
i++;
arr[i]=n%10;
n/=10;
}
m=i;
for(i=0; i<=m; i++){
s+=(arr[i]*arr[i]);
}
n=s;
if(n==1){
k=1;
break;
}
else{
for(j=0; j<q; j++){
if(arr1[j]==s){
k=2;
break;
}
}
if(k==2)
break;
}
}
if(k==1){
printf("Case #%d: %d is a Happy number.\n", p, l);
}
else
printf("Case #%d: %d is an Unhappy number.\n", p, l);
}
return 0;
}
0 Comments