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 9
values |
|---|---|---|---|---|---|---|---|
p02768
|
def modpow(a,b,mod):
ans=1
a=a%mod
while b>0:
if b%2==1:
ans=(ans*a)%mod
a=(a**2)%mod
b=b//2
return ans
N,A,B=map(int,input().split())
ans=modpow(2,N,10**9+7)-1
c=1
d=1
for i in range(A):
c=(c*(N-i))%(10**9+7)
for i in range(A):
d=(d*(i+1))%(10**9+7)
d=modpow(d,10**9+5,10**9+7)
ans-=(c*d)%(10**9+7)
c=1
d=1
for i in range(B):
c=(c*(N-i))%(10**9+7)
for i in range(B):
d=(d*(i+1))%(10**9+7)
d=modpow(d,10**9+5,10**9+7)
ans-=(c*d)%(10**9+7)
if ans<0:
ans+=10**9+7
print(ans)
|
def modpow(a,b,mod):
ans=1
a=a%mod
while b>0:
if b%2==1:
ans=(ans*a)%mod
a=(a**2)%mod
b=b//2
return ans
N,A,B=map(int,input().split())
ans=modpow(2,N,10**9+7)-1
c=1
d=1
for i in range(A):
c=(c*(N-i))%(10**9+7)
for i in range(A):
d=(d*(i+1))%(10**9+7)
d=modpow(d,10**9+5,10**9+7)
ans-=(c*d)%(10**9+7)
c=1
d=1
for i in range(B):
c=(c*(N-i))%(10**9+7)
for i in range(B):
d=(d*(i+1))%(10**9+7)
d=modpow(d,10**9+5,10**9+7)
ans-=(c*d)%(10**9+7)
while ans<0:
ans+=10**9+7
print(ans)
|
[
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 565,212
| 565,213
|
u444082822
|
python
|
p02769
|
import sys
input = sys.stdin.readline
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 10 ** 5+15 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
def solve():
n,k = (int(i) for i in input().split())
mod = 10**9+7
if n-k <= 1:
#任意の部屋に移動可能
comba = 1
inva = 1
for i in range(1,n+1):
comba *= (n+i-1)
inva *= i
comba %= mod
inva %= mod
comba *= pow(inva,10**9+5,mod)
comba %= mod
print(comba)
else:
#n <= 2**10^5
#k <= 2**10^5
ans = 0
for i in range(0,k+1):
ans += cmb(n,i,mod)*cmb(n-1,i,mod)
ans %= mod
print(ans)
solve()
|
import sys
input = sys.stdin.readline
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 10 ** 9 + 7
N = 2* 10 ** 5+2 # N は必要分だけ用意する
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
def solve():
n,k = (int(i) for i in input().split())
mod = 10**9+7
if n-k <= 1:
#任意の部屋に移動可能
comba = 1
inva = 1
for i in range(1,n+1):
comba *= (n+i-1)
inva *= i
comba %= mod
inva %= mod
comba *= pow(inva,10**9+5,mod)
comba %= mod
print(comba)
else:
#n <= 2**10^5
#k <= 2**10^5
ans = 0
for i in range(0,k+1):
ans += cmb(n,i,mod)*cmb(n-1,i,mod)
ans %= mod
print(ans)
solve()
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 565,224
| 565,225
|
u950708010
|
python
|
p02769
|
n,k=map(int,input().split())
mod=10**9+7
n_max=4*(10**5+1)
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
for i in reversed(range(n_max-1)):
FI[i]=(FI[i+1]*(i+1))%mod
def comb(x,y):
return (F[x]*FI[x-y]*FI[y])%mod
if k>=n-1:
print(comb(2*n-1,n))
else:
ans=1
for i in range(k):
ans=ans+(comb(n,i+1)*comb(n-1,i+1))%mod
print(ans)
|
n,k=map(int,input().split())
mod=10**9+7
n_max=4*(10**5+1)
F,FI=[0]*(n_max+1),[0]*(n_max+1)
F[0],FI[0]=1,1
for i in range(n_max):
F[i+1]=(F[i]*(i+1))%mod
FI[n_max-1]=pow(F[n_max-1],mod-2,mod)
for i in reversed(range(n_max-1)):
FI[i]=(FI[i+1]*(i+1))%mod
def comb(x,y):
return (F[x]*FI[x-y]*FI[y])%mod
if k>=n-1:
print(comb(2*n-1,n))
else:
ans=1
for i in range(k):
ans=(ans+comb(n,i+1)*comb(n-1,i+1))%mod
print(ans)
|
[] | 565,238
| 565,239
|
u969190727
|
python
|
p02769
|
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 = 10**9+7 #出力の制限
N = 10**6
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[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
N, K = map(int, input().split())
MOD = 10**9+7
n = max(N,K)
ans = 0
for i in range(max(1,N-n),N+1):
m = cmb(N,i,MOD)
m *= cmb(N-1,i-1, MOD)
ans += m
ans %= MOD
print(ans)
|
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 = 10**9+7 #出力の制限
N = 10**6
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[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
N, K = map(int, input().split())
MOD = 10**9+7
n = min(N,K)
ans = 0
for i in range(max(1,N-n),N+1):
m = cmb(N,i,MOD)
m *= cmb(N-1,i-1, MOD)
ans += m
ans %= MOD
print(ans)
|
[
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,248
| 565,249
|
u476604182
|
python
|
p02769
|
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
# x=1
# for a in range(n-k+1, n+1):
# x = x * a % MOD
# return x
return kaijo[n] * inv(kaijo[k-1]) % MOD
def nCk(n,k):
return nPk(n,k) * inv(kaijo[k])
MOD = 10**9+7
kaijo = [0] * 200005
kaijo[0] = 1
for i in range(1, len(kaijo)):
kaijo[i] = kaijo[i-1] * i % MOD
n,k = get_nums_l()
if k >= n-1:
print(nCk(n+n-1, n) % MOD)
exit()
# 0人の部屋=zがk以下であるような人数の並べ方の個数
# z=0 1
# z=1 nC1 * (n-1)**1
# z=2 nC2 * (n-2)**2
# z=3 nC3 * (n-3)**3
ans = 1
for z in range(1,k+1):
ans += nCk(n,z) * nCk(n-1, z) % MOD
print(ans%MOD)
|
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
return kaijo[n] * inv(kaijo[n-k]) % MOD
def nCk(n,k):
return nPk(n,k) * inv(kaijo[k])
MOD = 10**9+7
kaijo = [0] * 400020
kaijo[0] = 1
for i in range(1, len(kaijo)):
kaijo[i] = kaijo[i-1] * i % MOD
n,k = get_nums_l()
if k >= n-1:
print(nCk(n+n-1, n) % MOD)
exit()
# 0人の部屋=zがk以下であるような人数の並べ方の個数
# z=0 1
# z=1 nC1 * (n-1)H1
# z=2 nC2 * (n-2)H2
# z=3 nC3 * (n-3)H3
# z nCz * (n-z)Hz
ans = 1
for z in range(1,k+1):
ans += nCk(n,z) * nCk(n-1, z)
print(ans%MOD)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 565,262
| 565,263
|
u407160848
|
python
|
p02769
|
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
# x=1
# for a in range(n-k+1, n+1):
# x = x * a % MOD
# return x
return kaijo[n] * inv(kaijo[k-1]) % MOD
def nCk(n,k):
return nPk(n,k) * inv(kaijo[k])
MOD = 10**9+7
kaijo = [0] * 200005
kaijo[0] = 1
for i in range(1, len(kaijo)):
kaijo[i] = kaijo[i-1] * i % MOD
n,k = get_nums_l()
if k >= n-1:
print(nCk(n+n-1, n) % MOD)
exit()
# 0人の部屋=zがk以下であるような人数の並べ方の個数
# z=0 1
# z=1 nC1 * (n-1)**1
# z=2 nC2 * (n-2)**2
# z=3 nC3 * (n-3)**3
ans = 1
for z in range(1,k+1):
ans += nCk(n,z) * nCk(n-1, z) % MOD
print(ans%MOD)
|
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
return [ int(input()) for _ in range(n)]
# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
return map(int, open(0).read().split())
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
def inv(x):
return pow(x, MOD-2, MOD)
def nPk(n,k):
# x=1
# for a in range(n-k+1, n+1):
# x = x * a % MOD
# return x
return kaijo[n] * inv(kaijo[n-k]) % MOD
def nCk(n,k):
return nPk(n,k) * inv(kaijo[k])
MOD = 10**9+7
kaijo = [0] * 400020
kaijo[0] = 1
for i in range(1, len(kaijo)):
kaijo[i] = kaijo[i-1] * i % MOD
n,k = get_nums_l()
if k >= n-1:
print(nCk(n+n-1, n) % MOD)
exit()
# 0人の部屋=zがk以下であるような人数の並べ方の個数
# z=0 1
# z=1 nC1 * (n-1)**1
# z=2 nC2 * (n-2)**2
# z=3 nC3 * (n-3)**3
ans = 1
for z in range(1,k+1):
ans += nCk(n,z) * nCk(n-1, z)
print(ans%MOD)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"identifier.replace.add",
"literal.replace.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 565,262
| 565,264
|
u407160848
|
python
|
p02769
|
mod=10**9+7
n,k=map(int,input().split())
ans=1-k%2
coef1=n
coef2=n-1
for i in range(1,min(k+1,n)):
tmp=1
tmp*=coef1
tmp%=mod
tmp*=coef2
tmp%=mod
ans+=tmp
ans%=mod
coef1*=n-i
coef1%=mod
coef1*=pow(i+1,mod-2,mod)
coef1%=mod
coef2*=n-1-i
coef2%=mod
coef2*=pow(i+1,mod-2,mod)
coef2%=mod
print(ans)
|
mod=10**9+7
n,k=map(int,input().split())
ans=1
coef1=n
coef2=n-1
for i in range(1,min(k+1,n)):
tmp=1
tmp*=coef1
tmp%=mod
tmp*=coef2
tmp%=mod
ans+=tmp
ans%=mod
coef1*=n-i
coef1%=mod
coef1*=pow(i+1,mod-2,mod)
coef1%=mod
coef2*=n-1-i
coef2%=mod
coef2*=pow(i+1,mod-2,mod)
coef2%=mod
print(ans)
|
[
"expression.operation.binary.remove"
] | 565,267
| 565,268
|
u163320134
|
python
|
p02769
|
def factorial(n, mod=10**9+7):
a = 1
for i in range(1,n+1):
a = a * i % mod
return a
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod=10**9+7):
if n < k or k < 0:
result = 0
else:
a = factorial(n, mod=mod)
b = factorial(k, mod=mod)
c = factorial(n-k, mod=mod)
result = (a * power(b, mod-2, mod=mod) * power(c, mod-2, mod=mod)) % mod
return result
n, k = map(int, input().split())
MOD = 10**9 + 7
if k >= n:
print(comb(2*n-1, n))
quit()
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
fl = [-1]*(k+1)
fl[0] = 1
def f(i):
global fl
if fl[i] > 0: return fl[i]
else:
if i <= n//2:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i] = res
return res
else:
res = f(n-i) * (n-i)
res *= power(i, MOD-2)
res %= MOD
fl[i] = res
return res
if k <= n//2:
fl = [-1]*(k+1)
fl[0] = 1
def f(i):
global fl
if fl[i] > 0: return fl[i]
else:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i] = res
return res
ans = 0
for i in range(k+1):
ans += f(i)
ans %= MOD
else:
fl = [-1]*(n+1)
fl[0] = comb(n, k) * comb(n-1, k) % MOD
def f(i):
global fl
if fl[i-k] > 0: return fl[i-k]
else:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i-k] = res
return res
ans = 0
for i in range(k+1, n+1):
ans += f(i)
ans %= MOD
ans = comb(2*n-1, n) - ans
ans %= M0D
print(ans % MOD)
|
def factorial(n, mod=10**9+7):
a = 1
for i in range(1,n+1):
a = a * i % mod
return a
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod=10**9+7):
if n < k or k < 0:
result = 0
else:
a = factorial(n, mod=mod)
b = factorial(k, mod=mod)
c = factorial(n-k, mod=mod)
result = (a * power(b, mod-2, mod=mod) * power(c, mod-2, mod=mod)) % mod
return result
n, k = map(int, input().split())
MOD = 10**9 + 7
if k >= n:
print(comb(2*n-1, n))
quit()
def power(n, r, mod=10**9+7):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
fl = [-1]*(k+1)
fl[0] = 1
def f(i):
global fl
if fl[i] > 0: return fl[i]
else:
if i <= n//2:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i] = res
return res
else:
res = f(n-i) * (n-i)
res *= power(i, MOD-2)
res %= MOD
fl[i] = res
return res
if k <= n//2:
fl = [-1]*(k+1)
fl[0] = 1
def f(i):
global fl
if fl[i] > 0: return fl[i]
else:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i] = res
return res
ans = 0
for i in range(k+1):
ans += f(i)
ans %= MOD
else:
fl = [-1]*(n+1)
fl[0] = comb(n, k) * comb(n-1, k) % MOD
def f(i):
global fl
if fl[i-k] > 0: return fl[i-k]
else:
res = f(i-1)*(n-i+1)*(n-i)
t = power(i, MOD-2)
res *= t
res %= MOD
res *= t
res %= MOD
fl[i-k] = res
return res
ans = 0
for i in range(k+1, n+1):
ans += f(i)
ans %= MOD
ans = comb(2*n-1, n) - ans
ans %= MOD
print(ans % MOD)
|
[
"identifier.change"
] | 565,275
| 565,276
|
u922449550
|
python
|
p02769
|
import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-1]:
ans -= (comb(n,n-i) * comb(i+j,j)) % mod
ans % mod
j += 1
print(ans)
|
import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-1]:
ans -= (comb(n,n-i) * comb(n-1,j)) % mod
ans %= mod
j += 1
print(ans)
|
[
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 565,286
| 565,287
|
u513434790
|
python
|
p02769
|
import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-1]:
ans -= (comb(n,n-i) * comb(i+j,j)) % mod
ans % mod
j += 1
print(ans)
|
import sys
n, k = map(int, input().split())
mod = 10 ** 9 + 7
f = [1]
for i in range(1,2*n+1):
f.append((f[-1] * i) % mod)
def comb(n,r):
return f[n] * (pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod) % mod
ans = comb(2*n-1, n)
if n-1 <= k:
print(ans)
sys.exit()
j = 0
for i in range(k+1,n)[::-1]:
ans -= (comb(n,n-i) * comb(i+j,j)) % mod
ans %= mod
j += 1
print(ans)
|
[
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 565,286
| 565,288
|
u513434790
|
python
|
p02769
|
#!/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 collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def C(n,r):
return fact[n]*pow(fact[n-r],mod-2,mod)*pow(fact[r],mod-2,mod)%mod
n,k = LI()
fact = [1]*(n+1)
for i in range(1,n+1):
fact[i] = i*fact[i-1]
fact[i] %= mod
ans = 0
for i in range(min(n+1,k+1)):
ans += C(n,i)*C(n-1,n-i-1) % mod
ans %= mod
print(ans)
|
#!/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 collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def C(n,r):
return fact[n] * pow(fact[n-r],mod-2,mod) * pow(fact[r],mod-2,mod) % mod
n,k = LI()
fact = [1]*(n+1)
for i in range(1,n+1):
fact[i] = i*fact[i-1]
fact[i] %= mod
ans = 0
for i in range(min(n,k+1)):
ans += C(n,i) * C(n-1,n-i-1)
ans %= mod
print(ans)
|
[
"expression.operation.binary.remove"
] | 565,289
| 565,290
|
u191874006
|
python
|
p02769
|
n,k = map(int, input().split())
mod = 10**9 + 7
ans = 0
lim = 2*(10**5) + 5
mothers = [1] * lim
mothers_inv = [1] * lim
for i in range(1, lim):
mothers[i] = mothers[i-1] * i % mod
mothers_inv[i] = pow(mothers[i], mod-2, mod)
def calc(n,k):
child = mothers[n] * mothers_inv[n-k] % mod
mother_inv = mothers_inv[k]
return((child * mother_inv)%mod)
def calc2(n,k):
child = 1
for i in range(n, n-k, -1):
child = child * i % mod
mother_inv = mothers_inv[k]
return((child * mother_inv)%mod)
if( n <= k+1):
ans = calc2(2*n-1, n-1)
print(ans)
exit()
ans = calc(2*n-1, n-1)
tmp = 0
for i in range(1,n-k):
if(i ==1):
c1 = 1
else:
c1 = calc(n-1, i-1)
c2 = calc(n, i)
ans = (ans - c1 * c2)%mod
print(ans)
|
n,k = map(int, input().split())
mod = 10**9 + 7
ans = 0
lim = 2*(10**5) + 5
mothers = [1] * lim
mothers_inv = [1] * lim
for i in range(1, lim):
mothers[i] = mothers[i-1] * i % mod
mothers_inv[i] = pow(mothers[i], mod-2, mod)
def calc(n,k):
child = mothers[n] * mothers_inv[n-k] % mod
mother_inv = mothers_inv[k]
return((child * mother_inv)%mod)
def calc2(n,k):
child = 1
for i in range(n, n-k, -1):
child = child * i % mod
mother_inv = mothers_inv[k]
return((child * mother_inv)%mod)
if( n <= k+1):
ans = calc2(2*n-1, n-1)
print(ans)
exit()
ans = calc2(2*n-1, n-1)
for i in range(1,n-k):
if(i ==1):
c1 = 1
else:
c1 = calc(n-1, i-1)
c2 = calc(n, i)
ans = (ans - c1 * c2)%mod
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,291
| 565,292
|
u490642448
|
python
|
p02771
|
a,b,c = map(int,input().split())
if a==b and b!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=c:print('Yes')
else:print('No')
|
a,b,c = map(int,input().split())
if a==b and b!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=a:print('Yes')
else:print('No')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,297
| 565,298
|
u773440446
|
python
|
p02771
|
a, b, c = input().split()
ans = "No"
if (a == b and a != c) or (a == c and a != b) or (b == c and b != c):
ans = "Yes"
print(ans)
|
a, b, c = input().split()
ans = "No"
if (a == b and a != c) or (a == c and a != b) or (b == c and a != b):
ans = "Yes"
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,299
| 565,300
|
u544272759
|
python
|
p02771
|
a,b,c=input().split()
if a==b==c:
print('No')
elif a!=b!=c:
print('No')
else:
print('Yes')
|
a,b,c=input().split()
if a==b==c:
print('No')
elif a!=b!=c!=a:
print('No')
else:
print('Yes')
|
[
"control_flow.branch.if.condition.change"
] | 565,309
| 565,310
|
u539367121
|
python
|
p02771
|
A = input().split()
a = A.count(A[0])
b = A.count(A[1])
c = A.count(A[2])
if a == 1 or b == 1 or c == 1:
print("Yes")
else:
print("No")
|
A = input().split()
a = A.count(A[0])
b = A.count(A[1])
c = A.count(A[2])
if a == 2 or b == 2 or c == 2:
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 565,313
| 565,314
|
u344888046
|
python
|
p02771
|
i = map(int,input().split())
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No")
|
i = list(map(int,input().split()))
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 565,315
| 565,316
|
u763628696
|
python
|
p02771
|
i = map(int,input(),split())
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No")
|
i = list(map(int,input().split()))
if (i[0] == i[1] and i[0] != i[2]) or (i[0] == i[2] and i[0] != i[1]) or (i[1] == i[2] and i[1] != i[0]):
print("Yes")
else:
print("No")
|
[
"call.add",
"assignment.value.change",
"call.arguments.change"
] | 565,317
| 565,316
|
u763628696
|
python
|
p02771
|
s = [input().split()]
print("Yes" if len(set(s)) == 2 else "No")
|
s = list(input().split())
print("Yes" if len(set(s)) == 2 else "No")
|
[
"assignment.value.change",
"call.arguments.change"
] | 565,322
| 565,323
|
u612635771
|
python
|
p02771
|
def main():
n = set(map(int, input().split()))
if len(n) == 2:
print('Yes')
else:
print('NO')
if __name__ == "__main__":
main()
|
def main():
n = set(map(int, input().split()))
if len(n) == 2:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,328
| 565,329
|
u274615057
|
python
|
p02771
|
a=list(map(int,input().split()))
l=set(a)
if len(l)==1:
print('Yes')
else:
print('No')
|
a=list(map(int,input().split()))
l=set(a)
if len(l)==2:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 565,332
| 565,333
|
u087118202
|
python
|
p02771
|
if len(input().split().set())==2:
print("Yes")
else:
print("No")
|
if len(set(input().split()))==2:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.arguments.add",
"call.remove"
] | 565,340
| 565,341
|
u946969297
|
python
|
p02771
|
a, b, c = mapt(int, input().split(" "))
print("Yes" if len(set({a,b,c})) == 2 else "No")
|
a, b, c = map(int, input().split(" "))
print("Yes" if len(set({a,b,c})) == 2 else "No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,349
| 565,350
|
u135197221
|
python
|
p02771
|
a,b,c = map(int,input().split())
if a == b and b == c and C == a:
print('No')
elif a != b and b != c and C != a:
print('No')
else:
print('Yes')
|
a,b,c = map(int,input().split())
if a == b and b == c and c == a:
print('No')
elif a != b and b != c and c != a:
print('No')
else:
print('Yes')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,353
| 565,354
|
u589969467
|
python
|
p02771
|
a, b, c = map(int, input().split())
if (a == b and a != c) or (b == c and b != a) or (c == a and c != b):
print("Yes")
else:
print("NO")
|
a, b, c = map(int, input().split())
if (a == b and a != c) or (b == c and b != a) or (c == a and c != b):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,355
| 565,356
|
u122495382
|
python
|
p02771
|
a,b,c=[int(i) for i in input().split()]
if(len(set(a))==2):
print('Yes')
else:
print('No')
|
a=[int(i) for i in input().split()]
if(len(set(a))==2):
print('Yes')
else:
print('No')
|
[] | 565,357
| 565,358
|
u108509795
|
python
|
p02771
|
a, b, c = map(int, input().split())
if a == b:
if a == c:
print('No')
else:
print('Yes')
else:
if b == c:
print('Yes')
else:
print('No')
|
a, b, c = map(int, input().split())
if a == b:
if a == c:
print('No')
else:
print('Yes')
else:
if b == c or a == c:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,373
| 565,374
|
u581403769
|
python
|
p02771
|
a=input()
if (a[0]==a[1] and a[1]==a[2] and a[0]==a[2] )or (a[0]!=a[1] and a[1]!=a[2] and a[0]!=a[2]):
print('No')
else:
print('Yes')
|
a=input().split()
if (a[0]==a[1] and a[1]==a[2] and a[0]==a[2] )or (a[0]!=a[1] and a[1]!=a[2] and a[0]!=a[2]):
print('No')
else:
print('Yes')
|
[
"call.add"
] | 565,375
| 565,376
|
u754511616
|
python
|
p02771
|
a,b,c=map(int,input().split())
if (a==b!=c) or (a!=b==c) or (a==c!=b):
print("Yes")
else:
prnit("No")
|
a,b,c=map(int,input().split())
if (a==b!=c) or (a!=b==c) or (a==c!=b):
print("Yes")
else:
print("No")
|
[
"identifier.change",
"call.function.change"
] | 565,390
| 565,391
|
u438189153
|
python
|
p02771
|
def main():
a,b,c = map(int,input().split())
if a == b and a == c or a != b and a != c:
print('No')
else:
print('Yes')
main()
|
def main():
a,b,c = map(int,input().split())
if a == b and a == c or a != b and a != c and b != c:
print('No')
else:
print('Yes')
main()
|
[
"control_flow.branch.if.condition.change"
] | 565,419
| 565,420
|
u962609087
|
python
|
p02771
|
def main():
a,b,c = map(int,input().split())
if a == b and a == c or a != b and a != c:
print("No")
else:
print('Yes')
main()
|
def main():
a,b,c = map(int,input().split())
if a == b and a == c or a != b and a != c and b != c:
print('No')
else:
print('Yes')
main()
|
[
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,421
| 565,420
|
u962609087
|
python
|
p02771
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A,B,C = map(int, readline().split())
if (A == B and B != C) or (B == C and C != A) (A == C and C != B):
print('Yes')
else:
print('No')
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A,B,C = map(int, readline().split())
if (A == B and B != C) or (B == C and C != A) or (A == C and C != B):
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,466
| 565,467
|
u515740713
|
python
|
p02771
|
a,b,c = map(int, input())
ans = "No"
if (a == b or a== c or b == c) and not (a==b==c): ans = "Yes"
print(ans)
|
a,b,c = map(int, input().split())
ans = "No"
if (a == b or a== c or b == c) and not (a==b==c): ans = "Yes"
print(ans)
|
[
"call.add"
] | 565,489
| 565,490
|
u276686572
|
python
|
p02771
|
a,b,c=map(int,input().split())
l=[b,c]
ans=0
for i in l:
if a==i:
ans+=1
if b==c:
ans+=1
if ans==1:
print("No")
else:
print("Yes")
|
a,b,c=map(int,input().split())
l=[b,c]
ans=0
for i in l:
if a==i:
ans+=1
if b==c:
ans+=1
if ans==1:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,491
| 565,492
|
u617556913
|
python
|
p02771
|
a,b,c = map(int,input().split())
if a == b and b == c and c == a: print('Yes')
elif a != b and b != c and c != a: print('Yes')
else: print('No')
|
a,b,c = map(int,input().split())
if a == b and b == c and c == a: print('No')
elif a != b and b != c and c != a: print('No')
else: print('Yes')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,493
| 565,494
|
u746428948
|
python
|
p02771
|
a = lsit(map(int,input().split()))
if len(set(a))==2:
print("Yes")
else:
print("No")
|
a = list(map(int,input().split()))
if len(set(a))==2:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 565,495
| 565,496
|
u175590965
|
python
|
p02770
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
k,q = map(int, input().split())
d = list(map(int, input().split()))
def sub(n,x,m):
X = 0
init = x%m
x%=m
if n<=k:
for i in range(n-1):
if x<(x+d[i])%m:
X += 1
x = (x+d[i])%m
ans = X
else:
for i in range(k):
if x<(x+d[i])%m:
X += 1
x = (x+d[i])%m
diff = (x-init)
ans = ((n-1)//k) * X - (init + (diff*((n-1)//k))) // m
nn = n-((n-1)//k)*k
xx = (init + (diff*(n//k))) % m
# if xx<init:
# ans -= 1
for i in range(nn-1):
if xx<(xx+d[i])%m:
ans += 1
xx = (xx+d[i])%m
return ans
# else:
# ans = (n//k) * X + (init + (diff*(n//k)))
ans = [None]*q
for i in range(q):
n,x,m = map(int, input().split())
ans[i] = sub(n,x,m)
write("\n".join(map(str, ans)))
|
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
k,q = map(int, input().split())
d = list(map(int, input().split()))
def sub(n,x,m):
X = 0
init = x%m
x%=m
if n<=k:
for i in range(n-1):
if x<(x+d[i])%m:
X += 1
x = (x+d[i])%m
ans = X
else:
for i in range(k):
if x<(x+d[i])%m:
X += 1
x = (x+d[i])%m
diff = (x-init)
ans = ((n-1)//k) * X - (init + (diff*((n-1)//k))) // m
nn = n-((n-1)//k)*k
xx = (init + (diff*((n-1)//k))) % m
# if xx<init:
# ans -= 1
for i in range(nn-1):
if xx<(xx+d[i])%m:
ans += 1
xx = (xx+d[i])%m
return ans
# else:
# ans = (n//k) * X + (init + (diff*(n//k)))
ans = [None]*q
for i in range(q):
n,x,m = map(int, input().split())
ans[i] = sub(n,x,m)
write("\n".join(map(str, ans)))
|
[] | 565,520
| 565,521
|
u535803878
|
python
|
p02770
|
k, q = map(int, input().split())
d = list(map(int, input().split()))
for _ in range(q):
n, x, m = map(int, input().split())
a = list(map(lambda y: y % m, d))
c = 0
s = 0
c2 = 0
s2 = 0
for x in a:
if x == 0:
c += 1
s += x
for x in a[:(n - 1) % k]:
if x == 0:
c2 += 1
s2 += x
t = s * ((n - 1) // k) + s2 + x % m
ans = n - 1 - t // m - c * ((n - 1) // k) - c2
print(ans)
|
k, q = map(int, input().split())
d = list(map(int, input().split()))
for _ in range(q):
n, x, m = map(int, input().split())
tmp = x
a = list(map(lambda y: y % m, d))
c = 0
s = 0
c2 = 0
s2 = 0
for x in a:
if x == 0:
c += 1
s += x
for x in a[:(n - 1) % k]:
if x == 0:
c2 += 1
s2 += x
t = s * ((n - 1) // k) + s2 + tmp % m
ans = n - 1 - t // m - c * ((n - 1) // k) - c2
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 565,524
| 565,525
|
u143509139
|
python
|
p02771
|
A, B, C = map(int, input().split())
if A == B and B != C:
print('yes')
elif B == C and C != A:
print('Yes')
elif A == C and C != B:
print("Yes")
else:
print('No')
|
A, B, C = map(int, input().split())
if A == B and B != C:
print('Yes')
elif B == C and C != A:
print('Yes')
elif A == C and C != B:
print("Yes")
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,563
| 565,564
|
u688587139
|
python
|
p02771
|
A = set(int,input().split())
if len(A)==2:
print("Yes")
else:
print("No")
|
A = set(map(int,input().split()))
if len(A)==2:
print("Yes")
else:
print("No")
|
[
"call.arguments.add",
"call.arguments.change"
] | 565,571
| 565,572
|
u772029934
|
python
|
p02771
|
ABC = set(input().split())
print('yes' if len(ABC) == 2 else 'No')
|
ABC = set(input().split())
print('Yes' if len(ABC) == 2 else 'No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,605
| 565,606
|
u537976628
|
python
|
p02771
|
s = set(map(int, input().split()))
print('Yes' if len(s) >= 2 else 'No')
|
s = set(map(int, input().split()))
print('Yes' if len(s) == 2 else 'No')
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 565,609
| 565,610
|
u075303794
|
python
|
p02771
|
a, b, c = map(int, input().split())
if a==b==c or (a!=b and b!=c and c !=a):
print('No')
else:
print('No')
|
a, b, c = map(int, input().split())
if a==b==c or (a!=b and b!=c and c !=a):
print('No')
else:
print('Yes')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,613
| 565,614
|
u471503862
|
python
|
p02771
|
x, y, z = map(int, input().split())
if x == y == z or x != y != z:
print("No")
else:
print("Yes")
|
x, y, z = map(int, input().split())
if x == y == z or x != y != z and z != x:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,625
| 565,626
|
u689835643
|
python
|
p02771
|
a = input().split()
count = 0
if a[0] == a[1]:
count = count + 1
if a[1] == a[2]:
count = count + 1
if a[0] == a[2]:
count = count + 1
print("Yes" if count == 2 else "No")
|
a = input().split()
count = 0
if a[0] == a[1]:
count = count + 1
if a[1] == a[2]:
count = count + 1
if a[0] == a[2]:
count = count + 1
print("Yes" if count == 1 else "No")
|
[
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 565,629
| 565,630
|
u294520705
|
python
|
p02771
|
a = input().split()
a = set(a)
print("YES" if len(a) == 2 else "No")
|
a = input().split()
a = set(a)
print("Yes" if len(a) == 2 else "No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,631
| 565,632
|
u294520705
|
python
|
p02771
|
A,B,C=input().split()
if A==B and A==C:
print("No")
elif A!=B and A!=C:
print("No")
else:
print("Yes")
|
A,B,C=input().split()
if A==B and A==C:
print("No")
elif A!=B and A!=C and B!=C:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,633
| 565,634
|
u494295478
|
python
|
p02771
|
a,b,c = map(int,input().split)
if a==b!=c or a==c!=b or b==c!=a:
print('Yes')
else:
print('No')
|
a,b,c = map(int, input().split())
if a==b!=c or a==c!=b or b==c!=a:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 565,635
| 565,636
|
u217303170
|
python
|
p02771
|
print("Yes" if len(set(map(int, input().split()))) < 3 else "No")
|
print("Yes" if len(set(map(int, input().split()))) == 2 else "No")
|
[] | 565,637
| 565,638
|
u157232135
|
python
|
p02771
|
A, B, C = list(map(int, input().split()))
print('No' if set([A, B, C]) == 2 else 'Yes')
|
A, B, C = list(map(int, input().split()))
print('Yes' if len(set([A, B, C])) == 2 else 'No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.add"
] | 565,641
| 565,642
|
u572122511
|
python
|
p02771
|
A, B, C = list(map(int, input().split()))
print('Yes' if set([A, B, C]) == 2 else 'No')
|
A, B, C = list(map(int, input().split()))
print('Yes' if len(set([A, B, C])) == 2 else 'No')
|
[
"call.add",
"call.arguments.change"
] | 565,643
| 565,642
|
u572122511
|
python
|
p02771
|
a,b,c = map(int,input().split())
if a==b==c:
print('No')
elif a!=b and b!=c:
print('No')
else:
print('Yes')
|
a,b,c = map(int,input().split())
if a==b==c:
print('No')
elif a!=b and b!=c and c!=a:
print('No')
else:
print('Yes')
|
[
"control_flow.branch.if.condition.change"
] | 565,646
| 565,647
|
u493318999
|
python
|
p02771
|
a,b,c = map(int, input().split())
if (a == b and b==c) or (a != b and b != c) :
print("No")
else :
print("Yes")
|
a,b,c = map(int, input().split())
if (a == b and b==c) or (a != b and b != c and a != c) :
print("No")
else :
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,654
| 565,655
|
u199120400
|
python
|
p02771
|
A, B, C = map(int, input().split())
if A == B or B == C or C == A:
if not A == B and B == C:
print("Yes")
else:
print("No")
else:
print("No")
|
A, B, C = map(int, input().split())
if A == B or B == C or C == A:
if A == B and B == C:
print("No")
else:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,660
| 565,661
|
u855710796
|
python
|
p02771
|
a,b,c=map(int,input().split())
if (a==b and a==c) or (a!=b and a!=c):
print("No")
else:
print("Yes")
|
a,b,c=map(int,input().split())
if (a==b and a==c) or (a!=b and a!=c and b!=c):
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,667
| 565,668
|
u901598613
|
python
|
p02771
|
a,b,c=input().split()
if a==b==c or a!=b!=c:
print('No')
else:
print('Yes')
|
a,b,c=input().split()
if a==b==c or a!=b!=c!=a:
print('No')
else:
print('Yes')
|
[
"control_flow.branch.if.condition.change"
] | 565,698
| 565,699
|
u007738720
|
python
|
p02771
|
a,b,c=map(int,input().split())
if a==b and b==c:
print('No')
elif a==b or b==c or a==c:
print('Yes')
else:
print('Yes')
|
a,b,c=map(int,input().split())
if a==b and b==c:
print('No')
elif a==b or b==c or a==c:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,700
| 565,701
|
u957957759
|
python
|
p02771
|
a,b,c=map(int,input().split())
if a==b and a!=c:
print("Yes")
elif a==b and a!=c:
print("Yes")
elif a==b and a!=c:
print("Yes")
else:
print("No")
|
a,b,c=map(int,input().split())
if a==b and a!=c:
print("Yes")
elif a==c and a!=b:
print("Yes")
elif c==b and a!=c:
print("Yes")
else:
print("No")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,704
| 565,705
|
u549603397
|
python
|
p02771
|
L = list(map(int,input().split()))
L.sort()
if L[0] == L[1] != L[2] or L[0] != L[1] == [2]:
print('Yes')
else:
print('No')
|
L = list(map(int,input().split()))
L.sort()
if L[0] == L[1] != L[2] or L[0] != L[1] == L[2]:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,706
| 565,707
|
u533713111
|
python
|
p02771
|
a,b,c = map(int,input())
if a == b != c or b == c != a or c == a != b:
print('Yes')
else:
print('No')
|
a,b,c = map(int,input().split())
if a == b != c or b == c != a or c == a != b:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 565,708
| 565,709
|
u815304751
|
python
|
p02771
|
A,B,C=map(int, input().split()) #1 2 3
if A == B == C:
print("NO")
elif (A != B and A!=C) and B != C:
print("NO")
else:
print("YES")
|
A,B,C=map(int, input().split()) #1 2 3
if A == B == C:
print("No")
elif (A != B and A!=C) and B != C:
print("No")
else:
print("Yes")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,712
| 565,713
|
u592819389
|
python
|
p02771
|
a=sorted([int(i) for i in input().split()])
if (a[0]==a[1] and a[0]!=a[2]) or (a[0]!=a[1] and a[0]==a[2]):
print("Yes")
else:
print("No")
|
a=sorted([int(i) for i in input().split()])
if (a[0]==a[1] and a[0]!=a[2]) or (a[0]!=a[1] and a[1]==a[2]):
print("Yes")
else:
print("No")
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 565,714
| 565,715
|
u156383602
|
python
|
p02771
|
a,b,c=(int(x) for x in input().split())
if a==b==c or a!=b!=c:
print("No")
else:
print("Yes")
|
a,b,c=(int(x) for x in input().split())
if a==b==c or a!=b!=c!=a:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,723
| 565,724
|
u734195782
|
python
|
p02771
|
a, b, c = list(map(int, input().split()))
if len(set(a)) == 2:
print('Yes')
else:
print('No')
|
a = list(map(int, input().split()))
if len(set(a)) == 2:
print('Yes')
else:
print('No')
|
[] | 565,729
| 565,730
|
u296989351
|
python
|
p02771
|
abc = input().split(" ")
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
d = 0
if a==b:
d=d+1
if b==c:
d=d+1
if c==a:
d=d+1
if d==1:
print("yes")
else:
print("no")
|
abc = input().split(" ")
a = int(abc[0])
b = int(abc[1])
c = int(abc[2])
d = 0
if a==b:
d=d+1
if b==c:
d=d+1
if c==a:
d=d+1
if d==1:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,737
| 565,738
|
u670826407
|
python
|
p02771
|
array = map(int,input().split())
array.sort()
if array[0] != array[2] and (array[0] == array[1] or array[1] == array[2]):
print('Yes')
else:
print('No')
|
array = list(map(int,input().split()))
array.sort()
if array[0] != array[2] and (array[0] == array[1] or array[1] == array[2]):
print('Yes')
else:
print('No')
|
[
"call.add",
"call.arguments.change"
] | 565,745
| 565,746
|
u973108807
|
python
|
p02771
|
a, b, c = map(int, input().split())
if a == b == c:
print('No')
elif a == b or a == c:
print('Yes')
else:
print('No')
|
a, b, c = map(int, input().split())
if a == b == c:
print('No')
elif a == b or a == c or b == c:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,753
| 565,754
|
u763210820
|
python
|
p02771
|
a,b,c = map(int,input().split())
ls=[a-b,b-c,c-a]
t = 0
for i in range(3):
if ls[i] != 0:
t += 1
if t >0:
print("Yes")
else:
print("No")
|
a,b,c = map(int,input().split())
ls=[a-b,b-c,c-a]
t = 0
for i in range(3):
if ls[i] == 0:
t += 1
if t ==1:
print("Yes")
else:
print("No")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 565,759
| 565,760
|
u247830763
|
python
|
p02771
|
# coding: utf-8
# Your code here!
A,B,C = map(int,input().split())
if A == B and B == C:
print("No")
elif A == B or B ==C or A == C:
print("Yse")
else:
print("No")
|
# coding: utf-8
# Your code here!
A,B,C = map(int,input().split())
if A == B and B == C:
print("No")
elif A == B or B ==C or A == C:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,761
| 565,762
|
u859241851
|
python
|
p02771
|
A,B,C=map(int,input().split())
if A==B==C or A!=B!=C:
print("No")
else:
print("Yes")
|
A,B,C=map(int,input().split())
if A==B==C or A!=B!=C!=A:
print("No")
else:
print("Yes")
|
[
"control_flow.branch.if.condition.change"
] | 565,763
| 565,764
|
u333546629
|
python
|
p02771
|
a,b,c = map(str, input().split())
if a==b and a!=c:
print("Yes")
if a==c and a!=b:
print("Yes")
if b==c and b!=a:
print("Yes")
else:
print("No")
|
a,b,c = map(str, input().split())
if a==b and a!=c:
print("Yes")
elif a==c and a!=b:
print("Yes")
elif b==c and b!=a:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 565,770
| 565,771
|
u694402282
|
python
|
p02771
|
from collections import Counter
Poors = list(map(int,input().split()))
c = Counter(Poors)
if 1 in list(c.values()) and len(list(c.values()))==3:
print('Yes')
else:
print('No')
|
from collections import Counter
Poors = list(map(int,input().split()))
c = Counter(Poors)
if 1 in list(c.values()) and 2 in list(c.values()):
print('Yes')
else:
print('No')
|
[] | 565,776
| 565,777
|
u485319545
|
python
|
p02771
|
a,b,c=map(int,input().split())
if a==b and a!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=a:
print('Yes')
else:
print('NO')
|
a,b,c=map(int,input().split())
if a==b and a!=c:
print('Yes')
elif a==c and a!=b:
print('Yes')
elif b==c and b!=a:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,778
| 565,779
|
u631579948
|
python
|
p02770
|
def process(k, d, n, x, m):
d_mod = [di % m for di in d]
sum_d_mod = sum(d_mod)
inc_times1 = len([d_mod_i for d_mod_i in d_mod if d_mod_i])
rem_d_mod = sum(d_mod[0:(n-2)%k])
inc_times2 = len([d_mod_i for d_mod_i in d_mod[0:(n-2)%k] if d_mod_i])
last = x + sum_d_mod * ((n-2) // k) + rem_d_mod
first = x
ans = inc_times1 * ((n-2) // k) + inc_times2
ans -= last // m - first // m
print(ans)
def main():
k, q = map(int, input().split())
d = list(map(int, input().split()))
for i in range(q):
n, x, m = map(int, input().split())
process(k, d, n, x, m)
if __name__ == "__main__" :
main()
|
def process(k, d, n, x, m):
d_mod = [di % m for di in d]
sum_d_mod = sum(d_mod)
inc_times1 = len([d_mod_i for d_mod_i in d_mod if d_mod_i])
rem_d_mod = sum(d_mod[0:(n-1)%k])
inc_times2 = len([d_mod_i for d_mod_i in d_mod[0:(n-1)%k] if d_mod_i])
last = x + sum_d_mod * ((n-1) // k) + rem_d_mod
first = x
ans = inc_times1 * ((n-1) // k) + inc_times2
ans -= last // m - first // m
print(ans)
def main():
k, q = map(int, input().split())
d = list(map(int, input().split()))
for i in range(q):
n, x, m = map(int, input().split())
process(k, d, n, x, m)
if __name__ == "__main__" :
main()
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 565,789
| 565,790
|
u081193942
|
python
|
p02770
|
K, Q = map(int, input("").split())
d_ = list(map(int, input("").split()))
for _ in range(Q):
n,x,m = map(int, input("").split())
d = [0]*K;zeroes = [0]*(K+1);sum = [0]*(K+1)
for i in range(K):d[i] = d_[i] % m
for i in range(K):zeroes[i+1] = zeroes[i] + (d[i] == 0)
for i in range(K):sum[i+1] = sum[i] + d[i]
s = (n-1)//K*sum[K] + sum[(n-1)%K]
s += x
num0 = (n-1)//K*zeroes[K] + zeroes[(n-1)%K]
print(n-1-s//m-num0)
|
K, Q = map(int, input("").split())
d_ = list(map(int, input("").split()))
for _ in range(Q):
n,x,m = map(int, input("").split())
d = [0]*K;zeroes = [0]*(K+1);sum = [0]*(K+1)
for i in range(K):d[i] = d_[i] % m
for i in range(K):zeroes[i+1] = zeroes[i] + (d[i] == 0)
for i in range(K):sum[i+1] = sum[i] + d[i]
#print(zeroes, sum)
s = (n-1)//K*sum[K] + sum[(n-1)%K]
s += x%m
#print(s)
num0 = (n-1)//K*zeroes[K] + zeroes[(n-1)%K]
print(n-1-s//m-num0)
|
[
"expression.operation.binary.add"
] | 565,811
| 565,812
|
u093219895
|
python
|
p02771
|
a, b, c = map(int, input().split())
if a == b and a == c:
print("No")
elif a == b or a == c or b == c:
print("Yes")
else:
print("Yes")
|
a, b, c = map(int, input().split())
if a == b and a == c:
print("No")
elif a == b or a == c or b == c:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,839
| 565,840
|
u571537830
|
python
|
p02771
|
print(["No","Yes"][len(set(input().split()))==3])
|
print(["No","Yes"][len(set(input().split()))==2])
|
[
"literal.number.integer.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 565,843
| 565,844
|
u695644361
|
python
|
p02771
|
l = list(map(int,input().split()))
l.sort()
if (l[0]==l[1] and l[1]) != l[2] or (l[0] != l[1] and l[1]==l[2]):
print('Yes')
else:
print('No')
|
l = list(map(int,input().split()))
l.sort()
if (l[0]==l[1] and l[1] != l[2]) or (l[0] != l[1] and l[1]==l[2]):
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,849
| 565,850
|
u493520238
|
python
|
p02771
|
A = list(map(int,input().split()))
A=set(A)
ans='No'
if len(ans) ==2:
ans='Yes'
print(ans)
|
A = list(map(int,input().split()))
A=set(A)
ans='No'
if len(A) == 2:
ans='Yes'
print(ans)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,852
| 565,853
|
u465101448
|
python
|
p02771
|
a,b,c=map(int,input())
if (a!=b and b!=c and c!=a) or (a==b and b==c):
print('No')
else:
print('Yes')
|
a,b,c=map(int,input().split())
if (a!=b and b!=c and c!=a) or (a==b and b==c):
print('No')
else:
print('Yes')
|
[
"call.add"
] | 565,854
| 565,855
|
u057362336
|
python
|
p02771
|
x,y,z = map(int,input().split())
if x == y and x != z:
print('Yes')
elif x == z and x != y:
print('Yes')
elif y == z and x != y:
print('Yse')
else:
print('No')
|
x,y,z = map(int,input().split())
if x == y and x != z:
print('Yes')
elif x == z and x != y:
print('Yes')
elif y == z and x != y:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,856
| 565,857
|
u150788544
|
python
|
p02771
|
from collections import defaultdict
def main():
N = list(map(int, input().split()))
dd = defaultdict(int)
for n in range(len(N)):
dd[N[n]] += 1
print('Yes') if len(dd) != 1 else print('No')
if __name__ == '__main__':
main()
|
from collections import defaultdict
def main():
N = list(map(int, input().split()))
dd = defaultdict(int)
for n in range(len(N)):
dd[N[n]] += 1
print('Yes') if len(dd) == 2 else print('No')
if __name__ == '__main__':
main()
|
[] | 565,866
| 565,867
|
u113310313
|
python
|
p02771
|
A, B, C = map(int, input().split())
if A == B == C:
print('No')
elif A != B and A != C:
print('No')
else:
print('Yes')
|
A, B, C = map(int, input().split())
if A == B == C:
print('No')
elif A != B and A != C and B != C:
print('No')
else:
print('Yes')
|
[
"control_flow.branch.if.condition.change"
] | 565,876
| 565,877
|
u065137691
|
python
|
p02771
|
lis = list(map(int, input().split()))
lis.sort()
if lis[0] == lis[1] and lis[1] != lis[2]:
print('Yes')
elif lis[1] == lis[2] and lis[0] != lis[1]:
print('No')
else:
print('No')
|
lis = list(map(int, input().split()))
lis.sort()
if lis[0] == lis[1] and lis[1] != lis[2]:
print('Yes')
elif lis[1] == lis[2] and lis[0] != lis[1]:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 565,878
| 565,879
|
u618251217
|
python
|
p02771
|
a=list(input().split())
b=set(a)
if len(b) != len(a):
print('Yes')
else:
print('No')
|
a=list(input().split())
b=set(a)
if len(b) == 2:
print('Yes')
else:
print('No')
|
[
"call.arguments.change"
] | 565,889
| 565,890
|
u977982384
|
python
|
p02771
|
a,b,c=map(int,input().split())
if a==b!=c or a!=b==c or a!=c==b:
print('Yes')
else:
print('No')
|
a,b,c=map(int,input().split())
if a==b!=c or a!=b==c or a==c!=b:
print('Yes')
else:
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 565,899
| 565,900
|
u115877451
|
python
|
p02771
|
A, B, C = map(int, input().split())
list = [A, B, C]
ans = list(set(list))
if len(ans) == 2:
print('Yes')
else:
print('No')
|
A, B, C = map(int, input().split())
l = [A, B, C]
ans = list(set(l))
if len(ans) == 2:
print('Yes')
else:
print('No')
|
[
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"call.arguments.change"
] | 565,904
| 565,905
|
u101350975
|
python
|
p02771
|
a = set(map(int,input().split()))
if len(a)==2:
print('YES')
else:
print('No')
|
a = set(map(int,input().split()))
if len(a)==2:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 565,912
| 565,913
|
u464912173
|
python
|
p02771
|
a,b,c = map(int, input())
if a==b==c:
print('No')
elif a==b or b==c or a==c:
print('Yes')
else:
print('No')
|
a,b,c = map(int, input().split())
if a==b==c:
print('No')
elif a==b or b==c or a==c:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 565,918
| 565,919
|
u227085629
|
python
|
p02771
|
A, B, C = input().rstrip().split('')
if A == B == C:
print('No')
elif A == B or B == C or C == A:
print('Yes')
else:
print('No')
|
A, B, C = input().rstrip().split(' ')
if A == B == C:
print('No')
elif A == B or B == C or C == A:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"assignment.value.change",
"call.arguments.change"
] | 565,927
| 565,928
|
u074687136
|
python
|
p02771
|
a, b, c = map(int, input().split())
if a == b == c or a != b != c:
print('No')
else:
print('Yes')
|
a, b, c = map(int, input().split())
if a == b == c == a or a != b != c != a:
print('No')
else:
print('Yes')
|
[
"control_flow.branch.if.condition.change"
] | 565,937
| 565,938
|
u615323709
|
python
|
p02771
|
a,b,c=map(int,input().split())
if a!=b and b==c:
print("Yes")
if b!=a and a==c:
print("Yes")
if c!=a and a==b:
print("Yes")
else:
print("No")
|
a,b,c=map(int,input().split())
if a!=b and b==c:
print("Yes")
elif b!=a and a==c:
print("Yes")
elif c!=a and a==b:
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 565,941
| 565,942
|
u153259685
|
python
|
p02771
|
read = lambda: map(int, input().split())
a, b, c = read()
print('Yes' if set((a, b, c)) == 2 else 'No')
|
read = lambda: map(int, input().split())
a, b, c = read()
print('Yes' if len(set((a, b, c))) == 2 else 'No')
|
[
"call.add",
"call.arguments.change"
] | 565,954
| 565,955
|
u275145490
|
python
|
p02771
|
A,B,C=map(int,input())
if((A==B and A!=C)or(B==C and B!=A)or(C==A and C!=B)):
print("Yes")
else:
print("No")
|
A,B,C=map(int,input().split())
if((A==B and A!=C)or(B==C and B!=A)or(C==A and C!=B)):
print("Yes")
else:
print("No")
|
[
"call.add"
] | 565,956
| 565,957
|
u471539833
|
python
|
p02771
|
a=list(map(int,input().split()))
if len(set(a))==1:
print('Yes')
else:
print('No')
|
a=list(map(int,input().split()))
if len(set(a))==2:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 565,958
| 565,959
|
u169138653
|
python
|
p02771
|
a,b,c = map(int,input().split())
ans="Yes"
if a==b and b==c or (a != b and b != c):
ans = "No"
print(ans)
|
a,b,c = map(int,input().split())
ans="Yes"
if a==b and b==c or (a != b and b != c and c != a):
ans = "No"
print(ans)
|
[
"control_flow.branch.if.condition.change"
] | 565,960
| 565,961
|
u995419623
|
python
|
p02771
|
num = [map(int, input().split())]
if len(set(num))==2: print('Yes')
else: print('No')
|
num = list(map(int, input().split()))
if len(set(num))==2: print('Yes')
else: print('No')
|
[
"assignment.value.change",
"call.arguments.change"
] | 565,973
| 565,974
|
u472696272
|
python
|
p02771
|
arr = map(int, input().split())
if len(set(a)) == 2:
print("Yes")
else:
print("No")
|
arr = map(int, input().split())
if len(set(arr)) == 2:
print("Yes")
else:
print("No")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,977
| 565,978
|
u999983491
|
python
|
p02771
|
n = list(map(int, input().split()))
if a[0] == a[1] and a[1] == a[2]:
print("No")
elif a[0] != a[1] and a[1] != a[2] and a[0] != a[2]:
print("No")
else:
print("Yes")
|
a = list(map(int, input().split()))
if a[0] == a[1] and a[1] == a[2]:
print("No")
elif a[0] != a[1] and a[1] != a[2] and a[0] != a[2]:
print("No")
else:
print("Yes")
|
[
"assignment.variable.change",
"identifier.change"
] | 565,983
| 565,984
|
u511449169
|
python
|
p02771
|
A, B, C = map(int, input().split())
if A == B == C or A != B != C != B:
print("No")
else:
print("Yes")
|
A, B, C = map(int, input().split())
if A == B == C or A != B != C != A:
print("No")
else:
print("Yes")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 565,987
| 565,988
|
u523957440
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.