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 |
|---|---|---|---|---|---|---|---|
p02765 | inp=list(map(int,input().strip().split()))[:2]
n,r=inp[0],inp[1]
if(n < 9):
print(100*(10-r))
else:
print(r) | inp=list(map(int,input().strip().split()))[:2]
n,r=inp[0],inp[1]
if(n <= 9):
print(100*(10-n)+r)
else:
print(r)
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 556,482 | 556,481 | u065994196 | python |
p02765 | from sys import stdin
N, R = [int(x) for x in stdin.readline().rstrip().split()]
if N >= 10:
print(R)
else:
print(R - (100*(10 - N)))
| from sys import stdin
N, R = [int(x) for x in stdin.readline().rstrip().split()]
if N >= 10:
print(R)
else:
print(R + (100*(10 - N)))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,490 | 556,491 | u868981240 | python |
p02765 | from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_... | from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,511 | 556,512 | u193264896 | python |
p02765 | N,R = map(int,input().split())
if N >= 10 :
print(R)
elif N < 10 :
print(100*(10-N)) | N,R = map(int,input().split())
if N >= 10 :
print(R)
else :
print(R+100*(10-N)) | [
"expression.operation.binary.add"
] | 556,526 | 556,527 | u309018392 | python |
p02765 | N,R = map(int,input().split())
if N >= 10 :
print(R)
else :
print(100*(10-N)) | N,R = map(int,input().split())
if N >= 10 :
print(R)
else :
print(R+100*(10-N)) | [
"expression.operation.binary.add"
] | 556,528 | 556,527 | u309018392 | python |
p02765 | import sys
n, r = map(int, sys.stdin.readline().split())
def main():
i = r + 100 * (10 - n)
print(i)
if __name__ == '__main__':
main() | import sys
n, r = map(int, sys.stdin.readline().split())
def main():
i = r + 100 * max(10 - n, 0)
print(i)
if __name__ == '__main__':
main() | [
"call.add",
"call.arguments.add"
] | 556,533 | 556,534 | u254871849 | python |
p02765 | n = input().split()
print(n)
if int(n[0]) >= 10:
print(n[1])
else:
print(100 * (10 - int(n[0])) + int(n[1])) | n = input().split()
if int(n[0]) >= 10:
print(n[1])
else:
print(100 * (10 - int(n[0])) + int(n[1])) | [
"call.remove"
] | 556,535 | 556,536 | u806084713 | python |
p02765 | N, R = map(int, input().split(" "))
if N >= 10:
print(R)
else:
print(R + 100 * (10 - K)) | N, R = map(int, input().split(" "))
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,546 | 556,547 | u198062737 | python |
p02765 | n, r = map(int, input().split())
print(r + 100*max(10-k, 0)) | n, r = map(int, input().split())
print(r + 100*max(10-n, 0)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,576 | 556,577 | u372550522 | python |
p02765 | n, r = [int(i) for i in input().split(" ")]
print(r if n >= 10 else r - 100 * (10 - n)) | n, r = [int(i) for i in input().split(" ")]
print(r if n >= 10 else r + 100 * (10 - n)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,585 | 556,586 | u303943871 | python |
p02765 | N ,R = map(int, input().split())
if N >=10:
print(R)
else:
r = 100*(10 - N)
R = R - r
print(R) | N ,R = map(int, input().split())
if N >=10:
print(R)
else:
r = 100*(10 - N)
R = R + r
print(R) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,594 | 556,595 | u830770242 | python |
p02765 | N ,R = map(int, input().split())
if N >=10:
print(R)
else:
r = 100*(10 - N)
R = R -n
print(R)
| N ,R = map(int, input().split())
if N >=10:
print(R)
else:
r = 100*(10 - N)
R = R + r
print(R) | [] | 556,596 | 556,595 | u830770242 | python |
p02765 | def main():
N,R = map(int,input().split())
if N > 11:
a = 100 * (10 - N)
print(a + R)
else:
print(R)
main() | def main():
N,R = map(int,input().split())
if N < 11:
a = 100 * (10 - N)
print(a + R)
else:
print(R)
main() | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 556,632 | 556,633 | u031722966 | python |
p02765 | n,ans = str(input()).split()
if int(n)<10:
ans = int(ans) - (100*(10-int(n)))
print(int(ans)) | n,ans = str(input()).split()
if int(n)<10:
ans = int(ans) + (100*(10-int(n)))
print(int(ans)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,639 | 556,640 | u813993459 | python |
p02765 | n,r=map(int(input().split()))
if n<10:
r+=100*(10-n)
print(r) | n,r=map(int,input().split())
if n<10:
r+=100*(10-n)
print(r) | [
"assignment.value.change",
"call.arguments.change"
] | 556,655 | 556,656 | u197921942 | python |
p02765 | n,r=map(int(input()))
if n<10:
r+=100*(10-n)
print(r) | n,r=map(int,input().split())
if n<10:
r+=100*(10-n)
print(r) | [
"assignment.value.change",
"call.arguments.change"
] | 556,657 | 556,656 | u197921942 | python |
p02765 | n,r=map(int,input().split())
if n<10:
r-=100*(10-n)
print(r) | n,r=map(int,input().split())
if n<10:
r+=100*(10-n)
print(r) | [
"expression.operator.change"
] | 556,658 | 556,656 | u197921942 | python |
p02765 | N,R = map(int,input().split())
if N >= 10:
answer = R
else:
answer = R - 100 * (10 - N )
print(answer)
| N,R = map(int,input().split())
if N >= 10:
answer = R
else:
answer = R + 100 * (10 - N )
print(answer) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,659 | 556,660 | u063346608 | python |
p02765 | s = input().split()
N = int(s[0])
R = int(s[1])
if N < 9:
ans = R + 100 *(10 - N)
else:
ans = R
print(ans) | s = input().split()
N = int(s[0])
R = int(s[1])
if N < 10:
ans = R + 100 *(10 - N)
else:
ans = R
print(ans) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 556,707 | 556,708 | u749512407 | python |
p02765 | n,r = list(map(int,input().split()))
if n>=10:
print(r)
else:
t = 100*(10-n)
print(r-t) | n,r = list(map(int,input().split()))
if n>=10:
print(r)
else:
t = 100*(10-n)
print(r+t) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,709 | 556,710 | u896451538 | python |
p02765 | a,b = map(int,input().split())
if a >= 10:
print(b)
else :
print(b + a*100) | a,b = map(int,input().split())
if a >= 10:
print(b)
else :
print(b + ((10-a)*100)) | [
"call.arguments.change"
] | 556,723 | 556,724 | u408958033 | python |
p02765 | def main():
N, R = map(int, input().split())
if N >= 10: return R
else: return R - 100 * (10 - N)
if __name__ == '__main__':
print(main()) | def main():
N, R = map(int, input().split())
if N >= 10: return R
else: return R + 100 * (10 - N)
if __name__ == '__main__':
print(main())
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 556,758 | 556,759 | u116002573 | python |
p02765 | N,R = map(int,input().split())
if N >= 10:
rat = R
else:
rat = R - 100*(10-N)
print(int(rat)) | N,R = map(int,input().split())
if N >= 10:
rat = R
else:
rat = R + 100*(10-N)
print(int(rat)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,768 | 556,769 | u517930510 | python |
p02765 | N,R = map(int,input().split())
if N > 9:
print(R)
else:
print(R -1000 +100*N) | N,R = map(int,input().split())
if N > 9:
print(R)
else:
print(R +1000 -100*N) | [
"expression.operation.binary.remove"
] | 556,770 | 556,771 | u185424824 | python |
p02765 | n, r = map(int, input().split())
if n < 10:
print(r + 100*(10-k))
else:
print(r) | n, r = map(int, input().split())
if n < 10:
print(r + 100*(10-n))
else:
print(r) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,786 | 556,787 | u524489226 | python |
p02765 | n, r = map(int, input().split())
print(n, r)
ans = 0
if n >= 10:
ans = r
else:
ans = r + (100 * (10 - n))
print(ans) | n, r = map(int, input().split())
ans = 0
if n >= 10:
ans = r
else:
ans = r + (100 * (10 - n))
print(ans) | [
"call.remove"
] | 556,796 | 556,797 | u079182025 | python |
p02765 | a, m = map(int, input().split())
if a >=10:
print(m)
else:
out = m - 100 *(10-a)
if out <= 1:
print(1)
else:
print(out) | a, m = map(int, input().split())
if a >=10:
print(m)
else:
out = m + 100 *(10-a)
if out <= 1:
print(1)
else:
print(out) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,813 | 556,814 | u267029978 | python |
p02765 | N, R = list(map(int, input().split()))
ans = R - 100 * max((10 - N), 0)
print(ans)
| N, R = list(map(int, input().split()))
ans = R + 100 * max((10 - N), 0)
print(ans)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,816 | 556,817 | u325264482 | python |
p02765 | N,R = list(map(int,input().split()))
if N >= 10:
print(R)
else:
print(R-100*(10-N)) | N,R = list(map(int,input().split()))
if N >= 10:
print(R)
else:
print(100*(10-N)+R) | [
"expression.operation.binary.remove"
] | 556,823 | 556,824 | u489762173 | python |
p02765 | N,R = list(map(int,input().split()))
if N >= 10:
print(R)
else:
print(100*(10-N)) | N,R = list(map(int,input().split()))
if N >= 10:
print(R)
else:
print(100*(10-N)+R) | [
"expression.operation.binary.add"
] | 556,825 | 556,824 | u489762173 | python |
p02765 | n, r = map(int,input().split())
print(100*(10-n) if n < 10 else r) | n, r = map(int,input().split())
print(r+100*(10-n) if n < 10 else r) | [
"expression.operation.binary.add"
] | 556,828 | 556,829 | u463775490 | python |
p02765 | def main():
K = 0
N, R = [int(_) for _ in input().split()]
if N >= 10:
K = R
else:
K = R + 100(10 - N)
print(K)
main() | def main():
K = 0
N, R = [int(_) for _ in input().split()]
if N >= 10:
K = R
else:
K = R + 100 * (10 - N)
print(K)
main() | [] | 556,830 | 556,831 | u571395477 | python |
p02765 | N, R = map(int, input().split())
if N >= 10:
ans = R
else:
ans = R - 100 * (10 - N)
print(ans) | N, R = map(int, input().split())
if N >= 10:
ans = R
else:
ans = R + 100 * (10 - N)
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,832 | 556,833 | u732870425 | python |
p02765 | N, R = map(int, input().split())
if N >= 10:
ans = R
else:
ans = R - 100 * (10 - K)
print(ans) | N, R = map(int, input().split())
if N >= 10:
ans = R
else:
ans = R + 100 * (10 - N)
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 556,834 | 556,833 | u732870425 | python |
p02765 | deta = input().split()
n = deta[0]
r = deta[1]
if int(n)>=10:
print(r)
else:
rate = 100*(10-int(n))
print(rate) | deta = input().split()
n = deta[0]
r = deta[1]
if int(n)>=10:
print(r)
else:
rate = 100*(10-int(n))+int(r)
print(rate) | [
"assignment.change"
] | 556,835 | 556,836 | u953379577 | python |
p02765 | """
じょえチャンネルおもしろいよ～～～
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n,r=map(int,input().split())
if n==10:print(r)
else:print(r+100*(10-n)) | """
じょえチャンネルおもしろいよ～～～
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n,r=map(int,input().split())
if n>=10:print(r)
else:print(r+100*(10-n)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 556,844 | 556,845 | u227082700 | python |
p02765 | """
じょえちゃんねる
高評価・チャンネル登録よろしくお願いします！
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + 100 * (10 - k))
| """
じょえちゃんねる
高評価・チャンネル登録よろしくお願いします！
https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
"""
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + 100 * (10 - n))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,846 | 556,847 | u143509139 | python |
p02765 | N,R = input().split()
N = int(N)
R = int(R)
if N >= 10:
print(R)
else:
print(100*(10-N)) | N,R = input().split()
N = int(N)
R = int(R)
if N >= 10:
print(R)
else:
print(R + 100*(10-N)) | [
"expression.operation.binary.add"
] | 556,852 | 556,853 | u651822741 | python |
p02765 | N,R = input()
N = int(N)
R = int(R)
if N >= 10:
print(R)
else:
print(100*(10-N)) | N,R = input().split()
N = int(N)
R = int(R)
if N >= 10:
print(R)
else:
print(R + 100*(10-N)) | [
"expression.operation.binary.add"
] | 556,854 | 556,853 | u651822741 | python |
p02765 | N,R=map(int, input().split())
print(R if N>=10 else R-100*(10-N)) | N,R=map(int, input().split())
print(R if N>=10 else R+100*(10-N))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,857 | 556,856 | u748311048 | python |
p02765 | i = list(map(int, input().split()))
N = i[0]
R = i[1]
if N >= 10:
insc = R
else:
insc = R + 100(10-N)
print(insc) | i = list(map(int, input().split()))
N = i[0]
R = i[1]
if N >= 10:
insc = R
else:
insc = R + 100*(10-N)
print(insc) | [] | 556,858 | 556,859 | u891125728 | python |
p02765 | N,R=list(map(int,input().split()))
if N>=10:
print(R)
else:
print(A+100*(10-N))
| N,R=list(map(int,input().split()))
if N>=10:
print(R)
else:
print(R+100*(10-N)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,866 | 556,867 | u903179665 | python |
p02765 | import sys
input = sys.stdin.readline
N, R = [int(x) for x in input().split()]
if N >= 10:
print(R)
else:
print(R + 100 * (10 - K)) | import sys
input = sys.stdin.readline
N, R = [int(x) for x in input().split()]
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,868 | 556,869 | u609061751 | python |
p02765 | import sys
input = sys.stdin.readline
N, R = [int(x) for x in input().split()]
if N >= 10:
print(R)
else:
print(R + 100 * (10 - R)) | import sys
input = sys.stdin.readline
N, R = [int(x) for x in input().split()]
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,870 | 556,869 | u609061751 | python |
p02765 | _input = input()
number = _input.split()
N = number[0]
R = number[1]
if N<10:
R += 100 * (10-N)
print(R)
| _input = input()
number = _input.split()
N = int(number[0])
R = int(number[1])
if N<10:
R += 100 * (10-N)
print(R)
| [
"call.add",
"call.arguments.change"
] | 556,879 | 556,880 | u052331051 | python |
p02765 | n,r = map(int,input().split())
print(r if n >= 10 else 100*(10-n)) | n,r = map(int,input().split())
print(r if n >= 10 else r+100*(10-n)) | [
"expression.operation.binary.add"
] | 556,883 | 556,884 | u836737505 | python |
p02765 | n,r=map(int,input.split())
if n >= 10:
print(r)
else:
in_rate = r + 100 * (10-n)
print(in_rate) | n,r = map(int,input().split())
if n >= 10:
print(r)
else:
in_rating = r + 100 * (10-n)
print(in_rating)
| [
"call.add",
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 556,887 | 556,886 | u752522099 | python |
p02765 | n,r=map(int,input.split())
if n >= 10:
print(r)
else:
in_rate = r + 100 * (10-n)
print(in_rate) | n,r = map(int,input().split())
if n >= 10:
print(r)
else:
in_rating = r + 100 * (10-n)
print(in_rating)
| [
"call.add",
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 556,887 | 556,888 | u752522099 | python |
p02765 | n,r=map(int,input.split())
if n >= 10:
print(r)
else:
in_rate = r + 100 * (10-n)
print(in_rate) | n,r=map(int,input().split())
if n >= 10:
print(r)
else:
in_rate = r + 100 * (10-n)
print(in_rate)
| [
"call.add"
] | 556,887 | 556,889 | u752522099 | python |
p02763 | class SegmentTree():
"""A segment Tree.
This is a segment tree without recursions.
This can support queries as follows:
- update a single value in O(logN).
- get the folded value of values in a segment [l, r) in O(logN)
N is the length of the given iterable value.
Parameters
--------... | class SegmentTree():
"""A segment Tree.
This is a segment tree without recursions.
This can support queries as follows:
- update a single value in O(logN).
- get the folded value of values in a segment [l, r) in O(logN)
N is the length of the given iterable value.
Parameters
--------... | [
"expression.operation.binary.add"
] | 556,911 | 556,912 | u034128150 | python |
p02763 | import sys
input = lambda: sys.stdin.readline().rstrip()
class SegTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.ide_ele = ide_ele
self.segfunc = segfunc
self.num = 2**(n - 1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
fo... | import sys
input = lambda: sys.stdin.readline().rstrip()
class SegTree:
def __init__(self, init_val, segfunc, ide_ele):
n = len(init_val)
self.ide_ele = ide_ele
self.segfunc = segfunc
self.num = 2**(n - 1).bit_length()
self.seg = [self.ide_ele] * 2 * self.num
fo... | [
"expression.operation.binary.add"
] | 556,917 | 556,918 | u163783894 | python |
p02763 | from bisect import bisect_left,bisect_right
import string
dic = {c:[] for c in string.ascii_lowercase}
n = int(input())
s = list(input())
q = int(input())
for i,c in enumerate(s,start=1):
dic[c].append(i)
print(dic)
for i in range(q):
p,l,r = map(str,input().split())
if p =='1':
j = int(l)
if r == s[... | from bisect import bisect_left,bisect_right
import string
dic = {c:[] for c in string.ascii_lowercase}
n = int(input())
s = list(input())
q = int(input())
for i,c in enumerate(s,start=1):
dic[c].append(i)
for i in range(q):
p,l,r = map(str,input().split())
if p =='1':
j = int(l)
if r == s[j-1]:
... | [
"call.remove"
] | 556,919 | 556,920 | u572142121 | python |
p02763 | class segtree:
def __init__(self,N):
self.n=(1<<len(bin(N-1)[2:]))
self.x=[0 for _ in range(2*self.n)]
def build(self,seq):
for i, j in enumerate(seq, start=self.n):
self.x[i]=1<<j
for i in range(self.n-1, 0, -1):
self.x[i]=self.x[i*2]|self.x[i*2+1]
de... | class segtree:
def __init__(self,N):
self.n=(1<<len(bin(N-1)[2:]))
self.x=[0 for _ in range(2*self.n)]
def build(self,seq):
for i, j in enumerate(seq, start=self.n):
self.x[i]=1<<j
for i in range(self.n-1, 0, -1):
self.x[i]=self.x[i*2]|self.x[i*2+1]
de... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 556,926 | 556,927 | u260216890 | python |
p02763 | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def update(i, val, n, bi_tree, sign=1):
i += 1
while i < n:
bi_tree[i][val] += (1 * sign)
i += i & -i
def get_sum(i, bi_tree):
ans = [0] * 26
while i > 0:
tmp = bi_tree[i]
for j in range(26):
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
def update(i, val, n, bi_tree, sign=1):
i += 1
while i < n:
bi_tree[i][val] += (1 * sign)
i += i & -i
def get_sum(i, bi_tree):
ans = [0] * 26
while i > 0:
tmp = bi_tree[i]
for j in range(26):
... | [
"expression.operation.binary.add"
] | 556,958 | 556,959 | u200785298 | python |
p02763 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
... | [
"call.remove"
] | 556,969 | 556,970 | u802977614 | python |
p02763 | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
... | import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
... | [
"call.remove",
"call.arguments.change"
] | 556,971 | 556,972 | u168579419 | python |
p02763 | 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... | [
"expression.operation.binary.add"
] | 556,980 | 556,981 | u988402778 | python |
p02763 | import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
... | import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
... | [
"call.add",
"call.arguments.change"
] | 557,026 | 557,027 | u179169725 | python |
p02763 | class SegmentTree():
"""一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する。
built(array) := arrayを初期値とするセグメント木を構築する O(N)。
update(i, val) := i番目の要素をvalに変更する。
get_val(l, r) := 区間[l, r)に対する二項演算の畳み込みの結果を返す。
"""
def __init__(self, n, op, e):
"""要素数、二項演算、単位元を引数として渡す
例) 区間最小値 SegmentTree(n, min,... | class SegmentTree():
"""一点更新、区間取得クエリをそれぞれO(logN)で答えるデータ構造を構築する。
built(array) := arrayを初期値とするセグメント木を構築する O(N)。
update(i, val) := i番目の要素をvalに変更する。
get_val(l, r) := 区間[l, r)に対する二項演算の畳み込みの結果を返す。
"""
def __init__(self, n, op, e):
"""要素数、二項演算、単位元を引数として渡す
例) 区間最小値 SegmentTree(n, min,... | [
"assignment.change"
] | 557,043 | 557,044 | u794173881 | python |
p02763 | import sys
input = sys.stdin.readline
def segfunc(x,y):
return x | y
def init(init_val):
#set_val
for i in range(n):
seg[i+num-1]=init_val[i]
#built
for i in range(num-2,-1,-1) :
seg[i]=segfunc(seg[2*i+1],seg[2*i+2])
def update(k,x):
k += num-1
seg[k] = x
while k:
... | import sys
input = sys.stdin.readline
def segfunc(x,y):
return x | y
def init(init_val):
#set_val
for i in range(n):
seg[i+num-1]=init_val[i]
#built
for i in range(num-2,-1,-1) :
seg[i]=segfunc(seg[2*i+1],seg[2*i+2])
def update(k,x):
k += num-1
seg[k] = x
while k:
... | [
"expression.operation.binary.add"
] | 557,047 | 557,048 | u623231048 | python |
p02765 | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R + N)
else :
print(100*(10-N)) | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N) + R) | [
"expression.operation.binary.remove"
] | 557,064 | 557,065 | u288430479 | python |
p02765 | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N)) | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N) + R) | [
"expression.operation.binary.add"
] | 557,066 | 557,065 | u288430479 | python |
p02765 | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R + N)
else :
print(100*(10-N)) | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N) + R) | [
"expression.operation.binary.remove"
] | 557,064 | 557,067 | u288430479 | python |
p02765 | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N)) | A = input().split( )
N = int(A[0])
R = int(A[1])
if N >= 10:
print(R)
else :
print(100*(10-N) + R) | [
"expression.operation.binary.add"
] | 557,066 | 557,067 | u288430479 | python |
p02765 | a, b = map(int, input().split)
print(b + max(0, 10 -a)) | a, b = map(int, input().split())
print(b + (max(0, 10 -a) * 100) ) | [
"call.add",
"call.arguments.change"
] | 557,069 | 557,070 | u832871520 | python |
p02765 | N,R = map(int, input().split())
if N < 10:
R = R - (100 * (10 - N))
if R < 0:
R = 0
print(R) | N,R = map(int, input().split())
if N < 10:
R = R + (100 * (10 - N))
if R < 0:
R = 0
print(R) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,079 | 557,080 | u482157295 | python |
p02765 | i = list(map(int, input().split()))
N = i[0]
R = i[1]
result = R if N >= 10 else R - 100 * (10 - N)
print(result) | i = list(map(int, input().split()))
N = i[0]
R = i[1]
result = R if N >= 10 else R + 100 * (10 - N)
print(result) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,081 | 557,082 | u504194367 | python |
p02765 | i = list(map(int, input().split()))
N = i[0]
R = i[1]
result = R if N >= 10 else 100 * (10 - N)
print(result) | i = list(map(int, input().split()))
N = i[0]
R = i[1]
result = R if N >= 10 else R + 100 * (10 - N)
print(result) | [
"assignment.change"
] | 557,083 | 557,082 | u504194367 | python |
p02765 | def resolve():
N, R = map(int, input().split())
if N < 10:
print(R)
else:
R = R + 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R + 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 557,111 | 557,112 | u644546699 | python |
p02765 | def resolve():
N, R = map(int, input().split())
if N < 10:
print(R)
else:
R = R - 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R + 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,114 | 557,112 | u644546699 | python |
p02765 | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R - 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R + 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,115 | 557,112 | u644546699 | python |
p02765 | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R - 100 * (10 - K)
print(R)
if __name__ == "__main__":
resolve() | def resolve():
N, R = map(int, input().split())
if N >= 10:
print(R)
else:
R = R + 100 * (10 - N)
print(R)
if __name__ == "__main__":
resolve() | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 557,116 | 557,112 | u644546699 | python |
p02765 | m,n = map(int,input().split())
if m>=10:
print(n)
else:
print(n+(100-m)) | m,n = map(int,input().split())
if m>=10:
print(n)
else:
print(n+(100*(10-m))) | [
"call.arguments.change"
] | 557,117 | 557,118 | u089032511 | python |
p02765 | m,n = map(int,input().split())
if m>=10:
print(n)
else:
print(n-(100-m)) | m,n = map(int,input().split())
if m>=10:
print(n)
else:
print(n+(100*(10-m))) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,119 | 557,118 | u089032511 | python |
p02765 | m,n = map(int,input().split())
if m>9:
print(n)
else:
print(n+(100-m)) | m,n = map(int,input().split())
if m>=10:
print(n)
else:
print(n+(100*(10-m))) | [
"call.arguments.change"
] | 557,121 | 557,118 | u089032511 | python |
p02765 | l = list(map(int, input().split()))
N = l[0]
R = l[1]
if N >= 10:
print(R)
else:
printint((R + 100(10 - N)))
| l = list(map(int, input().split()))
N = l[0]
R = l[1]
if N >= 10:
print(R)
elif N < 10:
print((R + 100 * (10 - N)))
| [
"control_flow.branch.if.condition.change",
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.change"
] | 557,124 | 557,125 | u163874353 | python |
p02765 | n, r = map(int, input().split())
print(r - (10 - min(n, 10)) * 100) | n, r = map(int, input().split())
print(r + (10 - min(n, 10)) * 100)
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,131 | 557,132 | u975039852 | python |
p02765 | N, R = int(input().split())
if N < 10:
N = R + 100 * (10 - N)
print(N)
else:
N = R
print(N) | N, R = (int(x) for x in input().split())
if N < 10:
N = R + 100 * (10 - N)
print(N)
else:
N = R
print(N) | [] | 557,135 | 557,136 | u288547705 | python |
p02765 | n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r - 100 * (10 - n)) | n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + 100 * (10 - n)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,144 | 557,145 | u347452770 | python |
p02765 | n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(100 * (10 - n)) | n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + 100 * (10 - n)) | [
"expression.operation.binary.add"
] | 557,146 | 557,145 | u347452770 | python |
p02765 | N, R = map(int, input().split())
print(R+100*(10-min(10,K))) | N, R = map(int, input().split())
print(R+100*(10-min(10,N))) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,152 | 557,153 | u047816928 | python |
p02765 | n,r =int(input().split())
if n < 10 :
print(100 * (10 - n) + r)
else:
print(r) | n,r =map(int,input().split())
if n < 10 :
print(100 * (10 - n) + r)
else:
print(r) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 557,156 | 557,157 | u932225778 | python |
p02765 | n,r = map(int(input(),split()))
if n < 10 :
print(100 * (10 - n) + r)
else:
print(r) | n,r =map(int,input().split())
if n < 10 :
print(100 * (10 - n) + r)
else:
print(r) | [
"assignment.value.change",
"call.arguments.change"
] | 557,158 | 557,157 | u932225778 | python |
p02765 | a,b=map(int,input().split())
if a >=10:
c=int(b)
print(c)
else:
c=int(b-1000+100*a)
print(c)
| a,b=map(int,input().split())
if a >=10:
c=int(b)
print(c)
else:
c=int(b+1000-100*a)
print(c)
| [
"expression.operation.binary.remove"
] | 557,162 | 557,163 | u403547519 | python |
p02765 | a,b=map(int,input().split())
print(b if a>=10 else b+100*(10-b)) | a,b=map(int,input().split())
print(b if a>=10 else b+100*(10-a)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,164 | 557,165 | u123745130 | python |
p02765 | n, r = map(int, input().split())
if n < 10:
ans = r - (100 * (10 - n))
print(ans)
else:
print(r) | n, r = map(int, input().split())
if n < 10:
ans = r + (100 * (10 - n))
print(ans)
else:
print(r) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,174 | 557,175 | u375172966 | python |
p02765 | N, R = map(int, input().split(' '))
if N < 9:
L = R+100*(10-N)
print('{}'.format(L))
else:
print('{}'.format(R))
| N, R = map(int, input().split(' '))
if N < 10:
L = R+100*(10-N)
print('{}'.format(L))
else:
print('{}'.format(R))
| [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 557,178 | 557,179 | u670606123 | python |
p02765 | n, r = map(int,input().split())
print(r)
if n < 10:
r = r + 100*(10-n)
print(r) | n, r = map(int,input().split())
if n < 10:
r = r + 100*(10-n)
print(r) | [
"call.remove"
] | 557,193 | 557,194 | u774197297 | python |
p02765 | N, R = map(int, input().split())
A = int(0)
if N>=10:
A = N
else:
A = 100*(10-N)+R
print(A) | N, R = map(int, input().split())
A = int(0)
if N>=10:
A = R
else:
A = 100*(10-N)+R
print(A) | [
"assignment.value.change",
"identifier.change"
] | 557,205 | 557,206 | u507237474 | python |
p02765 | n,r = map(int,input().split())
a = min(10,n)
a = 100*(10-a)
print(r-a) | n,r = map(int,input().split())
a = min(10,n)
a = 100*(10-a)
print(r+a) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,211 | 557,212 | u424967964 | python |
p02765 | a = [int(i) for i in a.split()]
# N:参加回数 R:表示レーティング
N = a[0]
R = a[1]
# X:内部レーティング
#R = X - 100 * (10 - N)
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) | a = [int(i) for i in input().split()]
# N:参加回数 R:表示レーティング
N = a[0]
R = a[1]
# X:内部レーティング
#R = X - 100 * (10 - N)
if N >= 10:
print(R)
else:
print(R + 100 * (10 - N)) | [
"assignment.value.change",
"call.add"
] | 557,216 | 557,217 | u108072608 | python |
p02765 | a = input().split()
a=[int(i) for i in a]
n,r=a[0],a[1]
if n>=9:
b=r
else:
b=r+1000-100*n
print(b)
| a = input().split()
a=[int(i) for i in a]
n,r=a[0],a[1]
if n>=10:
b=r
else:
b=r+1000-100*n
print(b)
| [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 557,220 | 557,221 | u548069143 | python |
p02765 | n,r=map(int,input());
print(r+100*min(10-n,0)); | n,r=map(int,input().split());
print(r+100*max(10-n,0)); | [
"call.add",
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,224 | 557,225 | u367866606 | python |
p02765 | N,R = input().split(" ")
N = int(N)
R = int(R)
if(N >= 10):
print(R)
else:
print(R-100*(10-N)) | N,R = input().split(" ")
N = int(N)
R = int(R)
if(N >= 10):
print(R)
else:
print(R+100*(10-N)) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,229 | 557,230 | u282574080 | python |
p02765 | N, R = map(int, input().split(" "))
if N < 10:
print(R + N*100)
else:
print(R) | N, R = map(int, input().split(" "))
if N < 10:
print(R + (10-N)*100)
else:
print(R)
| [
"call.arguments.change"
] | 557,231 | 557,232 | u111473084 | python |
p02765 | N, R = map(int, input().split(" "))
if N < 10:
print(R - N*100)
else:
print(R) | N, R = map(int, input().split(" "))
if N < 10:
print(R + (10-N)*100)
else:
print(R)
| [
"call.arguments.change"
] | 557,233 | 557,232 | u111473084 | python |
p02765 | N, R = [int(x) for x in input().split(' ')]
if N > 9:
print(R)
else:
print(R - 100 * (10 - N))
| N, R = [int(x) for x in input().split(' ')]
if N > 9:
print(R)
else:
print(R + 100 * (10 - N))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 557,236 | 557,237 | u707659359 | python |
p02765 | N, R = [int(x) for x in input().split(' ')]
if N > 9:
print(R)
else:
print(R - 100 * (10 - K))
| N, R = [int(x) for x in input().split(' ')]
if N > 9:
print(R)
else:
print(R + 100 * (10 - N))
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.change"
] | 557,238 | 557,237 | u707659359 | python |
p02765 | sum,rate=map(int,input().split())
if sum>=10:
print(rate)
else:
ans=rate-100*(10-sum)
print(ans) | sum,rate=map(int,input().split())
if sum>=10:
print(rate)
else:
ans=rate+100*(10-sum)
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,263 | 557,264 | u129961029 | python |
p02765 | sum,rate=map(int,input().split())
if sum>=10:
print(rate)
else:
ans=rate-(100*(10-sum))
print(ans) | sum,rate=map(int,input().split())
if sum>=10:
print(rate)
else:
ans=rate+100*(10-sum)
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 557,265 | 557,264 | u129961029 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.