Submission #1842782
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <cmath> #include <algorithm> #include <cassert> #define rep(i, a, b) for (int i = (a), _ = (b); i <= _; ++ i) #define per(i, a, b) for (int i = (a), _ = (b); i >= _; -- i) #define For(i, a, b) for (int i = (a), _ = (b); i < _; ++ i) #define ri rd<int> using namespace std; const int maxN = 1e5 + 7; template<class T> inline T rd() { bool f = 1; char c = getchar(); for (; !isdigit(c); c = getchar()) if (c == '-') f = 0; T x = 0; for (; isdigit(c); c = getchar()) x = x * 10 + c - 48; return f ? x : -x; } inline void END(int kd) { kd ? puts("First") : puts("Second"); exit(0); } int n, sum; int a[maxN]; inline int gcd(int x, int y) { while (y) swap(x %= y, y); return x; } void play(int kd) { int cnt = 0, tag = 0; rep (i, 1, n) if (a[i] == 1) tag = 1; rep (i, 1, n) if (a[i] & 1) ++ cnt; if (cnt ^ (n & 1)) END(kd); if (cnt > 1 || tag) END(kd ^ 1); assert(cnt == 1); rep (i, 1, n) if (a[i] & 1) --a[i]; int g = 0; rep (i, 1, n) g = gcd(g, a[i]); rep (i, 1, n) a[i] /= g; play(kd ^ 1); } int main() { n = ri(); rep (i, 1, n) a[i] = ri(); if (n >= 3) play(1); else if (n == 1) END(a[1] % 2 == 0); else if (n == 2) END (a[1] % 2 == 0 || a[2] % 2 == 0); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | acha |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1325 Byte |
Status | WA |
Exec Time | 40 ms |
Memory | 512 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 1000 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample1.txt, sample2.txt, sample3.txt |
All | sample1.txt, sample2.txt, sample3.txt, in1.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in2.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in3.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt, sample1.txt, sample2.txt, sample3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in1.txt | AC | 8 ms | 512 KB |
in10.txt | AC | 8 ms | 512 KB |
in11.txt | WA | 18 ms | 512 KB |
in12.txt | AC | 8 ms | 512 KB |
in13.txt | AC | 15 ms | 512 KB |
in14.txt | AC | 35 ms | 512 KB |
in15.txt | AC | 14 ms | 512 KB |
in16.txt | AC | 34 ms | 512 KB |
in17.txt | WA | 13 ms | 512 KB |
in18.txt | AC | 40 ms | 512 KB |
in19.txt | WA | 18 ms | 512 KB |
in2.txt | AC | 8 ms | 512 KB |
in20.txt | WA | 36 ms | 512 KB |
in21.txt | WA | 20 ms | 512 KB |
in22.txt | WA | 18 ms | 512 KB |
in23.txt | WA | 17 ms | 512 KB |
in24.txt | WA | 20 ms | 512 KB |
in25.txt | WA | 17 ms | 512 KB |
in26.txt | WA | 18 ms | 512 KB |
in27.txt | WA | 18 ms | 512 KB |
in28.txt | WA | 20 ms | 512 KB |
in29.txt | WA | 17 ms | 512 KB |
in3.txt | AC | 8 ms | 512 KB |
in30.txt | WA | 17 ms | 512 KB |
in31.txt | WA | 8 ms | 512 KB |
in32.txt | WA | 8 ms | 512 KB |
in33.txt | AC | 19 ms | 512 KB |
in34.txt | AC | 22 ms | 512 KB |
in35.txt | AC | 19 ms | 512 KB |
in36.txt | AC | 1 ms | 128 KB |
in37.txt | AC | 1 ms | 128 KB |
in4.txt | AC | 8 ms | 512 KB |
in5.txt | WA | 8 ms | 512 KB |
in6.txt | WA | 8 ms | 512 KB |
in7.txt | AC | 8 ms | 512 KB |
in8.txt | AC | 8 ms | 512 KB |
in9.txt | AC | 8 ms | 512 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | AC | 1 ms | 128 KB |