Submission #6934719
Source Code Expand
#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include<cstdio>
#include<iomanip>
#include<stack>
#include<queue>
#include<string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <list>
#define REP(i, n) for(int i=0;i<n;i++)
#define REP2(i, s, n) for(int i=s;i<n;i++)
#define REP_1(i, n) for(int i=1;i<n+1;i++)
#define bitSearch(bit, n) for(int bit = 0; bit < (1 << n); bit++)
using namespace std;
template<class T>
void print(const T &value) {
std::cout << value << std::endl;
}
void yesno(bool a) { if (a)cout << "yes" << endl; else cout << "no" << endl; }
void YesNo(bool a) { if (a)cout << "Yes" << endl; else cout << "No" << endl; }
void YESNO(bool a) { if (a)cout << "YES" << endl; else cout << "NO" << endl; }
typedef long long ll;
typedef unsigned long ul;
typedef long double ld;
template<class T>
inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T>
inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll INF = 1000001000;
ll mod = 1000000007;//10^9+7
ll power(ll x, ll n, ll mod) {//x^nをmodで割った余り
ll res = 1;
if (n > 0) {
res = power(x, n / 2, mod);
if (n % 2 == 0) res = (res * res) % mod;
else res = (((res * res) % mod) * x) % mod;
}
return res;
}
int dx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int dy[8] = {0, -1, 1, 0, -1, 1, -1, 1};
struct Edge {
int to, cost;
Edge(int to, int cost) : to(to), cost(cost) {};
};
using Graph = vector<vector<int>>;//隣接リスト:G[i]にはiと隣接する頂点が入るよ。
using GraphW = vector<vector<Edge>>;//重み付きの隣接リスト
using P = pair<int, int>;//BFSで利用。queueに入れる。
using lP = pair<ll, ll>;
using PP = pair<int, P>; //dijkstraで利用,priority_queueに入れる。
using p_queue = priority_queue<int, vector<int>, greater<int>>;//小さい順
class UnionFindTree {
public:
UnionFindTree(int size) : memberSize(size) {
par.resize(size * sizeof(ll));
rnk.resize(size * sizeof(ll));
diff_weight.resize(size * sizeof(ll));
REP(i, size) {
par[i] = i;
rnk[i] = 0;
diff_weight[i] = 0;
}
}
int memberSize;
vector<int> par;
vector<int> rnk;
vector<ll> diff_weight;
//n個のnodeで初期化する関数
void init(ll n) {
REP(i, n) {
par[i] = i;
rnk[i] = 1;
}
}
//木の根を求める。この際,親は根に更新される。
int find(ll x) {
if (par[x] == x) { return x; }
else {
int r = find(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
//xとyが同じ集合に属するか判定
bool same(ll x, ll y) {
return find(x) == find(y);
}
//xとyの属する集合を融合
void unite(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y) { return; }
if (rnk[x] < rnk[y]) {
par[x] = y;
} else {
par[y] = x;
if (rnk[x] == rnk[y]) { rnk[x]++; }
}
}
//xの重み
ll weight(ll x) {
find(x);
return diff_weight[x];
}
ll diff(ll x, ll y) {
return weight(y) - weight(x);
}
//重みごと更新。weight(y)-weight(x)=wとなるようにする
void merge(int x, int y, int w) {
w += weight(x);
w -= weight(y);
x = find(x);
y = find(y);
if (x == y) { return; }
if (rnk[x] < rnk[y]) {
par[x] = y;
diff_weight[x] = -w;
} else {
par[y] = x;
diff_weight[y] = w;
if (rnk[x] == rnk[y]) { rnk[x]++; }
}
}
};
//番号ズレ注意!!
int main() {
ll N, M, P;
cin >> N >> M >> P;
cout << power(N, P, M) << endl;
}
Submission Info
Submission Time |
|
Task |
B - n^p mod m |
User |
Matsumatsumatsu |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4187 Byte |
Status |
AC |
Exec Time |
2 ms |
Memory |
384 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, sample_01.txt, sample_02.txt |
Case Name |
Status |
Exec Time |
Memory |
001.txt |
AC |
1 ms |
256 KB |
002.txt |
AC |
1 ms |
256 KB |
003.txt |
AC |
1 ms |
256 KB |
004.txt |
AC |
1 ms |
256 KB |
005.txt |
AC |
1 ms |
256 KB |
006.txt |
AC |
1 ms |
256 KB |
007.txt |
AC |
1 ms |
256 KB |
008.txt |
AC |
1 ms |
256 KB |
009.txt |
AC |
2 ms |
384 KB |
010.txt |
AC |
1 ms |
256 KB |
011.txt |
AC |
1 ms |
256 KB |
012.txt |
AC |
1 ms |
256 KB |
013.txt |
AC |
1 ms |
256 KB |
014.txt |
AC |
1 ms |
256 KB |
015.txt |
AC |
1 ms |
256 KB |
016.txt |
AC |
1 ms |
256 KB |
017.txt |
AC |
1 ms |
256 KB |
018.txt |
AC |
1 ms |
256 KB |
019.txt |
AC |
1 ms |
256 KB |
020.txt |
AC |
1 ms |
256 KB |
021.txt |
AC |
1 ms |
256 KB |
022.txt |
AC |
1 ms |
256 KB |
023.txt |
AC |
1 ms |
256 KB |
024.txt |
AC |
1 ms |
256 KB |
025.txt |
AC |
1 ms |
256 KB |
026.txt |
AC |
1 ms |
256 KB |
027.txt |
AC |
1 ms |
256 KB |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |