Submission #11406528
Source Code Expand
# -*- coding: utf-8 -*- # B - 繰り返し最小二乗法 ''' 123456789 234567894 6574837563712 ''' N, M, P = map(int, input().split()) def power_mod(n, k, m): if k == 0: return 1 elif k % 2 == 1: return power_mod(n, k-1, m) * (n % m) % m elif k % 2 == 0: temp = power_mod(n, k/2, m) return (temp * temp) % m print(power_mod(N, P, M))
Submission Info
Submission Time | |
---|---|
Task | B - n^p mod m |
User | hs_gori |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 406 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3060 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 | 17 ms | 3060 KB |
002.txt | AC | 17 ms | 2940 KB |
003.txt | AC | 17 ms | 3060 KB |
004.txt | AC | 17 ms | 3060 KB |
005.txt | AC | 17 ms | 3060 KB |
006.txt | AC | 17 ms | 3060 KB |
007.txt | AC | 17 ms | 3060 KB |
008.txt | AC | 17 ms | 3060 KB |
009.txt | AC | 17 ms | 2940 KB |
010.txt | AC | 17 ms | 3060 KB |
011.txt | AC | 17 ms | 3060 KB |
012.txt | AC | 17 ms | 3060 KB |
013.txt | AC | 17 ms | 3060 KB |
014.txt | AC | 17 ms | 3060 KB |
015.txt | AC | 17 ms | 3060 KB |
016.txt | AC | 17 ms | 3060 KB |
017.txt | AC | 17 ms | 3060 KB |
018.txt | AC | 17 ms | 2940 KB |
019.txt | AC | 17 ms | 3060 KB |
020.txt | AC | 17 ms | 3060 KB |
021.txt | AC | 17 ms | 3060 KB |
022.txt | AC | 17 ms | 2940 KB |
023.txt | AC | 17 ms | 3060 KB |
024.txt | AC | 17 ms | 2940 KB |
025.txt | AC | 17 ms | 2940 KB |
026.txt | AC | 17 ms | 3060 KB |
027.txt | AC | 17 ms | 2940 KB |
sample_01.txt | AC | 17 ms | 2940 KB |
sample_02.txt | AC | 17 ms | 3060 KB |