Submission #1987913
Source Code Expand
#include<cstdio> #include<cmath> #include<algorithm> #include<cstdlib> #include<cstring> using namespace std; int n,a[100005]; bool work(){ int num1=0,num2=0; for(int i=1;i<=n;i++) if(a[i]>1){ if(a[i]&1) num1++; else num2++; } if(!num1&&!num2) return false; if(num2&1) return true; if(num1>1||!num1) return false; for(int i=1;i<=n;i++) if(a[i]>1&&a[i]&1){ a[i]--; break; } int d=a[1]; for(int i=2;i<=n;i++) d=__gcd(d,a[i]); for(int i=1;i<=n;i++) a[i]/=d; return !work(); } int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",&a[i]); puts(work()?"First":"Second"); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Decrementing |
User | vjudge2 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 638 Byte |
Status | AC |
Exec Time | 43 ms |
Memory | 640 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:36:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&n); ^ ./Main.cpp:38:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d",&a[i]); ^
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 | 12 ms | 512 KB |
in10.txt | AC | 12 ms | 512 KB |
in11.txt | AC | 21 ms | 512 KB |
in12.txt | AC | 12 ms | 512 KB |
in13.txt | AC | 19 ms | 512 KB |
in14.txt | AC | 38 ms | 512 KB |
in15.txt | AC | 18 ms | 512 KB |
in16.txt | AC | 36 ms | 512 KB |
in17.txt | AC | 16 ms | 512 KB |
in18.txt | AC | 43 ms | 512 KB |
in19.txt | AC | 21 ms | 512 KB |
in2.txt | AC | 14 ms | 640 KB |
in20.txt | AC | 38 ms | 512 KB |
in21.txt | AC | 23 ms | 512 KB |
in22.txt | AC | 21 ms | 512 KB |
in23.txt | AC | 20 ms | 512 KB |
in24.txt | AC | 23 ms | 512 KB |
in25.txt | AC | 20 ms | 512 KB |
in26.txt | AC | 21 ms | 512 KB |
in27.txt | AC | 21 ms | 512 KB |
in28.txt | AC | 23 ms | 512 KB |
in29.txt | AC | 20 ms | 512 KB |
in3.txt | AC | 12 ms | 512 KB |
in30.txt | AC | 20 ms | 512 KB |
in31.txt | AC | 12 ms | 512 KB |
in32.txt | AC | 12 ms | 512 KB |
in33.txt | AC | 22 ms | 512 KB |
in34.txt | AC | 25 ms | 512 KB |
in35.txt | AC | 22 ms | 512 KB |
in36.txt | AC | 0 ms | 128 KB |
in37.txt | AC | 0 ms | 128 KB |
in4.txt | AC | 12 ms | 512 KB |
in5.txt | AC | 12 ms | 512 KB |
in6.txt | AC | 12 ms | 512 KB |
in7.txt | AC | 12 ms | 512 KB |
in8.txt | AC | 12 ms | 512 KB |
in9.txt | AC | 12 ms | 512 KB |
sample1.txt | AC | 1 ms | 128 KB |
sample2.txt | AC | 1 ms | 128 KB |
sample3.txt | AC | 0 ms | 128 KB |