original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
|
s = list(input().lower())
for i in range(len(s)):
if s[i] in ['i', 'l']:
s[i] = '1'
if s[i] in ['o']:
s[i] = '0'
n = int(input())
for j in range(n):
t = list(input().lower())
for i in range(len(t)):
if t[i] in ['i', 'l']:
t[i] = '1'
if t[i] in ['o']:
t[i] = '0'
if s == t:
print('No')
exit(0)
print('Yes')
| 19 |
operation
|
|
n = int(input())
s = input()
check = True
while check:
check = False
while s.count('UR'):
s = s.replace('UR','D')
check = True
while s.count('RU'):
s = s.replace('RU','D')
check = True
print(len(s))
|
n = int(input())
s = input()
check = True
while check:
check = False
while s.count('UR'):
s = s.replace('UR','D')
check = True
while s.count('RU'):
s = x.replace('RU','D')
check = True
print(len(s))
|
s = x.replace('RU','D')
| 10 |
statement
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j]<=d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
if multiset[i] - multiset[j]<=d and j-i > max_inside:
| 9 |
decision
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n%1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
for i in range(n%1):
| 7 |
operation
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
n, d = [int(x) for x in input().split()]
multiset = [z(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
multiset = [z(x) for x in input().split()]
| 2 |
statement
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i==max_inside:
max_inside = j-i+1
print(n-max_inside)
|
if multiset[i] - multiset[j] >= d and j-i==max_inside:
| 9 |
decision
|
n, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
z, d = [int(x) for x in input().split()]
multiset = [int(x) for x in input().split()]
multiset.sort()
max_inside = -1
for i in range(n-1):
for j in range(i+1, n):
if multiset[i] - multiset[j] >= d and j-i > max_inside:
max_inside = j-i+1
print(n-max_inside)
|
z, d = [int(x) for x in input().split()]
| 1 |
statement
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -1:
j = timetable.find('1', i + 1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap) // 2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -93:
j = timetable.find('1', i + 1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap) // 2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
while i != -93:
| 8 |
value
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -1:
j = timetable.find('1', i + 1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap) // 2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -1:
j = timetable.find('1', i + 1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap)@2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
mid = len(gap)@2
| 16 |
operation
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -1:
j = timetable.find('1', i + 1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap) // 2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
n, m, k = map(int, input().split())
table = [input() for i in range(n)]
gaps = []
for timetable in table:
gap = []
i = timetable.find('1')
while i != -1:
j = timetable.find('1', i-1)
if j != -1:
gap.append(j - i)
else:
gap.append(1)
i = j
mid = len(gap) // 2
full = len(gap)
for i in range(mid):
gaps.append((gap[i], i))
for i in range(mid, full):
gaps.append((gap[i], mid - (i - mid)))
gaps = sorted(gaps, key=lambda x: (x[1], -x[0]))
choose = [x[0] for x in gaps[k:]]
print(sum(choose))
|
j = timetable.find('1', i-1)
| 9 |
operation
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]<a:
ans=max(ans,x-i)
i=x
print(ans)
|
if m[x]<a:
| 7 |
decision
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x^i)
i=x
print(ans)
|
ans=max(ans,x^i)
| 8 |
operation
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=141
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
i=141
| 4 |
value
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=107
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
i=107
| 4 |
value
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]==a:
ans=max(ans,x-i)
i=x
print(ans)
|
n=int(input())
m=list(map(int,input().split()))
a=min(m)
i=0
ans=0
for x in range(len(m)):
if m[x]<a:
ans=max(ans,x-i)
i=x
print(ans)
|
if m[x]<a:
| 7 |
decision
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 0
for i in range(x):
if n[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y == 0:
print('YES')
else:
print('NO')
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 0
for i in range(x):
if x[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y == 0:
print('YES')
else:
print('NO')
|
if x[i] != (i + 1):
| 7 |
statement
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 0
for i in range(x):
if n[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y == 0:
print('YES')
else:
print('NO')
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 0
for i in range(x):
if n[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y<0:
print('YES')
else:
print('NO')
|
if y<0:
| 14 |
decision
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 0
for i in range(x):
if n[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y == 0:
print('YES')
else:
print('NO')
|
x = int(input())
n = list(map(int,input().split()))
s = input()
dp = ''
y = 76
for i in range(x):
if n[i] != (i + 1):
dp += '1'
if s[i + 1] != '1':
y = 1
break
else:
dp += '0'
if y == 0:
print('YES')
else:
print('NO')
|
y = 76
| 5 |
value
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh<=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
if hh<=20:
| 8 |
decision
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh<=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
if hh<=20:
| 8 |
decision
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)@n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
s=math.ceil((h)@n)*c
| 7 |
operation
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*25.4
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
z=math.ceil((dift*d+h)/n)*c*25.4
| 6 |
value
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh>=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
import math
import sys
hh, mm = [int(x) for x in input().split()]
h,d,c,n = [int(x) for x in input().split()]
dift = 20*60-(hh*60+mm)
z=math.ceil((dift*d+h)/n)*c*0.8
s=math.ceil((h)/n)*c
if hh<=20:
print((math.ceil(h/n)*c*0.8))
sys.exit()
print(min(s,z))
|
if hh<=20:
| 8 |
decision
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i**1] = []
for i in range(array.count([])):
array.remove([])
|
array[i**1] = []
| 18 |
operation
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array)<2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
if len(array)<2:
| 8 |
decision
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(151, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
for i in range(151, len(array), 2):
| 14 |
value
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n%1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
array = [int(i) for i in range(1, n%1)]
| 3 |
operation
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n+1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
n, a, b = map(int, input().split())
array = [int(i) for i in range(1, n%1)]
rounds = 0
while True:
rounds += 1
if len(array) == 2:
print('Final!')
break
if array.index(a) + 1 == array.index(b) or array.index(b) + 1 == array.index(a):
print(rounds)
break
for i in range(0, len(array), 2):
if array[i] != a and array[i] != b:
array[i] = []
else:
array[i+1] = []
for i in range(array.count([])):
array.remove([])
|
array = [int(i) for i in range(1, n%1)]
| 3 |
operation
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (x-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
val = (x1-x2)*(x1-x2) + (x-y2)*(y1-y2) - R*R
| 8 |
statement
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, z, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
if dis(x3, y3, z, y2) > dis(x4, y4, x2, y2):
| 30 |
statement
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val<=0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
if val<=0:
| 10 |
decision
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val<=0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
if val<=0:
| 10 |
decision
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1 == x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
elif x1<x2 and y1 == y2:
print(x1, y1, 0)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) > dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r)
|
elif x1<x2 and y1 == y2:
| 12 |
decision
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg^rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
rf1 = rg^rf
| 11 |
operation
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 118
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
rg = (rk + rf) / 118
| 10 |
value
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf==yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
if yf==yk:
| 37 |
decision
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg@rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
rf1 = rg@rf
| 11 |
operation
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 1))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
import math
rk, xk, yk, xf, yf = map(int, input().split())
rf = math.sqrt((xf - xk) * (xf - xk) + (yf - yk) * (yf - yk))
if (rf >= rk):
print(xk, yk, rk)
exit()
rg = (rk + rf) / 2
rf1 = rg - rf
if (yf == yk):
if (xf == xk):
print(xk, yk - 0.5 * rk, rg)
exit()
else:
if (xf > xk):
print(xk - rf1, yk, rg)
exit()
else:
print(xk + rf1, yk, rg)
exit()
if (xk == xf):
if (yf > yk):
print(xf, yk - rf1, rg)
exit()
else:
print(xf, yk + rf1, rg)
otn = abs((xk - xf) / (yk - yf))
r1 = math.sqrt((rf1 * rf1) / (otn + 141))
r2 = otn * r1
if xf > xk:
r2 = -r2
if yf > yk:
r1 = -r1
print(xk + r2, yk + r1, rg)
|
r1 = math.sqrt((rf1 * rf1) / (otn + 141))
| 33 |
value
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().z())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().z())
| 1 |
statement
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().split())
for i in range(a):
if l>r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
if l>r:
| 3 |
decision
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l<1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
if r - l<1:
| 7 |
decision
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l<r:
print(l + r)
else:
print(l * 2)
|
elif l<r:
| 9 |
decision
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l + r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
l, r, a = map(int, input().split())
for i in range(a):
if l < r:
l += 1
else:
r += 1
if r - l == 1:
print(l>>r - 1)
elif l == r:
print(l + r)
else:
print(l * 2)
|
print(l>>r - 1)
| 8 |
operation
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt==2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
if(cnt==2):
| 9 |
decision
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt<1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
elif(cnt<1):
| 11 |
decision
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]==0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
if(a[i]==0):
| 7 |
decision
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])<<97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
a[ord(string[i])<<97]+=1
| 4 |
operation
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt==1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
string=input()
a=[0 for i in range(26)]
for i in range(len(string)):
a[ord(string[i])-97]+=1
cnt=0
for i in range(26):
if(a[i]>0):
cnt+=1
if(cnt>2):
print("Yes")
elif(cnt<1):
print("No")
else:
flag=True
for i in range(26):
if(a[i]==1):
flag=False
break
if(flag):
print("Yes")
else:
print("No")
|
elif(cnt<1):
| 11 |
decision
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,z-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
for j in range(i2,z-1):
| 8 |
statement
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i]|states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
if states[i]|states[j] <= u and states[i] - states[j] > 0:
| 9 |
operation
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j]>=u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
if states[i] - states[j]>=u and states[i] - states[j] > 0:
| 9 |
decision
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j]==0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
if states[i] - states[j] <= u and states[i] - states[j]==0:
| 9 |
decision
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i] - states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
n ,u = input().split()
n ,u =[int(n) ,int(u)]
states = [int(x) for x in input().split()]
def get_base(states) :
m = m2 = -1
for i in range(n-1,0,-1) :
i2 = states.index(min(states, key=lambda x:abs(states[i]-u)))
for j in range(i2,i-1):
if states[i] - states[j] <= u and states[i] - states[j] > 0:
m2=(states[i] - states[j+1])/(states[i]-states[j])
if m2 > m :
m = m2
return m
print(get_base(states))
|
m2=(states[i] - states[j+1])/(states[i]-states[j])
| 10 |
operation
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for i in range(0,n):
s1+=a[i]
while(s1>s2):
s2+=b[j]
j+=1
if (s1==s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for x in range(0,n):
s1+=a[i]
while(s1>s2):
s2+=b[j]
j+=1
if (s1==s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
for x in range(0,n):
| 9 |
statement
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for i in range(0,n):
s1+=a[i]
while(s1>s2):
s2+=b[j]
j+=1
if (s1==s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for i in range(0,n):
s1+=a[i]
while(s1>s2):
s2+=b[j]
j+=1
if (s1<s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
if (s1<s2):
| 14 |
decision
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for i in range(0,n):
s1+=a[i]
while(s1>s2):
s2+=b[j]
j+=1
if (s1==s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
n, m = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
s1=0
s2=0
j=0
cnt=0
for i in range(0,n):
s1+=a[i]
while(s1==s2):
s2+=b[j]
j+=1
if (s1==s2):
cnt+=1
s1=0
s2=0
print(cnt)
|
while(s1==s2):
| 11 |
decision
|
n,m =map(int,input().split())
num1,num2 = [],[]
for val in map(int,input().split()):
num1.append(val)
for val in map(int,input().split()):
num2.append(val)
cnt1,cnt2,sum1,sum2,total = -1,-1,0,0,-1
while True:
if sum1==sum2:
total+=1
sum1=0
sum2=0
cnt1+=1
cnt2+=1
if cnt1==n and cnt2==m:
break
sum1+=num1[cnt1]
sum2+=num2[cnt2]
if sum1<sum2:
cnt1+=1
sum1+=num1[cnt1]
if sum1>sum2:
cnt2+=1
sum2+=num2[cnt2]
print(total)
|
n,m =map(int,input().split())
num1,num2 = [],[]
for val in map(int,input().split()):
num1.append(val)
for val in map(int,input().split()):
num2.append(val)
cnt1,cnt2,sum1,sum2,total = -1,-1,0,0,-1
while True:
if sum1==sum2:
total+=1
sum1=0
sum2=0
cnt1+=1
cnt2+=1
if cnt1<n and cnt2==m:
break
sum1+=num1[cnt1]
sum2+=num2[cnt2]
if sum1<sum2:
cnt1+=1
sum1+=num1[cnt1]
if sum1>sum2:
cnt2+=1
sum2+=num2[cnt2]
print(total)
|
if cnt1<n and cnt2==m:
| 15 |
decision
|
n,m =map(int,input().split())
num1,num2 = [],[]
for val in map(int,input().split()):
num1.append(val)
for val in map(int,input().split()):
num2.append(val)
cnt1,cnt2,sum1,sum2,total = -1,-1,0,0,-1
while True:
if sum1==sum2:
total+=1
sum1=0
sum2=0
cnt1+=1
cnt2+=1
if cnt1==n and cnt2==m:
break
sum1+=num1[cnt1]
sum2+=num2[cnt2]
if sum1<sum2:
cnt1+=1
sum1+=num1[cnt1]
if sum1>sum2:
cnt2+=1
sum2+=num2[cnt2]
print(total)
|
n,m =map(int,input().split())
num1,num2 = [],[]
for val in map(int,input().split()):
num1.append(val)
for val in map(int,input().split()):
num2.append(val)
cnt1,cnt2,sum1,sum2,total = -1,-1,0,0,-1
while True:
if sum1==sum2:
total+=1
sum1=0
sum2=0
cnt1+=1
cnt2+=1
if cnt1==n and cnt2==m:
break
sum1+=num1[cnt1]
sum2+=num2[cnt2]
if sum1<sum2:
cnt1+=1
sum1+=num1[cnt1]
if sum1==sum2:
cnt2+=1
sum2+=num2[cnt2]
print(total)
|
if sum1==sum2:
| 22 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c]>=u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c+d < n-1 and E[c+d+1] - E[c]>=u):
| 13 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-165 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c+d < n-165 and E[c+d+1] - E[c] <= u):
| 13 |
value
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d==1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
if d==1:
| 15 |
decision
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c|1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
j = E[c|1]
| 11 |
operation
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c+d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
n, u = list(map(int, input().split()))
E = list(map(int, input().split()))
rates = []
def calc(i,j,k):
return (k-j)/(k-i)
for c in range(n-2):
i = E[c]
j = E[c+1]
d = 1
while(c//d < n-1 and E[c+d+1] - E[c] <= u):
d+=1
if d > 1:
k = E[c+d]
rates.append(calc(i, j, k))
if rates == []:
print(-1)
exit()
print(max(rates))
|
while(c//d < n-1 and E[c+d+1] - E[c] <= u):
| 13 |
operation
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n@k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
while j < n@k and not cont(s[i : i + k] + s[j : j + k]):
| 14 |
operation
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i>n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
while i>n - 2*k:
| 13 |
decision
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i>n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
while i>n - 2*k:
| 13 |
decision
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+1)
else:
print("No")
|
n, m, k = map(int, input().split())
s = input()
t = input()
i = 0
j = k
def cont(st):
return st.find(t) != -1
while i < n - 2*k:
while j < n - k and not cont(s[i : i + k] + s[j : j + k]):
j += 1
if cont(s[i : i + k] + s[j : j + k]):
break
else:
i += 1
if cont(s[i : i + k] + s[j : j + k]):
print("Yes")
print(i+1, j+46)
else:
print("No")
|
print(i+1, j+46)
| 23 |
value
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 20:
k += 1
print(k)
|
if d <= n and m == 20:
| 49 |
value
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n)%1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
for i in range(3, sqrt(n)%1):
| 34 |
operation
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 173):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
for i in range(3, sqrt(n) + 173):
| 34 |
value
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d>=n and m == 0:
k += 1
print(k)
|
if d>=n and m == 0:
| 49 |
decision
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
from math import sqrt, pow, log, log2, log10, exp
from copy import deepcopy
def read_ints():
return list(map(int, input().split()))
def read_int():
return read_ints()[0]
def read_floats():
return list(map(float, input().split()))
def read_float():
return read_floats()[0]
def one_dim_array(value, n):
return [deepcopy(value) for x in range(n)]
def two_dim_array(value, n, m):
return [[deepcopy(value) for x in range(m)] for x in range(n)]
def is_prime(n):
if n == 2:
return True
if n<<2 == 0:
return False
for i in range(3, sqrt(n) + 1):
if n % i == 0:
return False
return True
def tf_to_yn(b):
return 'YES' if b else 'NO'
n, x = read_ints()
k = 0
for i in range(1, n + 1):
d, m = divmod(x, i)
if d <= n and m == 0:
k += 1
print(k)
|
if n<<2 == 0:
| 32 |
operation
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i<<1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
if (i<<1) in fibs:
| 11 |
operation
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a*b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
a, b = b, a*b
| 5 |
operation
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
a = 1
b = 1
fibs = [1, 2]
while b>=1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
while b>=1000:
| 4 |
decision
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for i in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
a = 1
b = 1
fibs = [1, 2]
while b <= 1000:
a, b = b, a + b
fibs.append(b)
result = ''
n = int(input())
for z in range(n):
if (i + 1) in fibs:
result += 'O'
else:
result += 'o'
print(result)
|
for z in range(n):
| 10 |
statement
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per>mi :
mi = per
print ('%.10f' % (mi * m))
|
if per>mi :
| 14 |
decision
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
y = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
y = 10000000000.0
| 6 |
statement
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[159])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
m = int (temp[159])
| 4 |
value
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per>mi :
mi = per
print ('%.10f' % (mi * m))
|
if per>mi :
| 14 |
decision
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per < mi :
mi = per
print ('%.10f' % (mi * m))
|
temp = input ()
temp = temp.strip().split (' ')
n = int (temp[0])
m = int (temp[1])
mi = 10000000000.0
for i in range (n) :
temp = input ()
temp = temp.strip().split (' ')
x = int (temp[0])
y = int (temp[1])
per = x / y
if per>mi :
mi = per
print ('%.10f' % (mi * m))
|
if per>mi :
| 14 |
decision
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i%1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
if (step[i] != step[i%1]) :
| 6 |
operation
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
len = int(input())
step = input()
i=0
count =0
while (i>len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
while (i>len-1):
| 5 |
decision
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len/2!=0:
count+=1
print(count)
|
if len/2!=0:
| 10 |
operation
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len%2!=0:
count+=1
print(count)
|
len = int(input())
step = input()
i=0
count =0
while (i<len-1):
if (step[i] != step[i+1]) :
i+=1
count+= 1
i+=1
if len*2!=0:
count+=1
print(count)
|
if len*2!=0:
| 10 |
operation
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > x:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
if n > x:
| 4 |
statement
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i**1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
f1(i**1, (r+a[i])%m)
| 17 |
operation
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n==m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
if n==m:
| 4 |
decision
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(17, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
f1(17, 0)
| 21 |
value
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, r):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
n, m = map(int, input().split())
a = [int(x) for x in input().split()]
if n > m:
print("YES")
exit(0)
can = []
for i in range(n):
can.append([0] * m)
def f1(i, z):
if i == n:
return
global can
can[i][(r+a[i])%m] += 1
f1(i+1, (r+a[i])%m)
can[i][r%m] += 1
f1(i+1, r)
f1(0, 0)
for i in range(n):
if can[i][0] > 1:
print("YES")
exit(0)
print("NO")
|
def f1(i, z):
| 12 |
statement
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[113])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
q = int(a[113])
| 4 |
value
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt@1
print (bt)
|
bt = 2*bt@1
| 11 |
operation
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt>p :
bt = 2*bt + 1
print (bt)
|
while bt>p :
| 10 |
decision
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < z :
bt = 2*bt + 1
print (bt)
|
while bt < z :
| 10 |
statement
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt < p :
bt = 2*bt + 1
print (bt)
|
x = input ()
a = x.split(" ")
p = int(a[0])
q = int(a[1])
if q == 1:
print (p)
else :
bt = 1
while bt>p :
bt = 2*bt + 1
print (bt)
|
while bt>p :
| 10 |
decision
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s>=r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
if s>=r:
| 12 |
decision
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[y] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
ans[y] = s
| 13 |
statement
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]|n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
ans = [0]|n
| 7 |
operation
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]//n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
ans = [0]//n
| 7 |
operation
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 1
for i in ans:
print(i,end=' ')
print()
|
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 1
ans = [0]*n
for i in range(n):
l,r = R()
if l > s:
s = l
if s <= r:
ans[i] = s
s += 9
for i in ans:
print(i,end=' ')
print()
|
s += 9
| 14 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.