forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathD.cpp
More file actions
93 lines (79 loc) · 2.13 KB
/
D.cpp
File metadata and controls
93 lines (79 loc) · 2.13 KB
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
#include <set>
#include <map>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstring>
#include <sstream>
#include <iomanip>
#include <complex>
#include <iostream>
#include <algorithm>
#include <ctime>
#include <deque>
#include <bitset>
#include <cctype>
#include <utility>
#include <cassert>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
using namespace std;
#define ll long long
ll A, B, C;
inline ll next(ll x) {
return (A * x + x % B) % C;
}
const int MN = 20000000;
int main() {
ios :: sync_with_stdio(false); cin.tie(NULL);
freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
while (cin >> A >> B >> C) {
ll x = 1;
bool found = false;
FOR(i,1,MN) {
x = next(x);
if (x == 1) {
cout << i << endl;
found = true;
break;
}
}
if (found) continue;
x = 1;
ll y = 1;
FOR(i,1,MN) {
x = next(x);
y = next(next(y));
if (y == x) break;
}
x = 1;
FOR(i,1,MN) {
x = next(x);
y = next(y);
if (x == y) {
found = true;
FOR(j,i+1,MN) {
y = next(y);
if (y == x) {
cout << j << endl;
break;
}
}
break;
}
}
if (found) continue;
cout << -1 << endl;
}
return 0;
}