hdu 5585

Numbers

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 2269    Accepted Submission(s): 838

Problem Description

There is a number N.You should output "YES" if N is a multiple of 2, 3 or 5,otherwise output "NO".

 

 

Input

There are multiple test cases, no more than 1000 cases.
For each case,the line contains a integer N.(0<N<1030)

 

 

Output

For each test case,output the answer in a line.

 

 

Sample Input

2 3 5 7

 

 

Sample Output

YES YES YES NO

 

 

Source

BestCoder Round #64 (div.2)

 判断n是不是2,3,5的倍数

判断2,5,只要判断末尾是不是0,或者2,5的倍数,,所以只要对2,5求余,,二判断是不是3的倍数,只要所有的数加起来对3求余就好

 

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <string.h>
#include <cstring>
#include <stdio.h>
#define lowbit(x) x&(-x)

using namespace std;
const int maxn=1e5+10;
typedef long long ll;

int main(){
    ios::sync_with_stdio(0);
    string s;
    while(cin>>s){
        int len=s.length();
        int sum=0;
        for(int i=0;i<s.length();i++){
            sum+=s[i]-'0';
        }
        if(sum%3==0||((s[len-1]-'0')%2==0)||((s[len-1]-'0')%5==0)){
            cout<<"YES"<<endl;
        }
        else {
            cout<<"NO"<<endl;
        }
    }
    return 0;
}