Submission #691245
Source Code Expand
#include <iostream> #include <algorithm> typedef long long ll; using namespace std; ll modpow(ll x, ll n, ll m) { ll res=1; while (n>0) { if (n&1) res=res*x%m; x=x*x%m; n>>=1; } return res; } int main() { ll n, m, p; cin>>n>>m>>p; cout<<modpow(n, p, m)<<endl; }
Submission Info
Submission Time | |
---|---|
Task | B - n^p mod m |
User | hogeover30 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 331 Byte |
Status | AC |
Exec Time | 116 ms |
Memory | 764 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 | 116 ms | 764 KB |
002.txt | AC | 4 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 |