Submission #691249
Source Code Expand
#include <bits/stdc++.h> #define REP(i,n) for(int i=0;i<(int)(n);i++) #define ALL(x) (x).begin(),(x).end() using namespace std; using ll = long long; int mod; struct Mod { int n; Mod () : n(0) {;} Mod (int m) : n(m) { if (n >= mod) n %= mod; else if (n < 0) n = (n % mod + mod) % mod; } operator int() { return n; } }; bool operator==(Mod a, Mod b) { return a.n == b.n; } Mod operator+=(Mod &a, Mod b) { a.n += b.n; if (a.n >= mod) a.n -= mod; return a; } Mod operator-=(Mod &a, Mod b) { a.n -= b.n; if (a.n < 0) a.n += mod; return a; } Mod operator*=(Mod &a, Mod b) { a.n = ((long long)a.n * b.n) % mod; return a; } Mod operator+(Mod a, Mod b) { return a += b; } Mod operator-(Mod a, Mod b) { return a -= b; } Mod operator*(Mod a, Mod b) { return a *= b; } Mod operator^(Mod a, ll n) { if (n == 0) return Mod(1); Mod res = (a * a) ^ (n / 2); if (n % 2) res = res * a; return res; } int main() { int N; ll P; cin >> N >> mod >> P; cout << (Mod(N) ^ P) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - n^p mod m |
User | asi1024 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1058 Byte |
Status | AC |
Exec Time | 6 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||
---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||
Status | AC |
|
Set Name | Test Cases |
---|---|
Sample | |
All | 001.txt, 002.txt, 003.txt, 004.txt, 005.txt, 006.txt, 007.txt, 008.txt, 009.txt, 010.txt, 011.txt, 012.txt, 013.txt, 014.txt, 015.txt, 016.txt, 017.txt, 018.txt, 019.txt, 020.txt, 021.txt, 022.txt, 023.txt, 024.txt, 025.txt, 026.txt, 027.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
001.txt | AC | 4 ms | 256 KB |
002.txt | AC | 6 ms | 256 KB |
003.txt | AC | 4 ms | 256 KB |
004.txt | AC | 4 ms | 256 KB |
005.txt | AC | 4 ms | 256 KB |
006.txt | AC | 4 ms | 256 KB |
007.txt | AC | 4 ms | 256 KB |
008.txt | AC | 4 ms | 256 KB |
009.txt | AC | 4 ms | 256 KB |
010.txt | AC | 4 ms | 256 KB |
011.txt | AC | 4 ms | 256 KB |
012.txt | AC | 4 ms | 256 KB |
013.txt | AC | 4 ms | 256 KB |
014.txt | AC | 4 ms | 256 KB |
015.txt | AC | 4 ms | 256 KB |
016.txt | AC | 4 ms | 256 KB |
017.txt | AC | 4 ms | 256 KB |
018.txt | AC | 4 ms | 256 KB |
019.txt | AC | 4 ms | 256 KB |
020.txt | AC | 4 ms | 256 KB |
021.txt | AC | 4 ms | 256 KB |
022.txt | AC | 4 ms | 256 KB |
023.txt | AC | 4 ms | 256 KB |
024.txt | AC | 4 ms | 256 KB |
025.txt | AC | 4 ms | 256 KB |
026.txt | AC | 4 ms | 256 KB |
027.txt | AC | 4 ms | 256 KB |
sample_01.txt | AC | 4 ms | 256 KB |
sample_02.txt | AC | 4 ms | 256 KB |