Submission #1691752
Source Code Expand
#include <iostream> #include <cstdio> #include <cstdlib> #include <cstring> #include <cctype> #include <algorithm> using namespace std; int read() { int x = 0, f = 1; char c = getchar(); while(!isdigit(c)){ if(c == '-') f = -1; c = getchar(); } while(isdigit(c)){ x = x * 10 + c - '0'; c = getchar(); } return x * f; } #define maxn 100010 int n, ceven, A[maxn]; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } int main() { int sum = 0; bool has1 = 0, cur = 0; n = read(); for(int i = 1; i <= n; i++) A[i] = read(), ceven += !(A[i] & 1), has1 |= (A[i] == 1), (sum += A[i] - 1) &= 1; if(has1) return puts(sum ? "First" : "Second"), 0; if(ceven & 1) return puts("First"), 0; if(n - ceven > 1) return puts("Second"), 0; for(; ;) { cur ^= 1; for(int i = 1; i <= n; i++) if(A[i] & 1) A[i]--; int g = A[1]; for(int i = 2; i <= n; i++) g = gcd(g, A[i]); ceven = sum = has1 = 0; for(int i = 1; i <= n; i++) A[i] /= g, ceven += !(A[i] & 1), has1 |= (A[i] == 1), (sum += A[i] - 1) &= 1; if(has1) return puts((sum ^ cur) ? "First" : "Second"), 0; if(n - ceven > 1) return puts(((ceven & 1) ^ cur) ? "First" : "Second"), 0; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | xjr |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1211 Byte |
Status | AC |
Exec Time | 40 ms |
Memory | 640 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 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 | 9 ms | 640 KB |
in10.txt | AC | 9 ms | 640 KB |
in11.txt | AC | 19 ms | 640 KB |
in12.txt | AC | 9 ms | 640 KB |
in13.txt | AC | 16 ms | 640 KB |
in14.txt | AC | 35 ms | 640 KB |
in15.txt | AC | 15 ms | 640 KB |
in16.txt | AC | 33 ms | 640 KB |
in17.txt | AC | 13 ms | 640 KB |
in18.txt | AC | 40 ms | 640 KB |
in19.txt | AC | 18 ms | 640 KB |
in2.txt | AC | 9 ms | 640 KB |
in20.txt | AC | 36 ms | 640 KB |
in21.txt | AC | 20 ms | 640 KB |
in22.txt | AC | 18 ms | 640 KB |
in23.txt | AC | 18 ms | 640 KB |
in24.txt | AC | 21 ms | 640 KB |
in25.txt | AC | 17 ms | 640 KB |
in26.txt | AC | 19 ms | 640 KB |
in27.txt | AC | 19 ms | 640 KB |
in28.txt | AC | 21 ms | 640 KB |
in29.txt | AC | 18 ms | 640 KB |
in3.txt | AC | 9 ms | 640 KB |
in30.txt | AC | 17 ms | 640 KB |
in31.txt | AC | 9 ms | 640 KB |
in32.txt | AC | 9 ms | 640 KB |
in33.txt | AC | 20 ms | 640 KB |
in34.txt | AC | 22 ms | 640 KB |
in35.txt | AC | 20 ms | 640 KB |
in36.txt | AC | 1 ms | 256 KB |
in37.txt | AC | 1 ms | 256 KB |
in4.txt | AC | 9 ms | 640 KB |
in5.txt | AC | 9 ms | 640 KB |
in6.txt | AC | 9 ms | 640 KB |
in7.txt | AC | 9 ms | 640 KB |
in8.txt | AC | 9 ms | 640 KB |
in9.txt | AC | 9 ms | 640 KB |
sample1.txt | AC | 1 ms | 256 KB |
sample2.txt | AC | 1 ms | 256 KB |
sample3.txt | AC | 1 ms | 256 KB |