QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#369171 | #7562. Except One | zhouyidie | AC ✓ | 1ms | 3708kb | C++20 | 1.1kb | 2024-03-27 21:17:27 | 2024-03-27 21:17:28 |
Judging History
answer
#include<bits/stdc++.h>
typedef long long LL ;
const int N = 1e6 + 10 , INF = 1e9 + 7 ;
using namespace std ;
int p ;
LL n , m , k , tt ;
int a[ N ] , af[ N ] , b[ N ] , bf[ N ] ;
int qmi( LL di , LL mi ){
LL res = 1 ;
while( mi ){
if( mi & 1 ){
res *= di ; res %= p ;
}
di *= di ; di %= p ;
mi /= 2 ;
}
return res % p ;
}
void AC(){
// cin >> n ;
// for( int i = 1 ; i <= n ; i ++ ){
// cin >> a[ i ] ;
// if( i >= 2 ){
// af[ i - 1 ] = a[ i ] - a[ i - 1 ] ;
// }
// }
//
// for( int i = 1 ; i <= n ; i ++ ){
// cin >> b[ i ] ;
// if( i >= 2 ){
// bf[ i - 1 ] = b[ i ] - b[ i - 1 ] ;
// }
//
// }
cin >> p >> k >> tt ;
int ans = p - qmi( k , tt ) ;
if( tt & 1 ){
cout << ans << endl;
}else{
cout << p - ans << endl;
}
return ;
}
int main(){
ios::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0) ;
int t = 1 ;
//cin >> t ;
//cout << ( 1296 * 216 ) % 11 << endl ;
while( t-- ){
AC() ;
}
return 0 ;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3500kb
input:
7 5 3
output:
1
result:
ok 1 number(s): "1"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
11 6 7
output:
3
result:
ok 1 number(s): "3"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
3 2 1
output:
1
result:
ok 1 number(s): "1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3608kb
input:
596620183 516846890 38276329
output:
135352707
result:
ok 1 number(s): "135352707"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
382744931 85302262 235496559
output:
14577469
result:
ok 1 number(s): "14577469"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
659446013 641119314 378275666
output:
290624162
result:
ok 1 number(s): "290624162"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
227 163 124
output:
189
result:
ok 1 number(s): "189"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
197 187 19
output:
62
result:
ok 1 number(s): "62"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3624kb
input:
5 3 3
output:
3
result:
ok 1 number(s): "3"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3572kb
input:
7 6 4
output:
1
result:
ok 1 number(s): "1"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3620kb
input:
7 1 1
output:
6
result:
ok 1 number(s): "6"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
782371 586755 418517
output:
298550
result:
ok 1 number(s): "298550"
Test #13:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
181081 178315 76002
output:
125177
result:
ok 1 number(s): "125177"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
715019 492103 446729
output:
221541
result:
ok 1 number(s): "221541"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
238985261 199832612 162675695
output:
65826267
result:
ok 1 number(s): "65826267"
Test #16:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
129716453 10994076 62963738
output:
5186275
result:
ok 1 number(s): "5186275"
Test #17:
score: 0
Accepted
time: 1ms
memory: 3564kb
input:
962360593 652577122 345596237
output:
814039152
result:
ok 1 number(s): "814039152"
Test #18:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
871606937 839183139 754188014
output:
466391387
result:
ok 1 number(s): "466391387"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
275568091 270750503 241146839
output:
252569968
result:
ok 1 number(s): "252569968"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
562028473 111749710 450258818
output:
63116256
result:
ok 1 number(s): "63116256"