Submission #1379435


Source Code Expand

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <unordered_set>
#include <unordered_map>

using namespace std;

#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define ll long long
#define ld double
#define ull unsigned long long
#define PI pair < int, int > 

const int N = 2e5 + 123;
const int M = 123;
const ld Pi = acos(-1);
const ll Inf = 1e18;
const int inf = 1e9;
const int mod = 1e9 + 7;
const int Sz = 501;
const int MOD = 1e9 + 7;

void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
int mult(int a, int b) {
  return 1ll * a * b % mod;
}
int sum(int a, int b) {
  add(a, b);
  return a;
}

int n, a[N], c[2];

int gcd(int a, int b) {
  while(b) {
    a %= b;
    swap(a, b);
  }
  return a;
}

void solve() { 
  cin >> n;
  for (int i = 1;i <= n;i++) {
    cin >> a[i];
  }
  for (int it = 0;;it++) {
    bool fail = 0;
    for (int i = 1;i <= n;i++) fail |= (a[i] > 1);
    if (!fail) {
      if (it == 0) cout << "Second\n";
      else cout << "First\n";
      return; 
    }
    c[0] = c[1] = 0;
    for (int i = 1;i <= n;i++) c[a[i] & 1]++;
    if (c[0] & 1) {
   //   cout << "here it = " << it << endl;
      if (it & 1) cout << "Second\n";
      else cout << "First\n";
      return;
    }
    if (c[1] > 1) {
      if (it & 1) cout << "First\n";
      else cout << "Second\n";
      return;
    }
    for (int i = 1;i <= n;i++) {
      if (a[i] & 1) {
        a[i]--;
        break;
      }
    }
    int g = 0;
    for (int i = 1;i <= n;i++) g = gcd(g, a[i]);
    for (int i = 1;i <= n;i++) a[i] /= g;
  } 
}

int main() {
  #ifdef wws
   freopen("in", "r", stdin);
   // freopen("in", "w", stdout);
  #endif 
  ios_base::sync_with_stdio(0);
  int tt = 1; 
  while(tt--) solve();
  return 0;
}

Submission Info

Submission Time
Task D - Decrementing
User SmallBoy
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2263 Byte
Status WA
Exec Time 46 ms
Memory 768 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 1000
Status
AC × 2
WA × 1
AC × 32
WA × 11
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 640 KB
in10.txt AC 12 ms 640 KB
in11.txt AC 22 ms 640 KB
in12.txt AC 11 ms 640 KB
in13.txt AC 19 ms 640 KB
in14.txt AC 40 ms 640 KB
in15.txt AC 18 ms 640 KB
in16.txt AC 38 ms 640 KB
in17.txt AC 16 ms 640 KB
in18.txt AC 46 ms 640 KB
in19.txt AC 21 ms 640 KB
in2.txt AC 12 ms 640 KB
in20.txt AC 41 ms 640 KB
in21.txt AC 24 ms 640 KB
in22.txt AC 22 ms 640 KB
in23.txt WA 21 ms 640 KB
in24.txt AC 24 ms 640 KB
in25.txt WA 21 ms 640 KB
in26.txt WA 22 ms 640 KB
in27.txt AC 23 ms 640 KB
in28.txt WA 24 ms 640 KB
in29.txt WA 21 ms 640 KB
in3.txt AC 12 ms 640 KB
in30.txt WA 21 ms 640 KB
in31.txt AC 12 ms 640 KB
in32.txt AC 12 ms 640 KB
in33.txt WA 25 ms 640 KB
in34.txt WA 28 ms 768 KB
in35.txt WA 25 ms 640 KB
in36.txt AC 1 ms 256 KB
in37.txt AC 1 ms 256 KB
in4.txt AC 12 ms 640 KB
in5.txt AC 12 ms 640 KB
in6.txt AC 12 ms 640 KB
in7.txt AC 12 ms 640 KB
in8.txt AC 12 ms 640 KB
in9.txt AC 12 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB
sample3.txt WA 1 ms 256 KB