Codeforces Round #651 (Div. 2) C. Number Game
- Time : O(sqrt(n) + log(n))
- Space : O(1)
c++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
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {
inline std::size_t operator()(const std::pair<int, int> &v) const { return v.first * 31 + v.second; }
};
#define MAX_N 1010101
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define umll unordered_map<ll,ll>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
ll __gcd(ll x, ll y) { return !y ? x : __gcd(y, x % y); }
using namespace std;
ll diviserOf(ll n) {
while(!(n & 1)) n >>= 1;
return n;
}
bool prime(ll n) {
for(ll i = 3; i * i <= n; i++) {
if(n % i == 0) return false;
}
return true;
}
string solve(ll n) {
bool turn = true;
while(n != 1) {
if(n & 1) n = 1;
else {
ll d = diviserOf(n);
if(d == 1) n -= 1;
else {
n /= d;
if(n == 2) {
if(prime(d)) return turn ? "FastestFinger" : "Ashishgup";
return turn ? "Ashishgup" : "FastestFinger";
}
}
}
turn = !turn;
}
return turn ? "FastestFinger" : "Ashishgup";
}
int main() {
ios_base::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
cin>>tc;
for (ll i = 1; i <= tc; i++) {
ll n;
cin>>n;
cout<<solve(n)<<endl;
}
return 0;
}
|
