Submission #2195491
Source Code Expand
#include <bits/stdc++.h> #define REP(i, n) for(int i = 0;i < n;i++) #define REPR(i, n) for(int i = n;i >= 0;i--) #define FOR(i, m, n) for(int i = m;i < n;i++) #define FORR(i, m, n) for(int i = m;i >= n;i--) #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define ll long long #define pb(a) push_back(a) #define INF 999999999 using namespace std; typedef pair<int, int> P; typedef pair<ll, ll> LP; typedef pair<int, P> PP; typedef pair<ll, LP> LPP; int dy[]={0, 0, 1, -1, 0}; int dx[]={1, -1, 0, 0, 0}; int main() { int N; cin >> N; if(N % 3 == 0) { cout << "YES" << endl; } else { cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - 世界のFizzBuzz |
User | jellyfish |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 715 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 |