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 |
|---|---|---|---|---|---|---|---|
p02796 | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), pople... | import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), pople... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,262 | 602,263 | u424768586 | python |
p02796 | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(input())
lr = []
for _ in range(N):
p,l = map(int,input().split())
lr.append((p-l,p+l))
lr.sort(key = itemgetter(0,1))
now = -10**10
count = 0
for i in range(N):
... | import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
def main():
N = int(input())
lr = []
for _ in range(N):
p,l = map(int,input().split())
lr.append((p-l,p+l))
lr.sort(key = itemgetter(1,0))
now = -10**10
count = 0
for i in range(N):
... | [
"call.arguments.change",
"call.arguments.add"
] | 602,275 | 602,276 | u648212584 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [] | 602,277 | 602,278 | u768890894 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 602,279 | 602,278 | u768890894 | python |
p02796 | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(N)]
R=[list(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>s:
s=r[i+1][1]
ans+=... | from operator import itemgetter
n=int(input())
xl=[list(map(int,input().split()))for i in range(n)]
R=[(xl[i][0]-xl[i][1],xl[i][0]+xl[i][1]) for i in range(n)]
r=sorted([(R[i][0],R[i][1]) for i in range(n)],key=itemgetter(1))
s=r[0][1]
ans=1
for i in range(n-1):
if r[i+1][0]>=s:
s=r[i+1][1]
ans+=1
p... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,280 | 602,278 | u768890894 | python |
p02796 |
n = int(input())
X = []
for _ in range(n):
x, l = map(int, input().split())
X.append((x, x + l))
count = 0
current = -1 * float('inf')
for x in sorted(X, key=lambda x: x[1]):
if x[0] >= current:
count += 1
current = x[1]
print(count) | n = int(input())
X = []
for _ in range(n):
x, l = map(int, input().split())
X.append((x - l, x + l))
count = 0
current = -1 * float('inf')
for x in sorted(X, key=lambda x: x[1]):
if x[0] >= current:
count += 1
current = x[1]
print(count) | [
"expression.operation.binary.add"
] | 602,285 | 602,286 | u319065189 | python |
p02796 | N = int(input())
ST = []
for i in range(N):
x, l = list(map(int, input().split()))
ST.append([x-l, x+l])
ST.sort(key = lambda x :x[1])
startT = ST[0][1]
ans = 1
if N != 1:
for i in range(1,N):
if startT >= ST[i][0]:
continue
else:
startT = ST[i][1]
ans += ... | N = int(input())
ST = []
for i in range(N):
x, l = list(map(int, input().split()))
ST.append([x-l, x+l])
ST.sort(key = lambda x :x[1])
startT = ST[0][1]
ans = 1
if N != 1:
for i in range(1,N):
if startT <= ST[i][0]:
startT = ST[i][1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,287 | 602,288 | u944643608 | python |
p02796 | import sys
input = sys.stdin.readline
n = int(input())
xl = [list(map(int, input().split())) for _ in range(n)]
xl2 = sorted([[x + l, x - l] for x, l in xl])
ans = 0
mr = xl2[0][0] - 1
for r, l in xl2:
if l > mr:
ans += 1
mr = r
print(ans)
| import sys
input = sys.stdin.readline
n = int(input())
xl = [list(map(int, input().split())) for _ in range(n)]
xl2 = sorted([[x + l, x - l] for x, l in xl])
ans = 0
mr = xl2[0][1]
for r, l in xl2:
if l >= mr:
ans += 1
mr = r
print(ans)
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,289 | 602,290 | u222668979 | python |
p02796 | #!/usr/bin/env python3
import sys
import collections
sys.setrecursionlimit(10 ** 7)
# 1 ✕ 1 (int)
N = int(input().rstrip())
# N ✕ M
A = list(tuple(map(int, input().rstrip().split())) for _ in range(N))
array = []
for s, t in A:
array.append((s + t, s))
array.sort()
# print(array)
ans = 0
t = 0
for e, s in arr... | #!/usr/bin/env python3
import sys
import collections
sys.setrecursionlimit(10 ** 7)
# 1 ✕ 1 (int)
N = int(input().rstrip())
# N ✕ M
A = list(tuple(map(int, input().rstrip().split())) for _ in range(N))
array = []
for s, t in A:
array.append((s + t, s - t))
array.sort()
# print(array)
ans = 0
t = -1e9
for e, s... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 602,291 | 602,292 | u017723605 | python |
p02796 | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]+rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]-rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 602,299 | 602,300 | u181195295 | python |
p02796 | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]-x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]+rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | n = int(input())
XL = []
for i in range(n):
x, l = map(int, input().split())
XL.append([x, l])
XL.sort(key=lambda x: x[0]+x[1])
seen = -10**10
ans = 0
for i in range(n):
rob = XL[i]
if seen <= rob[0]-rob[1]:
seen = rob[0]+rob[1]
ans += 1
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 602,301 | 602,300 | u181195295 | python |
p02796 | N = int(input())
robot = []
ans = 0
for i in range(N):
x,l = map(int,input().split())
robot.append([x-l,x+l])
robot.sort()
cur = -float('inf')
for i in range(N):
if cur <= robot[i][1]:
ans += 1
cur = robot[i][0]
print(ans) | N = int(input())
robot = []
ans = 0
for i in range(N):
x,l = map(int,input().split())
robot.append([x+l,x-l])
robot.sort()
cur = -float('inf')
for i in range(N):
if cur <= robot[i][1]:
ans += 1
cur = robot[i][0]
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 602,302 | 602,303 | u960080897 | python |
p02796 | n = int(input())
X = []
for i in range(n):
x, y = map(int, input().split())
X.append((x - y + 1, x + y))
X.sort(key=lambda x: x[1])
ter = -10**10
cnt = 0
for left, right in X:
if ter <= left:
ter = right
cnt += 1
print(cnt)
| n = int(input())
X = []
for i in range(n):
x, y = map(int, input().split())
X.append((x - y, x + y))
X.sort(key=lambda x: x[1])
ter = -10**10
cnt = 0
for left, right in X:
if ter <= left:
ter = right
cnt += 1
print(cnt)
| [
"expression.operation.binary.remove"
] | 602,310 | 602,311 | u997641430 | python |
p02796 | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
left = x - l + 1
right = x + l - 1
lst.append([left, right])
lst = sorted(lst, key=lambda x: x[1])
ans = 1
limit = lst[0][1]
for i in range(n):
if lst[i][0] > limit:
ans += 1
limit = lst[i][1]
print(ans) | n = int(input())
lst = []
for i in range(n):
x, l = map(int, input().split())
left = x - l
right = x + l
lst.append([left, right])
lst = sorted(lst, key=lambda x: x[1])
ans = 1
limit = lst[0][1]
for i in range(n):
if lst[i][0] >= limit:
ans += 1
limit = lst[i][1]
print(ans) | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,314 | 602,315 | u289547799 | python |
p02796 | N = int(input())
ts = []
for _ in range(N):
x, l = map(int,input().split())
t = min(x+l,10**9)
s = max(x-l,0)
ts.appned([t,s])
ts.sort()
tmp = 0
count = 0
for n in ts:
if tmp<=n[1]:
count += 1
tmp = n[0]
print(count)
| N = int(input())
ts = []
for _ in range(N):
x, l = map(int,input().split())
t = min(x+l,10**9)
s = max(x-l,0)
ts.append([t,s])
ts.sort()
tmp = 0
count = 0
for n in ts:
if tmp<=n[1]:
count += 1
tmp = n[0]
print(count) | [
"identifier.change"
] | 602,316 | 602,317 | u935558307 | python |
p02796 | from operator import itemgetter
n = int(input())
a = [list(map(int, input().split())) for i in range(n)]
s = [i[0]-i[1]+1 for i in a]
t = [i[0]+i[1]-1 for i in a]
st = sorted([(s[i], t[i]) for i in range(n)], key=itemgetter(1))
ans = 0
last = -10**9
for i in range(n):
if last < st[i][0]:
ans += 1
... | from operator import itemgetter
n = int(input())
a = [list(map(int, input().split())) for i in range(n)]
s = [i[0]-i[1] for i in a]
t = [i[0]+i[1] for i in a]
st = sorted([(s[i], t[i]) for i in range(n)], key=itemgetter(1))
ans = 0
last = -10**10
for i in range(n):
if last <= st[i][0]:
ans += 1
l... | [
"expression.operation.binary.remove",
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 602,322 | 602,323 | u414458988 | python |
p02793 | N = int(input())
A = list(map(int, input().split()))
# 参考：https://qiita.com/aki-takano/items/a43fac70b702d4f22d7e
def lcm(a):
from math import gcd
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
L = lcm(A)
B = []
for a in A:
B.append(a // L)
print(sum(B) % 1000... | N = int(input())
A = list(map(int, input().split()))
# 参考：https://qiita.com/aki-takano/items/a43fac70b702d4f22d7e
def lcm(a):
from math import gcd
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
L = lcm(A)
B = []
for a in A:
B.append(L // a)
print(sum(B) % 1000... | [
"expression.operation.binary.remove"
] | 603,070 | 603,071 | u022138926 | python |
p02793 | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pri... | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pri... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 603,072 | 603,073 | u255673886 | python |
p02793 | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pr... | n = int(input())
a = list(map(int,input().split()))
mod = 10**9 + 7
from math import gcd
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
# pri... | [
"call.add",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 603,074 | 603,073 | u255673886 | python |
p02793 | n = int(input())
arr = list(map(int, input().split()))
#arr：最小公倍数の対象とする配列
MOD = 10**9 + 7
def lcm(arr):
primes = {}
for val in arr:
p = 2
while p * p <= val:
if val % p == 0:
cnt = 0
while val % p == 0:
cnt += 1
... | n = int(input())
arr = list(map(int, input().split()))
#arr：最小公倍数の対象とする配列
MOD = 10**9 + 7
def lcm(arr):
primes = {}
for val in arr:
p = 2
while p * p <= val:
if val % p == 0:
cnt = 0
while val % p == 0:
cnt += 1
... | [
"expression.operation.binary.remove"
] | 603,075 | 603,076 | u404290207 | python |
p02793 | n = int(input())
arr = list(map(int, input().split()))
#arr：最小公倍数の対象とする配列
MOD = 10**9 + 7
def lcm(arr):
primes = {}
for val in arr:
p = 2
while p * p <= val:
if val % p == 0:
cnt = 0
while val % p == 0:
cnt += 1
... | n = int(input())
arr = list(map(int, input().split()))
#arr：最小公倍数の対象とする配列
MOD = 10**9 + 7
def lcm(arr):
primes = {}
for val in arr:
p = 2
while p * p <= val:
if val % p == 0:
cnt = 0
while val % p == 0:
cnt += 1
... | [
"expression.operation.binary.remove"
] | 603,077 | 603,076 | u404290207 | python |
p02793 | n=int(input())
A=[int(i) for i in input().split()]
mod=10**9+7
def gcd(a,b):
while b:
a,b=b,a%b
return a
lcm=A[0]
chk=True
for i in range(1,n):
if lcm%A[i]!=0:
lcm=lcm*A[i]//gcd(lcm,A[i])
if lcm>10**100:
chk=False
break
if chk:
ans=0
for i in range(n):
ans=(ans+lcm//A[i])%mod
print(... | n=int(input())
A=[int(i) for i in input().split()]
mod=10**9+7
def gcd(a,b):
while b:
a,b=b,a%b
return a
lcm=A[0]
chk=True
for i in range(1,n):
if lcm%A[i]!=0:
lcm=lcm*A[i]//gcd(lcm,A[i])
if lcm>10**50000:
chk=False
break
if chk:
ans=0
for i in range(n):
ans=(ans+lcm//A[i])%mod
prin... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 603,100 | 603,098 | u969190727 | python |
p02793 | # -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#a, b = map(int, input().split())
N = int(input())
A = list(map(int, input().split()))
mod = (10 ** 9) + 7
def lcm(a):
from math im... | # -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#a, b = map(int, input().split())
N = int(input())
A = list(map(int, input().split()))
mod = (10 ** 9) + 7
def lcm(a):
from math i... | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 603,113 | 603,114 | u545666277 | python |
p02793 | def gcd(a, b):
if a == 0:
return b
return gcd(b%a, a)
def lcm(a,b):
return a*b/gcd(a,b)
if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
l = int(1)
for e in a:
l = lcm(l,e)
s = int(0)
for e in a:
s += l//e
mod = int(1000000... | def gcd(a, b):
if a == 0:
return b
return gcd(b%a, a)
def lcm(a,b):
return a*b//gcd(a,b)
if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
l = int(1)
for e in a:
l = lcm(l,e)
s = int(0)
for e in a:
s += l//e
mod = int(100000... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,121 | 603,122 | u310752653 | python |
p02793 | def gcd(a, b):
if a == 0:
return b
return gcd(b%a, a)
def lcm(a,b):
return a*b/gcd(a,b)
if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
l = int(1)
for e in a:
l = lcm(l,e)
s = int(0)
for e in a:
s += l/e
mod = int(10000000... | def gcd(a, b):
if a == 0:
return b
return gcd(b%a, a)
def lcm(a,b):
return a*b//gcd(a,b)
if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
l = int(1)
for e in a:
l = lcm(l,e)
s = int(0)
for e in a:
s += l//e
mod = int(100000... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,123 | 603,122 | u310752653 | python |
p02793 | # 最小公倍数
from math import gcd
def lcm (x, y):
return (x * y) // gcd(x, y)
# 最小公倍数(リスト)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
lcm_A = lcm_list(A)
ans = 0
for i in range(N):
ans += lcm_A // A[i]
print(ans % mod) | # 最小公倍数
from math import gcd
from functools import reduce
def lcm (x, y):
return (x * y) // gcd(x, y)
# 最小公倍数(リスト)
def lcm_list(numbers):
return reduce(lcm, numbers, 1)
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
lcm_A = lcm_list(A)
ans = 0
for i in range(N):
ans += lcm_A // A... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change"
] | 603,124 | 603,125 | u379959788 | python |
p02793 | n = int(input())
s = list(map(int,input().split()))
ans = 0
mod = int(1e9+7)
def gcd(a,b):
while b != 0:
a, b = b, a % b
return a
def lcm(a,b):
return a // gcd(a,b)
g = 1
for i in range(n):
g = lcm(g, s[i])
for i in range(n):
ans += g // s[i]
print(ans%mod)
| n = int(input())
s = list(map(int,input().split()))
ans = 0
mod = int(1e9+7)
def gcd(a,b):
while b != 0:
a, b = b, a % b
return a
def lcm(a,b):
return a // gcd(a,b) * b
g = 1
for i in range(n):
g = lcm(g, s[i])
for i in range(n):
ans += g // s[i]
print(ans%mod)
| [
"expression.operation.binary.add"
] | 603,143 | 603,144 | u599114793 | python |
p02793 | def GCD(x,y):
if y==0:
return x
return GCD(y,x%y)
def func(x):
if x <= 1:
return []
for i in range(2,int(x**0.5)+1):
if x%i == 0:
count = 0
while x%i==0:
x //= i
count += 1
return [[i,count]]+func(x)
return ... | def GCD(x,y):
if y==0:
return x
return GCD(y,x%y)
def func(x):
if x <= 1:
return []
for i in range(2,int(x**0.5)+1):
if x%i == 0:
count = 0
while x%i==0:
x //= i
count += 1
return [[i,count]]+func(x)
return ... | [
"literal.number.integer.change",
"assignment.value.change"
] | 603,161 | 603,162 | u211160392 | python |
p02793 | import math
n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
lcm = a[0]
for i in range(1, n):
lcm = lcm * a[i] // math.gcd(lcm, a[i])
#lcm = lcm * a[i] // math.gcd(lcm, a[i])\
lcm %= MOD
for i in range(n):
ans += lcm * pow(a[i] , MOD-2, MOD)
# ans %= MOD
print(ans)
| import math
n = int(input())
a = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
lcm = a[0]
for i in range(1, n):
lcm = lcm * a[i] // math.gcd(lcm, a[i])
#lcm = lcm * a[i] // math.gcd(lcm, a[i])
lcm %= MOD
for i in range(n):
ans += lcm * pow(a[i] , MOD-2, MOD)
ans %= MOD
print(ans)
| [] | 603,167 | 603,166 | u701199820 | python |
p02793 |
MOD = 1000000007
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def lcm(a, b):
return a//gcd(a,b)*a
n = int(input())
a = list(map(int,input().split()))
all_lcm = 1
for i in range(n):
all_lcm = lcm(all_lcm, a[i])
ans = 0
for i in range(n):
ans += all_lcm//a[i]
print(a... |
MOD = 1000000007
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a%b)
def lcm(a, b):
return a//gcd(a,b)*b
n = int(input())
a = list(map(int,input().split()))
all_lcm = 1
for i in range(n):
all_lcm = lcm(all_lcm, a[i])
ans = 0
for i in range(n):
ans += all_lcm//a[i]
print(a... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,168 | 603,169 | u083190434 | python |
p02793 | #a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
N=int(input())
A=list(map(int, input().split()))
L = 1
for a in A:
L = lcm(L, a)
ans = 0
for a in A:
ans = ans + L/a
MOD = 1000000007
print(int(ans)%MOD)
| #a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
N=int(input())
A=list(map(int, input().split()))
L = 1
for a in A:
L = lcm(L, a)
ans = 0
for a in A:
ans = ans + L//a
MOD = 1000000007
print(int(ans)%MOD)
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 603,182 | 603,183 | u424103788 | python |
p02793 | N = int(input())
A = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
def lcm(a,b):
return a*b/gcd(a,b)
L = 1
D = 1000000007
for i in range(N):
L = lcm(L,A[i])
L = L % D
res = 0
for i in range(N):
res = (res + L * pow(A[i],D-2,D)) % D
print(int(res))... | N = int(input())
A = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
def lcm(a,b):
return a*b//gcd(a,b)
L = 1
D = 1000000007
for i in range(N):
L = lcm(L,A[i])
L = L % D
res = 0
for i in range(N):
res = (res + L * pow(A[i],D-2,D)) % D
print(int(res)... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,192 | 603,193 | u026537738 | python |
p02793 | import math
N = int(input())
A = list(map(int, input().split()))
AB = 1
for i in A:
AB = AB*i//math.gcd(AB,i)
sumB = 0
for i in A:
sumB += AB/i
print(int(sumB%(10**9+7))) | import math
N = int(input())
A = list(map(int, input().split()))
AB = 1
for i in A:
AB = AB*i//math.gcd(AB,i)
sumB = 0
for i in A:
sumB += AB//i
print(int(sumB%(10**9+7))) | [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 603,209 | 603,210 | u290279680 | python |
p02793 | from math import gcd
s=int(input())
t=list(map(int, input().split()))
ans=t[0]
for i in t:
ans=(ans*i)//gcd(ans,i)
mod=10**9+7
ans%=mod
a=0
for j in t:
a+=ans//j
print(int(a)%mod) | from math import gcd
s=int(input())
t=list(map(int, input().split()))
ans=t[0]
for i in t:
ans=(ans*i)//gcd(ans,i)
mod=10**9+7
a=0
for j in t:
a+=ans//j
print(int(a)%mod) | [] | 603,214 | 603,215 | u917558625 | python |
p02793 | def gcd(n,m):
if n>m:
return gcd(m,n);
if n==0:
return m;
return gcd(m-n*(m//n),n)
def lcm(x, y):
return (x * y) // gcd(x, y)
n=int(input())
a=list(map(int,input().split()))
s=1
for i in a:
s=lcm(s,i)
ans=0
for i in a:
ans+=s//i
ans % 1000000007
print(ans) | def gcd(n,m):
if n>m:
return gcd(m,n);
if n==0:
return m;
return gcd(m-n*(m//n),n)
def lcm(x, y):
return (x * y) // gcd(x, y)
n=int(input())
a=list(map(int,input().split()))
s=1
for i in a:
s=lcm(s,i)
ans=0
for i in a:
ans+=s//i
print(ans % 1000000007) | [
"expression.operation.binary.remove"
] | 603,217 | 603,218 | u204842730 | python |
p02793 | import math
N = int(input())
A = list(map(int, input().split()))
a = A[0]
for i in range(1, N):
g = a * A[i] // math.gcd(a, A[i])
a = g
b = 0
for i in range(N):
b = b + g // A[i]
c = b % (1000000007)
print(c) | import math
N = int(input())
A = list(map(int, input().split()))
a = 1
for i in range(N):
g = a * A[i] // math.gcd(a, A[i])
a = g
b = 0
for i in range(N):
b = b + g // A[i]
c = b % (1000000007)
print(c) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 603,238 | 603,239 | u886832246 | python |
p02793 | mod = 10**9+7
def fctr(n):
res=[]
c=0
r=int(n**0.5)
for i in range(2,r+2):
while n%i==0:
c+=1
n=n//i
if c!=0:
res.append([i,c])
c=0
if n!=1:
res.append([n,1])
return res
N = int(input())
A = list(map(int, input().split()))
... | mod = 10**9+7
def fctr(n):
res=[]
c=0
r=int(n**0.5)
for i in range(2,r+2):
while n%i==0:
c+=1
n=n//i
if c!=0:
res.append([i,c])
c=0
if n!=1:
res.append([n,1])
return res
N = int(input())
A = list(map(int, input().split()))
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 603,245 | 603,246 | u310678820 | python |
p02793 | import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
MOD = 10**9+7
def gcd(a, b):
while a and b:
if a > b:
a %= b
else:
b %= a
return max(a, b)
def lcm(a, b):
_gcd = gcd(a, b)
return a * b // _gcd
_a = a_ls[0]
for a in a_ls:
_a =... | import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
MOD = 10**9+7
def gcd(a, b):
while a and b:
if a > b:
a %= b
else:
b %= a
return max(a, b)
def lcm(a, b):
_gcd = gcd(a, b)
return a * b // _gcd
_a = a_ls[0]
for a in a_ls:
_a =... | [
"expression.operation.binary.remove"
] | 603,247 | 603,248 | u190406011 | python |
p02793 | import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
MOD = 10**9+7
def gcd(a, b):
while a and b:
if a > b:
a %= b
else:
b %= a
return max(a, b)
def lcm(a, b):
_gcd = gcd(a, b)
return a * b // _gcd % MOD
_a = a_ls[0]
for a in a_ls:
... | import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
MOD = 10**9+7
def gcd(a, b):
while a and b:
if a > b:
a %= b
else:
b %= a
return max(a, b)
def lcm(a, b):
_gcd = gcd(a, b)
return a * b // _gcd
_a = a_ls[0]
for a in a_ls:
_a =... | [
"expression.operation.binary.remove"
] | 603,250 | 603,248 | u190406011 | python |
p02793 | import sys
sys.setrecursionlimit(2000000)
from math import gcd
def lcm(a):
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
mod = 1000000007
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def power(x, y):
if y == 0 : return 1
elif y == 1 : r... | import sys
sys.setrecursionlimit(2000000)
from math import gcd
def lcm(a):
x = a[0]
for i in range(1, len(a)):
x = (x * a[i]) // gcd(x, a[i])
return x
mod = 1000000007
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def power(x, y):
if y == 0 : return 1
elif y == 1 : ... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,253 | 603,254 | u177388368 | python |
p02793 | from math import gcd
N = int(input())
A = [int(i) for i in input().split()]
lcm = A[0]
MOD = 10**9 + 7
for a in A:
lcm = (lcm // gcd(lcm,a) * a)
res = 0
for a in A:
res += lcm /a
print(res % MOD)
| from math import gcd
N = int(input())
A = [int(i) for i in input().split()]
lcm = A[0]
MOD = 10**9 + 7
for a in A:
lcm = (lcm // gcd(lcm,a) * a)
res = 0
for a in A:
res += lcm //a
print(res % MOD)
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 603,255 | 603,256 | u974620347 | python |
p02793 | import math
from functools import reduce
a = list(map(int,input().split()))
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
ans = 0
for i in a:
ans += (x//i)
a... | import math
from functools import reduce
b = input()
a = list(map(int,input().split()))
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
x = lcm_list(a)
ans = 0
for i in a:
ans += ... | [
"assignment.add"
] | 603,268 | 603,269 | u102602414 | python |
p02793 | # import itertools
# import math
import math
MOD = 10 ** 9 + 7
def solve(N, A):
lcm_ans = A[0]
for i in range(1, N):
lcm_ans = lcm_ans * A[i] // math.gcd(lcm_ans, A[i])
ans = 0
for AA in A:
ans += lcm_ans // AA
return ans // MOD
N = int(input())
# S = input()
# A, B = map(int,... | # import itertools
# import math
import math
MOD = 10 ** 9 + 7
def solve(N, A):
lcm_ans = A[0]
for i in range(1, N):
lcm_ans = lcm_ans * A[i] // math.gcd(lcm_ans, A[i])
ans = 0
for AA in A:
ans += lcm_ans // AA
return ans % MOD
N = int(input())
# S = input()
# A, B = map(int, ... | [
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 603,270 | 603,271 | u586662847 | python |
p02793 | # import itertools
# import math
import math
MOD = 10 ** 9 + 7
def solve(N, A):
lcm_ans = A[0]
for i in range(1, N):
lcm_ans = lcm_ans * A[i] // math.gcd(lcm_ans, A[i])
ans = 0
for AA in A:
ans += lcm_ans // AA
return ans
N = int(input())
# S = input()
# A, B = map(int, input(... | # import itertools
# import math
import math
MOD = 10 ** 9 + 7
def solve(N, A):
lcm_ans = A[0]
for i in range(1, N):
lcm_ans = lcm_ans * A[i] // math.gcd(lcm_ans, A[i])
ans = 0
for AA in A:
ans += lcm_ans // AA
return ans % MOD
N = int(input())
# S = input()
# A, B = map(int, ... | [
"expression.operation.binary.add"
] | 603,272 | 603,271 | u586662847 | python |
p02793 | MOD=10**9+7
import math
N=int(input())
if N==1:
A=int(input())
print(1)
exit()
A=list(map(int, input().split()))
def f(a, b):
return a*b//math.gcd(a, b)
if N>10:
A1=A[:N//2]
A2=A[N//2:]
tmp1=f(A1[0], A1[1])
n1=len(A1)
for i in range(2, n1):
tmp1=f(tmp1, A1[i])
tmp2=f(A2[0], A2[1])
... | MOD=10**9+7
import math
N=int(input())
if N==1:
A=int(input())
print(1)
exit()
A=list(map(int, input().split()))
def f(a, b):
return a*b//math.gcd(a, b)
if N>10:
A1=A[:N//2]
A2=A[N//2:]
tmp1=f(A1[0], A1[1])
n1=len(A1)
for i in range(2, n1):
tmp1=f(tmp1, A1[i])
tmp2=f(A2[0], A2[1])
... | [
"assignment.value.change"
] | 603,277 | 603,278 | u095021077 | python |
p02796 | import math
import fractions
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def bitlist(x,digit):
res = [0 for i in rang... | import math
import fractions
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def bitlist(x,digit):
res = [0 for i in rang... | [
"expression.operation.binary.add"
] | 603,304 | 603,305 | u366541443 | python |
p02796 | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | def main(sample_file = ''):
""" convenient functions
# for i, a in enumerate(iterable)
# q, mod = divmod(a, b)
# divmod(x, y) returns the tuple (x//y, x%y)
# Higher-order function: reduce(operator.mul, xyz_count, 1)
# manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc... | [
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 603,323 | 603,324 | u988402778 | python |
p02796 | N = int(input())
# X, L = [], []
A = []
for i in range(N):
x, l = map(int, input().split())
# X.append(x)
# L.append(l)
A.append((x - l, x + l))
A.sort(key=lambda x: x[1])
ans = 0
x = -10e50
for i in range(N):
l, r = A[i]
if x <= l:
ans += 1
x = r-1
print(ans)
# 選べるロボットの中で最もX... | N = int(input())
# X, L = [], []
A = []
for i in range(N):
x, l = map(int, input().split())
# X.append(x)
# L.append(l)
A.append((x - l, x + l))
A.sort(key=lambda x: x[1])
ans = 0
x = -10e50
for i in range(N):
l, r = A[i]
if x <= l:
ans += 1
x = r
print(ans)
# 選べるロボットの中で最もX+L... | [
"expression.operation.binary.remove"
] | 603,325 | 603,326 | u731368968 | python |
p02796 | N = int(input())
robos = []
for i in range(N):
x, l = map(int, input().split())
robos.append((x - l, x + l))
robos.sort()
kosuu = 0
maenomigi = -100000000000000000000000
for hidari, migi in robos:
# ok
if maenomigi <= hidari:
maenomigi = migi
kosuu += 1
print(kosuu)
| N = int(input())
robos = []
for i in range(N):
x, l = map(int, input().split())
robos.append((x + l, x - l))
robos.sort()
kosuu = 0
maenomigi = -100000000000000000000000
for migi, hidari in robos:
# ok
if maenomigi <= hidari:
maenomigi = migi
kosuu += 1
print(kosuu)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 603,362 | 603,363 | u328099989 | python |
p02796 | n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
a = [[a[i][0]-a[i][1],a[i][0]+a[i][1]] for i in range(n)]
a.sort(key = lambda x:x[1])
ans = 1
g = a[0][1]
for i in range(1,n):
x = a[i][0]
if g>=x:
ans += 1
g = a[i][1]
print(ans) | n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
a = [[a[i][0]-a[i][1],a[i][0]+a[i][1]] for i in range(n)]
a.sort(key = lambda x:x[1])
ans = 1
g = a[0][1]
for i in range(1,n):
x = a[i][0]
if g<=x:
ans += 1
g = a[i][1]
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 603,364 | 603,365 | u905582793 | python |
p02796 | N = int(input())
A = []
for i in range(N):
x,l = map(int,input().split())
A.append([x-l+1,x+l-1])
B=sorted(A,key=lambda x: x[1])
s = B[0][1]
n = 1
for i in range(1,N):
a = B[i][0]
b = B[i][1]
if a >= s:
n += 1
s = b
print(n) | N = int(input())
A = []
for i in range(N):
x,l = map(int,input().split())
A.append([x-l,x+l])
B=sorted(A,key=lambda x: x[1])
s = B[0][1]
n = 1
for i in range(1,N):
a = B[i][0]
b = B[i][1]
if a >= s:
n += 1
s = b
print(n) | [
"expression.operation.binary.remove"
] | 603,368 | 603,369 | u328858746 | python |
p02796 | import sys
input = sys.stdin.readline
N = int(input())
l = []
for _ in range(N):
Xi, Li = map(int, input().split())
l.append((Xi-Li+1, Xi+Li-1))
l.sort(key=lambda k: k[1])
now = -10**18
ans = 0
i = 0
while i<N:
if now<l[i][0]:
now = l[i][1]
ans += 1
i += 1
print(ans) | import sys
input = sys.stdin.readline
N = int(input())
l = []
for _ in range(N):
Xi, Li = map(int, input().split())
l.append((Xi-Li, Xi+Li))
l.sort(key=lambda k: k[1])
now = -10**18
ans = 0
i = 0
while i<N:
if now<=l[i][0]:
now = l[i][1]
ans += 1
i += 1
print(ans)
| [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 603,372 | 603,373 | u047796752 | python |
p02801 | C = input()
chars = "abcdefghijklmnopqrstuvwxyz"
ls = list(chars) + list(chars)
dic = {chars[i]:chars[i+1] for i in range(26)}
print(dic[C]) | C = input()
chars = "abcdefghijklmnopqrstuvwxyz"
ls = list(chars) + list(chars)
dic = {ls[i]:ls[i+1] for i in range(26)}
print(dic[C]) | [
"assignment.value.change",
"identifier.change"
] | 603,759 | 603,760 | u006880673 | python |
p02801 | c = input()
l = [chi(i) for i in range(65, 91)]
print(l[l.index(c) + 1]) | c = input()
l = [chr(i) for i in range(97, 123)]
print(l[l.index(c) + 1])
| [
"assignment.value.change",
"identifier.change",
"call.function.change",
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.lower.change",
"control_flow.loop.range.bounds.upper.change"
] | 603,769 | 603,770 | u581403769 | python |
p02801 | s=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
a=input()
for i in range(23):
if a==s[i]:
print(s[i+1]) | s=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
a=input()
for i in range(25):
if a==s[i]:
print(s[i+1])
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 603,771 | 603,772 | u754511616 | python |
p02801 | print(char(ord(input())+1)) | print(chr(ord(input())+1)) | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 603,773 | 603,774 | u658288444 | python |
p02801 | print(input()+1) | print(chr(ord(input())+1)) | [
"call.arguments.add",
"call.arguments.change"
] | 603,775 | 603,774 | u658288444 | python |
p02801 | x=input()
arr="abcdefghijklmnopqrstuvwxyz"
arr[arr.index(x)+1] | x=input()
arr="abcdefghijklmnopqrstuvwxyz"
print(arr[arr.index(x)+1]) | [
"call.add",
"call.arguments.change"
] | 603,783 | 603,784 | u487288850 | python |
p02801 | from strings import ascii_lowercase as lc
given = input()
print(lc[lc.index(given) + 1]) | from string import ascii_lowercase as lc
given = input()
print(lc[lc.index(given) + 1]) | [
"identifier.change"
] | 603,785 | 603,786 | u674190122 | python |
p02801 | N = str(input())
chr(ord(N)+1) | N = str(input())
print(chr(ord(N)+1)) | [
"call.add",
"call.arguments.change"
] | 603,791 | 603,792 | u591143370 | python |
p02801 | # !/use/bin/python3
"""
https://atcoder.jp/contests/abc151/tasks/abc151_a
Next Alphabate
"""
def solve(c):
print(c)
ans = ord(c)
return chr(ans+1)
if __name__ == "__main__":
c = input()
print(solve(c))
| # !/use/bin/python3
"""
https://atcoder.jp/contests/abc151/tasks/abc151_a
Next Alphabate
"""
def solve(c):
ans = ord(c)
return chr(ans+1)
if __name__ == "__main__":
c = input()
print(solve(c))
| [
"call.remove"
] | 603,793 | 603,794 | u862417957 | python |
p02801 | C = input()
print(char(ord(C)+1)) | C = input()
print(chr(ord(C)+1)) | [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 603,795 | 603,796 | u068862866 | python |
p02801 | C = input()
next = ord('C') + 1
print(chr(next)) | C = input()
next = ord(C) + 1 #ord()は一文字の文字列を数値に変換する
print(chr(next)) | [
"call.arguments.change"
] | 603,809 | 603,810 | u197833153 | python |
p02801 | c=input()
alp="abcdefghijklmnopqrstuvwxyz"
for i in range(25):
if c==alp[i]:
print(alh[i+1])
break
| c=input()
alp="abcdefghijklmnopqrstuvwxyz"
for i in range(25):
if c==alp[i]:
print(alp[i+1])
break
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 603,811 | 603,812 | u088488125 | python |
p02801 | alpha="abcdefghijklmnomqrstuvwxyz"
inp=input()
def split(w):
return [all for all in w]
alpha=split(alpha)
x=alpha.index(inp)
try:
print(alpha[x+1])
except:
print("a") | alpha="abcdefghijklmnopqrstuvwxyz"
inp=input()
def split(w):
return [all for all in w]
alpha=split(alpha)
x=alpha.index(inp)
try:
print(alpha[x+1])
except:
print("a") | [
"literal.string.change",
"assignment.value.change"
] | 603,817 | 603,818 | u000085263 | python |
p02801 | s = input()
st = 'abcdefghijklmnopqrstuvwxyz'
print(st[index(s)+1]) | s = input()
st = 'abcdefghijklmnopqrstuvwxyz'
print(st[st.index(s)+1])
| [] | 603,819 | 603,820 | u531599639 | python |
p02801 | c = int(input())
C = ord(c)
print(chr(C)) | c = input()
C = ord(c)
print(chr(C+1)) | [
"call.remove",
"call.arguments.change"
] | 603,821 | 603,822 | u853728588 | python |
p02801 | c = ord(input())
print(chr(c)) | c = ord(input())
print(chr(c+1)) | [
"expression.operation.binary.add"
] | 603,825 | 603,826 | u175590965 | python |
p02801 | ch = ord(input())
print(chr(ord(ch) + 1))
| ch = input()
print(chr(ord(ch) + 1)) | [
"call.remove",
"call.arguments.change"
] | 603,834 | 603,835 | u652155485 | python |
p02801 | ac = input()
acc ='abcdefghijklmnopqrstuvwxyx'
print(acc[acc.index(ac) + 1]) | ac = input()
acc ='abcdefghijklmnopqrstuvwxyz'
print(acc[acc.index(ac) + 1]) | [
"literal.string.change",
"assignment.value.change"
] | 603,838 | 603,839 | u629540524 | python |
p02801 | c = input()
c = ord(c + 1)
print(c) | c = input()
c = ord(c) + 1
print(chr(c)) | [
"call.arguments.change",
"call.arguments.add"
] | 603,845 | 603,846 | u357751375 | python |
p02801 | c = input()
c = c + 1
print(c) | c = input()
c = ord(c) + 1
print(chr(c)) | [
"call.add",
"call.arguments.change"
] | 603,847 | 603,846 | u357751375 | python |
p02801 | al = abcdefghijklmnopqrstuvwxyz
C = input()
print(al[al.index(C)+1]) | al = "abcdefghijklmnopqrstuvwxyz"
C = input()
print(al[al.index(C)+1]) | [] | 603,848 | 603,849 | u841568901 | python |
p02801 | c = input()
ord_s = ord(c)
chr_s = chr(ord_s)
print(chr_s) | c = input()
ord_s = ord(c)
chr_s = chr(ord_s+1)
print(chr_s) | [
"assignment.change"
] | 603,876 | 603,877 | u471503862 | python |
p02801 | C=input()
chr(ord(C) + 1) | C=input()
print(chr(ord(C) + 1)) | [
"call.add",
"call.arguments.change"
] | 603,882 | 603,883 | u494295478 | python |
p02801 | a = input()
print(char(ord(a)+1)) | a = input()
print(chr(ord(a)+1))
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 603,892 | 603,893 | u026155812 | python |
p02801 | C = input()
print(chr(ord('C') + 1))
| C = input()
print(chr(ord(C) + 1)) | [
"call.arguments.change"
] | 603,894 | 603,895 | u685244071 | python |
p02801 | l="abcdefghijklmnopqrstuvwxy"
print(l[l.index(input())+1]) | l="abcdefghijklmnopqrstuvwxyz"
print(l[l.index(input())+1]) | [
"literal.string.change",
"assignment.value.change"
] | 603,899 | 603,900 | u332793228 | python |
p02801 | alphabet = 'abcdefghijklmnopqrstuvwxyz'
print(alphabet[alphabet.find('a') + 1]) | alphabet = 'abcdefghijklmnopqrstuvwxyz'
print(alphabet[alphabet.find(input()) + 1]) | [] | 603,901 | 603,902 | u856775981 | python |
p02801 |
c = raw_input()
ls = [chr(ord('a') + i) for i in range(26)]
for i in range(len(ls)):
if ls[i] == c:
print(ls[i + 1])
break
|
c = input()
ls = [chr(ord('a') + i) for i in range(26)]
for i in range(len(ls)):
if ls[i] == c:
print(ls[i + 1])
break
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 603,907 | 603,908 | u916662650 | python |
p02801 | 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()))
S=input()
A=['a','b','c','b','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y'... | 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()))
S=input()
A=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y'... | [
"literal.string.change",
"assignment.value.change"
] | 603,923 | 603,924 | u525796732 | python |
p02801 | print(chr(ord(str(input())+1))) | print(chr(ord(str(input()))+1)) | [
"call.arguments.change"
] | 603,929 | 603,930 | u383450070 | python |
p02801 | A = "abcdefghijklmnopqrstu"
c = input()
print(A[A.index(c)+1])
| A = "abcdefghijklmnopqrstuvwxyz"
c = input()
print(A[A.index(c)+1])
| [
"literal.string.change",
"assignment.value.change"
] | 603,937 | 603,938 | u572343785 | python |
p02801 | a="abcdefghijklmnopgrstuvwxyz"
b=input()
c=0
while True:
if b==a[c]:
print(a[c+1])
break
c+=1 | a="abcdefghijklmnopqrstuvwxyz"
b=input()
c=0
while True:
if b==a[c]:
print(a[c+1])
break
c+=1 | [
"literal.string.change",
"assignment.value.change"
] | 603,941 | 603,942 | u156383602 | python |
p02801 | C = input()
print(chr(ord(C))) | C = input()
print(chr(ord(C)+1))
| [
"expression.operation.binary.add"
] | 603,947 | 603,948 | u425762225 | python |
p02801 | C=input()
print(str(ord(C)+1))
| C=input()
print(chr(ord(C)+1))
| [
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 603,957 | 603,958 | u375616706 | python |
p02801 | al = list("abcdefghijklmn")
C = input()
print(al[al.index(C)+1]) | al = list("abcdefghijklmnopqrstuvwxyz")
C = input()
print(al[al.index(C)+1]) | [
"literal.string.change",
"assignment.value.change",
"call.arguments.change"
] | 603,965 | 603,966 | u884323674 | python |
p02801 | import sys, string
c = sys.stdin.readline().rstrip()
a = string.ascii_lowercase
i = a.index('c') + 1
print(a[i])
| import sys, string
c = sys.stdin.readline().rstrip()
a = string.ascii_lowercase
i = a.index(c) + 1
print(a[i]) | [
"call.arguments.change"
] | 603,975 | 603,976 | u823885866 | python |
p02801 | c=input()
z='abcdefghijklmnopqrstuvwxy'
print(z[z.index(c)+1]) | c=input()
z='abcdefghijklmnopqrstuvwxyz'
print(z[z.index(c)+1]) | [
"literal.string.change",
"assignment.value.change"
] | 603,977 | 603,978 | u235066013 | python |
p02801 | a = ord(input())+1
print(a)
| a = chr(ord(input())+1)
print(a)
| [
"call.add",
"call.arguments.change"
] | 603,985 | 603,986 | u084320347 | python |
p02801 | al = [ord(i) for i in range(ord("a"), ord("a")+26)]
str = input()
print(al[al.index(str)+1]) | al = [chr(i) for i in range(ord("a"), ord("a")+26)]
str = input()
print(al[al.index(str)+1])
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 603,989 | 603,990 | u674052742 | python |
p02801 | alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
print(alphabet[alphabet.index(input())]) | alphabet = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
print(alphabet[alphabet.index(input())+1]) | [
"expression.operation.binary.add"
] | 603,991 | 603,992 | u033524082 | python |
p02801 | C=input()
str='abcdefghijtlmnopqrstuvwxyz'
print(str[str.index(C)+1]) | C=input()
str='abcdefghijklmnopqrstuvwxyz'
print(str[str.index(C)+1]) | [
"literal.string.change",
"assignment.value.change"
] | 603,993 | 603,994 | u233183615 | python |
p02801 | al = 'abcdefghijklmnopqrstuvwxy'
c = input()
print(al[al.index(c)+1]) | al = 'abcdefghijklmnopqrstuvwxyz'
c = input()
print(al[al.index(c)+1]) | [
"literal.string.change",
"assignment.value.change"
] | 604,004 | 604,005 | u175034939 | python |
p02801 | s = input()
print(chr(ord(s + 1))) | s = input()
print(chr(ord(s) + 1)) | [
"call.arguments.change"
] | 604,028 | 604,029 | u026862065 | python |
p02801 | # simply use double ifs
s = input()
print(chr(ord(s))+1)
| # simply use double ifs
s = input()
print(chr(ord(s)+1)) | [
"call.arguments.change"
] | 604,063 | 604,064 | u024340351 | python |
p02801 | alph = input()
print(ord(alph+1)) | alph = input()
print(chr(ord(alph)+1)) | [
"call.arguments.add",
"call.arguments.change"
] | 604,067 | 604,068 | u265118937 | python |
p02801 | alph = input()
print(ord(alph)+1) | alph = input()
print(chr(ord(alph)+1)) | [
"call.arguments.add",
"call.arguments.change"
] | 604,069 | 604,068 | u265118937 | python |
p02801 | x = ord(input())
ind = (x - ord("A")+1)%26
print(chr(ind+ord("A"))) | x = ord(input())
ind = (x - ord("a")+1)%26
print(chr(ind+ord("a"))) | [
"literal.string.change",
"literal.string.case.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 604,072 | 604,073 | u545368057 | python |
p02801 | c = input()
al = "abcdefghijklmnopqrstuvwxz"
print(al[al.index(c)+1]) | c = input()
al = "abcdefghijklmnopqrstuvwxyz"
print(al[al.index(c)+1]) | [
"literal.string.change",
"assignment.value.change"
] | 604,139 | 604,140 | u995163736 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.