#328652 (C++14) No.726 Tree Game

• 問題: No.726 Tree Game
• ユーザー: fumiphys
• 提出日時: 2019-03-24 22:22:04
• 言語: C++14 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,753 bytes
• コンパイル時間: 1,055 ms
• コンパイル使用メモリ: 112,240 KB
• 実行使用メモリ: 6,820 KB
• 最終ジャッジ日時: 2024-10-04 16:06:46
• 合計ジャッジ時間: 1,835 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

ファイルパターン	結果
other	AC * 25

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>
// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using namespace std;
//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;
// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)((ll)res * curr % mod);
    }
    curr = (T)((ll)curr * curr % mod);
    tmp >>= 1;
  }
  return res;
}
template <typename T>
bool suspect(T a, int s, T d, T n){
  T x = power<T>(a, d, n);
  if(x == 1)return true;
  for(int r = 0; r < s; r++){
    if(x == n - 1)return true;
    x = x * x % n;
  }
  return false;
}
template <typename T>
bool millar_rabin(T n){
  if(n <= 1 || (n > 2 && n % 2 == 0))return false;
  vector<ll> test = {2, 3, 5, 7, 11, 13, 17, 19, 23};
  T d = n - 1;
  int s = 0;
  while(d % 2 == 0)s++, d /= 2;
  for(int i = 0; i < test.size() && test[i] < n; i++){
    if(!suspect<T>(test[i], s, d, n))return false;
  }
  return true;
}
int calc(ll y, ll x){
  bool py = millar_rabin(y), px = millar_rabin(x);
  if(px && py){
    if(millar_rabin(x + 1) || millar_rabin(y + 1))return 2;
    else return 2 + calc(y + 1, x + 1);
  }
  if(px){
    if(millar_rabin(x + 1))return 0;
    else return 1 + calc(y, x + 1);
  }
  if(py){
    if(millar_rabin(y + 1))return 0;
    else return 1 + calc(y + 1, x);
  }
  ll currx = x + 1, curry = y + 1;
  while(true){
    if(millar_rabin(currx))break;
    currx++;
  }
  while(true){
    if(millar_rabin(curry))break;
    curry++;
  }
  return currx - x + curry - y;
}
int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ll y, x;
  cin >> y >> x;
  if(calc(y, x) % 2 == 1)cout << "First" << endl;
  else cout << "Second" << endl;
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX