Submission #691653
Source Code Expand
#include <iostream> #include <cstdio> #include <cstring> #include <vector> #include <climits> #include <algorithm> #include <cmath> #include <cstdlib> #include <stack> #include <queue> #include <string> #include <map> #include <set> #include <sstream> #include <functional> #include <ctime> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> PII; typedef vector<int> VI; #define FOR(i,a,b) for(int i=(a);i<(b);i++) #define REP(i,n) FOR(i,0,n) #define CLEAR(d) memset((d), 0, (sizeof((d)))) #define ALL(c) (c).begin(), (c).end() #define ABS(x) ((x < 0) ? -(x) : (x)) #define SORT(x) sort((x).begin(), (x).end()) #define RSORT(x) sort((x).begin(), (x).end(), greater<int>() ) #define SIZE(a) ((int)((a).size())) #define MOD 1000000007 #define EPS 1e-7 #define PI 3.14159265358979323846 #define INF 100000000 struct edge { int to; int cost; }; //=================================================== ll leastSquaresMethod(ll x, ll n, ll mod) { if (n == 0) return 1; x %= mod; if (n % 2) { return ((leastSquaresMethod(x * x, n / 2, mod) % mod) * (x % mod)) % mod; } return leastSquaresMethod(x * x, n / 2, mod) % mod; } int main() { ll N, M, P; cin >> N >> M >> P; cout << leastSquaresMethod(N, P, M) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - n^p mod m |
User | mo2mo268 |
Language | C++14 (GCC 5.4.1) |
Score | 100 |
Code Size | 1362 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 | 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 | 6 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 |