Numbers
Accepts: 480
Submissions: 1518
Time Limit: 2000/1000 MS (Java/Others)
Memory Limit: 65536/65536 K (Java/Others)
问题描述
给一个数N,如果N是2、3或者5的倍数,输出"YES",否则输出"NO".
输入描述
输入有多组数据,不超过1000组.
每组数据输入一行包含一个整数N.(0<N<1030)
输出描述
对于每组数据输出一行答案.
输入样例
2 3 5 7
输出样例
YES YES YES NO
这题就是能否被2,3,5整除,直接高精度取余就行了,水过~
AC代码:
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<string> #include<cmath> #include<queue> #include<vector> typedef long long ll; using namespace std; #define T 15000005 #define inf 0x3f3f3f3f int main() { #ifdef zsc freopen("input.txt","r",stdin); #endif string s; int i,j,k,s1,s2,s3; while(cin >> s) { s1 = s2 =s3 = 0; for(i=0;s[i];++i){ s1 = (s1*10+s[i]-'0')%2; s2 = (s2*10+s[i]-'0')%3; s3 = (s3*10+s[i]-'0')%5; } if(!s1||!s2||!s3){ printf("YES\n"); } else printf("NO\n"); } return 0; }