Submission #1815069
Source Code Expand
#include <bits/stdc++.h>
#include <stdio.h>
#include <math.h>
using namespace std;
#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;
struct edge {
int to,cost;
edge(int t,ll c):to(t),cost(c) {}
};
int dx[]={1,-1,0,0},dy[]={0,0,1,-1};
int ddx[]={1,1,1,0,-1,-1,-1,0},ddy[]={1,0,-1,-1,-1,0,1,1};
ll mypow(ll x,ll n,ll m) {
if(n==0) return 1;
if(n%2==0) return mypow(x*x%m,n/2,m);
else return x*mypow(x,n-1,m)%m;
}
//-----------------------------------------------------------------------------
int n;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin>>n;
if(n%3==0) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
A - 世界のFizzBuzz |
User |
moko_freedom |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
978 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
256 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
sample_01.txt, sample_02.txt, sample_03.txt, test_1.txt, test_2.txt, test_3.txt, test_4.txt, test_5.txt, test_6.txt, test_7.txt, test_8.txt, test_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
sample_03.txt |
AC |
1 ms |
256 KB |
test_1.txt |
AC |
1 ms |
256 KB |
test_2.txt |
AC |
1 ms |
256 KB |
test_3.txt |
AC |
1 ms |
256 KB |
test_4.txt |
AC |
1 ms |
256 KB |
test_5.txt |
AC |
1 ms |
256 KB |
test_6.txt |
AC |
1 ms |
256 KB |
test_7.txt |
AC |
1 ms |
256 KB |
test_8.txt |
AC |
1 ms |
256 KB |
test_9.txt |
AC |
1 ms |
256 KB |