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 |
|---|---|---|---|---|---|---|---|
p02804 | n, k = map(int,input().split())
a = sorted(list(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 = 10**9+7
N = 10**4
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) %... | n, k = map(int,input().split())
a = sorted(list(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 = 10**9+7
N = 10**5
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",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 608,606 | 608,605 | u912599273 | python |
p02804 | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
ans=0
fac=[1]
for i in range(n):
p=fac[-1]*(i+1)%mod
fac.append(p)
def comb(a,b):
if a-b<0:
return 0
else:
r=pow(fac[b]*fac[a-b]%mod,mod-2,mod)
return r*fac[a]%mod
for i in range(n):
ans-=comb(n-i-1,k-1)*a[i]
ans+=comb(i,k-1)... | n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
mod=10**9+7
ans=0
fac=[1]
for i in range(n):
p=fac[-1]*(i+1)%mod
fac.append(p)
def comb(a,b):
if a-b<0:
return 0
else:
r=pow(fac[b]*fac[a-b]%mod,mod-2,mod)
return r*fac[a]%mod
for i in range(n):
ans-=comb(n-i-1,k-1)*a[i]
ans+=comb(i,k-1)... | [] | 608,617 | 608,618 | u296150111 | python |
p02804 | N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
inv_t = [0, 1] + [0] * (N - 2)
for i in range(2, N):
inv_t[i] = inv_t[MOD % i] * (MOD - MOD // i) % MOD
A.sort()
ans = 0
C = 1
for i in range(K, N + 1):
ans += (A[i - 1] - A[N - i]) * C
ans %= MOD
C = C * i * inv_t[... | N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
inv_t = [0, 1] + [0] * (N - 1)
for i in range(2, N + 1):
inv_t[i] = inv_t[MOD % i] * (MOD - MOD // i) % MOD
A.sort()
ans = 0
C = 1
for i in range(K, N + 1):
ans += (A[i - 1] - A[N - i]) * C
ans %= MOD
C = C * i * in... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 608,711 | 608,712 | u374531474 | python |
p02804 | import math
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
A.sort()
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 #出力の制限
Ne = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | import math
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
A.sort()
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 #出力の制限
Ne = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | [
"call.arguments.change",
"call.arguments.add"
] | 608,737 | 608,738 | u062189367 | python |
p02804 | import math
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
A.sort()
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 #出力の制限
Ne = 10**4
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | import math
N, K = map(int, input().split())
A = [int(a) for a in input().split()]
A.sort()
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 #出力の制限
Ne = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 608,739 | 608,738 | u062189367 | python |
p02804 | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
r = 0
for i in range(K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
print(r % mod)
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r] * g... | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
r = 0
for i in range(N-K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
print(r % mod)
def cmb(n, r, mod):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return g1[n] * g2[r]... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 608,758 | 608,759 | u316464887 | python |
p02804 | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
r = 0
if N - K > K:
for i in range(K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
else:
for i in range(N-K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
... | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
r = 0
if False:
for i in range(K+1):
r += (A[-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
else:
for i in range(N-K+1):
r += (A[N-i-1] - A[i]) * cmb(N-i-1, K-1, mod)
pri... | [
"control_flow.branch.if.condition.change"
] | 608,760 | 608,761 | u316464887 | python |
p02804 | 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**5+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N_ + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -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
mod = 10**9+7 #出力の制限
N_ = 10**5+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N_ + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -i... | [
"expression.operation.binary.add"
] | 608,766 | 608,767 | u488636998 | python |
p02804 | 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**4
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 )
g... | 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**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[mod % i] * (mod//i) ) % mod )
g... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.remove"
] | 608,772 | 608,773 | u952467214 | python |
p02804 | n,k=map(int,input().split())
mod=10**9+7
f=[1]
for i in range(n):
f+=[f[-1]*(i+1)%mod]
print(f)
def combination(a,b):
return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
a=list(map(int,input().split()))
a.sort()
b=a[::-1]
ans=0
for i in range(k-1,n):
ans+=((a[i]-b[i])*(combination(i,k-1)))%(10**9+7)
... | n,k=map(int,input().split())
mod=10**9+7
f=[1]
for i in range(n):
f+=[f[-1]*(i+1)%mod]
def combination(a,b):
return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
a=list(map(int,input().split()))
a.sort()
b=a[::-1]
ans=0
for i in range(k-1,n):
ans+=((a[i]-b[i])*(combination(i,k-1)))%(10**9+7)
print(ans... | [
"call.remove"
] | 608,791 | 608,792 | u471684875 | python |
p02804 | n,k=map(int,input().split())
mod=10**9+7
f=[1]
for i in range(n):
f+=[f[-1]*(i+1)%mod]
print(f)
def combination(a,b):
return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
a=list(map(int,input().split()))
a.sort()
b=a[::-1]
ans=0
for i in range(k-1,n):
ans+=((a[i]-b[i])*(comb(i,k-1)))%(10**9+7)
print(a... | n,k=map(int,input().split())
mod=10**9+7
f=[1]
for i in range(n):
f+=[f[-1]*(i+1)%mod]
def combination(a,b):
return f[a]*pow(f[b],mod-2,mod)*pow(f[a-b],mod-2,mod)%mod
a=list(map(int,input().split()))
a.sort()
b=a[::-1]
ans=0
for i in range(k-1,n):
ans+=((a[i]-b[i])*(combination(i,k-1)))%(10**9+7)
print(ans... | [
"call.remove",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 608,793 | 608,792 | u471684875 | python |
p02804 | import sys
import copy
import bisect
import numpy as np
from scipy.special import comb
N,K = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a)
res = 0
fact = [0]*(N+1)
ifact = [0]*(N+1)
inv = [0]*(N+1)
p=10**9+7
def combination(n,fact,ifact):
fact[0] = 1
fact[1] = 1
ifact[0] = 1
... | import sys
import copy
import bisect
import numpy as np
N,K = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a)
res = 0
fact = [0]*(N+1)
ifact = [0]*(N+1)
inv = [0]*(N+1)
p=10**9+7
def combination(n,fact,ifact):
fact[0] = 1
fact[1] = 1
ifact[0] = 1
ifact[1] = 1
inv[1] = 1
... | [] | 609,088 | 609,089 | u871980676 | python |
p02804 | n, k = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
MOD = 10 ** 9 + 7
def pow(a, n):
if n == 0:
return 1
else:
temp = pow(a, n // 2)
if n % 2 == 0:
return temp * temp % MOD
else:
return temp * temp * a % MOD
... | n, k = map(int, input().split())
A = list(map(int, input().split()))
A = sorted(A)
MOD = 10 ** 9 + 7
def pow(a, n):
if n == 0:
return 1
else:
temp = pow(a, n // 2)
if n % 2 == 0:
return temp * temp % MOD
else:
return temp * temp * a % MOD
... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 609,150 | 609,151 | u593761424 | python |
p02804 | n, K = map(int, input().split())
A = list(map(int, input().split()))
def Com_kai(n, r, mod):
if (r < 0 or r > n or n < 0):
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] # 逆元テーブ... | n, K = map(int, input().split())
A = list(map(int, input().split()))
def Com_kai(n, r, mod):
if (r < 0 or r > n or n < 0):
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] # 逆元テーブ... | [
"call.remove"
] | 609,175 | 609,176 | u698902360 | python |
p02804 | N, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
MOD = 10 ** 9 + 7
# pypyで通す
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(... | N, K = map(int, input().split())
A = sorted(list(map(int, input().split())), reverse=True)
MOD = 10 ** 9 + 7
# pypyで通す
def prepare(n, MOD):
# 1! - n! の計算
f = 1
factorials = [1] # 0!の分
for m in range(1, n + 1):
f *= m
f %= MOD
factorials.append(f)
# n!^-1 の計算
inv = pow(... | [
"assignment.value.change"
] | 609,181 | 609,182 | u814781830 | python |
p02804 | MOD = 1000000007
MAX = 200000 # max n
fac = [0 for _ in range(MAX)] # = n! (mod MOD)
finv = [0 for _ in range(MAX)] # = 1/r! (mod MOD)
inv = [0 for _ in range(MAX)] # = 1/r (mod MOD)
# init
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
... | MOD = 1000000007
MAX = 200000 # max n
fac = [0 for _ in range(MAX)] # = n! (mod MOD)
finv = [0 for _ in range(MAX)] # = 1/r! (mod MOD)
inv = [0 for _ in range(MAX)] # = 1/r (mod MOD)
# init
def COMinit():
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
... | [
"call.add"
] | 609,183 | 609,184 | u747184036 | python |
p02805 | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# 2点の直径または3点の外心をテスト
import itertools
import numpy as np
N = int(readline())
m = map(int,read().split())
Z = [x + y * 1j for x,y in zip(m,m)]
def find_O(z0,z1,z2):
z1 -= z0; z2 -= z0
if abs((z1... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# 2点の直径または3点の外心をテスト
import itertools
import numpy as np
N = int(readline())
m = map(int,read().split())
Z = [x + y * 1j for x,y in zip(m,m)]
def find_O(z0,z1,z2):
z1 -= z0; z2 -= z0
if abs((z1... | [
"function.return_value.change"
] | 609,237 | 609,238 | u102461423 | python |
p02806 | n=int(input())
l=[input().split() for i in range(n)]
x=input()
ans=0
sum=0
for i,j in l:
print(i,j)
if i!=x:
ans+=int(j)
else:
ans+=int(j)
break
for i,j in l:
sum+=int(j)
print(sum-ans) | n=int(input())
l=[input().split() for i in range(n)]
x=input()
ans=0
sum=0
for i,j in l:
if i!=x:
ans+=int(j)
else:
ans+=int(j)
break
for i,j in l:
sum+=int(j)
print(sum-ans) | [
"call.remove"
] | 609,249 | 609,250 | u094191970 | python |
p02806 | N = int(input())
S = []
T = []
for i in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = input()
print(sum(T[:S.index(X)]))
| N = int(input())
S = []
T = []
for i in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = input()
print(sum(T[S.index(X)+1:]))
| [
"call.arguments.change"
] | 609,255 | 609,256 | u642012866 | python |
p02806 | N = int(input())
S = []
T = []
for i in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = input()
print(sum(T[:S.index(X)+1])) | N = int(input())
S = []
T = []
for i in range(N):
s, t = input().split()
S.append(s)
T.append(int(t))
X = input()
print(sum(T[S.index(X)+1:]))
| [
"call.arguments.change"
] | 609,257 | 609,256 | u642012866 | python |
p02806 | N = int(input())
songs = []
times = []
for _ in range(N):
song,time = input().split()
songs.append(song)
times.append(int(time))
start = input()
number = songs.index(start)
if number == len(songs):
print(0)
else:
print(sum(times[1:])) | N = int(input())
songs = []
times = []
for _ in range(N):
song,time = input().split()
songs.append(song)
times.append(int(time))
start = input()
number = songs.index(start)
if number == len(songs):
print(0)
else:
print(sum(times[number+1:])) | [
"expression.operation.binary.add"
] | 609,262 | 609,263 | u760794812 | python |
p02805 | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
N = int(input())
cood ... | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
N = int(input())
cood ... | [
"assignment.change"
] | 609,276 | 609,277 | u513900925 | python |
p02805 | #!/usr/bin/env python3
import itertools
import math
EPS = 1e-6
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def enclose_triangle(p1, p2, p3):
v12 = p2 - p1
v23 = p3 - p2
v31 = p1 - p3
an1 = dot(v12, -v31)
an2 = dot(-v12, v23)
an3 = dot(-v23, v31)
if an1 < 0 + EPS or an2... | #!/usr/bin/env python3
import itertools
import math
EPS = 1e-6
def dot(a, b):
return a.real * b.real + a.imag * b.imag
def enclose_triangle(p1, p2, p3):
v12 = p2 - p1
v23 = p3 - p2
v31 = p1 - p3
an1 = dot(v12, -v31)
an2 = dot(-v12, v23)
an3 = dot(-v23, v31)
if an1 < 0 + EPS or an2... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 609,280 | 609,281 | u509661905 | python |
p02805 | import sys
from math import hypot
readline = sys.stdin.readline
N = int(readline())
Points = [tuple(map(int, readline().split())) for _ in range(N)]
inf = 10**9+7
EPS = 1e-8
ans = inf
for i in range(N):
for j in range(i):
a = Points[i][0]
b = Points[i][1]
c = Points[j][0]
d = Point... | import sys
from math import hypot
readline = sys.stdin.readline
N = int(readline())
Points = [tuple(map(int, readline().split())) for _ in range(N)]
inf = 10**9+7
EPS = 1e-8
ans = inf
for i in range(N):
for j in range(i):
a = Points[i][0]
b = Points[i][1]
c = Points[j][0]
d = Point... | [
"assignment.change"
] | 609,314 | 609,315 | u368780724 | python |
p02806 | n=int(input())
a=[list(map(input().split())) for _ in range(n)]
x=input()
cnt='x'
for i in a:
if cnt!='x':
z=int(i[1])
cnt+=z
if i[0]==x:
cnt=0
print(cnt)
| n=int(input())
a=[(input().split()) for _ in range(n)]
x=input()
cnt='x'
for i in a:
if cnt!='x':
z=int(i[1])
cnt+=z
if i[0]==x:
cnt=0
print(cnt) | [
"call.remove",
"call.arguments.change"
] | 609,337 | 609,338 | u350093546 | python |
p02806 | n=int(input())
a=[list(map(input().split())) for _ in range(n)]
x=input()
cnt='x'
for i in a:
if cnt!='x':
z=int(i[1])
cnt+=z
if i[0]==x:
cnt=0
print(cnt) | n=int(input())
a=[(input().split()) for _ in range(n)]
x=input()
cnt='x'
for i in a:
if cnt!='x':
z=int(i[1])
cnt+=z
if i[0]==x:
cnt=0
print(cnt) | [
"call.remove",
"call.arguments.change"
] | 609,339 | 609,338 | u350093546 | python |
p02806 | n = int(input())
st = [list(input().split()) for nesya in range(n)]
x = input()
c = 0
for a in st:
if x == st[0]:
c = 0
else:
c += int(st[1])
print(c) | n = int(input())
st = [list(input().split()) for nesya in range(n)]
x = input()
c = 0
for a in st:
if x == a[0]:
c = 0
else:
c += int(a[1])
print(c) | [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 609,343 | 609,344 | u227085629 | python |
p02806 | n = int(input())
cum = 0
d = dict()
for _ in range(n):
a, b = input().split()
b = int(b)
cum += b
d[a] = b
c = input()
print(cum - d[c]) | n = int(input())
cum = 0
d = dict()
for _ in range(n):
a, b = input().split()
b = int(b)
cum += b
d[a] = cum
c = input()
print(cum - d[c]) | [
"assignment.value.change",
"identifier.change"
] | 609,349 | 609,350 | u091051505 | python |
p02806 | N=int(input())
s=[0]*N
t=[0]*N
for i in range(N):
s[i],t[i] = input().split()
t[i]=int(t[i])
X=input()
j= s.index(X)
if X==s[-1]:
ans=0
else:
ans= t[j+1:]
print(sum(ans)) | N=int(input())
s=[0]*N
t=[0]*N
for i in range(N):
s[i],t[i] = input().split()
t[i]=int(t[i])
X=input()
j= s.index(X)
if X==s[-1]:
ans=0
else:
ans= sum(t[j+1:])
print(ans) | [
"call.add",
"call.arguments.change"
] | 609,351 | 609,352 | u089142196 | python |
p02806 | N = int(input())
s, t = [], []
for i in range(N):
s_i, t_i = [input().split(" ")]
t_i = int(t_i)
s.append(s_i)
t.append(t_i)
X = input()
idx = 0
while idx < N:
if s[idx] == X:
idx += 1
break
idx += 1
ans = 0
for i in range(idx, N):
ans += t[i]
print(ans) | N = int(input())
s, t = [], []
for i in range(N):
s_i, t_i = input().split(" ")
t_i = int(t_i)
s.append(s_i)
t.append(t_i)
X = input()
idx = 0
while idx < N:
if s[idx] == X:
idx += 1
break
idx += 1
ans = 0
for i in range(idx, N):
ans += t[i]
print(ans) | [] | 609,355 | 609,356 | u198062737 | python |
p02806 | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
music = []
length = []
for i in range(n):
ti,leng = map(str,input().split())
music.append(ti)
length.append(leng)
x = input()
num = music.index(x)
print(sum(length[x::])) | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
music = []
length = []
for i in range(n):
ti,leng = map(str,input().split())
music.append(ti)
length.append(int(leng))
x = input()
num = music.index(x)
print(sum(length[num+1::])) | [
"call.add",
"call.arguments.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 609,357 | 609,358 | u021916304 | python |
p02806 | n = int(input())
data=[list(inout().split()) for _ in range(n)]
s = input()
ans = 0
c = False
for i in range(n):
if c:
ans += int(data[i][1])
if data[i][0] == s:
c = True
print(ans) | n = int(input())
data=[list(input().split()) for _ in range(n)]
s = input()
ans = 0
c = False
for i in range(n):
if c:
ans += int(data[i][1])
if data[i][0] == s:
c = True
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 609,359 | 609,360 | u923279197 | python |
p02806 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... | [
"call.add",
"call.arguments.change"
] | 609,361 | 609,362 | u423585790 | python |
p02806 | n=int(input())
lst=[]
for i in range(n):
s,t=input().split()
T=int(t)
lst.append([s,t])
x=input()
for j in range(n):
if lst[j][0]==x:
k=j
break
totl=0
for j in range(k+1,n):
totl+=lst[j][1]
print(totl) | n=int(input())
lst=[]
for i in range(n):
s,t=input().split()
T=int(t)
lst.append([s,T])
x=input()
for j in range(n):
if lst[j][0]==x:
k=j
break
totl=0
for j in range(k+1,n):
totl+=lst[j][1]
print(totl)
| [
"identifier.change",
"call.arguments.change"
] | 609,363 | 609,364 | u527261492 | python |
p02806 | n=int(input())
p=[input().split() for _ in range(n)]
x=input()
ans=0
flag=False
for i in p:
if i[1]==x:
flag=True
continue
if flag:
ans+=int(i[0])
print(ans) | n=int(input())
p=[input().split() for _ in range(n)]
x=input()
ans=0
flag=False
for i in p:
if i[0]==x:
flag=True
continue
if flag:
ans+=int(i[1])
print(ans)
| [
"literal.number.integer.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 609,379 | 609,380 | u664373116 | python |
p02806 | n=int(input())
l=[]
for i in range(n):
l.append(list(map(str,input().split())))
x=input()
ans=0
f=0
for i in l:
if f==1:
ans+=int(l[1])
if i[0]==x:
f=1
print(ans) | n=int(input())
l=[]
for i in range(n):
l.append(list(map(str,input().split())))
x=input()
ans=0
f=0
for i in l:
if f==1:
ans+=int(i[1])
if i[0]==x:
f=1
print(ans)
| [
"identifier.change",
"call.arguments.change"
] | 609,402 | 609,403 | u223904637 | python |
p02806 | N=int(input())
s=["" for i in range(N)]
t=["" for i in range(N)]
for i in range(N):
s[i],t[i]=input().split()
t[i]=int(t[i])
X=int(input())
flag=0
ans=0
for i in range(N):
if flag==1:
ans+=t[i]
else:
if s[i]==X:
flag=1
print(ans)
| N=int(input())
s=["" for i in range(N)]
t=["" for i in range(N)]
for i in range(N):
s[i],t[i]=input().split()
t[i]=int(t[i])
X=input()
flag=0
ans=0
for i in range(N):
if flag==1:
ans+=t[i]
else:
if s[i]==X:
flag=1
print(ans)
| [
"call.remove",
"call.arguments.change"
] | 609,406 | 609,407 | u562016607 | python |
p02806 | n = int(input())
s = ['']*n
t = ['']*n
for i in range(n):
s[i], t[i] = input().split()
x = input()
p = s.index(x)
total = 0
for i in range(p, n):
total += int(t[i])
print(total) | n = int(input())
s = ['']*n
t = ['']*n
for i in range(n):
s[i], t[i] = input().split()
x = input()
p = s.index(x)
total = 0
for i in range(p+1, n):
total += int(t[i])
print(total) | [
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.add"
] | 609,421 | 609,422 | u816637025 | python |
p02806 | N = int(input())
P = []
for _ in range(N):
s,t = input().split()
t = int(t)
P.append([s,t])
X = input()
end_index = 0
for i in range(N):
p = P[i]
if p[0]==X:
end_index = i
break
count = 0
for i in range(end_index, N, 1):
count = count + P[i][1]
print(count)
| N = int(input())
P = []
for _ in range(N):
s,t = input().split()
t = int(t)
P.append([s,t])
X = input()
end_index = -1
for i in range(N):
p = P[i]
if p[0]==X:
end_index = i
break
count = 0
for i in range(end_index+1, N, 1):
count = count + P[i][1]
print(count) | [
"assignment.value.change",
"expression.operation.unary.add"
] | 609,423 | 609,424 | u492447501 | python |
p02806 | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
import functools
N = i... | import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import gcd
from copy import deepcopy
import functools
N = i... | [
"call.remove"
] | 609,435 | 609,436 | u513900925 | python |
p02806 | N = int(input())
ST = list()
for i in range(N):
s, t = input().split()
ST.append([s, t])
X = input()
result = None
for s, t in ST:
t = int(t)
if result is None:
if s == X:
result = 0
else:
result += t
print(s, t)
print(result) | N = int(input())
ST = list()
for i in range(N):
s, t = input().split()
ST.append([s, t])
X = input()
result = None
for s, t in ST:
t = int(t)
if result is None:
if s == X:
result = 0
else:
result += t
print(result) | [
"call.remove"
] | 609,439 | 609,440 | u658801777 | python |
p02806 | n=int(input())
l=[input() for i in range(n)]
target_song = input()
total = 0
ff = False
for i in l:
s, t = i.split(" ")
if s == target_song:
f = True
continue
if f == True:
total += int(t)
print(total) | n=int(input())
l=[input() for i in range(n)]
target_song = input()
total = 0
ff = False
for i in l:
s, t = i.split(" ")
if s == target_song:
ff = True
continue
if ff == True:
total += int(t)
print(total)
| [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 609,460 | 609,461 | u218602353 | python |
p02806 | def main():
N = int(input())
music = []
m_time = []
for _ in range(N):
a, b = input().split()
music.append(a)
m_time.append(int(b))
X = input()
ans = 0
for i, a in enumerate(music):
if a == X:
for j in range(i, N):
ans += m_time[j]
... | def main():
N = int(input())
music = []
m_time = []
for _ in range(N):
a, b = input().split()
music.append(a)
m_time.append(int(b))
X = input()
ans = 0
for i, a in enumerate(music):
if a == X:
for j in range(i+1, N):
ans += m_time[j... | [
"control_flow.loop.range.bounds.lower.change",
"expression.operation.binary.add"
] | 609,481 | 609,482 | u611865271 | python |
p02806 | n=int(input())
t=[]*n
sec=[]*n
for k in range(n):
s=input().split()
t[k]=s[0]
sec[k]=int(s[1])
x=input()
p=t.index(x)
a=0
if p!=n:
for l in range(p+1,n):
a+=sec[l]
print(str(a)) | n=int(input())
t=[""]*n
sec=[0]*n
for k in range(n):
s=input().split()
t[k]=s[0]
sec[k]=int(s[1])
x=input()
p=t.index(x)
a=0
if p!=n:
for l in range(p+1,n):
a+=sec[l]
print(str(a)) | [] | 609,483 | 609,484 | u291988695 | python |
p02806 | N = int(input())
s = ["" for i in range(N)]
t = [0 for i in range(N)]
for i in range(N):
s_str, t_str = input().split()
s[i] = s_str
t[i] = int(t_str)
X = input()
ans = 0
count = False
for i in range(X):
if count:
ans += t[i]
if s[i] == X:
count = True
print(ans) | N = int(input())
s = ["" for i in range(N)]
t = [0 for i in range(N)]
for i in range(N):
s_str, t_str = input().split()
s[i] = s_str
t[i] = int(t_str)
X = input()
ans = 0
count = False
for i in range(N):
if count:
ans += t[i]
if s[i] == X:
count = True
print(ans) | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 609,499 | 609,500 | u623349537 | python |
p02806 | n=int(input())
s=list(input().strip().split() for _ in range(n))
x=input().strip()
ans=0
isis=False
for ss,tt in s:
if isis:
ans += (tt)
if ss==x:
isis=True
print(ans) | n=int(input())
s=list(input().strip().split() for _ in range(n))
x=input().strip()
ans=0
isis=False
for ss,tt in s:
if isis:
ans += int(tt)
if ss==x:
isis=True
print(ans)
| [
"call.add",
"type_conversion.to_integer.change",
"type_conversion.to_number.change"
] | 609,501 | 609,502 | u077337864 | python |
p02803 | from collections import deque
def solve(s, start):
if s[start[0]][start[1]] == "#":
return -1
q = deque([start])
distance = [[-1] * w for _ in range(h)]
distance[start[0]][start[1]] = 0
while q:
y, x = q.popleft()
for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
... | from collections import deque
def solve(s, start):
if s[start[0]][start[1]] == "#":
return -1
q = deque([start])
distance = [[-1] * w for _ in range(h)]
distance[start[0]][start[1]] = 0
while q:
y, x = q.popleft()
for i, j in ((1, 0), (-1, 0), (0, 1), (0, -1)):
... | [
"call.remove"
] | 609,515 | 609,516 | u561870477 | python |
p02803 | def Warshall_floyd(d, n):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
H, W = map(int,input().split())
N = H * W
d = [[float("inf") for i in range(N)] for i in range(N)]
M = [[1 for i in range(W+1)] for i in r... | def warshall_floyd(d, n):
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k] + d[k][j])
return d
H, W = map(int,input().split())
N = H * W
d = [[float("inf") for i in range(N)] for i in range(N)]
M = [[1 for i in range(W+1)] for i in r... | [
"identifier.change"
] | 609,548 | 609,549 | u314350294 | python |
p02803 | from collections import deque
import itertools
h,w=map(int,input().split())
s=["#"+input()+"#" for i in range(h)]
s.insert(0,'#'*(w+2))
s.append('#'*(w+2))
def dep(s,t,p,q,time):
print(s)
s[p][q]=min(time,s[p][q])
time+=1
if t[p+1][q]=="." :
dep(s,t,p+1,q,time)
if t[p-1][q]=="." :
de... | from collections import deque
import itertools
h,w=map(int,input().split())
s=["#"+input()+"#" for i in range(h)]
s.insert(0,'#'*(w+2))
s.append('#'*(w+2))
def dep(s,t,p,q,time):
print(s)
s[p][q]=min(time,s[p][q])
time+=1
if t[p+1][q]=="." :
dep(s,t,p+1,q,time)
if t[p-1][q]=="." :
de... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 609,595 | 609,596 | u341267151 | python |
p02803 | import queue
import copy
def ngoin(bo,now):
return 0 <= now[0] and now[0] < len(bo) and 0 <= now[1] and now[1] < len(bo[0])
def minido(bo,si,sj):
tb = [[False for i in range(len(bo[0]))] for j in range(len(bo))]
q = queue.Queue()
q.put([si,sj,0])
tb[si][sj] = True
ret = 0
while not q.emp... | import queue
import copy
def ngoin(bo,now):
return 0 <= now[0] and now[0] < len(bo) and 0 <= now[1] and now[1] < len(bo[0])
def minido(bo,si,sj):
tb = [[False for i in range(len(bo[0]))] for j in range(len(bo))]
q = queue.Queue()
q.put([si,sj,0])
tb[si][sj] = True
ret = 0
while not q.emp... | [
"assignment.change"
] | 609,597 | 609,598 | u386131832 | python |
p02807 | n = int(input())
x = list(map(int, input().split()))
d = []
for x1, x2 in zip(x, x[1:]):
d.append(x2 - x1)
mod = 10 ** 9 + 7
base = 1
P = 10**9 + 7
N = n
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
for i in range(1, n):
base *= i
base %= mod
ans = 0
b = base
for i... | n = int(input())
x = list(map(int, input().split()))
d = []
for x1, x2 in zip(x, x[1:]):
d.append(x2 - x1)
mod = 10 ** 9 + 7
base = 1
P = 10**9 + 7
N = n+2
inv_t = [0]+[1]
for i in range(2,N):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
for i in range(1, n):
base *= i
base %= mod
ans = 0
b = base
for... | [
"assignment.change"
] | 609,622 | 609,623 | u711539583 | python |
p02807 | # -*- coding: utf-8 -*-
# dwacon6th-prelims/dwacon6th_prelims_b
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss ... | # -*- coding: utf-8 -*-
# dwacon6th-prelims/dwacon6th_prelims_b
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss ... | [
"call.add",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 609,656 | 609,657 | u106311097 | python |
p02807 | n = int(input())
x = list(map(int, input().split()))
mod = 10**9 + 7
fac = [1, 1]
inv = [1, 1]
finv = [1, 1]
for i in range(2, n+5):
fac.append(fac[i-1] * i % mod)
inv.append(mod - inv[mod%i] * (mod//i) % mod)
finv.append(finv[i-1] * inv[i] % mod)
ans = 0
j_inv = []
num = 0
for j in range(1, n):
num ... | n = int(input())
x = list(map(int, input().split()))
mod = 10**9 + 7
fac = [1, 1]
inv = [1, 1]
finv = [1, 1]
for i in range(2, n+5):
fac.append(fac[i-1] * i % mod)
inv.append(mod - inv[mod%i] * (mod//i) % mod)
finv.append(finv[i-1] * inv[i] % mod)
ans = 0
j_inv = []
num = 0
for j in range(1, n):
num ... | [] | 609,682 | 609,683 | u270681687 | python |
p02807 | N = int(input())
A = list(map(int, input().split()))
mod = 1e+9 + 7
p = mod - 2
S = []
while p != 0:
S = [p%2] + S[:]
p //= 2
frac = 1
for i in range(N - 1):
frac *= i+1
frac %= mod
T = 0
for i in range(N - 1):
k = 1
for j in range(len(S)):
if S[j] == 1:
k *= i+1
k %= mod
if j != len(S) ... | N = int(input())
A = list(map(int, input().split()))
mod = int(1e+9 + 7)
p = mod - 2
S = []
while p != 0:
S = [p%2] + S[:]
p //= 2
frac = 1
for i in range(N - 1):
frac *= i+1
frac %= mod
T = 0
for i in range(N - 1):
k = 1
for j in range(len(S)):
if S[j] == 1:
k *= i+1
k %= mod
if j != le... | [
"call.add",
"call.arguments.change"
] | 609,713 | 609,714 | u984276646 | python |
p02807 | mod=10**9+7
n=int(input())
arr=list(map(int,input().split()))
acum=[1]
for i in range(2,n+1):
tmp=acum+pow(i,mod-2,mod)
tmp%=mod
acum.append(tmp)
ans=0
for i in range(n-1):
ans+=(arr[i+1]-arr[i])*acum[i]
ans%=mod
for i in range(1,n):
ans*=i
ans%=mod
print(ans) | mod=10**9+7
n=int(input())
arr=list(map(int,input().split()))
acum=[1]
for i in range(2,n+1):
tmp=acum[-1]+pow(i,mod-2,mod)
tmp%=mod
acum.append(tmp)
ans=0
for i in range(n-1):
ans+=(arr[i+1]-arr[i])*acum[i]
ans%=mod
for i in range(1,n):
ans*=i
ans%=mod
print(ans) | [] | 609,720 | 609,721 | u163320134 | python |
p02807 | import sys
input = sys.stdin.readline
N = int(input())
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
for i in range(1, n + 1):
self.f.append(self.f[-1] * i % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for i in range(1, n + 1)[... | import sys
input = sys.stdin.readline
N = int(input())
x = list(map(int, input().split()))
mod = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
for i in range(1, n + 1):
self.f.append(self.f[-1] * i % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for i in range(1, n + 1)[... | [
"call.remove"
] | 609,725 | 609,726 | u141610915 | python |
p02807 | MOD = 10**9+7
N = int(input())
x = list(map(int,input().split()))
def mod_pow(x,n,mod):
res = 1
while(n > 0):
if(n and 1):
res = res * x % mod
x = x * x % mod
n >>= 1
return res
prob = []
a = 0
for i in range(1,N):
a += mod_pow(i,MOD-2,MOD)
a %= MOD
prob.appen... | MOD = 10**9+7
N = int(input())
x = list(map(int,input().split()))
def mod_pow(x,n,mod):
res = 1
while(n > 0):
if n&1:
res = res * x % mod
x = x * x % mod
n >>= 1
return res
prob = []
a = 0
for i in range(1,N):
a += mod_pow(i,MOD-2,MOD)
#koko
a %= MOD
prob.... | [
"control_flow.branch.if.condition.change"
] | 609,742 | 609,743 | u434872492 | python |
p02805 | import math
from itertools import combinations
eps = 10 ** -7
def midpoint(a, b):
return (a[0] + b[0]) / 2, (a[1] + b[1]) / 2
def distance(a, b):
return ((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2) ** 0.5
def within(c, r, a):
return (a[0] - c[0]) ** 2 + (a[1] - c[1]) ** 2 <= r ** 2 + eps
def tcircle(t1, t... | import math
from itertools import combinations
eps = 10 ** -7
def midpoint(a, b):
return (a[0] + b[0]) / 2, (a[1] + b[1]) / 2
def distance(a, b):
return ((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2) ** 0.5
def within(c, r, a):
return (a[0] - c[0]) ** 2 + (a[1] - c[1]) ** 2 <= r ** 2 + eps
def tcircle(t1, t... | [
"identifier.change",
"function.return_value.change"
] | 609,780 | 609,781 | u858742833 | python |
p02805 | # 解説AC
from math import sin, sqrt
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
INF = 10 ** 6
def circumcenter(i,j,k):
""" 3点を通る円の中心(外心) """
a,b = XY[i]
c,d = XY[j]
e,f = XY[k]
aa, bb, cc, dd, ee, ff = a**2, b**2, c**2, d**2, e**2, f**2
try:
x = ((e - a... | # 解説AC
from math import sin, sqrt
N = int(input())
XY = [[int(i) for i in input().split()] for _ in range(N)]
INF = 10 ** 6
def circumcenter(i,j,k):
""" 3点を通る円の中心(外心) """
a,b = XY[i]
c,d = XY[j]
e,f = XY[k]
aa, bb, cc, dd, ee, ff = a**2, b**2, c**2, d**2, e**2, f**2
try:
y = ((e - a... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change",
"function.return_value.change"
] | 609,796 | 609,797 | u561083515 | python |
p02805 | 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
def ddprint(x):
if DBG:
print(x)
import math
def dist(xx,yy,u,v):
ret... | 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
def ddprint(x):
if DBG:
print(x)
import math
def dist(xx,yy,u,v):
ret... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add"
] | 609,832 | 609,833 | u102445737 | python |
p02805 | 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
def ddprint(x):
if DBG:
print(x)
import math
def dist(xx,yy,u,v):
ret... | 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
def ddprint(x):
if DBG:
print(x)
import math
def dist(xx,yy,u,v):
ret... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"literal.number.integer.change"
] | 609,834 | 609,833 | u102445737 | python |
p02805 | import sys
input = sys.stdin.readline
LOCAL = len(sys.argv) > 1 and sys.argv[1] == 'LOCAL'
def dprint(*args):
if LOCAL:
print(*args)
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
import math
import itertools
def distanse(x1, y1, x2, y2):
return math.sqrt((x1 - x2)**2 + (y1 - ... | import sys
input = sys.stdin.readline
LOCAL = len(sys.argv) > 1 and sys.argv[1] == 'LOCAL'
def dprint(*args):
if LOCAL:
print(*args)
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
import math
import itertools
def distanse(x1, y1, x2, y2):
return math.sqrt((x1 - x2)**2 + (y1 - ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 609,854 | 609,855 | u530606147 | python |
p02805 | import sys
input = sys.stdin.readline
LOCAL = len(sys.argv) > 1 and sys.argv[1] == 'LOCAL'
def dprint(*args):
if LOCAL:
print(*args)
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
import math
import itertools
def distanse(x1, y1, x2, y2):
return math.sqrt((x1 - x2)**2 + (y1 - ... | import sys
input = sys.stdin.readline
LOCAL = len(sys.argv) > 1 and sys.argv[1] == 'LOCAL'
def dprint(*args):
if LOCAL:
print(*args)
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
import math
import itertools
def distanse(x1, y1, x2, y2):
return math.sqrt((x1 - x2)**2 + (y1 - ... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 609,856 | 609,857 | u530606147 | python |
p02805 | N=int(input())
X,Y=[0]*N,[0]*N
for i in range(N):
X[i],Y[i]=map(int,input().split())
def check(a,b,r):
if r<0:r=0
res=[0,0,0]
flg=True
for i in range(N):
tmp=(X[i]-a)**2+(Y[i]-b)**2
if tmp>r**2:
flg=False
if tmp>res[0]:
res=[tmp,X[i],Y[i]]
res[0]=... | N=int(input())
X,Y=[0]*N,[0]*N
for i in range(N):
X[i],Y[i]=map(int,input().split())
def check(a,b,r):
if r<0:r=0
res=[0,0,0]
flg=True
for i in range(N):
tmp=(X[i]-a)**2+(Y[i]-b)**2
if tmp>r**2:
flg=False
if tmp>res[0]:
res=[tmp,X[i],Y[i]]
res[0]=... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 609,881 | 609,880 | u842170774 | python |
p02805 | from itertools import combinations
import math
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n = int(readline())
m = map(float,read().split())
points = [[x, y] for x, y in zip(m, m)]
def center(a, b, c):
M = pow(a[0], 2) - pow(b[0], 2) + pow(a[1], 2) - pow(b[1], 2)
N = pow(a[0], 2) - pow(c[0... | from itertools import combinations
import math
import sys
read = sys.stdin.read
readline = sys.stdin.readline
n = int(readline())
m = map(float,read().split())
points = [[x, y] for x, y in zip(m, m)]
def center(a, b, c):
M = pow(a[0], 2) - pow(b[0], 2) + pow(a[1], 2) - pow(b[1], 2)
N = pow(a[0], 2) - pow(c[0... | [
"control_flow.branch.if.add",
"control_flow.continue.add"
] | 609,926 | 609,927 | u780475861 | python |
p02811 | k, x = map(int, input())
if (500*k) >= x:
print("Yes")
else:
print("No") | k, x = map(int, input().split())
if (500*k) >= x:
print("Yes")
else:
print("No") | [
"call.add"
] | 609,932 | 609,933 | u995163736 | python |
p02811 | K,X=map(int,input().split())
total = K*500
if total > X:
print("Yes")
else:
print("No") | k, x = map(int, input().split())
total = k * 500
if total >= x:
print("Yes")
else:
print("No") | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 609,939 | 609,940 | u853728588 | python |
p02811 | K,X=map(int,input().split())
total = K*500
if total > X:
print("Yes")
else:
print("No") | k, x = map(int,input().split())
total = k * 500
if total >= x:
print("Yes")
else:
print("No") | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 609,939 | 609,941 | u853728588 | python |
p02811 | K,X = map(int,input().split())
print('Yes' if K * 500 <= X else 'No') | K,X = map(int,input().split())
print('Yes' if K * 500 >= X else 'No') | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 609,946 | 609,947 | u732061897 | python |
p02811 | k,x=map(int,input(),split())
print("Yes" if 500*k>=x else "No") | k,x=map(int,input().split())
print("Yes" if 500*k>=x else "No") | [
"assignment.value.change",
"call.arguments.change"
] | 609,977 | 609,978 | u021657949 | python |
p02811 | N,X=map(int, input(),split())
print("Yes" if 500*N >= X else "No") | N,X=map(int, input().split())
print("Yes" if 500*N >= X else "No") | [
"assignment.value.change",
"call.arguments.change"
] | 609,989 | 609,990 | u054825571 | python |
p02811 | k, x = map(int, input().split())
if 500*k >= x:
print("yes")
exit()
else:
print("No")
| k, x = map(int, input().split())
if 500*k >= x:
print("Yes")
exit()
else:
print("No")
exit()
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change",
"call.add"
] | 609,994 | 609,995 | u974485376 | python |
p02811 | K, X = list(map(int, input()))
if K * 500 >= X:
print('Yes')
else:
print('No') | K, X = list(map(int, input().split()))
if K * 500 >= X:
print('Yes')
else:
print('No') | [
"call.add"
] | 610,011 | 610,012 | u967822229 | python |
p02811 | k,x = map(int,input().split())
if k*500 >= X:
print('Yes')
else:
print('No')
| k,x = map(int,input().split())
if k*500 >= x:
print('Yes')
else:
print('No')
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 610,017 | 610,018 | u855831834 | python |
p02811 | k,x = map(int,input().split())
if k*500 >= X:
print('Yes')
else:
print('No') | k,x = map(int,input().split())
if k*500 >= x:
print('Yes')
else:
print('No')
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 610,019 | 610,018 | u855831834 | python |
p02811 | K,X = map(int,input().split())
if K*2>=X:
print("Yes")
else:
print("No") | K,X = map(int,input().split())
if K*500>=X:
print("Yes")
else:
print("No") | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 610,026 | 610,027 | u068862866 | python |
p02811 | k,x=map(int, input().split())
print('Yes' if k*500 > x else 'No') | k,x=map(int, input().split())
print('Yes' if k*500 >= x else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 610,118 | 610,119 | u075303794 | python |
p02811 | k,x=map(int,input().split())
print("No" if k*500<x else "yes") | k, x = map(int, input().split())
print("Yes" if k*500 >= x else "No") | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"expression.operator.compare.change"
] | 610,127 | 610,128 | u896847891 | python |
p02811 | k,x=map(int,input().split())
print("No" if k*500<x else "yes") | k,x=map(int,input().split())
print("No" if k*500<x else "Yes") | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 610,127 | 610,129 | u896847891 | python |
p02811 | K,X = map(int, input().split())
#総額
SUM = 500*X
#判定
if SUM >= X:
print("Yes")
else:
print("No")
| K,X = map(int, input().split())
#総額
SUM = 500*K
#判定
if SUM >= X:
print("Yes")
else:
print("No") | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 610,136 | 610,137 | u819663617 | python |
p02811 | K, X = map(int, input().split)
a = 500*K
if a >= X:
print("Yes")
else:
print("No") | K, X = map(int, input().split())
a = 500*K
if a >= X:
print("Yes")
else:
print("No")
| [
"call.add"
] | 610,146 | 610,147 | u685244071 | python |
p02811 | n.m=map(int,input().split())
if 500*n>=m:
print("Yes")
else:
print("No") | n,m=map(int,input().split())
if 500*n >= m:
print("Yes")
else:
print("No") | [
"misc.typo",
"assignment.variable.change"
] | 610,148 | 610,149 | u901598613 | python |
p02811 | import sys
stdin=sys.stdin
ns=lambda:stdin.readline().rstrip()
ni=lambda:int(stdin.readline().rstrip())
nm=lambda:map(int,stdin.readline().rstrip())
nl=lambda:list(map(int,stdin,readline().rstrip()))
K,X=nm()
print('Yes' if X<=500*K else 'No') | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
K,X=nm()
print('Yes' if X<=500*K else 'No') | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 610,174 | 610,175 | u525796732 | python |
p02811 | k,x = map(int, input().split())
print('No' if x*500<x else 'Yes') | k,x = map(int, input().split())
print('No' if k*500<x else 'Yes') | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 610,186 | 610,187 | u725133562 | python |
p02811 | import sys
K, X = map(int, sys.stdin.readline().strip().split())
if K * 500 >= X:
print('YES')
else:
print('NO') | import sys
K, X = map(int, sys.stdin.readline().strip().split())
if K * 500 >= X:
print('Yes')
else:
print('No') | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 610,188 | 610,189 | u135454978 | python |
p02811 | n, m = map(int, input().split())
if 500 * n > m:
print("Yes")
else:
print("No") | n, m = map(int, input().split())
if 500 * n >= m:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 610,192 | 610,193 | u671060652 | python |
p02811 | K, X = map(int, input().split())
print('Yes' if K*500 > X else 'No')
| K, X = map(int, input().split())
print('Yes' if K*500 >= X else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 610,201 | 610,202 | u821588465 | python |
p02811 | K,X = map(int, input().split())
# N = int(input())
# s = int(input())
# C = int(input())
# s= input()
print("Yes" if K * 2 >= X else "No") | K,X = map(int, input().split())
# N = int(input())
# s = int(input())
# C = int(input())
# s= input()
print("Yes" if K * 500 >= X else "No") | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 610,203 | 610,204 | u027403702 | python |
p02811 | k,x=map(int,input().split())
if (k*500>x):
print("Yes")
else:
print("No") | k,x=map(int,input().split())
if (k*500>=x):
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 610,250 | 610,251 | u877389510 | python |
p02811 | k, x = list(map(int, input().split))
print('Yes') if k *500 <= x else print('No') | k, x = list(map(int, input().split()))
print('Yes') if k *500 >= x else print('No') | [
"call.add",
"misc.opposites",
"expression.operator.compare.change"
] | 610,258 | 610,259 | u518929058 | python |
p02811 | import sys
K, X = map(int, next(sys.stdin).split())
print('Yes' if K * 500 <= X else 'No')
| import sys
K, X = map(int, next(sys.stdin).split())
print('Yes' if K * 500 >= X else 'No') | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 610,276 | 610,277 | u317423698 | python |
p02811 | import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(... | import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
# mod = 10**9+7
def inp(... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 610,300 | 610,301 | u773580152 | python |
p02811 | k,x=[int(_) for _ in input().split()]
print('Yes' if k*500>x else 'No') | k,x=[int(_) for _ in input().split()]
print('Yes' if k*500>=x else 'No') | [
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 610,324 | 610,325 | u484229314 | python |
p02811 | k,x = map(int,input().split)
print("Yes" if 500*k>=x else "No") | k,x = map(int,input().split())
print("Yes" if 500*k>=x else "No") | [
"call.add"
] | 610,328 | 610,329 | u686536081 | python |
p02811 | data = [int(k) for k in input().split()]
print(data)
takashi = 500 * data[0]
if takashi >= data[1]:
print('Yes')
else:
print('No')
| data = [int(k) for k in input().split()]
takashi = 500 * data[0]
if takashi >= data[1]:
print('Yes')
else:
print('No')
| [
"call.remove"
] | 610,336 | 610,337 | u785354231 | python |
p02811 | data = [int(k) for k in input().split()]
takashi = 500 * data[0]
if takashi >= data[1]:
print('YES')
else:
print('NO') | data = [int(k) for k in input().split()]
takashi = 500 * data[0]
if takashi >= data[1]:
print('Yes')
else:
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 610,338 | 610,337 | u785354231 | python |
p02811 | data = [int(k) for k in input().split()]
takashi = 500 * data[0]
if takashi > data[1]:
print('YES')
else:
print('NO') | data = [int(k) for k in input().split()]
takashi = 500 * data[0]
if takashi >= data[1]:
print('Yes')
else:
print('No')
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 610,339 | 610,337 | u785354231 | python |
p02811 | n, s = map(int, input())
print("Yes" if 500*n >= s else "No") | n, s = map(int, input().split())
print("Yes" if 500*n >= s else "No") | [
"call.add"
] | 610,342 | 610,343 | u537818901 | python |
p02811 | K, X = map(int, input().split())
print(["No", "Yes"][K*500>X]) | K, X = map(int, input().split())
print(["No", "Yes"][K*500>=X]) | [
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 610,350 | 610,351 | u770944306 | python |
p02811 | K, X = map(int, input().split(" "))
if 500*K>X:
print("Yes")
else:
print("No") | K, X = map(int, input().split(" "))
if 500*K>=X:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 610,383 | 610,384 | u416258526 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.