Submission #1457911
Source Code Expand
// This amazing code is by Eric Sunli Chen. #include <algorithm> #include <bitset> #include <cmath> #include <cstring> #include <cstdio> #include <cstdlib> #include <ctime> #include <iomanip> #include <iostream> #include <map> #include <queue> #include <set> #include <string> #include <utility> #include <vector> using namespace std; template<typename T> void get_int(T &x) { char t=getchar(); bool neg=false; x=0; for(; (t>'9'||t<'0')&&t!='-'; t=getchar()); if(t=='-')neg=true,t=getchar(); for(; t<='9'&&t>='0'; t=getchar())x=x*10+t-'0'; if(neg)x=-x; } template<typename T> void print_int(T x) { if(x<0)putchar('-'),x=-x; short a[20]= {},sz=0; while(x>0)a[sz++]=x%10,x/=10; if(sz==0)putchar('0'); for(int i=sz-1; i>=0; i--)putchar('0'+a[i]); } #define ff first #define ss second #define pb push_back #define mp make_pair #define get1(a) get_int(a) #define get2(a,b) get1(a),get1(b) #define get3(a,b,c) get1(a),get2(b,c) #define printendl(a) print_int(a),puts("") typedef long long LL; typedef unsigned long long uLL; typedef pair<int,int> pii; const int inf=0x3f3f3f3f; const LL Linf=1ll<<61; const double pi=acos(-1.0); int n,a[100111]; int main() { get1(n); int win=0; for(int i=1;i<=n;i++) { get1(a[i]); win^=(a[i]-1)&1; } if(win)puts("First"); else { int cur=win,last=win; while(true) { int odd=0; for(int i=1;i<=n;i++) { if(a[i]&1) { if(odd==0)odd=i; else { odd=0; break; } } } if(odd==0||a[odd]==1)break; a[odd]--;odd=0; for(int i=1;i<=n;i++)if(odd==0)odd=a[i];else odd=__gcd(odd,a[i]); for(int i=1;i<=n;i++)a[i]/=odd; odd=0;for(int i=1;i<=n;i++)odd^=(a[i]-1)&1; if(last^odd)break; last=odd; cur^=1; } puts(cur?"First":"Second"); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | OhWeOnFire |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1859 Byte |
Status | AC |
Exec Time | 39 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 | 18 ms | 640 KB |
in12.txt | AC | 9 ms | 640 KB |
in13.txt | AC | 16 ms | 640 KB |
in14.txt | AC | 34 ms | 640 KB |
in15.txt | AC | 14 ms | 640 KB |
in16.txt | AC | 33 ms | 640 KB |
in17.txt | AC | 13 ms | 640 KB |
in18.txt | AC | 39 ms | 640 KB |
in19.txt | AC | 18 ms | 640 KB |
in2.txt | AC | 9 ms | 640 KB |
in20.txt | AC | 35 ms | 640 KB |
in21.txt | AC | 20 ms | 640 KB |
in22.txt | AC | 18 ms | 640 KB |
in23.txt | AC | 17 ms | 640 KB |
in24.txt | AC | 20 ms | 640 KB |
in25.txt | AC | 17 ms | 640 KB |
in26.txt | AC | 18 ms | 640 KB |
in27.txt | AC | 18 ms | 640 KB |
in28.txt | AC | 20 ms | 640 KB |
in29.txt | AC | 17 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 | 19 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 |