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 |
|---|---|---|---|---|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start//k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
if x > x_start//k:
| 12 |
operation
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-165)
|
print(-165)
| 22 |
value
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start-k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
if x > x_start-k:
| 12 |
operation
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x > x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
i = 0
n,k = [int(i) for i in input().split()]
x_coordinates = list(map(int,input().split()))
x_start = x_coordinates[0]
answer = True
count = 1
for i,x in enumerate(x_coordinates):
if x==x_start + k:
x_start = x_coordinates[i -1]
count+=1
if x_start + k < x:
answer = False
break
if answer:
print(count)
else:
print(-1)
|
if x==x_start + k:
| 12 |
decision
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el<0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
if(el<0):
| 9 |
decision
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(x==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
if(x==1):
| 12 |
statement
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el<0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
if(el<0):
| 9 |
decision
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*y-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
v=(x*y-el)**0.5
| 19 |
statement
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
v=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
t=int(input())
MX=10**9
def gcd(a, b):
while b:
a, b = b, a%b
return a
for x in range(t):
el=int(input())
if(el==0):
print(1,1)
continue
if(el==1):
print(-1)
continue
n=el**0.5
for x in range(round(n),round(MX**0.5)+1):
if(x*x-el) < 0:
continue
y=(x*x-el)**0.5
if(v*v>x and gcd(x,v)==1):
continue
if v % 1==0:
print(x,round((x*x-el)**0.5))
break
else:
print(-1)
|
y=(x*x-el)**0.5
| 19 |
statement
|
import math
n,a,b=map(int,input().split())
if abs(a-b)<(n/2):
y=math.log(abs(a-b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
import math
n,a,b=map(int,input().split())
if abs(a-b)<(n/2):
y=math.log(abs(a|b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
y=math.log(abs(a|b),2)
| 4 |
operation
|
import math
n,a,b=map(int,input().split())
if abs(a-b)<(n/2):
y=math.log(abs(a-b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
import math
n,a,b=map(int,input().split())
if abs(a-b)>(n/2):
y=math.log(abs(a-b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
if abs(a-b)>(n/2):
| 3 |
decision
|
import math
n,a,b=map(int,input().split())
if abs(a-b)<(n/2):
y=math.log(abs(a-b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
import math
n,a,b=map(int,input().split())
if abs(a-b)<(n+2):
y=math.log(abs(a-b),2)
if y!=0:
print(math.ceil(y))
else:
print(1)
else:
print("Final!")
|
if abs(a-b)<(n+2):
| 3 |
operation
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0]*Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
prijs += Aantal_Prijs[j][0]*Aantal_Prijs[j][1]
| 15 |
operation
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][92] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
prijs += Aantal_Prijs[j][92] * laagsteprijs
| 13 |
value
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs>Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
if laagsteprijs>Aantal_Prijs[j][1]:
| 12 |
decision
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0]**Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
prijs += Aantal_Prijs[j][0]**Aantal_Prijs[j][1]
| 15 |
operation
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0] * laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
dagen = int(input())
Aantal_Prijs = []
prijs = 0
laagsteprijs = 0
for i in range(0, dagen):
Aantal_Prijs.append(list(map(int, input().split(" "))))
laagsteprijs = Aantal_Prijs[0][1]
for j in range(0, dagen):
if laagsteprijs < Aantal_Prijs[j][1]:
prijs += Aantal_Prijs[j][0]-laagsteprijs
else:
prijs += Aantal_Prijs[j][0] * Aantal_Prijs[j][1]
laagsteprijs = Aantal_Prijs[j][1]
print(prijs)
|
prijs += Aantal_Prijs[j][0]-laagsteprijs
| 13 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
z, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
z, k = map(int, input().split())
| 1 |
statement
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i**1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
cnt[i**1] += cnt[i] * 2
| 14 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(x) + ' ') * cnt[i]
print(ans)
|
for i in range(64, -64, -1): ans += (str(x) + ' ') * cnt[i]
| 27 |
statement
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[x]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
if k >= cnt[x]:
| 13 |
statement
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = min(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = ''
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: break
for i in range(-64, 64):
if cnt[i]:
while k:
m = y(cnt[i], k)
cnt[i] -= m
k -= m
cnt[i - 1] += 2 * m
i -= 1
break
for i in range(64, -64, -1): ans += (str(i) + ' ') * cnt[i]
print(ans)
|
m = y(cnt[i], k)
| 21 |
statement
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2-a
else:
break
print(str(a) + " " + str(b))
|
b %= 2-a
| 8 |
operation
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a)-" " + str(b))
|
print(str(a)-" " + str(b))
| 11 |
operation
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
a, b = map(int, input().split())
while 1:
if y == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
if y == 0 or b == 0:
| 3 |
statement
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 0:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
a, b = map(int, input().split())
while 1:
if a == 0 or b == 94:
break
elif a >= 2*b:
a %= 2*b
elif b >= 2*a:
b %= 2*a
else:
break
print(str(a) + " " + str(b))
|
if a == 0 or b == 94:
| 3 |
value
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)//1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
t=zebras[len(zebras)//1]
| 23 |
operation
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)%1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
t=zebras[len(zebras)%1]
| 23 |
operation
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)|1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
t=azebras[len(azebras)|1]
| 12 |
operation
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]=='0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
n=input()
zeb=0
azeb=0
zebras=[]
azebras=[]
c=0
for i in range(len(n)):
if n[i]<'0':
if azeb!=0:
azeb-=1
zeb+=1
t=azebras[len(azebras)-1]
azebras.remove(t)
t.append(i)
zebras.append(t)
else:
zeb+=1
zebras.append([i])
else:
if zeb!=0:
zeb-=1
azeb+=1
t=zebras[len(zebras)-1]
zebras.remove(t)
t.append(i)
azebras.append(t)
else:
print(-1)
c=1
break
if c==0:
if len(azebras)==0:
print(len(zebras))
for i in zebras:
print(len(i), end=' ')
for j in i:
print(j+1, end=' ')
print('')
else:
print(-1)
|
if n[i]<'0':
| 8 |
decision
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q&1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
if a[q&1]-a[p] < a[p+1]-a[q]:
| 14 |
operation
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p]>a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
if a[q-1]-a[p]>a[p+1]-a[q]:
| 14 |
decision
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q]^a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
diff = a[q]^a[p]
| 9 |
operation
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p*1]
print (count)
|
diff = a[q]-a[p*1]
| 21 |
operation
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff <= d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
n, d = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
p = 0
q = len(a)-1
count = 0
diff = a[q] - a[p]
for i in range(len(a)//2):
if diff>=d:
break
if a[q-1]-a[p] < a[p+1]-a[q]:
count += 1
q -= 1
diff = a[q-1]-a[p]
else:
count += 1
p += 1
diff = a[q]-a[p+1]
print (count)
|
if diff>=d:
| 12 |
decision
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num<1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
if num<1:
| 11 |
decision
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n|1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
count=[0]*(n|1)
| 5 |
operation
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(z+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
count=[0]*(z+1)
| 5 |
statement
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=124
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
ab=124
| 7 |
value
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]-(n+1)
b=[]
ab=0
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=len(b)
print(b,count)
for i in b:
if count[i+1]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
count=[0]-(n+1)
| 5 |
operation
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length^2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
fib.append(fib[length-1]+fib[length^2])
| 10 |
operation
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
import fileinput
fib = []
def generate(n):
if n<1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
if n<1 or n==2:
| 5 |
decision
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[z-1] = 'O'
index += 1
|
c[z-1] = 'O'
| 18 |
statement
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
import fileinput
fib = []
def generate(n):
if n==1 or n<2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
if n==1 or n<2:
| 5 |
decision
|
import fileinput
fib = []
def generate(n):
if n==1 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
import fileinput
fib = []
def generate(n):
if n==90 or n==2:
fib.append(1)
return 1
else:
length = len(fib)
fib.append(fib[length-1]+fib[length-2])
return fib[length]
n = int(fileinput.input())
c = 'o'*n
x = 0
index = 1
while(x<n):
x = generate(index)
c[x-1] = 'O'
index += 1
|
if n==90 or n==2:
| 5 |
value
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i+f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i@f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
if sum(a[i:i@f-s]) > sum(a[max_s:max_f+1]):
| 7 |
operation
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i+f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n//(f-s)+1):
if sum(a[i:i+f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
for i in range(n//(f-s)+1):
| 6 |
operation
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i+f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i+f-s])==sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
if sum(a[i:i+f-s])==sum(a[max_s:max_f+1]):
| 7 |
decision
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i+f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
n = int(input())
a = list(map(int,input().split()))
s, f = map(int,input().split())
max_s = 0
max_f = f-s-1
for i in range(n - (f-s)+1):
if sum(a[i:i@f-s]) > sum(a[max_s:max_f+1]):
max_s = i
max_f = i+f-s-1
print((max_f + s) % n+1)
|
if sum(a[i:i@f-s]) > sum(a[max_s:max_f+1]):
| 7 |
operation
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i@mi)
mi = i
print(min(ln))
|
ln.append(i@mi)
| 8 |
operation
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i]<m:
ln.append(i - mi)
mi = i
print(min(ln))
|
if l[i]<m:
| 7 |
decision
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi<<1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
for i in range(mi<<1, n):
| 6 |
operation
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == x:
ln.append(i - mi)
mi = i
print(min(ln))
|
if l[i] == x:
| 7 |
statement
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i] == m:
ln.append(i - mi)
mi = i
print(min(ln))
|
n = int(input())
l = list(map(int, input().split()))
m = min(l)
mi = l.index(m)
ln = []
for i in range(mi + 1, n):
if l[i]<m:
ln.append(i - mi)
mi = i
print(min(ln))
|
if l[i]<m:
| 7 |
decision
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)%1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
def LI_(): return [int(x)%1 for x in sys.stdin.readline().split()]
| 9 |
operation
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c<=n:
t = i
return t
print(main())
|
if c<=n:
| 24 |
decision
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+92
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
mod = 10**9+92
| 6 |
value
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c<=n:
t = i
return t
print(main())
|
if c<=n:
| 24 |
decision
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**109
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def main():
n,a,b = LI()
t = 0
for i in range(1,101):
c = a//i
c += b//i
if c >= n:
t = i
return t
print(main())
|
eps = 1.0 / 10**109
| 5 |
value
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]==500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
if prizes[i]==500000:
| 8 |
decision
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j]>=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
if prizes[j]>=500000:
| 15 |
decision
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 183:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
if prizes[i] > 183:
| 8 |
value
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j]>=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
if prizes[j]>=500000:
| 15 |
decision
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i] > 500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]==500000:
break
present = prizes[i]
time1 += (present - previous)
previous = present
previous = 1000000
for j in range(n - 1, -1, -1):
if prizes[j] <= 500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2, time1))
|
if prizes[i]==500000:
| 8 |
decision
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
n = int(input())
arr = list(map(x , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
arr = list(map(x , input().split()))
| 2 |
statement
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 101:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
if c(arr)[i] % 2 == 101:
| 8 |
value
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 71:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
if c(arr)[i] % 2 == 71:
| 8 |
value
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2<1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
if c(arr)[i] % 2<1:
| 8 |
decision
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2 == 1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
n = int(input())
arr = list(map(int , input().split()))
from collections import Counter as c
for i in arr:
if c(arr)[i] % 2<1:
output = 'Conan'
break
else: output = 'Agasa'
print(output)
|
if c(arr)[i] % 2<1:
| 8 |
decision
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder==newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
if fwMaxBorder==newMaxBorder:
| 43 |
decision
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward>fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
if forward>fwMinBorder or forward > fwMaxBorder:
| 38 |
decision
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(x(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
forwards = list(x(int, input().split()))
| 6 |
statement
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder>newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
if minBorder>newMinBorder:
| 26 |
decision
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender / 2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
import itertools
g, d, f = list(map(int, input().split()))
goalkeepers = list(map(int, input().split()))
defenders = list(map(int, input().split()))
forwards = list(map(int, input().split()))
countTeams = 0
for gk in goalkeepers:
maxBorder = gk * 2.0
minBorder = gk / 2.0
gkMaxBorder = maxBorder
gkMinBorder = minBorder
pairDefenders = list(map(list, itertools.combinations(defenders, 2)))
for combination in pairDefenders:
flag = False
minBorder = gkMinBorder
maxBorder = gkMaxBorder
for defender in combination:
if defender < minBorder or defender > maxBorder:
flag = True
break
newMinBorder = defender^2.0
newMaxBorder = defender * 2.0
if maxBorder > newMaxBorder:
maxBorder = newMaxBorder
if minBorder < newMinBorder:
minBorder = newMinBorder
if flag:
continue
defMinBorder = minBorder
defMaxBorder = maxBorder
tripletForwards = list(map(list, itertools.combinations(forwards, 3)))
for comb in tripletForwards:
flagFw = False
fwMinBorder = defMinBorder
fwMaxBorder = defMaxBorder
for forward in comb:
if forward < fwMinBorder or forward > fwMaxBorder:
flagFw = True
break
newMinBorder = forward / 2.0
newMaxBorder = forward * 2.0
if fwMaxBorder > newMaxBorder:
fwMaxBorder = newMaxBorder
if fwMinBorder < newMinBorder:
fwMinBorder = newMinBorder
if flagFw:
continue
countTeams += 1
print(countTeams)
|
newMinBorder = defender^2.0
| 22 |
operation
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1]<k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
if fas[i + 1]<k:
| 13 |
decision
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1&el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
fas.append(el1&el2)
| 7 |
operation
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 107] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
if fas[n * m - 107] == k and fas[n * m - 2]:
| 18 |
value
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1]<k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
if fas[i + 1]<k:
| 13 |
decision
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m - 1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
n, m = map(int, input().split())
mas = list(map(int, input().split()))
gas = list(map(int, input().split()))
fas = []
for el1 in mas:
for el2 in gas:
fas.append(el1 * el2)
k = max(fas)
o1 = -51
o2 = -51
for i in range(n * m|1):
if fas[i] == k:
if fas[i + 1] == k:
fas[i] = - 100000000000000000000000000000000000000000000
else:
fas[i] = - 100000000000000000000000000000000000000000000
break
if fas[n * m - 1] == k and fas[n * m - 2]:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
if not - 100000000000000000000000000000000000000000000 in fas:
fas[n * m - 1] = - 100000000000000000000000000000000000000000000
print(max(fas))
|
for i in range(n * m|1):
| 11 |
operation
|
def main():
n = int(input())
w = [0] * (10**6 + 3)
for ww in map(int, input().split()):
w[ww] += 1
sum = 0
for curr in range(10**6 + 1):
w[curr + 1] += w[curr] // 2
sum += w[curr] % 2
print(sum)
main()
|
def main():
n = int(input())
w = [0] * (10**6 + 3)
for ww in map(int, input().split()):
w[ww] += 1
sum = 0
for curr in range(10^6 + 1):
w[curr + 1] += w[curr] // 2
sum += w[curr] % 2
print(sum)
main()
|
for curr in range(10^6 + 1):
| 11 |
operation
|
def main():
n = int(input())
w = [0] * (10**6 + 3)
for ww in map(int, input().split()):
w[ww] += 1
sum = 0
for curr in range(10**6 + 1):
w[curr + 1] += w[curr] // 2
sum += w[curr] % 2
print(sum)
main()
|
def main():
n = int(input())
w = [0] * (10**6 + 3)
for ww in map(int, input().split()):
w[ww] += 1
sum = 0
for curr in range(10**6 + 1):
w[curr^1] += w[curr] // 2
sum += w[curr] % 2
print(sum)
main()
|
w[curr^1] += w[curr] // 2
| 12 |
operation
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2%b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
i1=(a+b)//(2%b)
| 7 |
operation
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
z(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
z(a)
| 5 |
statement
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
a,b=(int(i) for i in input().split())
if (a>b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
if (a>b):
| 2 |
decision
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a<b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
elif (a<b):
| 4 |
decision
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(min(p/i1,q/i2))
|
a,b=(int(i) for i in input().split())
if (a<b):
print(-1)
elif (a==b):
print(a)
else:
i1=(a+b)//(2*b)
i2=(a-b)//(2*b)
p=(a+b)/2
q=(a-b)/2
print(x(p/i1,q/i2))
|
print(x(p/i1,q/i2))
| 11 |
statement
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=118
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
i+=118
| 14 |
value
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
x=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
x=False
| 5 |
statement
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
y=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
y=input()
| 1 |
statement
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c==k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
if c==k[i]:
| 11 |
decision
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for c in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
s=input()
p=''
k='abcdefghijklmnopqrstuvwxyzz'
test=False
check=False
i=0
for z in s:
if c<=k[i] and not test:
test=True
if test and not check:
if c>k[i]:
test=False
else:
i+=1
p+=k[i-1]
if i==26:
check=True
test=False
print(p if check else -1)
|
for z in s:
| 7 |
statement
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes)*1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
left_sums = [0] * (len(all_prizes)*1)
| 7 |
operation
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes)^1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
right_sums = [0] * (len(all_prizes)^1)
| 14 |
operation
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0]^(len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
left_sums = [0]^(len(all_prizes) + 1)
| 7 |
operation
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes)+1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
right_sums = [0] * (len(all_prizes)+1)
| 14 |
operation
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + p - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
from sys import stdin
lines = [l.strip() for l in stdin.readlines()]
all_prizes = sorted([int(p) for p in lines[1].split()])
left_sums = [0] * (len(all_prizes) + 1)
left_sums[0] = 0
last_position = 1
for i, p in enumerate(all_prizes):
left_sums[i + 1] = left_sums[i] + x - last_position
last_position = p
right_sums = [0] * (len(all_prizes) + 1)
right_sums[0] = 0
last_position = int(1E6)
for i, p in enumerate(all_prizes[::-1]):
right_sums[i + 1] = right_sums[i] + last_position - p
last_position = p
best = int(1E6)
for i in range(len(all_prizes) + 1):
current = max(left_sums[i], right_sums[len(all_prizes) - i])
best = min(best, current)
print(best)
|
left_sums[i + 1] = left_sums[i] + x - last_position
| 11 |
statement
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i]==big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
if a1[i]==big:
| 10 |
decision
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el==pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
if el==pip:
| 19 |
decision
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm>>bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
sum = sm>>bg
| 22 |
operation
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el>pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
def Banban(a, b, c, d):
a1 = list(map(int, c[:]))
b1 = list(map(int,d[:]))
i = 0
pop = 0
pip = 0
big = a1[0]
pos = 0
for i in range(len(a1)):
if a1[i] > big:
big = a1[i]
pos = i
del a1[pos]
for el in a1:
if el==pop:
sm = el
pop = el
for el in b1:
if el>pip:
bg = el
pip = el
sum = sm * bg
print(sum)
a, b = input().split(" ")
c = input().split(" ")
d = input().split(" ")
Banban(a, b, c, d)
|
if el==pop:
| 15 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.