problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02684 | n, k = map(int,input().split())
A = list(map(int,input().split()))
A = [a-1 for a in A]
path = []
passed = set([])
p = 0
while 1:
if k ==0:
print(p)
exit()
if p not in passed:
path.append(p)
passed.add(p)
p = A[p]
k -= 1
else:
break
path = path[path.index(p):]
term = len(path)
k %= te... | n, k = map(int,input().split())
A = list(map(int,input().split()))
A = [a-1 for a in A]
path = []
passed = set([])
p = 0
while 1:
if k ==0:
print(p+1)
exit()
if p not in passed:
path.append(p)
passed.add(p)
p = A[p]
k -= 1
else:
break
path = path[path.index(p):]
term = len(path)
k %= ... | [
"expression.operation.binary.add"
] | 416,537 | 416,538 | u103902792 | python |
p02684 | n,k = map(int,input().split())
a = list(map(int,input().split()))
flag = True
went = {1}
go = [1]
i = 0
while flag:
if a[i] not in went:
go.append(a[i])
went.add(a[i])
i = a[i]-1
else:
flag = False
loop = go[go.index(a[i]):]
if len(go) >= k:
print(go[k])
else:
k -= len(go)-len(loop)
ans = k % ... | n,k = map(int,input().split())
a = list(map(int,input().split()))
flag = True
went = {1}
go = [1]
i = 0
while flag:
if a[i] not in went:
go.append(a[i])
went.add(a[i])
i = a[i]-1
else:
flag = False
loop = go[go.index(a[i]):]
if len(go) > k:
print(go[k])
else:
k -= len(go)-len(loop)
ans = k % l... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 416,549 | 416,550 | u097317219 | python |
p02684 | N, K = map(int, input().split())
As = list(map(int, input().split()))
history = {}
cycle = []
pos = 1
isEnd = False
for i in range(2*N):
if pos in history:
for j in range(len(cycle)):
if cycle[j] == pos:
head = cycle[:j]
cycle = cycle[j:]
isEnd = ... | N, K = map(int, input().split())
As = list(map(int, input().split()))
history = {}
cycle = []
pos = 1
isEnd = False
for i in range(2*N):
if pos in history:
for j in range(len(cycle)):
if cycle[j] == pos:
head = cycle[:j]
cycle = cycle[j:]
isEnd = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 416,559 | 416,560 | u666476759 | python |
p02684 | def read_int():
return int(input())
def read_int_map():
return map(int,input().split(' '))
def read_int_list():
return list(map(int,input().split(' ')))
def read_s_list_loop(n):
return [input() for _ in range(n)]
N,K = read_int_map()
An = read_int_list()
memo = [0]*(N+1)
memo_indx = [0]*(N+1)
memo[1... | def read_int():
return int(input())
def read_int_map():
return map(int,input().split(' '))
def read_int_list():
return list(map(int,input().split(' ')))
def read_s_list_loop(n):
return [input() for _ in range(n)]
N,K = read_int_map()
An = read_int_list()
memo = [0]*(N+1)
memo_indx = [0]*(N+1)
memo[1... | [
"control_flow.branch.if.condition.change"
] | 416,582 | 416,583 | u415154163 | python |
p02684 | def read_int():
return int(input())
def read_int_map():
return map(int,input().split(' '))
def read_int_list():
return list(map(int,input().split(' ')))
def read_s_list_loop(n):
return [input() for _ in range(n)]
N,K = read_int_map()
An = read_int_list()
memo = [0]*(N+1)
memo_indx = [0]*(N+1)
memo[1... | def read_int():
return int(input())
def read_int_map():
return map(int,input().split(' '))
def read_int_list():
return list(map(int,input().split(' ')))
def read_s_list_loop(n):
return [input() for _ in range(n)]
N,K = read_int_map()
An = read_int_list()
memo = [0]*(N+1)
memo_indx = [0]*(N+1)
memo[1... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 416,584 | 416,583 | u415154163 | python |
p02684 | n,k = map(int,input().split())
a = [0]+list(map(int,input().split()))
b = [0]*(n+1)
cnt = 0
temp = 1
rep = 0
while 1:
cnt += 1
if b[temp] == 0:
b[temp] = cnt
else:
rep = cnt-b[temp]
# print(rep,cnt-1,b[temp])
# print(b)
break
temp = a[temp]
# print((k-b[temp]+1) %... | n,k = map(int,input().split())
a = [0]+list(map(int,input().split()))
b = [0]*(n+1)
cnt = 0
temp = 1
rep = 0
while 1:
cnt += 1
if b[temp] == 0:
b[temp] = cnt
else:
rep = cnt-b[temp]
# print(rep,cnt-1,b[temp])
# print(b)
break
temp = a[temp]
# print((k-b[temp]+1) %... | [
"call.add",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 416,589 | 416,590 | u738898077 | python |
p02685 | N,M,K = map(int,(input().split()))
MOD = 998244353
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo... | N,M,K = map(int,(input().split()))
MOD = 998244353
kaijo_memo = []
def kaijo(n):
if(len(kaijo_memo) > n):
return kaijo_memo[n]
if(len(kaijo_memo) == 0):
kaijo_memo.append(1)
while(len(kaijo_memo) <= n):
kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
return kaijo_memo[n]
gyaku_kaijo_memo... | [] | 416,613 | 416,614 | u397384480 | python |
p02685 | n,m,k=map(int,input().split())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * (g2[r] * g2[n-r]) % mod)%mod
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i ) % mod )
... | n,m,k=map(int,input().split())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * (g2[r] * g2[n-r]) % mod)%mod
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i ) % mod )
... | [
"expression.operation.binary.add"
] | 416,617 | 416,618 | u752907966 | python |
p02685 | n,m,k=map(int,input().split())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * (g2[r] * g2[n-r]) % mod)%mod
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i ) % mod )
... | n,m,k=map(int,input().split())
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return (g1[n] * (g2[r] * g2[n-r]) % mod)%mod
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, n + 1 ):
g1.append( ( g1[-1] * i ) % mod )
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 416,619 | 416,618 | u752907966 | python |
p02685 | class Combination:
def __init__(self, n_max, mod=998244353):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
... | class Combination:
def __init__(self, n_max, mod=998244353):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 416,656 | 416,657 | u217627525 | python |
p02685 | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
mod = 998244353
ans = 0
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) ... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
import sys
input = sys.stdin.readline
N, M, K = map(int, input().split())
mod = 998244353
ans = 0
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) ... | [
"expression.operation.binary.remove"
] | 416,666 | 416,667 | u219417113 | python |
p02685 | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353
N = 2*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[... | def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353
N = 2*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[... | [
"call.add",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add"
] | 416,668 | 416,669 | u115110170 | python |
p02685 | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | [
"call.add",
"call.arguments.add"
] | 416,682 | 416,683 | u367794409 | python |
p02685 | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | [
"call.add",
"call.arguments.add"
] | 416,684 | 416,683 | u367794409 | python |
p02685 | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | [
"assignment.change"
] | 416,684 | 416,685 | u367794409 | python |
p02685 | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-1]*i%mod
inv[i] = mod - inv[mod%i]*(mod//i)%mod
finv[i] = finv[i-1]*inv[i]%mod
def COM(n,k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
retur... | [
"assignment.change"
] | 416,684 | 416,686 | u367794409 | python |
p02685 | fact = [1 for _ in range(100000)]
inv = [1 for _ in range(100000)]
fact_inv = [1 for _ in range(100000)]
mod = 998244353
for i in range(2, 100000):
fact[i] = (fact[i-1]*i) % mod
inv[i] = mod - (inv[mod % i] * (mod // i)) % mod
fact_inv[i] = (fact_inv[i-1] * inv[i]) % mod
N, M, K = map(int, input().split()... | fact = [1 for _ in range(200000)]
inv = [1 for _ in range(200000)]
fact_inv = [1 for _ in range(200000)]
mod = 998244353
for i in range(2, 200000):
fact[i] = (fact[i-1]*i) % mod
inv[i] = mod - (inv[mod % i] * (mod // i)) % mod
fact_inv[i] = (fact_inv[i-1] * inv[i]) % mod
N, M, K = map(int, input().split()... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 416,695 | 416,696 | u267718666 | python |
p02685 | n, m, k = map(int, input().split())
mod = 998244353
N = 10**5 # N!まで求める
fact = [1, 1] # 階乗の元テーブル
fact_inv = [1, 1] # 階乗の逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル 1,2,,...の逆元を求めてる
# 計算 O(1)
def comb(n, r, mod):
if (r<0 or r>n):
return 0
r = min(r, n-r)
return fact[n] * fact_inv[r] * fact_inv[n-r] % ... | n, m, k = map(int, input().split())
mod = 998244353
N = 10**5 * 2 # N!まで求める
fact = [1, 1] # 階乗の元テーブル
fact_inv = [1, 1] # 階乗の逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル 1,2,,...の逆元を求めてる
# 計算 O(1)
def comb(n, r, mod):
if (r<0 or r>n):
return 0
r = min(r, n-r)
return fact[n] * fact_inv[r] * fact_inv[n-r... | [
"assignment.change"
] | 416,703 | 416,704 | u533232830 | python |
p02685 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 416,713 | 416,714 | u191874006 | python |
p02685 | import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare(n, mod=998244353):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
inv = pow(f, mod - 2, mod)
... | import sys
from io import StringIO
import unittest
import os
# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)
def prepare(n, mod=998244353):
f = 1
factorials = [1]
for m in range(1, n + 1):
f *= m
f %= mod
factorials.append(f)
inv = pow(f, mod - 2, mod)
... | [
"literal.number.integer.change",
"assignment.value.change",
"call.arguments.change"
] | 416,715 | 416,716 | u550814027 | python |
p02685 | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
#R = 10**9 + 7
R = 998244353
def ddprint(x):
if D... | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
#R = 10**9 + 7
R = 998244353
def ddprint(x):
if D... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 416,719 | 416,720 | u102445737 | python |
p02685 |
N, M, K = map(int, input().split())
MOD = 998244353
MAX = 2 * 10 ** 5 + 1
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] =... |
N, M, K = map(int, input().split())
MOD = 998244353
MAX = 2 * 10 ** 5 + 1
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] =... | [] | 416,721 | 416,722 | u057109575 | python |
p02685 | class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
if n... | class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
if n >= self... | [
"identifier.change"
] | 416,727 | 416,728 | u781262926 | python |
p02685 | #import numpy as np
import math
#from decimal import *
#from numba import njit
#@njit
def main():
(N, M, K) = map(int, input().split())
MOD = 998244353
fact = [1]*(N+1)
factinv = [1]*(N+1)
for i in range(1,K+1):
fact[i] = fact[i-1]*i % MOD
factinv[i] = pow(fact[i], MOD-2, MOD)
... | #import numpy as np
import math
#from decimal import *
#from numba import njit
#@njit
def main():
(N, M, K) = map(int, input().split())
MOD = 998244353
fact = [1]*(N+1)
factinv = [1]*(N+1)
for i in range(1,N+1):
fact[i] = fact[i-1]*i % MOD
factinv[i] = pow(fact[i], MOD-2, MOD)
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 416,738 | 416,739 | u221998589 | python |
p02685 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 416,745 | 416,746 | u375616706 | python |
p02685 | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | # -*- coding: utf-8 -*-
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
self.f = [1]*(n+1)
for... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 416,747 | 416,746 | u375616706 | python |
p02685 | def main():
n, m, k = map(int, input().split())
mod = 998244353
kai = [None]*n
m1 = [None]*n
num = 1
ki = 1
for i in range(n):
m1[i] = num
num *= m-1
num %= mod
kai[i] = ki
ki *= i+1
ki %= mod
def comb(a, b):
return kai[a]*ferm... | def main():
n, m, k = map(int, input().split())
mod = 998244353
kai = [None]*n
m1 = [None]*n
num = 1
ki = 1
for i in range(n):
m1[i] = num
num *= m-1
num %= mod
kai[i] = ki
ki *= i+1
ki %= mod
def comb(a, b):
return kai[a]*ferm... | [
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 416,748 | 416,749 | u750990077 | python |
p02685 | def main():
n, m, k = map(int, input().split())
mod = 998244353
kai = [None]*n
m1 = [None]*n
num = 1
ki = 1
for i in range(n):
m1[i] = num
num *= m-1
num %= mod
kai[i] = ki
ki *= i+1
ki %= mod
def comb(a, b):
return kai[a]*ferm... | def main():
n, m, k = map(int, input().split())
mod = 998244353
kai = [None]*n
m1 = [None]*n
num = 1
ki = 1
for i in range(n):
m1[i] = num
num *= m-1
num %= mod
kai[i] = ki
ki *= i+1
ki %= mod
def comb(a, b):
return kai[a]*ferm... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 416,750 | 416,749 | u750990077 | python |
p02685 | from functools import lru_cache
MOD = 998244353
def solve_baka(n, m, k):
print('params:', n, m, k)
ans = 0
for i in range(m**n):
s = ''
for j in range(n):
s = str(i % m) + s
i = i // m
cnt = 0
for j in range(n-1):
if s[j] == s[j+1]:
... | from functools import lru_cache
MOD = 998244353
def solve_baka(n, m, k):
print('params:', n, m, k)
ans = 0
for i in range(m**n):
s = ''
for j in range(n):
s = str(i % m) + s
i = i // m
cnt = 0
for j in range(n-1):
if s[j] == s[j+1]:
... | [
"call.remove"
] | 416,767 | 416,768 | u926080943 | python |
p02685 | M = 998244353
n,m,K = map(int,input().split())
ans = 0
c = 1
for k in range(K+1):
ans += c * m * pow(m-1,n-k-1,M)
c *= (n-k+1) * pow(k+1,M-2,M)
ans %= M
c %= M
print(ans)
| M = 998244353
n,m,K = map(int,input().split())
ans = 0
c = 1
for k in range(K+1):
ans += c * m * pow(m-1,n-k-1,M)
c *= (n-k-1) * pow(k+1,M-2,M)
ans %= M
c %= M
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 416,781 | 416,782 | u788703383 | python |
p02685 | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#ここにコード
#input
N, M, K = map(int, input().split())
#output
mod = 998244353
n_ = 4*10**5 + 5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_... | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#ここにコード
#input
N, M, K = map(int, input().split())
#output
mod = 998244353
n_ = 4*10**5 + 5
fun = [1]*(n_+1)
for i in range(1,n_+1):
fun[i] = fun[i-1]*i%mod
rev = [1]*(n_+1)
rev[n_] = pow(fun[n_... | [
"call.arguments.change"
] | 416,783 | 416,784 | u461454424 | python |
p02685 | from operator import mul
from functools import reduce
from math import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 998244353
class Combination(object):
def __init__(self, N, MOD):
self.fac = [0] * (N + 1)
self.inv = [0]... | from operator import mul
from functools import reduce
from math import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 998244353
class Combination(object):
def __init__(self, N, MOD):
self.fac = [0] * (N + 1)
self.inv = [0]... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 416,793 | 416,794 | u912862653 | python |
p02685 | from operator import mul
from functools import reduce
from math import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 998244353
class Combination(object):
def __init__(self, N, MOD):
self.fac = [0] * (N + 1)
self.inv = [0]... | from operator import mul
from functools import reduce
from math import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")
MOD = 998244353
class Combination(object):
def __init__(self, N, MOD):
self.fac = [0] * (N + 1)
self.inv = [0]... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change",
"control_flow.return.add"
] | 416,795 | 416,794 | u912862653 | python |
p02685 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
def inp():
'''
一つの... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9 + 7
eps = 10**-7
def inp():
'''
一つの... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 416,798 | 416,799 | u802977614 | python |
p02685 | mod= 998244353
n,m,k=map(int,input().split())
ans=0
cmb=1
for i in range(k+1):
ans+=cmb*m*pow(m-1,n-1-i,mod)
ans%=mod
X=(n-1-i)*pow(i+1,mod-2,mod)
X%=mod
print(ans) | mod= 998244353
n,m,k=map(int,input().split())
ans=0
cmb=1
for i in range(k+1):
ans+=cmb*m*pow(m-1,n-1-i,mod)
ans%=mod
cmb*=(n-1-i)*pow(i+1,mod-2,mod)
cmb%=mod
print(ans)
| [
"identifier.change"
] | 416,822 | 416,823 | u210827208 | python |
p02685 | def solve():
N,M,K = map(int,input().split())
MOD = 998244353
fac, finv, inv = COMinit(N,MOD)
ans = 0
for i in range(K+1):
ans += M % MOD * pow(M-1,N-1-i,MOD) % MOD * COM(N-1,i,MOD,fac,finv,inv) % MOD
print(ans%MOD)
# COMの前処理
# テーブルを作る
# O(n)
def COMinit(N, mod):
fac = [0] * ... | def solve():
N,M,K = map(int,input().split())
MOD = 998244353
fac, finv, inv = COMinit(N+1,MOD)
ans = 0
for i in range(K+1):
ans += M % MOD * pow(M-1,N-1-i,MOD) % MOD * COM(N-1,i,MOD,fac,finv,inv) % MOD
print(ans%MOD)
# COMの前処理
# テーブルを作る
# O(n)
def COMinit(N, mod):
fac = [0] ... | [
"assignment.change"
] | 416,838 | 416,839 | u647999897 | python |
p02685 | N,M,K = map(int,input().split())
MOD = 998244353
mod = MOD
MAX = N+1
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def cominit():
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod//i) ... | N,M,K = map(int,input().split())
MOD = 998244353
mod = MOD
MAX = N+1
fac = [0] * MAX
finv = [0] * MAX
inv = [0] * MAX
def cominit():
fac[0] = 1
fac[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2,MAX):
fac[i] = fac[i-1] * i % mod
inv[i] = mod - inv[mod%i] * (mod//i) ... | [
"expression.operation.binary.add"
] | 416,845 | 416,846 | u698176039 | python |
p02685 | def main():
N, M, K = map(int, input().split())
MOD = 998244353
fac = [0] * 10 ** 6
inv = [0] * 10 ** 6
finv = [0] * 10 ** 6
def COM_init():
fac[0] = 1
fac[1] = 1
inv[1] = 1
finv[0] = 1
finv[1] = 1
for i in range(2, 10**5+10):
fac[i]... | def main():
N, M, K = map(int, input().split())
MOD = 998244353
fac = [0] * 10 ** 6
inv = [0] * 10 ** 6
finv = [0] * 10 ** 6
def COM_init():
fac[0] = 1
fac[1] = 1
inv[1] = 1
finv[0] = 1
finv[1] = 1
for i in range(2, 2 * 10**5 +10):
f... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 416,869 | 416,870 | u707498674 | python |
p02685 | N, M, K = list(map(int,input().split()))
m = 998244353
# コンビネーション _{N} C_n (n=1,...,N)をmod mで計算する
# フェルマーの小定理を利用する
# 計算量はO(max(N,m))
class combination_mod: # mod mのもとでのN C nを計算するクラス，計算量はO(N)
def __init__(self,N,m):
self.N = N
self.m = m
self.N_factorials = [1 for _ in range(N)] # 1!からN!までをm... | N, M, K = list(map(int,input().split()))
m = 998244353
# コンビネーション _{N} C_n (n=1,...,N)をmod mで計算する
# フェルマーの小定理を利用する
# 計算量はO(max(N,m))
class combination_mod: # mod mのもとでのN C nを計算するクラス，計算量はO(N)
def __init__(self,N,m):
self.N = N
self.m = m
self.N_factorials = [1 for _ in range(N)] # 1!からN!までをm... | [
"control_flow.branch.if.condition.change"
] | 416,873 | 416,874 | u444732068 | python |
p02685 | class Cmb:
def __init__(self, N, mod=998244353):
self.fact = [1,1]
self.fact_inv = [1,1]
self.inv = [0,1]
""" 階乗を保存する配列を作成 """
for i in range(2, N+1):
self.fact.append((self.fact[-1]*i) % mod)
self.inv.append((-self.inv[mod%i] * (mod//i))%mod)... | class Cmb:
def __init__(self, N, mod=998244353):
self.fact = [1,1]
self.fact_inv = [1,1]
self.inv = [0,1]
""" 階乗を保存する配列を作成 """
for i in range(2, N+1):
self.fact.append((self.fact[-1]*i) % mod)
self.inv.append((-self.inv[mod%i] * (mod//i))%mod)... | [
"literal.number.integer.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 416,877 | 416,878 | u672475305 | python |
p02685 | def inverse(a, p):
a_, p_ = a, p
x, y = 1, 0
while p_:
t = a_ // p_
a_ -= t * p_
a_, p_ = p_, a_
x -= t * y
x, y = y, x
x %= p
return x
def solve():
N, M, K = map(int, input().split())
mod = 998244353
nCi = [1]
for i in range(1, N):
... | def inverse(a, p):
a_, p_ = a, p
x, y = 1, 0
while p_:
t = a_ // p_
a_ -= t * p_
a_, p_ = p_, a_
x -= t * y
x, y = y, x
x %= p
return x
def solve():
N, M, K = map(int, input().split())
mod = 998244353
nCi = [1]
for i in range(1, N):
... | [
"call.remove"
] | 416,888 | 416,889 | u945228737 | python |
p02685 | n,m,k=map(int,input().split())
mod = 998244353
nCi = [1]#n-1からi個えらぶ場合の数
for i in range(n):
next = nCi[i]*(n-1-i)*pow(i+1,mod-2,mod)
next %= mod
nCi.append(next)
print(nCi)
ans = 0
for i in range(k+1):
ans += m*pow(m-1,n-i-1,mod)*nCi[i]
ans %= mod
print(ans) | n,m,k=map(int,input().split())
mod = 998244353
nCi = [1]#n-1からi個えらぶ場合の数
for i in range(n):
next = nCi[i]*(n-1-i)*pow(i+1,mod-2,mod)
next %= mod
nCi.append(next)
#print(nCi)
ans = 0
for i in range(k+1):
ans += m*pow(m-1,n-i-1,mod)*nCi[i]
ans %= mod
print(ans) | [
"call.remove"
] | 416,890 | 416,891 | u221061152 | python |
p02685 | n, m, k = map(int, input().split())
mod = 998244353
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
N = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % m... | n, m, k = map(int, input().split())
mod = 998244353
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
N = 10**6
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i )... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 416,903 | 416,904 | u324197506 | python |
p02685 | #入力部
C= 998244353
N,M,K=map(int,input().split())
#定義部
U=max(N,K)
F=[0]*U
G=[0]*U
F[0]=1
for i in range(1,U):
F[i]=(F[i-1]*i)%C
G[i]=pow(F[-1],C-2,C)
for j in range(U-2,-1,-1):
G[j]=(G[j+1]*(j+1))%C
def nCr(n,r):
if r<0 or n<r:
return 0
else:
return (F[n]*G[r]*G[n-r])
#メイン部
S=0
for ... | #入力部
C= 998244353
N,M,K=map(int,input().split())
#定義部
U=max(N+1,K)
F=[0]*U
G=[0]*U
F[0]=1
for i in range(1,U):
F[i]=(F[i-1]*i)%C
G[i]=pow(F[-1],C-2,C)
for j in range(U-2,-1,-1):
G[j]=(G[j+1]*(j+1))%C
def nCr(n,r):
if r<0 or n<r:
return 0
else:
return (F[n]*G[r]*G[n-r])
#メイン部
S=0
fo... | [
"assignment.change"
] | 416,917 | 416,918 | u779805689 | python |
p02685 | N,M,K=map(int,input().split())
P=998244353
class FactInv:
def __init__(self,N,P):
fact=[];ifact=[];fact=[1]*(N+1);ifact=[0]*(N+1)
for i in range(1,N):
fact[i+1]=(fact[i]*(i+1))%P
ifact[-1]=pow(fact[-1],P-2,P)
for i in range(N,0,-1):
ifact[i-1]=(ifact[i]*i)%P
... | N,M,K=map(int,input().split())
P=998244353
class FactInv:
def __init__(self,N,P):
fact=[];ifact=[];fact=[1]*(N+1);ifact=[0]*(N+1)
for i in range(1,N):
fact[i+1]=(fact[i]*(i+1))%P
ifact[-1]=pow(fact[-1],P-2,P)
for i in range(N,0,-1):
ifact[i-1]=(ifact[i]*i)%P
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 416,943 | 416,944 | u521602455 | python |
p02685 | mod = 998244353
n, m, k = map(int, input().split())
count = 0
comb = 1
for i in range(k + 1):
tmp = comb * m * pow(m-1, n-i-1, mod) % mod
count = (count + tmp) % mod
comb = comb * (n - i) * pow(i+1, mod-2, mod) % mod
print(count) | mod = 998244353
n, m, k = map(int, input().split())
count = 0
comb = 1
for i in range(k + 1):
tmp = comb * m * pow(m-1, n-i-1, mod) % mod
count = (count + tmp) % mod
comb = comb * (n - i - 1) * pow(i+1, mod-2, mod) % mod
print(count) | [
"assignment.change"
] | 417,003 | 417,004 | u686230543 | python |
p02685 | P = 998244353
nn = 200200
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % P
fainv[-1] = pow(fa[-1], P-2, P)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % P
def comb(a, b):
return fa[a] * fainv[b] % P * fainv[a-b] % P if 0 <= b <= a else 0
N, M, K = map... | P = 998244353
nn = 200200
fa = [1] * (nn+1)
fainv = [1] * (nn+1)
for i in range(nn):
fa[i+1] = fa[i] * (i+1) % P
fainv[-1] = pow(fa[-1], P-2, P)
for i in range(nn)[::-1]:
fainv[i] = fainv[i+1] * (i+1) % P
def comb(a, b):
return fa[a] * fainv[b] % P * fainv[a-b] % P if 0 <= b <= a else 0
N, M, K = map... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 417,007 | 417,008 | u722148122 | python |
p02685 | import sys
N,M,K= list(map(int, input().split()))
mod = 998244353
if N == 1:
print(1)
sys.exit()
def cmbinit(n):
fac = [0]*n
finv = [0]*n
inv = [0]*n
fac[0]=fac[1] = 1
finv[0]=finv[1] = 1
inv[1] = 1
for i in range(2,n):
fac[i] = fac[i-1]*i %mod
inv[i] = mod - inv[m... | import sys
N,M,K= list(map(int, input().split()))
mod = 998244353
if N == 1:
print(M)
sys.exit()
def cmbinit(n):
fac = [0]*n
finv = [0]*n
inv = [0]*n
fac[0]=fac[1] = 1
finv[0]=finv[1] = 1
inv[1] = 1
for i in range(2,n):
fac[i] = fac[i-1]*i %mod
inv[i] = mod - inv[m... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 417,028 | 417,029 | u231189826 | python |
p02685 | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 417,039 | 417,040 | u711539583 | python |
p02685 | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 417,041 | 417,040 | u711539583 | python |
p02685 | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
#逆元テーブル
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
#階乗計算
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
# コンビネー... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 417,042 | 417,043 | u711539583 | python |
p02685 | #### 逆元リストいらない
mod = 998244353
fact = [1]
fact_inv = [1]
for i in range(10**5+5):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n] * fact_inv[k] % mod * fact_inv[n-k] %mod
def power_func(a,n,p):
bi=str(format(n,"b"))#2... | #### 逆元リストいらない
mod = 998244353
fact = [1]
fact_inv = [1]
for i in range(2*10**5+2):
new_fact = fact[-1]*(i+1)%mod
fact.append(new_fact)
fact_inv.append(pow(new_fact,mod-2,mod))
def mod_comb_k(n,k,mod):
return fact[n] * fact_inv[k] % mod * fact_inv[n-k] %mod
def power_func(a,n,p):
bi=str(format(n,"b"))... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 417,422 | 417,423 | u183896397 | python |
p02685 | X = 998244353
N, M, K = map(int, input().split())
def calc_inverse(n, law):
if n == 1:
return 1
pre_r = law
pre_x = 0
pre_y = 1
cur_r = n
cur_x = 1
cur_y = 0
while True:
d = pre_r // cur_r
r = pre_r % cur_r
nxt_r = r
nxt_x = pre_x - d * cur_x
nxt_y = pre_y - d * cur_y
if nxt_r == 1:
... | X = 998244353
N, M, K = map(int, input().split())
def calc_inverse(n, law):
if n == 1:
return 1
pre_r = law
pre_x = 0
pre_y = 1
cur_r = n
cur_x = 1
cur_y = 0
while True:
d = pre_r // cur_r
r = pre_r % cur_r
nxt_r = r
nxt_x = pre_x - d * cur_x
nxt_y = pre_y - d * cur_y
if nxt_r == 1:
... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.step.change"
] | 417,448 | 417,449 | u751724075 | python |
p02686 | n = int(input())
left = []
right = []
for i in range(n):
s = input()
n0 = 0
n1 = 0
l = len(s)
for j in range(l):
if s[j] == "(":
n0 += 1
else:
if n0 == 0:
n1 += 1
else:
n0 -= 1
if n0 > 0 or n1 > 0:
if n0 ... | n = int(input())
left = []
right = []
for i in range(n):
s = input()
n0 = 0
n1 = 0
l = len(s)
for j in range(l):
if s[j] == "(":
n0 += 1
else:
if n0 == 0:
n1 += 1
else:
n0 -= 1
if n0 > 0 or n1 > 0:
if n0 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 417,515 | 417,516 | u552290152 | python |
p02686 | def main():
n = int(input())
s = [list(input()) for _ in range(n)]
L_cnt = []
R_cnt = []
LR_cnt = []
min_l,min_r = 10**6,10**6
for i in range(n):
t = s[i]
flag = 0
l = 0
r = 0
for j in range(len(t)):
if not flag and t[j] == ')':
... | def main():
n = int(input())
s = [list(input()) for _ in range(n)]
L_cnt = []
R_cnt = []
LR_cnt = []
min_l,min_r = 10**6,10**6
for i in range(n):
t = s[i]
flag = 0
l = 0
r = 0
for j in range(len(t)):
if not flag and t[j] == ')':
... | [
"identifier.change"
] | 417,530 | 417,531 | u937642029 | python |
p02686 | import sys
read = sys.stdin.read
n = int(input())
ss = read().split()
cnt_p = []
cnt_m = []
for i in range(n):
left = 0
right = 0
for s in ss[i]:
if(s == '('):
left += 1
elif(s == ')'):
if(left > 0):
left -= 1
else:
right ... | import sys
read = sys.stdin.read
n = int(input())
ss = read().split()
cnt_p = []
cnt_m = []
for i in range(n):
left = 0
right = 0
for s in ss[i]:
if(s == '('):
left += 1
elif(s == ')'):
if(left > 0):
left -= 1
else:
right ... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 417,536 | 417,537 | u490642448 | python |
p02686 | import sys
import heapq
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def end(flag):
if flag:
print('Yes')
else:
print('No')
exit(0)
n = int(input())
# S = [tuple() for _ in range(n)]
plus = []
minus = []
zero = []
total = 0
for i in range(n):
s = input()[:-1]
cnt = 0
M... | import sys
import heapq
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def end(flag):
if flag:
print('Yes')
else:
print('No')
exit(0)
n = int(input())
# S = [tuple() for _ in range(n)]
plus = []
minus = []
zero = []
total = 0
for i in range(n):
s = input()[:-1]
cnt = 0
M... | [
"assignment.add"
] | 417,561 | 417,562 | u145600939 | python |
p02687 | S = input()
print("ARC") if S=="ABC" else print("ARC") | S = input()
print("ARC") if S=="ABC" else print("ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,593 | 417,594 | u245641078 | python |
p02687 | s = input()
print("ABC" if s == "ARC" else "ABC") | s=input();print("ABC"if s=="ARC"else"ARC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,595 | 417,596 | u758815106 | python |
p02687 | s = input()
print("ABC" if s == "ARC" else "ABC") | s = input()
print("ABC" if s == "ARC" else "ARC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,595 | 417,597 | u758815106 | python |
p02687 | S=int()
if S=='ABC':
print('ARC')
else:
print('ABC') | S=input()
if S==('ABC'):
print('ARC')
else:
print('ABC') | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"control_flow.branch.if.condition.change"
] | 417,598 | 417,599 | u969081133 | python |
p02687 | s=input()
print("ARC" if s=="ABC" else s) | s=input()
print("ARC" if s=="ABC" else "ABC") | [
"call.arguments.change",
"io.output.change"
] | 417,600 | 417,601 | u840988663 | python |
p02687 | contest = input()
if contest == "ABC":
print("ARC")
else:
print("ARC") | contest = input()
if contest == "ABC":
print("ARC")
else:
print("ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,610 | 417,611 | u698756732 | python |
p02687 | s = inpu()
if s == 'ARC':
print('ABC')
else:
print('ARC') | s = input()
if s == 'ARC':
print('ABC')
else:
print('ARC')
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 417,614 | 417,615 | u165114979 | python |
p02687 | print("ABC" if input()[1] == "B" else "ARC") | print("ABC" if input()[1]=="R" else "ARC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,621 | 417,622 | u809819902 | python |
p02687 | print("ABC" if input()[1] == "B" else "ARC") | print("ARC" if input()=="ABC" else "ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,621 | 417,623 | u809819902 | python |
p02687 | print("ABC" if input()[1] == "B" else "ARC") | print("ARC" if input()[1] == "B" else "ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,621 | 417,624 | u809819902 | python |
p02687 | S=input()
print("ABC" if S!="ABC" else S) | S=input()
print("ARC" if S=="ABC" else "ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.compare.change"
] | 417,625 | 417,626 | u054825571 | python |
p02687 | S=input()
print(S if S!="ABC" else "ABC") | S=input()
print("ARC" if S=="ABC" else "ABC") | [
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.compare.change"
] | 417,627 | 417,626 | u054825571 | python |
p02687 | S = input()
if(S == ABC):
print("ARC")
else:
print("ABC") | S = input()
if(S == "ABC"):
print("ARC")
else:
print("ABC")
| [
"control_flow.branch.if.condition.change"
] | 417,644 | 417,646 | u851704997 | python |
p02687 | S = input()
if S[1] == "B":
print("ARC")
else:
print("ARC") | S = input()
if S[1] == "B":
print("ARC")
else:
print("ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,653 | 417,654 | u985963315 | python |
p02687 | last = input()
if input[1] == "B":
print("ARC")
else:
print("ABC") | S = input()
if S[1] == "B":
print("ARC")
else:
print("ABC") | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 417,655 | 417,654 | u985963315 | python |
p02686 | N = int(input())
lremain = []
rremain = []
for i in range(N):
S = input()
left = 0
right = 0
for c in S:
if c == ".":
left += 1
else:
if left == 0:
right += 1
else:
left -= 1
if left == 0 and right == 0:
continue
lremain.append(left)
rremain.append(right)
N = len(lremain)
if sum(lremain... | N = int(input())
lremain = []
rremain = []
for i in range(N):
S = input()
left = 0
right = 0
for c in S:
if c == "(":
left += 1
else:
if left == 0:
right += 1
else:
left -= 1
if left == 0 and right == 0:
continue
lremain.append(left)
rremain.append(right)
N = len(lremain)
if sum(lremain... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 417,708 | 417,707 | u847923740 | python |
p02686 | n=int(input())
d=[]
e=[]
for i in range(n):
p=[0,0]
s=input()
for j in s:
if j==")":
if p[0]!=0:
p[0]-=1
else:
p[1]+=1
else:
p[0]+=1
if p[1]-p[0]>=0:
d.append(p)
else:
e.append(p)
d=sorted(d,key=lambd... | n=int(input())
d=[]
e=[]
for i in range(n):
p=[0,0]
s=input()
for j in s:
if j==")":
if p[0]!=0:
p[0]-=1
else:
p[1]+=1
else:
p[0]+=1
if p[0]-p[1]>=0:
d.append(p)
else:
e.append(p)
d=sorted(d,key=lambd... | [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 417,721 | 417,722 | u619819312 | python |
p02686 | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if D... | #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if D... | [
"expression.operation.binary.remove"
] | 417,732 | 417,733 | u102445737 | python |
p02686 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, co... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, co... | [
"call.arguments.add"
] | 417,749 | 417,750 | u499381410 | python |
p02686 | def Yes():
print('Yes')
exit()
def No():
print('No')
exit()
def parse(s):
ret = [0, 0]
for c in s:
if c == ')':
if ret[0]:
ret[0] -= 1
else:
ret[1] -= 1
else:
ret[0] += 1
return ret
N = int(input())
S =... | def Yes():
print('Yes')
exit()
def No():
print('No')
exit()
def parse(s):
ret = [0, 0]
for c in s:
if c == ')':
if ret[0]:
ret[0] -= 1
else:
ret[1] -= 1
else:
ret[0] += 1
return ret
N = int(input())
S =... | [
"expression.operation.unary.add",
"call.arguments.change",
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 417,760 | 417,759 | u844789719 | python |
p02686 | import sys
input = sys.stdin.readline
def main():
n = int(input())
a = []
b = []
for i in range(n):
s = input()
c1, c2 = 0, 0
for i in range(len(s)):
if s[i] == "(":
c2 += 1
if s[i] == ")":
if c2:
c2 -= 1
else:
c1 += 1
if c1 >= c2:
... | import sys
input = sys.stdin.readline
def main():
n = int(input())
a = []
b = []
for i in range(n):
s = input()
c1, c2 = 0, 0
for i in range(len(s)):
if s[i] == "(":
c2 += 1
if s[i] == ")":
if c2:
c2 -= 1
else:
c1 += 1
if c1 >= c2:
... | [
"call.arguments.keyword_argument.add"
] | 417,790 | 417,791 | u021548497 | python |
p02687 | s=input()
if s.find('B')=='1':
print('ARC')
else:
print('ABC') | s=input()
if s.find('B')==1:
print('ARC')
else:
print('ABC') | [
"control_flow.branch.if.condition.change"
] | 417,816 | 417,817 | u428341537 | python |
p02687 | s=input()
if s.find('B')=="2":
print('ARC')
else:
print('ABC') | s=input()
if s.find('B')==1:
print('ARC')
else:
print('ABC') | [
"control_flow.branch.if.condition.change"
] | 417,818 | 417,817 | u428341537 | python |
p02687 | s=input()
if s.find('B'):
print('ARC')
else:
print('ABC') | s=input()
if s.find('B')==1:
print('ARC')
else:
print('ABC') | [
"control_flow.branch.if.condition.change"
] | 417,819 | 417,817 | u428341537 | python |
p02687 | s = input()
if(s == 'ABC'):
print('ARC')
else:
print("ARC")
| s = input()
if(s == 'ABC'):
print('ARC')
else:
print("ABC")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,821 | 417,822 | u867616076 | python |
p02687 | # 166 A
S = input()
print('ABC') if S == 'ARC' else print('ABC') | # 166 A
S = input()
print('ABC') if S == 'ARC' else print('ARC') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,848 | 417,849 | u365491796 | python |
p02687 |
def main():
s = input()
if s == "ABC" :
print("ARC")
else:
print("ARC")
if __name__ == "__main__":
main() |
def main():
s = input()
if s == "ABC" :
print("ARC")
else:
print("ABC")
if __name__ == "__main__":
main() | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,856 | 417,857 | u872271866 | python |
p02687 | n=str(input())
if n=="ABS":
print("ARC")
else:
print("ABC")
| n=str(input())
if n=="ABC":
print("ARC")
else:
print("ABC") | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 417,858 | 417,859 | u825161822 | python |
p02687 | S =input()
if S[1] =='B':
print('R')
else:
print('B') | S =input()
if S[1] =='B':
print('ARC')
else:
print('ABC') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,860 | 417,861 | u244434589 | python |
p02687 | text = input()
if text == "ABC":
print("ARC")
else:
print(text) | text = input()
if text == "ABC":
print("ARC")
else:
print("ABC") | [
"call.arguments.change",
"io.output.change"
] | 417,874 | 417,875 | u368185034 | python |
p02687 | S = "ABC"
if S == "ABC":
print("ARC")
else:
print("ABC")
| S = input()
if S == "ABC":
print("ARC")
else:
print("ABC")
| [] | 417,882 | 417,883 | u459511441 | python |
p02687 | S=input()
if S=='ABC':
print('ARC')
else:
print('ARC') | S=input()
if S=='ABC':
print('ARC')
else:
print('ABC') | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,890 | 417,891 | u827261928 | python |
p02687 |
s=input()
if s=='abc':
print('arc')
if s=='arc':
print('abc')
|
s=input()
if s=='ABC':
print('ARC')
if s=='ARC':
print('ABC')
| [
"literal.string.change",
"literal.string.case.change",
"control_flow.branch.if.condition.change",
"call.arguments.change",
"io.output.change"
] | 417,892 | 417,893 | u268314634 | python |
p02687 | S = input()
if(S=="ABC"):
print("ARC")
else:
print("ARC") | S = input()
if(S=="ABC"):
print("ARC")
else:
print("ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,894 | 417,895 | u132894387 | python |
p02687 | # ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催
# 先週開催されたコンテストを表す文字列Sが与えられる
# 制約: S は ABC または ARC
# S = 'ABC'
if S == 'ABC':
print('ARC')
else:
print('ABC') | # ABC が開催された次の週には ARC が開催され、ARC が行われた次の週には ABC が開催
# 先週開催されたコンテストを表す文字列Sが与えられる
# 制約: S は ABC または ARC
# S = 'ABC'
S = input()
if S == 'ABC':
print('ARC')
else:
print('ABC') | [
"assignment.add"
] | 417,898 | 417,899 | u941624042 | python |
p02687 | s = input()
if s is "ARC":
print("ABC")
else:
print("ARC") | s = input()
if s == "ARC":
print("ABC")
else:
print("ARC")
| [
"control_flow.branch.if.condition.change"
] | 417,902 | 417,903 | u298976461 | python |
p02687 | s = input()
if s is "ARC":
print("ABC")
else:
print("ARC") | s = input()
if s == "ARC":
print("ABC")
else:
print("ARC") | [
"control_flow.branch.if.condition.change"
] | 417,902 | 417,904 | u298976461 | python |
p02687 | s = {input()}
test = {'ABC', 'ARC'}
print(test - s) | s = {input()}
test = {'ABC', 'ARC'}
print(list(test - s)[0]) | [
"call.arguments.add"
] | 417,915 | 417,916 | u334983390 | python |
p02687 | S = "ABC"
if S == "ABC":
print("ARC")
else:
print("ABC") | S = input()
if S == "ABC":
print("ARC")
else:
print("ABC")
| [] | 417,919 | 417,920 | u734169929 | python |
p02687 | S = input()
if S == "ABC":
print("ARC")
else:
print("ARC") | S = input()
if S == "ABC":
print("ARC")
else:
print("ABC")
| [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 417,921 | 417,920 | u734169929 | python |
p02687 | a = str(input())
if a=="ABC":
print("AGC")
elif a=="AGC":
print("ABC") | a = str(input())
if a=="ABC":
print("ARC")
elif a=="ARC":
print("ABC") | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"control_flow.branch.if.condition.change"
] | 417,928 | 417,929 | u201544433 | python |
p02687 | S=input()
if S[1]==B:
print('ARC')
else:
print('ABC') | S=input()
if S[1]=='B':
print('ARC')
else:
print('ABC')
| [
"control_flow.branch.if.condition.change"
] | 417,930 | 417,931 | u671889550 | python |
p02687 | s = str(input())
if s is ABC:
print("ARC")
else:
print("ABC") | s = str(input())
if s == "ABC":
print("ARC")
else:
print("ABC") | [
"control_flow.branch.if.condition.change"
] | 417,942 | 417,943 | u133240057 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.