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 |
|---|---|---|---|---|---|---|---|
p02811
|
K, X = map(int, input().split())
print('Yes' if X/500<=K else'NO')
|
K, X = map(int, input().split())
print('Yes' if X/500<=K else'No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,088
| 611,089
|
u309026918
|
python
|
p02811
|
K, X = map(int, input().split())
print('Yes' if X/500<=k else'NO')
|
K, X = map(int, input().split())
print('Yes' if X/500<=K else'No')
|
[
"identifier.change",
"call.arguments.change",
"io.output.change",
"literal.string.change",
"literal.string.case.change"
] | 611,090
| 611,089
|
u309026918
|
python
|
p02811
|
K, X = map(int, input().split())
k = K * 500
if k > X:
print('Yes')
else:
print('No')
|
K, X = map(int, input().split())
k = K * 500
if k >= X:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,091
| 611,092
|
u891876269
|
python
|
p02811
|
# input
K, X = map(int, input().split())
# output
print("YES" if 500*K >= X else "NO")
|
# input
K, X = map(int, input().split())
# output
print("Yes" if 500*K >= X else "No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,099
| 611,100
|
u563676207
|
python
|
p02811
|
K,X = list(map(int,input().split()))
if 500*K > X:
print("Yes")
else:
print("No")
|
K,X = list(map(int,input().split()))
if 500*K >= X:
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,110
| 611,111
|
u310035060
|
python
|
p02811
|
l = [int(i) for i in input().split()]
K, X = l
if K * 500 > X:
print('Yes')
else:
print("No")
|
l = [int(i) for i in input().split()]
K, X = l
if K * 500 >= X:
print('Yes')
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,124
| 611,125
|
u253674219
|
python
|
p02811
|
l = [int(i) for i in input().split()]
K, X = l
if K * 500 > X:
print('Yes')
else:
print("no")
|
l = [int(i) for i in input().split()]
K, X = l
if K * 500 >= X:
print('Yes')
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,126
| 611,125
|
u253674219
|
python
|
p02811
|
K, X = input().split()
print(K, X)
if 500 * int(K) >= int(X):
print('Yes')
else:
print('No')
|
K, X = input().split()
if 500 * int(K) >= int(X):
print('Yes')
else:
print('No')
|
[
"call.remove"
] | 611,127
| 611,128
|
u096022836
|
python
|
p02811
|
K,X=input().split()
if (K*500>=X):
print("Yes")
else:
print("No")
|
K,X=map(int,input().split())
if (K*500>=X):
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 611,147
| 611,148
|
u301319173
|
python
|
p02811
|
K,X=input().split()
if (K*500<=X):
print("Yes")
else:
print("No")
|
K,X=map(int,input().split())
if (K*500>=X):
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,149
| 611,148
|
u301319173
|
python
|
p02811
|
K,X=input().split()
if 500*K >= X:
print("Yes")
else:
print("No")
|
K,X=map(int,input().split())
if 500*K >= X:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 611,158
| 611,159
|
u941884460
|
python
|
p02811
|
x, k = input().split()
if int(x) <= int(k)*500:
print("Yes")
else:
print("No")
|
k, x = input().split()
if int(x) <= int(k)*500:
print("Yes")
else:
print("No")
|
[] | 611,167
| 611,168
|
u724295910
|
python
|
p02811
|
x = input()
k = input()
if int(x) <= int(k)*500:
print("Yes")
else:
print("No")
|
k, x = input().split()
if int(x) <= int(k)*500:
print("Yes")
else:
print("No")
|
[] | 611,169
| 611,168
|
u724295910
|
python
|
p02811
|
k, x = map(int, input().split())
if 500*k >= X:
print("Yes")
else:
print("No")
|
k, x = map(int, input().split())
if 500*k >= x:
print("Yes")
else:
print("No")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 611,182
| 611,183
|
u393512980
|
python
|
p02811
|
k,y=input().split()
coin=k*500
if coin>=y:
print("Yes")
else:
print("No")
|
k,y=input().split()
coin=int(k)*500
if coin>=int(y):
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 611,192
| 611,193
|
u693134887
|
python
|
p02811
|
k, x = map(int, input().split())
cost=500*k
if x >=cost:
print("Yes")
else:
print("No")
|
k, x = map(int, input().split())
cost=500*k
if x <=cost:
print("Yes")
else:
print("No")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,208
| 611,209
|
u182594853
|
python
|
p02811
|
from sys import stdin
#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
k,x = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
if k*500 > x:
print("Yes")
else:
print("No")
|
from sys import stdin
#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
k,x = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに
if k*500 >= x:
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,210
| 611,211
|
u478719560
|
python
|
p02811
|
n,k=map(int,input().split())
if (n*500>=k):
print("YES")
else:
print('NO')
|
n,k=map(int,input().split())
if (n*500>=k):
print("Yes")
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,235
| 611,236
|
u309753263
|
python
|
p02811
|
k, n = [int(x) for x in input().split()]
if k*500 >= n:
print("YES")
else:
print("NO")
|
k, n = [int(x) for x in input().split()]
if k*500 >= n:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,251
| 611,252
|
u024496314
|
python
|
p02811
|
nums = list(map(int,input().split()))
money_sum = 500 * nums[0]
if nums[1] < money_sum:
print("No")
else:
print("Yes")
|
nums = list(map(int,input().split()))
money_sum = 500 * nums[0]
if nums[1] > money_sum:
print("No")
else:
print("Yes")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,256
| 611,257
|
u982127653
|
python
|
p02811
|
char = input().split(" ")
if int(char[0])*500 >= (char[1]):
print("Yes")
else:
print("No")
|
char = input().split(" ")
if int(char[0])*500 >= int(char[1]):
print("Yes")
else:
print("No")
|
[
"call.add",
"control_flow.branch.if.condition.change"
] | 611,258
| 611,259
|
u796708718
|
python
|
p02811
|
char = input().split(" ")
if char[0]*500 >= char[1]:
print("Yes")
else:
print("No")
|
char = input().split(" ")
if int(char[0])*500 >= int(char[1]):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 611,260
| 611,259
|
u796708718
|
python
|
p02811
|
k,x=(int(x) for x in input().split())
if 500*k>x:
print('Yes\n')
else:
print('No\n')
|
k,x=(int(x) for x in input().split())
if 500*k>=x:
print('Yes\n')
else:
print('No\n')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,262
| 611,263
|
u561570330
|
python
|
p02811
|
K, X = list(map(int, input().split()))
print("yes" if 500 * K >= X else "no" )
|
K, X = list(map(int, input().split()))
print("Yes" if 500 * K >= X else "No" )
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,264
| 611,265
|
u055854974
|
python
|
p02811
|
KX = input().split()
K = int(KX[0])
X = int(KX[1])
answer = "No"
if 500*K > X:
answer = "Yes"
print(answer)
|
KX = input().split()
K = int(KX[0])
X = int(KX[1])
answer = "No"
if 500*K >= X:
answer = "Yes"
print(answer)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,270
| 611,271
|
u817381202
|
python
|
p02811
|
K=input()
X=input()
if int(K)*500>=int(X):
print('Yes')
else:
print('No')
|
K,X=input().split()
if int(K)*500>=int(X):
print('Yes')
else:
print('No')
|
[
"assignment.variable.change",
"call.remove",
"call.add"
] | 611,288
| 611,289
|
u544212192
|
python
|
p02811
|
tar, max = map(int, input().sprit())
if max <= tar * 500:
print('Yes')
else:
print('No')
|
tar, max = map(int, input().split())
if max <= tar*500:
print('Yes')
else:
print('No')
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 611,300
| 611,301
|
u288001809
|
python
|
p02811
|
tar, max = map(int, input(),sprit())
if max <= tar * 500:
print('Yes')
else:
print('No')
|
tar, max = map(int, input().split())
if max <= tar*500:
print('Yes')
else:
print('No')
|
[] | 611,302
| 611,301
|
u288001809
|
python
|
p02811
|
if __name__ == '__main__':
temp = input().split(' ')
k = int(temp[0])
x = int(temp[1])
if k * 500 > x:
print('Yes')
else:
print('No')
|
if __name__ == '__main__':
temp = input().split(' ')
k = int(temp[0])
x = int(temp[1])
if k * 500 >= x:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,325
| 611,326
|
u084261177
|
python
|
p02811
|
k,m=map(int,input().split())
c=500*k
if(c<m):
print("Yes")
else:
print("No")
|
k,m=map(int,input().split())
c=500*k
if(c>=m):
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,329
| 611,330
|
u269724549
|
python
|
p02811
|
k,m=map(input().split())
c=500*k
if(c<m):
print("Yes")
else:
print("No")
|
k,m=map(int,input().split())
c=500*k
if(c>=m):
print("Yes")
else:
print("No")
|
[
"call.arguments.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,331
| 611,330
|
u269724549
|
python
|
p02811
|
K, X = list(map(int, input().split()))
if(500 + K < X):
print("No")
else:
print("Yes")
|
K, X = list(map(int, input().split()))
if(500 * K < X):
print("No")
else:
print("Yes")
|
[
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 611,342
| 611,343
|
u383025592
|
python
|
p02811
|
K, X = map(int, input().split())
print('Yes' if 500 * X >= K else 'No')
|
K, X = map(int, input().split())
print('Yes' if 500 * K >= X else 'No')
|
[] | 611,348
| 611,349
|
u022488946
|
python
|
p02811
|
N,M= [int(i) for i in input().split()]
print("Yes" if N*500 > M else "No")
|
N,M= [int(i) for i in input().split()]
print("Yes" if N*500 >= M else "No")
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 611,350
| 611,351
|
u295294832
|
python
|
p02811
|
k,x = map(int,input().split())
if x <= k :
print('Yes')
else :
print('No')
|
k,x = map(int,input().split())
if x <= 500*k :
print('Yes')
else :
print('No')
|
[
"control_flow.branch.if.condition.change"
] | 611,352
| 611,353
|
u237601489
|
python
|
p02811
|
k,x = map(int.input(),split())
if x <= k :
print('Yes')
else :
print('No')
|
k,x = map(int,input().split())
if x <= 500*k :
print('Yes')
else :
print('No')
|
[
"misc.typo",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 611,354
| 611,353
|
u237601489
|
python
|
p02811
|
k,x=map(int.input(),split())
if x <= k :
print('Yes')
else :
print('No')
|
k,x = map(int,input().split())
if x <= 500*k :
print('Yes')
else :
print('No')
|
[
"misc.typo",
"assignment.value.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 611,356
| 611,353
|
u237601489
|
python
|
p02811
|
k, x = list(map(int, input().split(" ")))
if 2 * k >= x:
print('Yes')
else:
print('No')
|
k, x = list(map(int, input().split(" ")))
if 500 * k >= x:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 611,357
| 611,358
|
u944015274
|
python
|
p02811
|
K,X = [map(int,input().split())]
if K*500>=X:
print("Yes")
else:
print("No")
|
K,X = map(int,input().split())
if K*500>=X:
print("Yes")
else:
print("No")
|
[] | 611,376
| 611,377
|
u592035627
|
python
|
p02811
|
K,X = [map(int,input().split())]
if K*500>=X:
print("Yes")
else:
print("No")
|
K,X = map(int,input().split())
if K*500>=X:
print("Yes")
else:
print("No")
|
[] | 611,378
| 611,377
|
u592035627
|
python
|
p02811
|
K, X = map(int,input().split())
print('Yes' if K*500 > X else 'No')
|
K, X = map(int,input().split())
print('Yes' if K*500 >= X else 'No')
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 611,383
| 611,384
|
u221898645
|
python
|
p02811
|
# https://atcoder.jp/contests/abc150/tasks/abc150_a
def read_int_n(): return list(map(int, input().split()))
K, X = read_int_n()
if K*500 > X:
print("Yes")
else:
print("No")
|
# https://atcoder.jp/contests/abc150/tasks/abc150_a
def read_int_n(): return list(map(int, input().split()))
K, X = read_int_n()
if K*500 >= X:
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,394
| 611,395
|
u736995123
|
python
|
p02811
|
k, x = (int(x) for x in input().split())
if k*500 >= x :
print('Yes')
else:
Print('No')
|
k, x = (int(x) for x in input().split())
if k*500 >= x :
print('Yes')
else:
print('No')
|
[
"identifier.change",
"call.function.change",
"io.output.change"
] | 611,400
| 611,401
|
u569853645
|
python
|
p02811
|
k, x = (int(x) for x in input().split())
if k*500 >= x :
print(Yes)
else:
Print(No)
|
k, x = (int(x) for x in input().split())
if k*500 >= x :
print('Yes')
else:
print('No')
|
[
"call.arguments.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 611,402
| 611,401
|
u569853645
|
python
|
p02811
|
import sys
input = sys.stdin.readline
k, x = [int(x) for x in input().rstrip().split()]
print('Yes' if k * 2 >= x else 'No')
|
import sys
input = sys.stdin.readline
k, x = [int(x) for x in input().rstrip().split()]
print('Yes' if k * 500 >= x else 'No')
|
[
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 611,405
| 611,406
|
u048472648
|
python
|
p02811
|
K,X = input().split()
total = 500*K
if total>=X :
print("Yes")
else :
print("No")
|
K,X = map(int,input().split())
total = 500*K
if total>=X :
print("Yes")
else :
print("No")
|
[
"call.add",
"call.arguments.change"
] | 611,413
| 611,414
|
u932864155
|
python
|
p02811
|
K,M=mao(int,input().split())
if K*500>=M:
print("Yes")
else:
print("No")
|
K,M=map(int,input().split())
if K*500>=M:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 611,417
| 611,418
|
u107091170
|
python
|
p02811
|
k, x = map(int, input().split())
if 500 * k > x:
print('Yes')
else:
print('No')
|
k, x = map(int, input().split())
if 500 * k >= x:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,432
| 611,433
|
u971096161
|
python
|
p02811
|
K,X = (int(x) for x in input().split())
if K*500 > X:
print('Yes')
else:
print('No')
|
K,X = (int(x) for x in input().split())
if K*500 >= X:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,472
| 611,473
|
u193303905
|
python
|
p02811
|
k,x = input().split(" ")
k = int(k)
x = int(x)
print(k,x)
text = "No"
if k*500>=x:
text = "Yes"
print(text)
|
k,x = input().split(" ")
k = int(k)
x = int(x)
text = "No"
if k*500>=x:
text = "Yes"
print(text)
|
[
"call.remove"
] | 611,494
| 611,495
|
u112952458
|
python
|
p02811
|
k,x = input().split(" ")
k = int(k)
x = int(x)
print(k,x)
text = "No"
if k*500>=x:
text = "Yes"
print(text +"\n")
|
k,x = input().split(" ")
k = int(k)
x = int(x)
text = "No"
if k*500>=x:
text = "Yes"
print(text +"\n")
|
[
"call.remove"
] | 611,496
| 611,497
|
u112952458
|
python
|
p02811
|
k ,x = map(int,input().split)
if k*500 >= x:
print('Yes')
else:
print('No')
|
k , x = map(int,input().split())
if k*500 >= x:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 611,514
| 611,515
|
u116767113
|
python
|
p02811
|
num, max = input().split()
if (int(num) * 500 >= int(max)):
print('yes')
else:
print('no')
|
num, max = input().split()
if (int(num) * 500 >= int(max)):
print('Yes');
else:
print('No');
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,518
| 611,519
|
u332926534
|
python
|
p02811
|
A,B = map(int, input().split())
ans = 500*A - B
if ans >0:
print("Yes")
else:
print("No")
|
A,B = map(int, input().split())
ans = 500*A - B
if ans >= 0:
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,545
| 611,546
|
u336564899
|
python
|
p02811
|
a,b=(int(x) for x in input().split())
if a*500 > b:
print("Yes")
else:
print("No")
|
K,X=(int(x) for x in input().split())
if K*500 >= X:
print("Yes")
else:
print("No")
|
[
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 611,556
| 611,557
|
u469363658
|
python
|
p02811
|
K, X = int(input().split())
if 500 * K >= X:
print("Yes")
elif 500 * K < X:
print("No")
|
K, X = (int(x) for x in input().split())
if 500 * K >= X:
print("Yes")
elif 500 * K < X:
print("No")
|
[] | 611,561
| 611,562
|
u779327980
|
python
|
p02805
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def main():
n=II()
xy=[LI() for _ in range(n)]
sx=sy=1000
bx=by=0
for x,y in xy:
if x<sx:sx=x
if x>bx:bx=x
if y<sy:sy=y
if y>by:by=y
x0=(sx+bx)/2
y0=(sy+by)/2
m=100
roop=10000
for _ in range(roop):
maxd=0
for x,y in xy:
d=(x-x0)**2+(y-y0)**2
if d>maxd:
maxd=d
vx=x-x0
vy=y-y0
rate=m/(vx**2+vy**2)**0.5
x0+=vx*rate
y0+=vy*rate
m*=0.99
print(maxd**0.5,m)
main()
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def main():
n=II()
xy=[LI() for _ in range(n)]
sx=sy=1000
bx=by=0
for x,y in xy:
if x<sx:sx=x
if x>bx:bx=x
if y<sy:sy=y
if y>by:by=y
x0=(sx+bx)/2
y0=(sy+by)/2
m=100
roop=10000
for _ in range(roop):
maxd=0
for x,y in xy:
d=(x-x0)**2+(y-y0)**2
if d>maxd:
maxd=d
vx=x-x0
vy=y-y0
rate=m/(vx**2+vy**2)**0.5
x0+=vx*rate
y0+=vy*rate
m*=0.998
print(maxd**0.5)
main()
|
[
"literal.number.float.change",
"call.arguments.change"
] | 611,585
| 611,584
|
u353797797
|
python
|
p02805
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def main():
n=II()
xy=[LI() for _ in range(n)]
sx=sy=1000
bx=by=0
for x,y in xy:
if x<sx:sx=x
if x>bx:bx=x
if y<sy:sy=y
if y>by:by=y
x0=(sx+bx)/2
y0=(sy+by)/2
m=0.98
roop=10000
for _ in range(roop):
maxd=0
for x,y in xy:
d=(x-x0)**2+(y-y0)**2
if d>maxd:
maxd=d
vx=x-x0
vy=y-y0
rate=m/(vx**2+vy**2)**0.5
x0+=vx*rate
y0+=vy*rate
m*=0.98
print(maxd**0.5)
main()
|
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def main():
n=II()
xy=[LI() for _ in range(n)]
sx=sy=1000
bx=by=0
for x,y in xy:
if x<sx:sx=x
if x>bx:bx=x
if y<sy:sy=y
if y>by:by=y
x0=(sx+bx)/2
y0=(sy+by)/2
m=100
roop=10000
for _ in range(roop):
maxd=0
for x,y in xy:
d=(x-x0)**2+(y-y0)**2
if d>maxd:
maxd=d
vx=x-x0
vy=y-y0
rate=m/(vx**2+vy**2)**0.5
x0+=vx*rate
y0+=vy*rate
m*=0.998
print(maxd**0.5)
main()
|
[
"assignment.value.change",
"literal.number.float.change"
] | 611,587
| 611,584
|
u353797797
|
python
|
p02805
|
import math
class Point:
def __init__(self, x, y):
self.x = x
self.y = y
def __add__(self, q):
if isinstance(q, Point):
return Point(self.x + q.x, self.y + q.y)
else:
return Point(self.x + q, self.y + q)
def __sub__(self, q):
if isinstance(q, Point):
return Point(self.x - q.x, self.y - q.y)
else:
return Point(self.x - q, self.y - q)
def __mul__(self, q):
if isinstance(q, Point):
return Point(self.x * q.x - self.y * q.y,
self.x * q.y + self.y * q.x)
else:
return Point(self.x * q, self.y * q)
def __truediv__(self, q):
if isinstance(q, Point):
return self * q.conj / q.norm
else:
return Point(self.x / q, self.y / q)
@property
def conj(self):
return Point(self.x, -self.y)
def rot(self, ang):
return Point(math.cos(ang) * self.x - math.sin(ang) * self.y,
math.sin(ang) * self.x + math.cos(ang) * self.y)
def rot90(self):
return Point(-self.y, self.x)
def cross(self, q):
return self.x * q.y - self.y * q.x
def dot(self, q):
return self.x * q.x + self.y * q.y
@property
def norm(self):
return self.dot(self)
def __abs__(self):
return self.dot(self) ** 0.5
class Line:
def __init__(self, a, b):
if not isinstance(a, Point) or not isinstance(b, Point):
raise AttributeError("points should be instance of Point")
self.a = a
self.b = b
def cross_point(self, l, eps=1e-12):
deg = (l.b - l.a).cross(self.b - self.a)
if abs(deg) < eps:
return Point(0, 0)
return self.a + (self.b - self.a) * (l.b - l.a).cross(l.b - l.a) / deg
def simple_ccw(a, b, c, eps=1e-12):
if (b - a).cross(c - a) > eps:
return 1
if (b - a).cross(c - a) < -eps:
return -1
return 0
def circum_center(a, b, c):
ab = Line((a + b) / 2, (a + b) / 2 + (a - b).rot90())
bc = Line((b + c) / 2, (b + c) / 2 + (b - c).rot90())
return ab.cross_point(bc)
# ---------------------------------------
# Solution
# ---------------------------------------
N = int(input())
vecs = []
for _ in range(N):
x, y = map(int, input().split())
vecs.append(Point(x, y))
cand = []
for i in range(N):
for j in range(i + 1, N):
cand.append((vecs[i] + vecs[j]) / 2)
for k in range(j + 1, N):
if simple_ccw(vecs[i], vecs[j], vecs[k]) == 0:
continue
cand.append(circum_center(vecs[i], vecs[j], vecs[k]))
ans = float("inf")
for p in cand:
tmp = 0
for v in vecs:
tmp = max(tmp, abs(p - v))
ans = min(ans, tmp)
print("{:.14f}".format(ans))
|
import math
class Point:
def __init__(self, x, y):
self.x = x
self.y = y
def __add__(self, q):
if isinstance(q, Point):
return Point(self.x + q.x, self.y + q.y)
else:
return Point(self.x + q, self.y + q)
def __sub__(self, q):
if isinstance(q, Point):
return Point(self.x - q.x, self.y - q.y)
else:
return Point(self.x - q, self.y - q)
def __mul__(self, q):
if isinstance(q, Point):
return Point(self.x * q.x - self.y * q.y,
self.x * q.y + self.y * q.x)
else:
return Point(self.x * q, self.y * q)
def __truediv__(self, q):
if isinstance(q, Point):
return self * q.conj / q.norm
else:
return Point(self.x / q, self.y / q)
@property
def conj(self):
return Point(self.x, -self.y)
def rot(self, ang):
return Point(math.cos(ang) * self.x - math.sin(ang) * self.y,
math.sin(ang) * self.x + math.cos(ang) * self.y)
def rot90(self):
return Point(-self.y, self.x)
def cross(self, q):
return self.x * q.y - self.y * q.x
def dot(self, q):
return self.x * q.x + self.y * q.y
@property
def norm(self):
return self.dot(self)
def __abs__(self):
return self.dot(self) ** 0.5
class Line:
def __init__(self, a, b):
if not isinstance(a, Point) or not isinstance(b, Point):
raise AttributeError("points should be instance of Point")
self.a = a
self.b = b
def cross_point(self, l, eps=1e-12):
deg = (l.b - l.a).cross(self.b - self.a)
if abs(deg) < eps:
return Point(0, 0)
return self.a + (self.b - self.a) * (l.b - l.a).cross(l.b - self.a) / deg
def simple_ccw(a, b, c, eps=1e-12):
if (b - a).cross(c - a) > eps:
return 1
if (b - a).cross(c - a) < -eps:
return -1
return 0
def circum_center(a, b, c):
ab = Line((a + b) / 2, (a + b) / 2 + (a - b).rot90())
bc = Line((b + c) / 2, (b + c) / 2 + (b - c).rot90())
return ab.cross_point(bc)
# ---------------------------------------
# Solution
# ---------------------------------------
N = int(input())
vecs = []
for _ in range(N):
x, y = map(int, input().split())
vecs.append(Point(x, y))
cand = []
for i in range(N):
for j in range(i + 1, N):
cand.append((vecs[i] + vecs[j]) / 2)
for k in range(j + 1, N):
if simple_ccw(vecs[i], vecs[j], vecs[k]) == 0:
continue
cand.append(circum_center(vecs[i], vecs[j], vecs[k]))
ans = float("inf")
for p in cand:
tmp = 0
for v in vecs:
tmp = max(tmp, abs(p - v))
ans = min(ans, tmp)
print("{:.14f}".format(ans))
|
[
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 611,635
| 611,636
|
u057109575
|
python
|
p02805
|
import math
class Point:
def __init__(self, x, y):
self.x = x
self.y = y
def __add__(self, q):
if isinstance(q, Point):
return Point(self.x + q.x, self.y + q.y)
else:
return Point(self.x + q, self.y + q)
def __sub__(self, q):
if isinstance(q, Point):
return Point(self.x - q.x, self.y - q.y)
else:
return Point(self.x - q, self.y - q)
def __mul__(self, q):
if isinstance(q, Point):
return Point(self.x * q.x - self.y * q.y,
self.x * q.y + self.y * q.x)
else:
return Point(self.x * q, self.y * q)
def __truediv__(self, q):
if isinstance(q, Point):
return self * q.conj / q.norm
else:
return Point(self.x / q, self.y / q)
@property
def conj(self):
return Point(self.x, -self.y)
def rot(self, ang):
return Point(math.cos(ang) * self.x - math.sin(ang) * self.y,
math.sin(ang) * self.x + math.cos(ang) * self.y)
def rot90(self):
return Point(-self.y, self.x)
def cross(self, q):
return self.x * q.y - self.y * q.x
def dot(self, q):
return self.x * q.x + self.y * q.y
@property
def norm(self):
return self.dot(self)
def __abs__(self):
return self.dot(self) ** 0.5
class Line:
def __init__(self, a, b):
if not isinstance(a, Point) or not isinstance(b, Point):
raise AttributeError("points should be instance of Point")
self.a = a
self.b = b
def cross_point(self, l, eps=1e-10):
deg = (l.b - l.a).cross(self.b - self.a)
if abs(deg) < eps:
return Point(0, 0)
return self.a + (self.b - self.a) * (l.b - l.a).cross(l.b - l.a) / deg
def simple_ccw(a, b, c, eps=1e-10):
if (b - a).cross(c - a) > eps:
return 1
if (b - a).cross(c - a) < -eps:
return -1
return 0
def circum_center(a, b, c):
ab = Line((a + b) / 2, (a + b) / 2 + (a - b).rot90())
bc = Line((b + c) / 2, (b + c) / 2 + (b - c).rot90())
return ab.cross_point(bc)
# ---------------------------------------
# Solution
# ---------------------------------------
N = int(input())
vecs = []
for _ in range(N):
x, y = map(int, input().split())
vecs.append(Point(x, y))
cand = []
for i in range(N):
for j in range(i + 1, N):
cand.append((vecs[i] + vecs[j]) / 2)
for k in range(j + 1, N):
if simple_ccw(vecs[i], vecs[j], vecs[k]) == 0:
continue
cand.append(circum_center(vecs[i], vecs[j], vecs[k]))
ans = float("inf")
for p in cand:
tmp = 0
for v in vecs:
tmp = max(tmp, abs(p - v))
ans = min(ans, tmp)
print("{:.14f}".format(ans))
|
import math
class Point:
def __init__(self, x, y):
self.x = x
self.y = y
def __add__(self, q):
if isinstance(q, Point):
return Point(self.x + q.x, self.y + q.y)
else:
return Point(self.x + q, self.y + q)
def __sub__(self, q):
if isinstance(q, Point):
return Point(self.x - q.x, self.y - q.y)
else:
return Point(self.x - q, self.y - q)
def __mul__(self, q):
if isinstance(q, Point):
return Point(self.x * q.x - self.y * q.y,
self.x * q.y + self.y * q.x)
else:
return Point(self.x * q, self.y * q)
def __truediv__(self, q):
if isinstance(q, Point):
return self * q.conj / q.norm
else:
return Point(self.x / q, self.y / q)
@property
def conj(self):
return Point(self.x, -self.y)
def rot(self, ang):
return Point(math.cos(ang) * self.x - math.sin(ang) * self.y,
math.sin(ang) * self.x + math.cos(ang) * self.y)
def rot90(self):
return Point(-self.y, self.x)
def cross(self, q):
return self.x * q.y - self.y * q.x
def dot(self, q):
return self.x * q.x + self.y * q.y
@property
def norm(self):
return self.dot(self)
def __abs__(self):
return self.dot(self) ** 0.5
class Line:
def __init__(self, a, b):
if not isinstance(a, Point) or not isinstance(b, Point):
raise AttributeError("points should be instance of Point")
self.a = a
self.b = b
def cross_point(self, l, eps=1e-12):
deg = (l.b - l.a).cross(self.b - self.a)
if abs(deg) < eps:
return Point(0, 0)
return self.a + (self.b - self.a) * (l.b - l.a).cross(l.b - self.a) / deg
def simple_ccw(a, b, c, eps=1e-12):
if (b - a).cross(c - a) > eps:
return 1
if (b - a).cross(c - a) < -eps:
return -1
return 0
def circum_center(a, b, c):
ab = Line((a + b) / 2, (a + b) / 2 + (a - b).rot90())
bc = Line((b + c) / 2, (b + c) / 2 + (b - c).rot90())
return ab.cross_point(bc)
# ---------------------------------------
# Solution
# ---------------------------------------
N = int(input())
vecs = []
for _ in range(N):
x, y = map(int, input().split())
vecs.append(Point(x, y))
cand = []
for i in range(N):
for j in range(i + 1, N):
cand.append((vecs[i] + vecs[j]) / 2)
for k in range(j + 1, N):
if simple_ccw(vecs[i], vecs[j], vecs[k]) == 0:
continue
cand.append(circum_center(vecs[i], vecs[j], vecs[k]))
ans = float("inf")
for p in cand:
tmp = 0
for v in vecs:
tmp = max(tmp, abs(p - v))
ans = min(ans, tmp)
print("{:.14f}".format(ans))
|
[
"literal.number.float.change",
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 611,637
| 611,636
|
u057109575
|
python
|
p02805
|
import numpy as np
import math
class GradientDescent:
def __init__(self, f, df, eta=0.01, eps=1e-7):
self.f = f # 最適化する関数
self.df = df # 関数の勾配（１次導関数）
self.eta = eta # 学習率
self.eps = eps # 学習のストップ判定に用いる定数
self.path = None # 学習の経過、初期値は空
def solve(self, x, count_max):
path = []
grad = self.df(x) # 勾配
path.append(x)
count = 0
# 多変数の場合のノルムの大きさとself.epsを比較
# self.epsの二乗より大きい場合、xの更新を続ける
while (grad**2).sum() > self.eps**2 and count < count_max:
x = x - self.eta * grad
grad = self.df(x)
# print(x, grad)
path.append(x)
count += 1
self.path_ = np.array(path) # 学習の経過
self.x_ = x # 最適化された変数の値
self.opt_ = f(x) # 最適化後の f(x)の値
self.grad_ = grad # 最適化後の勾配
def f(xy):
x = xy[0]
y = xy[1]
ret = 0.
for i in range(n):
dx, dy = x - p[i][0], y - p[i][1]
ret = max(ret, dx**2 + dy**2)
return math.sqrt(ret)
def df(xy):
mu = 1e-8
x = xy[0]
y = xy[1]
return np.array([(f([x + mu, y]) - f([x - mu, y])) / (2 * mu), (f([x, y + mu]) - f([x, y - mu])) / (2 * mu)])
n = int(input())
p = []
for i in range(n):
xy = list(map(float, input().split()))
p.append(xy)
xy = np.array([500., 500.])
for e_eta in range(2, -9, -1):
gd = GradientDescent(f, df, eta=10**e_eta)
initial = np.array(xy)
gd.solve(initial, 100)
xy = gd.x_
print(gd.opt_)
|
import numpy as np
import math
class GradientDescent:
def __init__(self, f, df, eta=0.01, eps=1e-8):
self.f = f # 最適化する関数
self.df = df # 関数の勾配（１次導関数）
self.eta = eta # 学習率
self.eps = eps # 学習のストップ判定に用いる定数
self.path = None # 学習の経過、初期値は空
def solve(self, x, count_max):
path = []
grad = self.df(x) # 勾配
path.append(x)
count = 0
# 多変数の場合のノルムの大きさとself.epsを比較
# self.epsの二乗より大きい場合、xの更新を続ける
while (grad**2).sum() > self.eps**2 and count < count_max:
x = x - self.eta * grad
grad = self.df(x)
# print(x, grad)
path.append(x)
count += 1
self.path_ = np.array(path) # 学習の経過
self.x_ = x # 最適化された変数の値
self.opt_ = f(x) # 最適化後の f(x)の値
self.grad_ = grad # 最適化後の勾配
def f(xy):
x = xy[0]
y = xy[1]
ret = 0.
for i in range(n):
dx, dy = x - p[i][0], y - p[i][1]
ret = max(ret, dx**2 + dy**2)
return math.sqrt(ret)
def df(xy):
mu = 1e-9
x = xy[0]
y = xy[1]
return np.array([(f([x + mu, y]) - f([x - mu, y])) / (2. * mu), (f([x, y + mu]) - f([x, y - mu])) / (2. * mu)])
n = int(input())
p = []
for i in range(n):
xy = list(map(float, input().split()))
p.append(xy)
xy = np.array([500., 500.])
for e_eta in range(2, -9, -1):
gd = GradientDescent(f, df, eta=10**e_eta)
initial = np.array(xy)
gd.solve(initial, 200)
xy = gd.x_
# print(xy)
print(gd.opt_)
|
[
"literal.number.float.change",
"assignment.value.change",
"literal.integer.replace.remove",
"literal.float.replace.add",
"call.arguments.change",
"function.return_value.change",
"literal.number.integer.change"
] | 611,707
| 611,705
|
u617380180
|
python
|
p02805
|
n = int(input())
p = []
for _ in range(n):
x,y = map(int, input().split())
p.append([x,y])
import math
import itertools
if n == 2:
print(math.sqrt((p[0][0]-p[1][0])**2 + (p[0][1]-p[1][1])**2)/2)
exit()
def rad(v):
p1 = v[0]
p2 = v[1]
p3 = v[2]
x1 = p1[0]
y1 = p1[1]
x2 = p2[0]
y2 = p2[1]
x3 = p3[0]
y3 = p3[1]
px = (x1-x3)*(y1**2-y2**2+x1**2-x2**2)-(y1-y2)*(y1**2-y3**2+x1**2-x3**2)
if (2*(y1-y3)*(x1-x2)-2*(y1-y2)*(x1-x3)) == 0:
return None
px = px / (2*(y1-y3)*(x1-x2)-2*(y1-y2)*(x1-x3))
py = (x1-x3)*(x1**2-x2**2+y1**2-y2**2)-(x1-x2)*(x1**2-x3**2+y1**2-y3**2)
if (2*(x1-x3)*(y1-y2)-2*(x1-x2)*(y1-y3)) == 0:
return None
py = py / (2*(x1-x3)*(y1-y2)-2*(x1-x2)*(y1-y3))
return [px,py,(x1-px)**2+(y1-px)**2]
ans = 10**13
for v in itertools.combinations(p,2):
p1 = v[0]
p2 = v[1]
px = (p1[0]+p2[0])/2
py = (p1[1]+p2[1])/2
rr = (p1[0]-p2[0])**2+(p1[1]-p2[1])**2
rr = rr /4
chk = True
for i in range(n):
if (p[i][0]-px)**2+(p[i][1]-py)**2 > rr + 10**(-6):
chk = False
if chk:
ans = min(ans,rr**0.5)
for v in itertools.combinations(p,3):
d = rad(v)
if d == None:
continue
chk = True
for i in range(n):
if (p[i][0]-d[0])**2+(p[i][1]-d[1])**2 > d[2]+10**(-6):
chk = False
if chk:
ans = min(ans,d[2]**0.5)
print(ans)
|
n = int(input())
p = []
for _ in range(n):
x,y = map(int, input().split())
p.append([x,y])
import math
import itertools
if n == 2:
print(math.sqrt((p[0][0]-p[1][0])**2 + (p[0][1]-p[1][1])**2)/2)
exit()
def rad(v):
p1 = v[0]
p2 = v[1]
p3 = v[2]
x1 = p1[0]
y1 = p1[1]
x2 = p2[0]
y2 = p2[1]
x3 = p3[0]
y3 = p3[1]
px = (y1-y3)*(y1**2-y2**2+x1**2-x2**2)-(y1-y2)*(y1**2-y3**2+x1**2-x3**2)
if (2*(y1-y3)*(x1-x2)-2*(y1-y2)*(x1-x3)) == 0:
return None
px = px / (2*(y1-y3)*(x1-x2)-2*(y1-y2)*(x1-x3))
py = (x1-x3)*(x1**2-x2**2+y1**2-y2**2)-(x1-x2)*(x1**2-x3**2+y1**2-y3**2)
if (2*(x1-x3)*(y1-y2)-2*(x1-x2)*(y1-y3)) == 0:
return None
py = py / (2*(x1-x3)*(y1-y2)-2*(x1-x2)*(y1-y3))
return [px,py,(x1-px)**2+(y1-py)**2]
ans = 10**13
for v in itertools.combinations(p,2):
p1 = v[0]
p2 = v[1]
px = (p1[0]+p2[0])/2
py = (p1[1]+p2[1])/2
rr = (p1[0]-p2[0])**2+(p1[1]-p2[1])**2
rr = rr /4
chk = True
for i in range(n):
if (p[i][0]-px)**2+(p[i][1]-py)**2 > rr + 10**(-6):
chk = False
if chk:
ans = min(ans,rr**0.5)
for v in itertools.combinations(p,3):
d = rad(v)
if d == None:
continue
chk = True
for i in range(n):
if (p[i][0]-d[0])**2+(p[i][1]-d[1])**2 > d[2] + 10**(-6):
chk = False
if chk:
ans = min(ans,d[2]**0.5)
print(ans)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"function.return_value.change"
] | 611,721
| 611,722
|
u906428167
|
python
|
p02811
|
n = 500
x, y = map(int, raw_input().split())
if x*n >= y:
print("Yes")
else:
print("No")
|
n = 500
x, y = map(int, input().split())
if x*n >= y:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.change"
] | 611,790
| 611,791
|
u735315224
|
python
|
p02811
|
k, x = map(int, input().split())
p = k * 500
if p > x:
print('Yes')
else:
print('No')
|
k, x = map(int, input().split())
p = k * 500
if p >= x:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,792
| 611,793
|
u636669232
|
python
|
p02811
|
K, X = input().split()
K, X = int(K), int(X)
if K * 500 > X:
print("Yes")
else:
print("No")
|
K, X = input().split()
K, X = int(K), int(X)
if K * 500 >= X:
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,817
| 611,818
|
u054473438
|
python
|
p02811
|
k, x = list(map(int, input().split()))
if 500*k >= x:
print('yes')
else:
print('no')
|
k, x = list(map(int, input().split()))
if 500*k >= x:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,844
| 611,845
|
u208187916
|
python
|
p02811
|
K, X = map(int, input().split())
total = 500 * K
if total >= X:
print("Yes")
else:
prnt("No")
|
K, X = map(int, input().split())
total = 500 * K
if total >= X:
print("Yes")
else:
print("No")
|
[
"identifier.change",
"call.function.change"
] | 611,846
| 611,847
|
u891884439
|
python
|
p02811
|
K,X = map(int,input().split())
Knew = 500*K
if Knew >=X:
print("yes")
else:
print("No")
|
K,X = map(int,input().split())
Knew = 500*K
if Knew >=X:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,854
| 611,855
|
u679236042
|
python
|
p02811
|
K, X = list(map(int,input().split()))
def main():
coin = 500
if x <= coin*K:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
K, X = list(map(int,input().split()))
def main():
coin = 500
if X <= coin*K:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 611,864
| 611,865
|
u898428248
|
python
|
p02811
|
num = input().split()
if int(num[0])*500 > int(num[1]): print("Yes")
else: print("No")
|
num = input().split()
if int(num[0])*500 >= int(num[1]):
print("Yes")
else:
print("No")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,881
| 611,882
|
u945140822
|
python
|
p02811
|
K,X = map(int,input().split())
if 500*K>=X:
print("yes")
else:
print("no")
|
K,X = map(int,input().split())
if 500*K>=X:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,883
| 611,884
|
u690184681
|
python
|
p02811
|
x, y = input().split()
if int(x) * 500 > int(y):
print("Yes")
else:
print("No")
|
x, y = input().split()
if int(x) * 500 < int(y):
print("No")
else:
print("Yes")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 611,892
| 611,893
|
u218487926
|
python
|
p02811
|
import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
X, K = map(int, input().split())
if 500 * K >= X:
print("Yes")
else:
print("No")
# Run main
if __name__ == '__main__':
AtCoder().main()
|
import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
K, X = map(int, input().split())
if 500 * K >= X:
print("Yes")
else:
print("No")
# Run main
if __name__ == '__main__':
AtCoder().main()
|
[] | 611,894
| 611,895
|
u131625544
|
python
|
p02811
|
import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
X, K = map(int, input().split())
if 500 * K >= 1000:
print("Yes")
else:
print("No")
# Run main
if __name__ == '__main__':
AtCoder().main()
|
import sys
input = sys.stdin.readline
class AtCoder:
def main(self):
K, X = map(int, input().split())
if 500 * K >= X:
print("Yes")
else:
print("No")
# Run main
if __name__ == '__main__':
AtCoder().main()
|
[
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 611,896
| 611,895
|
u131625544
|
python
|
p02811
|
K,X = (input().split())
if K * 500 >= X:
print ("Yes")
else: print ("No")
|
K,X = map(int,input().split())
if K * 500 >= X:
print ("Yes")
else: print ("No")
|
[
"call.add",
"call.arguments.add"
] | 611,899
| 611,900
|
u870684607
|
python
|
p02811
|
k,x = input().split()
if k*500 >= x:
print("Yes")
else:
print("No")
|
k,x = input().split()
if int(k)*500 >= int(x):
print("Yes")
else:
print("No")
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 611,910
| 611,911
|
u366784601
|
python
|
p02811
|
a,b=map(int,input().split())
if (a * 500) <= b:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split())
if (a * 500) < b:
print("No")
else:
print("Yes")
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 611,912
| 611,913
|
u460553416
|
python
|
p02811
|
a,b=map(int,input().split())
if (a * 500) < b:
print("Yes")
else:
print("No")
|
a,b=map(int,input().split())
if (a * 500) < b:
print("No")
else:
print("Yes")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 611,914
| 611,913
|
u460553416
|
python
|
p02811
|
a=input().split()
b=a[0]
c=a[1]
if 500*b >= c :
print("Yes")
else:
print("No")
|
a=input().split()
b=int(a[0])
c=int(a[1])
if 500*b >= c:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 611,917
| 611,918
|
u771538568
|
python
|
p02811
|
a=input().split()
b=a[0]
c=a[1]
if 500*b>=c:
print("Yes")
else:
print("No")
|
a=input().split()
b=int(a[0])
c=int(a[1])
if 500*b >= c:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 611,920
| 611,918
|
u771538568
|
python
|
p02811
|
K,X=list(map(int,input().split(' ')))
if X>=K*500:
print('No')
else:
print('Yes')
|
K,X=list(map(int,input().split(' ')))
if X>K*500:
print('No')
else:
print('Yes')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,925
| 611,926
|
u311176548
|
python
|
p02811
|
K,X=list(map(int,input().split(' ')))
if X>=K*500:
print('Yes')
else:
print('No')
|
K,X=list(map(int,input().split(' ')))
if X>K*500:
print('No')
else:
print('Yes')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 611,927
| 611,926
|
u311176548
|
python
|
p02811
|
K,X=list(map(int,input().split(' ')))
if X>=K*500:
print('Yes')
else:
print('No')
|
K,X=list(map(int,input().split(' ')))
if X>K*500:
print('No')
else:
print('Yes')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.add"
] | 611,928
| 611,926
|
u311176548
|
python
|
p02811
|
K, X = map(int,input().split())
K = K*500
if(K >= X):
print("yes")
else:
print("No")
|
K, X = map(int,input().split())
K = K*500
if(K >= X):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 611,935
| 611,936
|
u212347962
|
python
|
p02811
|
K, X = map(int, input().split())
print("Yes" if 500*K>X else "No")
|
K, X = map(int, input().split())
print("No" if 500*K<X else "Yes")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change",
"misc.opposites",
"expression.operator.compare.change"
] | 611,964
| 611,965
|
u602740328
|
python
|
p02811
|
K, X = map(int, input().split())
if K*500 > X:
print('Yes')
else:
print('No')
|
K, X = map(int, input().split())
if K*500 >= X:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,966
| 611,967
|
u259416421
|
python
|
p02811
|
K,X = map(int,input().split())
ans = 'No'
y = 500 * K
if y > X:
ans = 'Yes'
print(ans)
|
K,X = map(int,input().split())
ans = 'No'
y = 500 * K
if y >= X:
ans = 'Yes'
print(ans)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 611,977
| 611,978
|
u431981421
|
python
|
p02811
|
k, x = map(int,input().split())
if 500*k > x:
print('Yes')
else:
print('No')
|
k, x = map(int,input().split())
if 500*k >= x:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 612,005
| 612,006
|
u564837886
|
python
|
p02811
|
b,c = map(int, input().split())
if 500 * b > c:
print('Yes')
else:
print('No')
|
b,c = map(int, input().split())
if 500 * b >= c:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 612,029
| 612,030
|
u982749462
|
python
|
p02811
|
S = input()
X = S.split(" ")[0]
Y = S.split(" ")[1]
if X*500 >= Y:
print("Yes")
else:
print("No")
|
S = input()
X = int(S.split(" ")[0])
Y = int(S.split(" ")[1])
if X*500 >= Y:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 612,046
| 612,047
|
u758353414
|
python
|
p02811
|
import sys
# input=sys.stdin.readline
val = []
val = input()
arrays = val.split(' ')
a = int(arrays[0])*500
if a>=int(arrays[1]):
print("Yes")
elif a<int(arrays[1]):
print("No")
print(arrays, a)
sys.exit()
|
import sys
# input=sys.stdin.readline
val = []
val = input()
arrays = val.split(' ')
a = int(arrays[0])*500
if a>=int(arrays[1]):
print("Yes")
elif a<int(arrays[1]):
print("No")
sys.exit()
|
[
"call.remove"
] | 612,066
| 612,067
|
u296620754
|
python
|
p02811
|
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
print("Yes")
if sum<b:
print("NO")
exit()
|
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
print("Yes")
else:
print("No")
exit()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 612,069
| 612,070
|
u248791307
|
python
|
p02811
|
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
print("Yes")
else:
print("NO")
exit()
|
a,b=map(int,input().split( ))
sum=a*500
if sum>=b:
print("Yes")
else:
print("No")
exit()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 612,071
| 612,070
|
u248791307
|
python
|
p02811
|
k,x = map(int,input().split())
ks = k * 500
if ks < k:
print('No')
else:
print('Yes')
|
k,x = map(int,input().split())
ks = k * 500
if ks < x:
print('No')
else:
print('Yes')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 612,095
| 612,096
|
u979726772
|
python
|
p02811
|
k, x = map(int, input())
if(k * 500 >= x): print("Yes")
else: print("No")
|
k, x = map(int, input().split())
if k * 500 >= x: print("Yes")
else: print("No")
|
[
"call.add",
"control_flow.branch.if.condition.change"
] | 612,097
| 612,098
|
u956530786
|
python
|
p02811
|
sp_list = list(map(int, input.split()))
if 500 * sp_list[0] >= sp_list[1]:
print("Yes")
else:
print("No")
|
sp_list = list(map(int, input().split()))
if 500 * sp_list[0] >= sp_list[1]:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 612,103
| 612,104
|
u709686535
|
python
|
p02811
|
x,y = map(int,input().split())
if(x*500<y):
print("NO")
else:
print("YES")
|
x,y = map(int,input().split())
if(x*500<y):
print("No")
else:
print("Yes")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 612,122
| 612,123
|
u133134242
|
python
|
p02811
|
a = list(map(int,input().split()))
if a[0] * 500 > a[1]:
print('Yes')
else:
print('No')
|
a = list(map(int,input().split()))
if a[0] * 500 >= a[1]:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 612,124
| 612,125
|
u087592149
|
python
|
p02811
|
# coding: utf-8
num_of_coins, border = (int(n) for n in input().split)
if 500 * num_of_coins >= border:
print("Yes")
else:
print("No")
|
# coding: utf-8
num_of_coins, border = (int(n) for n in input().split())
if 500 * num_of_coins >= border:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 612,135
| 612,136
|
u691746545
|
python
|
p02811
|
def p_a():
k, x = map(int, input().split())
print("Yes" if 500 * k > x else "No")
p_a()
|
def p_a():
k, x = map(int, input().split())
print("Yes" if 500 * k >= x else "No")
p_a()
|
[
"expression.operator.compare.change",
"call.arguments.change",
"io.output.change"
] | 612,137
| 612,138
|
u756829954
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.