Submission #691253
Source Code Expand
#include <stdio.h> #include <cstdio> #include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <set> #include <iostream> #include <memory> #include <string> #include <vector> #include <algorithm> #include <functional> #include <sstream> #include <complex> #include <stack> #include <queue> #include <numeric> #include <unordered_map> #include "assert.h" using namespace std; static const double EPS = 1e-9; template<class T> bool INRANGE(T x,T a,T b){return a<=x&&x<=b;} template<class T> void amin(T &a,T v){if(a>v) a=v;} template<class T> void amax(T &a,T v){if(a<v) a=v;} int ROUND(double x) { return (int)(x+0.5); } bool ISINT(double x) { return fabs(ROUND(x)-x)<=EPS; } bool ISEQUAL(double x,double y) { return fabs(x-y)<=EPS*max(1.0,max(fabs(x),fabs(y))); } double SQSUM(double x,double y) { return x*x+y*y; } #define PI (acos(-1)) #define ARRAY_NUM(a) (sizeof(a)/sizeof(a[0])) #define NG (-1) #define BIG ((int)1e9) #define BIGLL ((ll)4e18) #define SZ(a) ((int)(a).size()) #define SQ(a) ((a)*(a)) typedef unsigned long long ull; typedef long long ll; int modpow(ll p, ll q, int MOD) { ll res = 1; ll basemod = p%MOD; for(ll i=0;i<63;i++) { if( q & (1LL<<i)) { res *= basemod; res = res%MOD; } basemod = (basemod*basemod)%MOD; } return (int)(res%MOD); } int main(){ ll n,m,p; cin >> n >> m >> p; cout << modpow(n, p, m) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - n^p mod m |
User | shindannin |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1510 Byte |
Status | AC |
Exec Time | 5 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 | 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 | 5 ms | 256 KB |
019.txt | AC | 5 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 |