Submission #2551646
Source Code Expand
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #include <complex> using namespace std; typedef long long int ll; ll gcd(ll a, ll b){ if(b==0) return a; return gcd(b, a%b); } ll extgcd(ll a, ll b, ll& x, ll& y, ll k){ ll d=a; if(b!=0){ d=extgcd(b, a%b, y, x, k); y-=(a/b)*x; }else{ x=k/a, y=0; } return d; } long long int powmod(long long int a, long long int k, long long int m){ //0<=a<=1e9, 0<k<=1e18, 0<m<=1e9 if(a==0){ return 0; } long long int apow[60], c[60]; for(int i=0; i<60; i++){ if(i==0){ apow[i]=a; c[i]=1; }else{ apow[i]=apow[i-1]*apow[i-1]%m; c[i]=c[i-1]*2; } } long long int ans=1; for(int i=59; i>=0; i--){ if(k>=c[i]){ ans=ans*apow[i]%m; } k=k%c[i]; } return ans; } long long int eulerphi(long long int n){ if(n==1) return 1; long long int res=n; for(long long int i=2; i*i<=n; i++){ if(n%i==0){ res=res/i*(i-1); while(n%i==0) n/=i; } } if(n!=1) res=res/n*(n-1); return res; } ll ans(ll a, ll m){ // ans>=30 if(a==0) return m; if(m==1) return 30; ll m1=m, m2=1; ll d; while((d=gcd(a, m1))>1){ m1/=d; m2*=d; } ll phi1=eulerphi(m1); ll s=ans(a, phi1); ll k1=powmod(a, s, m), k2=powmod(a, s, phi1), k; ll x, y; extgcd(m, phi1, x, y, k2-k1); k=m*(x%phi1)+k1; while(k<30) k+=(m*phi1); return k; } int main() { int q; scanf("%d", &q); for(int i=0; i<q; i++){ ll a, m, k; scanf("%lld %lld", &a, &m); k=ans(a, m); printf("%lld\n", k); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - ModularPowerEquation!! |
User | chocorusk |
Language | C++14 (GCC 5.4.1) |
Score | 1400 |
Code Size | 1715 Byte |
Status | AC |
Exec Time | 31 ms |
Memory | 128 KB |
Compile Error
./Main.cpp: In function ‘int main()’: ./Main.cpp:93:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &q); ^ ./Main.cpp:96:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%lld %lld", &a, &m); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1400 / 1400 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, 49.txt, 50.txt, 51.txt, 52.txt, 53.txt, 54.txt, 55.txt, 56.txt, 57.txt, 58.txt, 59.txt, 60.txt, 61.txt, 62.txt, 63.txt, 64.txt, 65.txt, 66.txt, 67.txt, 68.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 9 ms | 128 KB |
02.txt | AC | 10 ms | 128 KB |
03.txt | AC | 9 ms | 128 KB |
04.txt | AC | 9 ms | 128 KB |
05.txt | AC | 9 ms | 128 KB |
06.txt | AC | 10 ms | 128 KB |
07.txt | AC | 10 ms | 128 KB |
08.txt | AC | 10 ms | 128 KB |
09.txt | AC | 10 ms | 128 KB |
10.txt | AC | 11 ms | 128 KB |
11.txt | AC | 2 ms | 128 KB |
12.txt | AC | 1 ms | 128 KB |
13.txt | AC | 1 ms | 128 KB |
14.txt | AC | 1 ms | 128 KB |
15.txt | AC | 2 ms | 128 KB |
16.txt | AC | 2 ms | 128 KB |
17.txt | AC | 2 ms | 128 KB |
18.txt | AC | 1 ms | 128 KB |
19.txt | AC | 9 ms | 128 KB |
20.txt | AC | 9 ms | 128 KB |
21.txt | AC | 9 ms | 128 KB |
22.txt | AC | 9 ms | 128 KB |
23.txt | AC | 9 ms | 128 KB |
24.txt | AC | 9 ms | 128 KB |
25.txt | AC | 11 ms | 128 KB |
26.txt | AC | 10 ms | 128 KB |
27.txt | AC | 28 ms | 128 KB |
28.txt | AC | 31 ms | 128 KB |
29.txt | AC | 28 ms | 128 KB |
30.txt | AC | 27 ms | 128 KB |
31.txt | AC | 7 ms | 128 KB |
32.txt | AC | 6 ms | 128 KB |
33.txt | AC | 7 ms | 128 KB |
34.txt | AC | 7 ms | 128 KB |
35.txt | AC | 6 ms | 128 KB |
36.txt | AC | 6 ms | 128 KB |
37.txt | AC | 7 ms | 128 KB |
38.txt | AC | 7 ms | 128 KB |
39.txt | AC | 1 ms | 128 KB |
40.txt | AC | 1 ms | 128 KB |
41.txt | AC | 1 ms | 128 KB |
42.txt | AC | 1 ms | 128 KB |
43.txt | AC | 1 ms | 128 KB |
44.txt | AC | 1 ms | 128 KB |
45.txt | AC | 12 ms | 128 KB |
46.txt | AC | 13 ms | 128 KB |
47.txt | AC | 1 ms | 128 KB |
48.txt | AC | 1 ms | 128 KB |
49.txt | AC | 1 ms | 128 KB |
50.txt | AC | 1 ms | 128 KB |
51.txt | AC | 1 ms | 128 KB |
52.txt | AC | 1 ms | 128 KB |
53.txt | AC | 1 ms | 128 KB |
54.txt | AC | 1 ms | 128 KB |
55.txt | AC | 1 ms | 128 KB |
56.txt | AC | 1 ms | 128 KB |
57.txt | AC | 1 ms | 128 KB |
58.txt | AC | 1 ms | 128 KB |
59.txt | AC | 1 ms | 128 KB |
60.txt | AC | 1 ms | 128 KB |
61.txt | AC | 1 ms | 128 KB |
62.txt | AC | 1 ms | 128 KB |
63.txt | AC | 1 ms | 128 KB |
64.txt | AC | 1 ms | 128 KB |
65.txt | AC | 1 ms | 128 KB |
66.txt | AC | 1 ms | 128 KB |
67.txt | AC | 2 ms | 128 KB |
68.txt | AC | 1 ms | 128 KB |
s1.txt | AC | 1 ms | 128 KB |
s2.txt | AC | 1 ms | 128 KB |