Submission #1151582
Source Code Expand
#include <iostream> #include <iomanip> #include <cstdio> #include <string> #include <cstring> #include <deque> #include <list> #include <queue> #include <stack> #include <vector> #include <utility> #include <algorithm> #include <map> #include <set> #include <complex> #include <cmath> #include <limits> #include <cfloat> #include <climits> #include <ctime> #include <cassert> using namespace std; #define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++) #define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++) #define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--) #define all(v) begin(v), end(v) #define pb(a) push_back(a) #define fr first #define sc second #define INF 2000000000 #define int long long int #define X real() #define Y imag() #define EPS (1e-10) #define EQ(a,b) (abs((a) - (b)) < EPS) #define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) ) #define LE(n, m) ((n) < (m) + EPS) #define LEQ(n, m) ((n) <= (m) + EPS) #define GE(n, m) ((n) + EPS > (m)) #define GEQ(n, m) ((n) + EPS >= (m)) typedef vector<int> VI; typedef vector<VI> MAT; typedef pair<int, int> pii; typedef long long ll; typedef complex<double> P; typedef pair<P, P> L; typedef pair<P, double> C; int dy[]={0, 0, 1, -1}; int dx[]={1, -1, 0, 0}; int const MOD = 1000000007; namespace std { bool operator<(const P& a, const P& b) { return a.X != b.X ? a.X < b.X : a.Y < b.Y; } } signed main() { int n; cin >> n; if(n % 4 == 0) cout << "GO" << endl; else cout << "SEN" << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - ハヌマーンの試練 |
User | tsutaj |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1564 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 | 00_sample_00.txt, 00_sample_01.txt, 00_sample_02.txt, 10_min_01.txt, 10_min_02.txt, 10_min_03.txt, 10_min_04.txt, 10_min_05.txt, 10_min_06.txt, 10_min_07.txt, 10_min_08.txt, 10_min_09.txt, 10_min_10.txt, 10_min_11.txt, 10_min_12.txt, 10_min_13.txt, 10_min_14.txt, 10_min_15.txt, 10_min_16.txt, 10_min_17.txt, 10_min_18.txt, 10_min_19.txt, 10_min_20.txt, 20_max_00.txt, 20_max_01.txt, 20_max_02.txt, 90_random_00.txt, 90_random_01.txt, 90_random_02.txt, 90_random_03.txt, 90_random_04.txt, 90_random_05.txt, 90_random_06.txt, 90_random_07.txt, 90_random_08.txt, 90_random_09.txt, 99_medium_00.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample_00.txt | AC | 1 ms | 256 KB |
00_sample_01.txt | AC | 1 ms | 256 KB |
00_sample_02.txt | AC | 1 ms | 256 KB |
10_min_01.txt | AC | 1 ms | 256 KB |
10_min_02.txt | AC | 1 ms | 256 KB |
10_min_03.txt | AC | 1 ms | 256 KB |
10_min_04.txt | AC | 1 ms | 256 KB |
10_min_05.txt | AC | 1 ms | 256 KB |
10_min_06.txt | AC | 1 ms | 256 KB |
10_min_07.txt | AC | 1 ms | 256 KB |
10_min_08.txt | AC | 1 ms | 256 KB |
10_min_09.txt | AC | 1 ms | 256 KB |
10_min_10.txt | AC | 1 ms | 256 KB |
10_min_11.txt | AC | 1 ms | 256 KB |
10_min_12.txt | AC | 1 ms | 256 KB |
10_min_13.txt | AC | 1 ms | 256 KB |
10_min_14.txt | AC | 1 ms | 256 KB |
10_min_15.txt | AC | 1 ms | 256 KB |
10_min_16.txt | AC | 1 ms | 256 KB |
10_min_17.txt | AC | 1 ms | 256 KB |
10_min_18.txt | AC | 1 ms | 256 KB |
10_min_19.txt | AC | 1 ms | 256 KB |
10_min_20.txt | AC | 1 ms | 256 KB |
20_max_00.txt | AC | 1 ms | 256 KB |
20_max_01.txt | AC | 1 ms | 256 KB |
20_max_02.txt | AC | 1 ms | 256 KB |
90_random_00.txt | AC | 1 ms | 256 KB |
90_random_01.txt | AC | 1 ms | 256 KB |
90_random_02.txt | AC | 1 ms | 256 KB |
90_random_03.txt | AC | 1 ms | 256 KB |
90_random_04.txt | AC | 1 ms | 256 KB |
90_random_05.txt | AC | 1 ms | 256 KB |
90_random_06.txt | AC | 1 ms | 256 KB |
90_random_07.txt | AC | 1 ms | 256 KB |
90_random_08.txt | AC | 1 ms | 256 KB |
90_random_09.txt | AC | 1 ms | 256 KB |
99_medium_00.txt | AC | 1 ms | 256 KB |