Lucky Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2956 Accepted Submission(s): 1515
Problem Description
To Chinese people, 8 is a lucky number. Now your task is to judge if a number is lucky.
We say a number is lucky if it’s a multiple of 8, or the sum of digits that make up the number is a multiple of 8, or the sum of every digit’s square is a multiple of 8.
We say a number is lucky if it’s a multiple of 8, or the sum of digits that make up the number is a multiple of 8, or the sum of every digit’s square is a multiple of 8.
Input
The first line contains an integer stands for the number of test cases.
Each test case contains an integer n (n >= 0).
Each test case contains an integer n (n >= 0).
Output
For each case, output “Lucky number!” if the number is lucky, otherwise output “What a pity!”.
Sample Input
2 0 8
Sample Output
Lucky number! Lucky number!
Author
dandelion
Source
直接看代码吧 用sprintf很快就过的。
#include<bits/stdc++.h>
using namespace std;
char ss[100];
bool lucky1(int x){
}
int main(){
int n;
int t;
cin>>t;
while(t--){
cin>>n;
if(n%8==0) {
cout<<"Lucky number!"<<endl;
continue;
}
sprintf(ss,"%d",n);
int len=strlen(ss);
int sum1=0,sum2=0;
for(int i=0;i<len;i++){
sum1+=ss[i];
sum2+=ss[i]*ss[i];
}
if(sum1%8==0||sum2%8==0) cout<<"Lucky number!"<<endl;
else cout<<"What a pity!"<<endl;
}
}