Datasets:
tm0012-QCB
/
QCoderBenchmark

Dataset card Data Studio Files
xet
 Community
1
problem
stringclasses
67 values
user
stringlengths
13
13
submission_order
int64
1
57
result
stringclasses
10 values
execution_time
stringlengths
0
8
memory
stringclasses
88 values
code
stringlengths
47
7.62k
QPC004_C1
A325389273CBE
9
RE
1640 ms
158 MiB
'''python def gcd(x: int, y: int) -> int: while y != 0: x, y = y, x % y return x def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: n=10*10*10*10*10 x = a % L for _ in range(1,n+1): result.append(x) x = (x * x) % L ...
QPC004_C1
A325389273CBE
10
RE
1593 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here x = a % L for _ in range(1,n+1): result.append(x) x = (x * x) % L return result '''
QPC004_C1
A325389273CBE
11
UME
'''python from qiskit.quantum_info import Statevector from qiskit.visualization import * from qiskit import QuantumCircuit def ccx_same(qc, c1, c2, tgt): qc.cx(c2, tgt) qc.cx(c1, c2) qc.cx(c2, tgt) qc.cx(c1, c2) def solve(a: int, L: int) -> list[int]: result: list[int] = [] # W...
QPC004_C1
A325389273CBE
12
RE
1485 ms
157 MiB
'''python from qiskit import QuantumCircuit def ccx_same(qc, c1, c2, tgt): qc.cx(c2, tgt) qc.cx(c1, c2) qc.cx(c2, tgt) qc.cx(c1, c2) def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here for i in range(n): qc.x(i) for i in range...
QPC004_C1
A325389273CBE
13
WA
1988 ms
162 MiB
'''python def solve(n: int, a: int, L: int) -> list: result = [a] for i in range(n - 1): result.append(result[i-1] ** 2 % L) return result '''
QPC004_C1
A325389273CBE
14
AC
3000 ms
191 MiB
'''python def solve(n: int, a: int, L: int) -> list: result = [a] for i in range(1,n): result.append(result[i-1] ** 2 % L) return result '''
QPC004_C1
A3DA23F0F67F0
1
AC
2708 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): result.append(a) a=(a**2)%L return result '''
QPC004_C1
A45D89576E194
1
RE
1468 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a) k = 1 while True: x = pow(a, 2**k, mod=L) if x == a: break if(x == 1): break result.append(x) k += 1 return result ''...
QPC004_C1
A45D89576E194
2
RE
1500 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a) k = 1 while True: x = pow(a, pow(2, k), mod=L) if x == a: break if(x == 1): break result.append(x) k += 1 return resu...
QPC004_C1
A45D89576E194
3
RE
1528 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a) k = 1 while True: x = pow(a, k, mod=L) if x == a: break if (x == 1): break if (result[-1] == x): break result....
QPC004_C1
A45D89576E194
4
RE
1747 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a) # 2^0 k = 2 # 2^1 while True: x = pow(a, k, mod=L) if x == a: break if (x == 1): break if (result[-1] == x): break ...
QPC004_C1
A45D89576E194
5
RE
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a) # 2^0 k = 2 # 2^1 while True: x = pow(a, k, mod=L) if (x == a || x == 1 || x == 0): break if (result[-1] == x): break result.appe...
QPC004_C1
A45D89576E194
6
RE
1696 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: k = 1 for i in range(10^5): x = pow(a, k, mod=L) result.append(x) k *= 2 return result '''
QPC004_C1
A45D89576E194
7
RE
1647 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(10**5): x = pow(a, pow(2, k), mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
8
TLE
3000 ms
157 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(10**5): x = pow(a, pow(2, k), mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
9
WA
1596 ms
164 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a % L result.append(x) for k in range(1, 10**5): x = (x * 2) % L result.append(x) return result '''
QPC004_C1
A45D89576E194
10
WA
1994 ms
164 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(10**5): x = pow(a, 2*k, mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
11
WA
1863 ms
158 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): x = pow(a, 2*k, mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
12
TLE
3000 ms
158 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): x = pow(a, pow(2, k), mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
13
RE
1615 ms
158 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): x = pow(x, 2, mod=L) result.append(x) return result '''
QPC004_C1
A45D89576E194
14
AC
2863 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a result.append(x) for k in range(1, n): x = pow(x, 2, mod=L) result.append(x) return result '''
QPC004_C1
A45DCC4B2BED7
1
RE
1820 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result = [pow(a, 2**k, L) for k in range(n)] return result '''
QPC004_C1
A45DCC4B2BED7
2
RE
1953 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(pow(a, 2**k, L)) return result '''
QPC004_C1
A45DCC4B2BED7
3
RE
1624 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(pow(a, 2**k, L)) return result '''
QPC004_C1
A45DCC4B2BED7
4
UME
'''python import sympy.ntheory.factor_ def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = int(sympy.ntheory.factor_.totient(L)) for k in range(n): tmp = pow(2, k, L_totient) result.append(pow(a, tmp, L)) return result '''
QPC004_C1
A45DCC4B2BED7
5
RE
1583 ms
157 MiB
'''python def phi(num): cnt=0 for i in range (1,num): if gcd(num,i)==1: cnt+=1 return cnt def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = phi(L) for k in range(n): tmp = pow(2, k, L_totient) result.append(pow...
QPC004_C1
A45DCC4B2BED7
6
RE
1567 ms
157 MiB
'''python from math import gcd def phi(num): cnt=0 for i in range (1,num): if gcd(num,i)==1: cnt+=1 return cnt def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = phi(L) for k in range(n): tmp = pow(2, k, L_totient) ...
QPC004_C1
A45DCC4B2BED7
7
RE
1489 ms
158 MiB
'''python from math import gcd def phi(num): cnt=0 for i in range (1,num): if gcd(num,i)==1: cnt+=1 return cnt def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = phi(L) for k in range(n): tmp = pow(2, k, L_totient)...
QPC004_C1
A45DCC4B2BED7
8
RE
'''python from math import gcd def phi(num): cnt=0 for i in range (1,num): if gcd(num,i)==1: cnt+=1 return cnt def solve(n int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = phi(L) for k in range(n): tmp = pow(2, k, L_t...
QPC004_C1
A45DCC4B2BED7
9
TLE
3000 ms
158 MiB
'''python from math import gcd def phi(num): cnt=0 for i in range (1,num): if gcd(num,i)==1: cnt+=1 return cnt def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: L_totient = phi(L) for k in range(n): tmp = pow(2, k, L_...
QPC004_C1
A4DB3E4437F45
1
RE
1563 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): tmp = a**(2**i) % L result.append(tmp) return result '''
QPC004_C1
A4DB3E4437F45
2
RE
2037 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): tmp = (a**(2**i)) % L result.append(tmp) return result '''
QPC004_C1
A4DB3E4437F45
3
RE
1656 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a% L for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
4
RE
1529 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a for _ in range(n): result.append(current % L) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
5
RE
1635 ms
159 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a for _ in range(n): result.append(current % L) current = (current * current) % L return result[:n] '''
QPC004_C1
A4DB3E4437F45
6
RE
1542 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
7
RE
1670 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
8
RE
1476 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
9
RE
1556 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
10
RE
1656 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
11
RE
1722 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A4DB3E4437F45
12
RE
1546 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a for _ in range(n): result.append(current) current = pow(current, 2, L) return result '''
QPC004_C1
A4DB3E4437F45
13
RE
1621 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a % L for _ in range(n): result.append(x) # Square x modulo L for the next term x = (x * x) % L # or x = pow(x, 2, L) return result '''
QPC004_C1
A4DB3E4437F45
14
RE
1669 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a % L for _ in range(n-1): result.append(x) # Square x modulo L for the next term x = (x * x) % L # or x = pow(x, 2, L) return result '''
QPC004_C1
A4DB3E4437F45
15
RE
1695 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a for _ in range(n-1): result.append(x) # Square x modulo L for the next term x = (x * x) % L # or x = pow(x, 2, L) return result '''
QPC004_C1
A4DB3E4437F45
16
RE
1477 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: x = a for _ in range(n): result.append(x) # Square x modulo L for the next term x = (x * x) % L # or x = pow(x, 2, L) return result '''
QPC004_C1
A4DB3E4437F45
17
RE
1488 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result = [a] for _ in range(n - 1): result.append(result[-1] ** 2 % L) return result '''
QPC004_C1
A4DB3E4437F45
18
TLE
3000 ms
179 MiB
'''python def solve(n: int, a: int, L: int) -> list: result = [a] for _ in range(n - 1): result.append(result[-1] ** 2 % L) return result '''
QPC004_C1
A56F812424B13
1
TOE
'''python def solve(n: int, a: int, L: int) -> list[int]: res = [1] cur = 1 for i in range(1, n): cur = cur * cur if(cur >= L) cur = cur % L res.push_back(cur) return res '''
QPC004_C1
A56F812424B13
2
RE
1907 ms
158 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: res = [1] expmod = pow(a, -1, L) curexp = 1 for i in range(1, n): curexp = (2*curexp) % expmod res.push_back(pow(a, curexp, L)) return res '''
QPC004_C1
A56F812424B13
3
RE
2063 ms
157 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: expmod = pow(a, -1, L) curexp = 1 for i in range(n): curexp = (2*curexp) % expmod res.push_back(pow(a, curexp, L)) return res '''
QPC004_C1
A56F812424B13
4
RE
2111 ms
157 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: expmod = pow(a, -1, L) curexp = 1 res = [] for i in range(n): curexp = (2*curexp) % expmod res.push_back(pow(a, curexp, L)) return res '''
QPC004_C1
A56F812424B13
5
TOE
'''python def solve(n: int, a: int, L: int) -> list[int]: expmod = pow(a, -1, L) curexp = 1 res = for i in range(n): curexp = (2*curexp) % expmod res.append(pow(a, curexp, L)) return res '''
QPC004_C1
A56F812424B13
6
AC
2702 ms
192 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: res = [1]*n cur = a for i in range(n): res[i] = cur cur = (cur*cur)%L return res '''
QPC004_C1
A58513FBB174E
1
RE
1900 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result: list[int] = [] current_value = a for k in range(L): result.append(current_value % L) current_value = (current_value * a * a) % L return result '''
QPC004_C1
A58513FBB174E
2
RE
1474 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current_value = a % L result.append(current_value) for k in range(1, n): current_value = (current_value * current_value) % L result.append(current_value) return result '''
QPC004_C1
A58513FBB174E
3
RE
1585 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current_value = a % L result.append(current_value) max_k = L.bit_length() for k in range(1, max_k): current_value = (current_value * current_value) % L result.append(curr...
QPC004_C1
A58513FBB174E
4
RE
1584 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current_value = a % L result.append(current_value) max_k = 100000 # 最大回数として適当な大きな値（問題の制約に基づく） for k in range(1, max_k): current_value = (current_value * current_value) % L ...
QPC004_C1
A58513FBB174E
5
RE
1765 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current_value = a % L result.append(current_value) for _ in range(n): result.append(current % L) current = (current * current) % L return result '''
QPC004_C1
A58513FBB174E
6
RE
1561 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(current) current = (current ** 2) % L return result '''
QPC004_C1
A58513FBB174E
7
RE
1739 ms
158 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(current) current = (current ** 2) % L return result '''
QPC004_C1
A58513FBB174E
8
AC
2696 ms
192 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] current = a % L # 初期値 a^2^0 mod L (a^1 mod L) for k in range(n): result.append(current) # 次の a^(2^(k+1)) mod L を計算 current = (current ** 2) % L return result '''
QPC004_C1
A5D72ED9B3B0C
1
RE
1800 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result = pow(a, 2**k, ) results.append(result) return result '''
QPC004_C1
A5D72ED9B3B0C
2
RE
1728 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A5D72ED9B3B0C
3
RE
1518 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L n = 2 ** 1024 for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A5D72ED9B3B0C
4
RE
1548 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L n = 10 ** 5 for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A5D72ED9B3B0C
5
RE
1700 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: current = a % L n = 10 ** 5 for _ in range(n): result.append(current) current = (current * current) % L return result '''
QPC004_C1
A5D72ED9B3B0C
6
RE
1783 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ** 5 for _ in range(n): result.append(current) current = (current *...
QPC004_C1
A5D72ED9B3B0C
7
RE
1781 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ** 5 for _ in range(n): result.append(current) ...
QPC004_C1
A5D72ED9B3B0C
8
RE
1765 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ** 5 for _ in range(n): result.append(current) ...
QPC004_C1
A5D72ED9B3B0C
9
RE
2029 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] result = [a] for _ in range(n - 1): result.append(result[-1] ** 2 % L) return result if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ...
QPC004_C1
A5D72ED9B3B0C
10
RE
2013 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result = [a] for _ in range(n - 1): result.append(result[-1] ** 2 % L) return result if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ** 5 for _ in range...
QPC004_C1
A5D72ED9B3B0C
11
AC
2844 ms
192 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result = [a] for _ in range(n - 1): result.append(result[-1] ** 2 % L) return result if not (1 <= a < L <= 2**1024): raise ValueError("条件 1 ≤ a < L ≤ 2^1024 を満たしていません。") current = a % L n = 10 ** 5 for _ ...
QPC004_C1
A65FF65626F92
1
AC
2914 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: v = a for i in range(n): result.append(v) v = (v ** 2) % L return result '''
QPC004_C1
A7D2F4F917E4D
1
AC
3000 ms
191 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a) a = a * a % L return result '''
QPC004_C1
A83F97D36C67B
1
AC
2833 ms
191 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] current_value = 1 # This will hold a^(2^k) mod L, starting with a^(2^0) = a^1 mod L for k in range(n): if k == 0: current_value = a % L # a^(2^0) mod L else: current_value = (curre...
QPC004_C1
A8645A240690F
1
RE
1505 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: val = a result.append(val % L) for i in range(k): val = (a ** 2) % L result.append(val) return result '''
QPC004_C1
A8645A240690F
2
WA
1701 ms
158 MiB
'''python def solve(n, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: val = a result.append(val % L) for i in range(n): val = (a ** 2) % L result.append(val) return result '''
QPC004_C1
A8645A240690F
3
WA
1571 ms
158 MiB
'''python def solve(n, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: val = a result.append(val % L) for i in range(n): val = (val ** 2) % L result.append(val) return result '''
QPC004_C1
A8645A240690F
4
AC
2797 ms
193 MiB
'''python def solve(n, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: val = a result.append(val % L) for i in range(n - 1): val = (val ** 2) % L result.append(val) return result '''
QPC004_C1
A8BAEB1214037
1
RE
1580 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a % L) a = a * a return result '''
QPC004_C1
A8BAEB1214037
2
RE
1578 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a % L) a = (a * a) % L return result '''
QPC004_C1
A8BAEB1214037
3
WA
1706 ms
157 MiB
'''python def solve(a: int, L: int, n: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a % L) a = (a * a) % L return result '''
QPC004_C1
A8BAEB1214037
4
WA
1823 ms
157 MiB
'''python def solve(a: int, L: int, n: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a) a = (a * a) % L return result '''
QPC004_C1
A8BAEB1214037
5
AC
2658 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for _ in range(n): result.append(a) a = (a * a) % L return result '''
QPC004_C1
A94EC2CC80C4D
1
AC
2870 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] x = a % L for _ in range(n): result.append(x) x = (x * x) % L return result '''
QPC004_C1
A984ED6CAEC0E
1
AC
2950 ms
192 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] for _ in range(n): result.append(a) a = (a * a) % L return result '''
QPC004_C1
A9AF297F479D2
1
RE
1567 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] record = {} i = 0 while True: a2modL = pow(a, 2**i, L) if a2modL in record: break record[a2modL] = i result.append(a2modL) i += 1 return result '''
QPC004_C1
A9AF297F479D2
2
RE
1549 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] record = {} val = a % L i = 0 while val not in record: record[val] = i result.append(val) val = (val * a) % L i += 1 return result '''
QPC004_C1
A9C49DF13D7A2
1
AC
2976 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): result.append(a) a *= a a %= L return result '''
QPC004_C1
A9F06D68C38B4
1
RE
1794 ms
157 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a % L) for i in range(n - 1): result.append((result[i] * result[i]) % L) return result '''
QPC004_C1
A9F06D68C38B4
2
AC
2732 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: result.append(a % L) for i in range(n - 1): result.append((result[i] * result[i]) % L) return result '''
QPC004_C1
AA909D5BEC6B5
1
RE
1560 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): result.append(a) a = a*a%L return result '''
QPC004_C1
AA909D5BEC6B5
2
AC
2862 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for i in range(n): result.append(a) a = a*a%L return result '''
QPC004_C1
ACF5EBCBA447E
1
AC
2702 ms
192 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: b = a for i in range(0, n): if i > 0: b = b*b b %= L b %= L result += [b] return result '''
QPC004_C1
AD602DA575EDA
1
RE
1698 ms
156 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append((a ** (2 ** k)) % k) return result '''
QPC004_C1
AD602DA575EDA
2
TLE
3000 ms
160 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append((a ** (2 ** k)) % L) return result '''
QPC004_C1
AD602DA575EDA
3
TLE
3000 ms
161 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(a) a = a * a return result '''
QPC004_C1
AD602DA575EDA
4
AC
2716 ms
193 MiB
'''python def solve(n: int, a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: for k in range(n): result.append(a) a = (a * a) % L return result '''
QPC004_C1
AD83A66F52985
1
RE
1525 ms
158 MiB
'''python def solve(a: int, L: int) -> list[int]: result: list[int] = [] # Write your code here: n = 10**5 act = a result.append(act) for i in range(1, n): act = pow(act, 2, L) result.append(act) return result '''