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 |
|---|---|---|---|---|---|---|---|
p02765
|
N,R = map(int,input().split())
if N<10:
print(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"
] | 555,787
| 555,788
|
u068862866
|
python
|
p02765
|
n,k = map(int,input().split())
if n >= 10:
print(k)
else:
print(k + 100*(10-k))
|
n,k = map(int,input().split())
if n >= 10:
print(k)
else:
print(k + 100*(10-n))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,794
| 555,795
|
u283751459
|
python
|
p02765
|
n,k = map(int,input().split())
if n >= 10:
print(k)
else:
print(100*(100-k))
|
n,k = map(int,input().split())
if n >= 10:
print(k)
else:
print(k + 100*(10-n))
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.change"
] | 555,796
| 555,795
|
u283751459
|
python
|
p02765
|
N,R=map(int,input().split())
naibu=0
if(N>=10):
naibu=R
else:
naibu=R+100*(10-R)
print(naibu)
|
N,R=map(int,input().split())
naibu=0
if(N>=10):
naibu=R
else:
naibu=R+100*(10-N)
print(naibu)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 555,813
| 555,814
|
u038216098
|
python
|
p02765
|
N,M = map(int, input().split())
if N < 10:
print(M - 100*(10 -N))
else:
print(M)
|
N,M = map(int, input().split())
if N <= 9:
print(M + 100*(10 -N))
else:
print(M)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,822
| 555,823
|
u096025032
|
python
|
p02765
|
N,R=map(int,input().split())
print(R if N>=10 else R+(100*(10-K)))
|
N,R=map(int,input().split())
print(R if N>=10 else R+(100*(10-N)))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,824
| 555,825
|
u611239490
|
python
|
p02765
|
n, r = map(int, input().split())
if n <= 10:
ans = r - 100*(10-n)
else:
ans = r
print(ans)
|
n, r = map(int, input().split())
if n <= 10:
ans = r + 100*(10-n)
else:
ans = r
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,860
| 555,861
|
u004482945
|
python
|
p02765
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, r = na()
if n >= 10:
print(r)
else:
print(100*(10-n))
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, r= na()
if n >= 10:
print(r)
else:
print(r+100*(10-n))
|
[
"expression.operation.binary.add"
] | 555,868
| 555,869
|
u683956577
|
python
|
p02765
|
N,R = map(int,input().split())
if N <= 9:
R -= 100*(10-N)
print(R)
|
N,R = map(int,input().split())
if N <= 9:
R += 100*(10-N)
print(R)
|
[
"expression.operator.change"
] | 555,876
| 555,877
|
u131464432
|
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"
] | 555,881
| 555,882
|
u125269142
|
python
|
p02765
|
N,R = sorted(map(int,input().split()))
if N<=10:
print(R+100*(10-N))
else:
print(R)
|
N,R = map(int,input().split())
if N<10:
print(R+100*(10-N))
else:
print(R)
|
[
"call.remove",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 555,885
| 555,886
|
u479937725
|
python
|
p02765
|
N,R = sorted(map(int,input().split()))
if N<10:
print(R+100*(10-N))
else:
print(R)
|
N,R = map(int,input().split())
if N<10:
print(R+100*(10-N))
else:
print(R)
|
[
"call.remove",
"call.arguments.change"
] | 555,887
| 555,886
|
u479937725
|
python
|
p02765
|
N, R = list(map(int,input().split(" ")))
if N < 10:
print(R-100*(10-N))
else:
print(R)
|
N, R = list(map(int,input().split(" ")))
if N < 10:
print(R+100*(10-N))
else:
print(R)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,907
| 555,908
|
u258325541
|
python
|
p02765
|
n,r = map(int,input().split())
if n >= 10:
print(r)
else:
k = 10 - n
print(100 * k)
|
n,r = map(int,input().split())
if n >= 10:
print(r)
else:
k = 10 - n
print(100 * k + r)
|
[
"expression.operation.binary.add"
] | 555,912
| 555,913
|
u357751375
|
python
|
p02765
|
n,r=map(int,input().split())
s=r-100*(10-n)
if n>=10:
print(r)
else:
print(s)
|
n,r=map(int,input().split())
s=r+100*(10-n)
if n>=10:
print(r)
else:
print(s)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 555,916
| 555,917
|
u136284779
|
python
|
p02765
|
N,R = map(int,input().split())
print(R if N >= 10 else R+{100*(10-K)})
|
N,R = map(int,input().split())
print(R if N >= 10 else R + 100*(10-N))
|
[
"call.arguments.change",
"identifier.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,924
| 555,923
|
u626228246
|
python
|
p02765
|
N,R = map(int,input().split())
print(R if N >= 10 else R+100*(10-K))
|
N,R = map(int,input().split())
print(R if N >= 10 else R + 100*(10-N))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,925
| 555,923
|
u626228246
|
python
|
p02765
|
# abc156_a.py
N, R = map(int,input().split())
if N>=10:
print(R)
else:
print(R + 100*10-N)
|
# abc156_a.py
N, R = map(int,input().split())
if N>=10:
print(R)
else:
print(R + 100*(10-N))
|
[
"call.arguments.change"
] | 555,926
| 555,927
|
u371132735
|
python
|
p02765
|
N, R = map(int,input().split())
if N >= 10 :
print(R)
else:
print(R - 100*(10-N))
|
# abc156_a.py
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"
] | 555,928
| 555,927
|
u371132735
|
python
|
p02765
|
N, R = map(int,input().split())
if N >= 10 :
print(R)
else:
print(100*(10-R))
|
# abc156_a.py
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"
] | 555,929
| 555,927
|
u371132735
|
python
|
p02765
|
n, r = map(int, input().split())
if n >= 10:
exit(0)
else:
r = r + 100 * (10 - n)
print(r)
|
n, r = map(int, input().split())
if n >= 10:
r = r
else:
r = r + 100 * (10 - n)
print(r)
|
[
"call.arguments.change"
] | 555,936
| 555,937
|
u843768197
|
python
|
p02765
|
print((lambda x:int(x[1])-max(0,100*(10-int(x[0]))))(input().split()))
|
print((lambda x:int(x[1])+max(0,100*(10-int(x[0]))))(input().split()))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 555,942
| 555,943
|
u770077083
|
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"
] | 555,947
| 555,948
|
u666964944
|
python
|
p02765
|
n, r = map(int, input().split())
ans = r
ans += 100 * (10 - n)
print(ans)
|
n, r = map(int, input().split())
ans = r + max(0, 100 * (10 - n))
print(ans)
|
[
"call.arguments.add",
"call.arguments.change"
] | 555,953
| 555,954
|
u323680411
|
python
|
p02765
|
N, R = map(int, input().split())
if N<=2:
print(R + (10-N)*100)
else:
print(R)
|
N, R = map(int, input().split())
if N<=10:
print(R + (10-N)*100)
else:
print(R)
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 555,975
| 555,976
|
u742529680
|
python
|
p02765
|
from sys import stdin
n,k = map(int,stdin.readline().rstrip().split())
if n >= 10:
print(k)
else:
print(n*100+k)
|
from sys import stdin
n,k = map(int,stdin.readline().rstrip().split())
if n >= 10:
print(k)
else:
print((10-n)*100+k)
|
[
"call.arguments.change"
] | 555,994
| 555,995
|
u987164499
|
python
|
p02765
|
n,m=map(int,input().split())
if 10<=n:
print(m)
else:
m=m-(10-n)*100
print(m)
|
n,m=map(int,input().split())
if 10<=n:
print(m)
else:
m=m+(10-n)*100
print(m)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,021
| 556,022
|
u954153335
|
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"
] | 556,036
| 556,037
|
u494295478
|
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"
] | 556,047
| 556,048
|
u720124072
|
python
|
p02765
|
a,b=map(int,input())
if a<10:
print(b+(100*(10-a)))
else:
print(b)
|
a,b=map(int,input().split())
if a<10:
print(b+(100*(10-a)))
else:
print(b)
|
[
"call.add"
] | 556,055
| 556,054
|
u997393081
|
python
|
p02765
|
n, r = map(int, input().split())
if n >= 10:
rating = r
else:
rating = r - 100 * (10 - n)
print(rating)
|
n, r = map(int, input().split())
if n >= 10:
rating = r
else:
rating = r + 100 * (10 - n)
print(rating)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,063
| 556,064
|
u242890210
|
python
|
p02765
|
n, r = map(int, input().split())
if n >= 10:
rating = r
else:
rating = 100 * (10 - n)
print(rating)
|
n, r = map(int, input().split())
if n >= 10:
rating = r
else:
rating = r + 100 * (10 - n)
print(rating)
|
[
"assignment.change"
] | 556,065
| 556,064
|
u242890210
|
python
|
p02765
|
n, r = map(int(input()))
if n >= 10:
rating = r
else:
rating = 100 * (10 - n)
print(rating)
|
n, r = map(int, input().split())
if n >= 10:
rating = r
else:
rating = r + 100 * (10 - n)
print(rating)
|
[
"assignment.value.change",
"call.arguments.change",
"call.add"
] | 556,066
| 556,064
|
u242890210
|
python
|
p02765
|
n,r = map(int, nput().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))
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 556,085
| 556,086
|
u725133562
|
python
|
p02765
|
n,r=map(int,input().split())
if n>=10:
print(r)
else:
ans = r + 100 * (10 - r)
print(ans)
|
n,r=map(int,input().split())
if n>=10:
print(r)
else:
ans = r + 100 * (10 - n)
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 556,087
| 556,088
|
u905793676
|
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(r + 100 * (10 - n))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,089
| 556,090
|
u941047297
|
python
|
p02765
|
import math
import queue
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def printQueue(q):
r=qb
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
def dq():
return queue.deque()
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
n,r = readInts()
k=n
if n>=10:
print(k)
else:
print(r+100*(10-k))
|
import math
import queue
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
def factorization(n):
res = []
if n%2==0:
res.append(2)
for i in range(3,math.floor(n//2)+1,2):
if n%i==0:
c = 0
for j in res:
if i%j==0:
c=1
if c==0:
res.append(i)
return res
def fact2(n):
p = factorization(n)
res = []
for i in p:
c=0
z=n
while 1:
if z%i==0:
c+=1
z/=i
else:
break
res.append([i,c])
return res
def fact(n):#階乗
ans = 1
m=n
for _i in range(n-1):
ans*=m
m-=1
return ans
def comb(n,r):#コンビネーション
if n<r:
return 0
l = min(r,n-r)
m=n
u=1
for _i in range(l):
u*=m
m-=1
return u//fact(l)
def printQueue(q):
r=qb
ans=[0]*r.qsize()
for i in range(r.qsize()-1,-1,-1):
ans[i] = r.get()
print(ans)
def dq():
return queue.deque()
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1]*n
def find(self, x): # root
if self.parents[x]<0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self,x,y):
x = self.find(x)
y = self.find(y)
if x==y:
return
if self.parents[x]>self.parents[y]:
x,y = y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x
def size(self,x):
return -1*self.parents[self.find(x)]
def same(self,x,y):
return self.find(x)==self.find(y)
def members(self,x): # much time
root = self.find(x)
return [i for i in range(self.n) if self.find(i)==root]
def roots(self):
return [i for i,x in enumerate(self.parents) if x<0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
x = 1
zero = "0"*n
ans = []
ans.append([0]*n)
for i in range(2**n-1):
ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
x+=1
return ans;
def arrsSum(a1,a2):
for i in range(len(a1)):
a1[i]+=a2[i]
return a1
n,r = readInts()
k=n
if n>=10:
print(r)
else:
print(r+100*(10-k))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 556,091
| 556,092
|
u509739538
|
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,103
| 556,104
|
u857673087
|
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))
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 556,105
| 556,104
|
u857673087
|
python
|
p02765
|
N,R = map(int,input())
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))
|
[
"call.add",
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 556,106
| 556,104
|
u857673087
|
python
|
p02765
|
n,r=map(int,input().split())
if n>=10:
print(r)
elif n<10:
print(r-(100*(10-n)))
|
n,r=map(int,input().split())
if n>=10:
print(r)
elif n<10:
print(r+(100*(10-n)))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,126
| 556,127
|
u273186459
|
python
|
p02765
|
# -*- coding: utf-8 -*-
N,R=map(int,input().split())
print(R+100*(10-min(N, 9)))
|
# -*- coding: utf-8 -*-
N,R=map(int,input().split())
print(R+100*(10-min(N, 10)))
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,128
| 556,129
|
u767438459
|
python
|
p02765
|
n,r=map(int,input().split())
if n < 10:
print(str(r-100*(10-n))+"\n")
else:
print(str(r)+"\n")
|
n,r=map(int,input().split())
if n < 10:
print(str(r+100*(10-n))+"\n")
else:
print(str(r)+"\n")
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,130
| 556,131
|
u223504018
|
python
|
p02765
|
N, R = map(int, input().split())
if N < 10:
ans = R - 100 * (10 - N)
else:
ans = R
print(ans)
|
N, R = map(int, input().split())
if N < 10:
ans = R + 100 * (10 - N)
else:
ans = R
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,142
| 556,143
|
u186121428
|
python
|
p02765
|
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,r = [int(i) for i in readline().split()]
if n >= 10:
print(r)
else:
print(r-100*(10-n))
|
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n,r = [int(i) for i in readline().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,144
| 556,145
|
u307516601
|
python
|
p02765
|
N, R = map(int, input().split())
print(R + 100*(10-N)) if n < 10 else print(R)
|
N, R = map(int, input().split())
print(R + 100*(10-N)) if N < 10 else print(R)
|
[
"identifier.change"
] | 556,161
| 556,162
|
u860002137
|
python
|
p02765
|
N,R=map(int,input().split())
u=0
if N>=10:
u=R
else:
u=R-100*(10-N)
print(u)
|
N,R=map(int,input().split())
u=0
if N>=10:
u=R
else:
u=R+100*(10-N)
print(u)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,177
| 556,178
|
u428199834
|
python
|
p02765
|
#ABC156-A #Beginner
n,r = map(int, input().split())
if n >= 10:
k = 100*(10-n)
s = k + r
else:
s = r
print(s)
|
n,r = map(int, input().split())
if n < 10:
k = 100*(10-n)
s = r + k
else:
s = r
print(s)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 556,211
| 556,212
|
u694402282
|
python
|
p02765
|
#ABC156-A #Beginner
n,r = map(int, input().split())
if n > 10:
k = 100*(10-n)
s = k + r
else:
s = r
print(s)
|
n,r = map(int, input().split())
if n < 10:
k = 100*(10-n)
s = r + k
else:
s = r
print(s)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 556,213
| 556,212
|
u694402282
|
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)+r
print(r)
|
[
"assignment.change"
] | 556,220
| 556,221
|
u810066979
|
python
|
p02765
|
N,R = map(int, input().split())
if N >= 10:
k = R
print(k)
else:
k = 100*(10-N)+R
orint(k)
|
N,R = map(int, input().split())
if N >= 10:
k = R
print(k)
else:
k = 100*(10-N)+R
print(k)
|
[
"identifier.change",
"call.function.change"
] | 556,230
| 556,231
|
u118760114
|
python
|
p02765
|
N,R = map(int,input().split())
if N < 10:
print(R + 100*(100-N))
else:
print(R)
|
N,R = map(int,input().split())
if N < 10:
print(R + 100*(10-N))
else:
print(R)
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,252
| 556,253
|
u819593641
|
python
|
p02765
|
n,r=[int(i) for i in input().split()]
if n>=10:
print(r)
else:
print(r-100*(10-n))
|
n,r=[int(i) for i in 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"
] | 556,264
| 556,265
|
u235066013
|
python
|
p02765
|
n,r=[int(i) for i in input().split()]
if n>9:
print(r)
else:
print(r-100*(10-n))
|
n,r=[int(i) for i in 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"
] | 556,266
| 556,265
|
u235066013
|
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"
] | 556,269
| 556,270
|
u733132703
|
python
|
p02765
|
N,R = map(int,input().split())
if N >= 10:
print(N)
else:
print(R-100*(10-N))
|
N,R = map(int,input().split())
if N >= 10:
print(R)
else:
print(R+100*(10-N))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 556,271
| 556,270
|
u733132703
|
python
|
p02765
|
a,b=map(int,input().split())
if a<10:
print(b-(100*(10-a)))
else:
print(b)
|
a,b=map(int,input().split())
if a<10:
print(b+(100*(10-a)))
else:
print(b)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,276
| 556,277
|
u115877451
|
python
|
p02765
|
n,r = (int(x) for x in input().split())
if n < 10:
print(r-100*(10-n))
else:
print(r)
|
n,r = (int(x) for x in input().split())
if n < 10:
print(r+100*(10-n))
else:
print(r)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,288
| 556,289
|
u571832343
|
python
|
p02765
|
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
N,R = map(int,input().split())
if N >= 10:
print(R)
else:
print(R+100*(10-K))
|
import sys
input=sys.stdin.buffer.readline
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
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,290
| 556,291
|
u201387466
|
python
|
p02765
|
n,r = map(int,input().split())
ans = n
if n < 10:
ans = r + 100*(10-n)
print(ans)
|
n,r = map(int,input().split())
ans = r
if n < 10:
ans = r + 100*(10-n)
print(ans)
|
[
"assignment.value.change",
"identifier.change"
] | 556,292
| 556,293
|
u179508038
|
python
|
p02765
|
import numpy as np
n,r = map(int,input().split())
print(n,r)
if n < 10:
print(r + 1000 - 100*n)
else:
print(r)
|
import numpy as np
n,r = map(int,input().split())
if n < 10:
print(r + 1000 - 100*n)
else:
print(r)
|
[
"call.remove"
] | 556,294
| 556,295
|
u019291053
|
python
|
p02765
|
n,r=map(int,input().split())
if n>=10:
print(r)
else:
R=r-100*(10-n)
print(R)
|
n,r=map(int,input().split())
if n>=10:
print(r)
else:
R=r+100*(10-n)
print(R)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,313
| 556,314
|
u153259685
|
python
|
p02765
|
N, R = map(int, input().solit())
if N>= 10:
print(R)
else:
print(R+1000-100*N)
|
N, R = map(int, input().split())
if N>= 10:
print(R)
else:
print(R+1000-100*N)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 556,317
| 556,318
|
u878291720
|
python
|
p02765
|
n = list(map(int,input().split()))
if n[0]<10:
print(100*(10-n[0]))
else:
print(n[1])
|
n = list(map(int,input().split()))
if n[0]<10:
print(100*(10-n[0])+n[1])
else:
print(n[1])
|
[
"expression.operation.binary.add"
] | 556,323
| 556,324
|
u886907961
|
python
|
p02765
|
N=input()
R=input()
N=int(N)
R=int(R)
if N<10:
R+=100*(10-N)
print(R)
|
N,R=input().split()
N=int(N)
R=int(R)
if N<10:
R+=100*(10-N)
print(R)
|
[
"assignment.variable.change",
"call.remove",
"call.add"
] | 556,338
| 556,339
|
u261947526
|
python
|
p02765
|
n,r = map(int, input().split())
if n < 10:
print((100 * (10-r))+r)
else:
print(r)
|
n,r = map(int, input().split())
if n < 10:
print((100 * (10-n))+r)
else:
print(r)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,346
| 556,347
|
u320763652
|
python
|
p02765
|
n,r = map(int, input().split())
if n < 10:
print(100 * (10-r))
else:
print(r)
|
n,r = map(int, input().split())
if n < 10:
print((100 * (10-n))+r)
else:
print(r)
|
[
"call.arguments.change"
] | 556,348
| 556,347
|
u320763652
|
python
|
p02765
|
n,r = map(int, input().split())
if n < 10:
print(100 * (n-r))
else:
print(r)
|
n,r = map(int, input().split())
if n < 10:
print((100 * (10-n))+r)
else:
print(r)
|
[
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"io.output.change"
] | 556,349
| 556,347
|
u320763652
|
python
|
p02765
|
n,r=map(int,input().split())
ans=r
if n <10:
ans= r - (100*(10-n))
print(ans)
|
n,r=map(int,input().split())
ans=r
if n <10:
ans= r + (100*(10-n))
print(ans)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 556,362
| 556,363
|
u995419623
|
python
|
p02765
|
n, r = map(int, input().strip().split())
if n>=10:
print(r)
else:
print(r+100*(10-r))
|
n, r = map(int, input().strip().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,364
| 556,365
|
u970133396
|
python
|
p02765
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, r = map(int, readline().split())
if 10 < r:
print(r)
else:
print(100 * (10 - n) + r)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n, r = map(int, readline().split())
if 10 < n:
print(r)
else:
print(100 * (10 - n) + r)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 556,368
| 556,369
|
u691018832
|
python
|
p02765
|
n,r = map(int, input().split())
if n>10: print(r)
else: print(int(100*(19-n)+r))
|
n,r = map(int, input().split())
if n>10: print(r)
else: print(int(100*(10-n)+r))
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,370
| 556,371
|
u472696272
|
python
|
p02765
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N, R = MAP()
print( R if N >= 10 else R-100*(10-N) )
|
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from math import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
N, R = MAP()
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,387
| 556,388
|
u285891772
|
python
|
p02765
|
N, R = map(int, input().split())
ans = 0
if N >= 10:
ans = R
else:
ans = R + 100*(10 - K)
print(ans)
|
K, R = map(int, input().split())
ans = 0
if K >= 10:
ans = R
else:
ans = R + 100*(10 - K)
print(ans)
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 556,400
| 556,401
|
u066551652
|
python
|
p02765
|
n, k = map(int, input().split())
if n >= 10:
print(k)
else:
print(n + 100 * (10-k))
|
n, k = map(int, input().split())
if n >= 10:
print(k)
else:
print(k + 100 * (10-n))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,409
| 556,410
|
u736189571
|
python
|
p02765
|
n,m = map(int.input().split())
if n < 10:
print(m+(100*(10-n)))
else:
print(m)
|
n,m = map(int,input().split())
if n < 10:
print(m+(100*(10-n)))
else:
print(m)
|
[
"misc.typo",
"assignment.value.change",
"call.arguments.change"
] | 556,426
| 556,427
|
u669770320
|
python
|
p02765
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n,r = na()
print(r-max(0,100*(10-n)))
|
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n,r = na()
print(r+max(0,100*(10-n)))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,430
| 556,431
|
u843135954
|
python
|
p02765
|
N, R = map(int, input().split())
if N < 10:
O = N
else:
O = R + 100*(10-N)
print(O)
|
N, R = map(int, input().split())
if N >= 10:
O = R
else:
O = R + 100*(10-N)
print(O)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.change"
] | 556,436
| 556,435
|
u394352233
|
python
|
p02765
|
#print(input())
N, DR = map(int, input().split())
# DR = IR - 100 * (10 - N)
# IR + 100 * (10 - N) = IR
if N >= 10:
print(DR)
else:
print(100 * (10 - N) * DR)
|
#print(input())
N, DR = map(int, input().split())
# DR = IR - 100 * (10 - N)
# IR + 100 * (10 - N) = IR
if N >= 10:
print(DR)
else:
print(100 * (10 - N) + DR)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,444
| 556,445
|
u585532831
|
python
|
p02765
|
#--Beginner
#1行1列
number, rate = map(int, input().split())
if (number < 10):
print(rate+(100*(10-number)))
elif (number <= 10):
print(rate)
|
#--Beginner
#1行1列
number, rate = map(int, input().split())
if (number < 10):
print(rate+(100*(10-number)))
elif (number >= 10):
print(rate)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 556,457
| 556,458
|
u949234226
|
python
|
p02765
|
N,K=[int(s) for s in input().split()]
if N<10:
print(K-(10-N)*100)
else:
print(K)
|
N,K=[int(s) for s in input().split()]
if N<10:
print(K+(10-N)*100)
else:
print(K)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 556,473
| 556,474
|
u918601425
|
python
|
p02765
|
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)
|
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"
] | 556,480
| 556,481
|
u065994196
|
python
|
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_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from math import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
def main():
n, r = map(int, readline().split())
if n>=10:
print(r)
else:
print(r-100*(10-n))
if __name__ == '__main__':
main()
|
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_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from math import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
def main():
n, r = map(int, readline().split())
if n>=10:
print(r)
else:
print(r+100*(10-n))
if __name__ == '__main__':
main()
|
[
"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
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.