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 |
|---|---|---|---|---|
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count)
|
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]&2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count)
|
lambda x: ((gi/2<=x<=gi*2)and(di[0]&2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
| 15 |
operation
|
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi*2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count)
|
import itertools
count = 0;
a = input()
g = list(map(int, input().split()))
d = list(map(int, input().split()))
f = list(map(int, input().split()))
g.sort()
d.sort()
for gi in g:
g_with_d = filter( lambda x: (gi/2<=x<=gi-2) , d)
for di in itertools.combinations(g_with_d,2):
if di[0]*2<=di[1]:
continue
f_with_all = list(filter(
lambda x: ((gi/2<=x<=gi*2)and(di[0]/2<=x<=di[0]*2)and(di[1]/2<=x<=di[1]*2)) , f))
f_with_all.sort(reverse = True);
for i in itertools.combinations(f_with_all,3):
if (i[0]/2<=i[2]):
count+=1
print(count)
|
g_with_d = filter( lambda x: (gi/2<=x<=gi-2) , d)
| 10 |
operation
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y<<1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
y_e = y<<1
| 5 |
operation
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(55)
else:
print(abs(summ)+y_ee)
|
print(55)
| 10 |
value
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ>=0:
print(0)
else:
print(abs(summ)+y_ee)
|
if summ>=0:
| 9 |
decision
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*89
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
y_e = y*89
| 5 |
value
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ <= 0:
print(0)
else:
print(abs(summ)+y_ee)
|
a, b = input().split(' ')
x, y, z = input().split(' ')
a,b,x,y,z = int(a),int(b),int(x),int(y),int(z)
x_e = x*2
y_e = y*1
y_ee = y*1
z_e = z*3
summ = x_e+y_e+z_e-a-b
if summ>=0:
print(0)
else:
print(abs(summ)+y_ee)
|
if summ>=0:
| 9 |
decision
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1]<1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
if k[n - 1]<1:
| 7 |
decision
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i@1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
if k[i] == k[i@1]:
| 12 |
operation
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i*1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
if k[i] == k[i*1]:
| 12 |
operation
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1]<1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
if k[n - 1]<1:
| 7 |
decision
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n - 1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
n = int(input())
k = list(map(int, input().split()))
ans = int(0)
now = int(1)
last = int(0)
kol = int(0)
if k[n+1] == 1:
k.append(0)
else:
k.append(1)
for i in range(n):
if k[i] == k[i + 1]:
now = now + 1
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
sys.exit(0)
else:
last = now
now = 1
print("YES")
|
if k[n+1] == 1:
| 7 |
operation
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a<0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
if a<0 or b==0:
| 5 |
decision
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a<0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
if a<0 or b==0:
| 5 |
decision
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a<=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
if a<=2*b:
| 11 |
decision
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = z-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
b = z-2*a
| 19 |
statement
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a==0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
s = input().split()
a = int(s[0])
b = int(s[1])
def f1(a, b):
if a<0 or b==0:
return (a, b)
else:
return f2(a, b)
def f2(a, b):
if a>=2*b:
a = a-2*b
return f1(a, b)
else:
return f3(a, b)
def f3(a, b):
if b>=2*a:
b = b-2*a
return f1(a, b)
else:
return (a, b)
res = f1(a, b)
print('{} {}'.format(res[0], res[1]))
|
if a<0 or b==0:
| 5 |
decision
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt-prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
while tt-prime==0:
| 25 |
operation
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime>=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
if prime>=tt:
| 29 |
decision
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime<0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
while tt%prime<0:
| 25 |
decision
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime<0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
while tt%prime<0:
| 25 |
decision
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime==0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
import math
n=int(input())
tt=n
def prime(n):
numbers = set(range(n, 1, -1))
primes = []
while numbers:
p = numbers.pop()
primes.append(p)
numbers.difference_update(set(range(p*2, n+1, p)))
return primes
s=prime(n)
i=0
if len(s)==0:
print(tt)
print(tt)
else:
ans=0
array=[]
for prime in s:
while tt%prime<0:
array.append(prime)
prime=prime*prime
ans+=1
if prime<=tt:
ans+=1
array.append(prime)
print(ans)
for i in array:
print(i,end=' ')
|
while tt%prime<0:
| 25 |
decision
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l|r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
if a<=(l+r)//2 and b>(l|r)//2:
| 5 |
operation
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,14,n,0))
|
print(sv-dq(a,b,14,n,0))
| 18 |
value
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)*2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
if a<=(l+r)*2 and b>(l+r)//2:
| 5 |
operation
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(z-dq(a,b,1,n,0))
|
print(z-dq(a,b,1,n,0))
| 18 |
statement
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,1,n,0))
|
n,a,b=map(int,input().split())
def dq(a,b,l,r,dem):
if a<l or b>r:
return 1000000000
if a<=(l+r)//2 and b>(l+r)//2:
return dem
return min(dq(a,b,l,(l+r)//2,dem+1),dq(a,b,(l+r)//2+1,r,dem+1))
if a>b:
a,b=b,a
sv=0
_n=n
while _n!=1:
sv=sv+1
_n=_n/2
if sv==sv-dq(a,b,1,n,0):
print("Final!")
else:
print(sv-dq(a,b,102,n,0))
|
print(sv-dq(a,b,102,n,0))
| 18 |
value
|
import sys
def max_fac(a):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==959806:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+1<min:
min=i-tmp+1
print(min)
|
import sys
def max_fac(a):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==959806:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+25<min:
min=i-tmp+1
print(min)
|
elif i-tmp+25<min:
| 23 |
value
|
import sys
def max_fac(a):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==959806:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+1<min:
min=i-tmp+1
print(min)
|
import sys
def max_fac(z):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==959806:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+1<min:
min=i-tmp+1
print(min)
|
def max_fac(z):
| 2 |
statement
|
import sys
def max_fac(a):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==959806:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+1<min:
min=i-tmp+1
print(min)
|
import sys
def max_fac(a):
max=1
i=2
while i*i<=a:
if not(a%i):
max=i
a/=i
else:
i+=1
return max if max>a else int(a)
p=int(input())
if p==4:
print(239958)
sys.exit()
m_p=max_fac(p)
min=p
for i in range(p-m_p+1,p+1):
tmp=max_fac(i)
if tmp==i:
continue
elif i-tmp+1<min:
min=i-tmp+1
print(min)
|
if p==4:
| 14 |
value
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i<0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
if i<0:
| 5 |
decision
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag<0:
print('No')
else:
print('Yes')
|
if flag<0:
| 24 |
decision
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
n = int(input())
s = input()
flag=0
for y in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
for y in range(n):
| 4 |
statement
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
z=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
z=1
| 11 |
statement
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i+1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0:
if s[0] == '?':
flag=1
break
elif i==n-1:
if s[n-1] == '?':
flag=1
break
else:
if s[i] == '?':
if s[i-1] == s[i+1]:
flag=1
break
if s[i-1]=='?' or s[i|1]=='?':
flag=1
break
for i in range(n-1):
if s[i] == s[i+1] and s[i] != '?':
flag=0
if flag==0:
print('No')
else:
print('Yes')
|
if s[i-1]=='?' or s[i|1]=='?':
| 18 |
operation
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 44*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
b -= 44*a
| 8 |
value
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,y)[1])
|
print(f(a,b)[0],f(a,y)[1])
| 16 |
statement
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2>>b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
elif a >= 2>>b:
| 4 |
operation
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, z().split()))
print(f(a,b)[0],f(a,b)[1])
|
a,b = list(map(int, z().split()))
| 14 |
statement
|
def f(a,b):
if a==0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
def f(a,b):
if a<0 or b==0:
return (a,b)
elif a >= 2*b:
a -= 2*b
return f(a,b)
elif b >= 2*a:
b -= 2*a
return f(a,b)
else:
return (a,b)
a,b = list(map(int, input().split()))
print(f(a,b)[0],f(a,b)[1])
|
if a<0 or b==0:
| 2 |
decision
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k==0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
if k==0:
| 17 |
decision
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i<<1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
if i<<1==p:
| 12 |
operation
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
z=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
z=[]
| 7 |
statement
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k==0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
if k==0:
| 17 |
decision
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i+1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
import math
n=int(input())
li=[]
c=0
s=input()
li=s.split(" ")
lic=[]
for i in range(0,n):
p=int(li[i])
if i%1==p:
flag=0
else:
k=lic.count(li[i])
if k>0:
flag=0
else:
c+=1;
lic.append(li[i])
if c>=3:
print("YES")
else:
print("NO")
|
if i%1==p:
| 12 |
operation
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a / b
print(min * m)
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min==a / b and abs():
min = a / b
print(min * m)
|
if min==a / b and abs():
| 9 |
decision
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a / b
print(min * m)
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a@b
print(min * m)
|
min = a@b
| 10 |
operation
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a / b
print(min * m)
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a*b
print(min * m)
|
min = a*b
| 10 |
operation
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(float, input().split())
if min > a / b and abs():
min = a / b
print(min * m)
|
import sys
n, m = map(int, input().split())
min = sys.maxsize
for i in range(n):
a, b = map(z, input().split())
if min > a / b and abs():
min = a / b
print(min * m)
|
a, b = map(z, input().split())
| 7 |
statement
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m@10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
if h % 10 ==7 or h // 10 ==7 or m@10 ==7 or m // 10 ==7:
| 5 |
operation
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10<7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
if h % 10<7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
| 5 |
decision
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or z // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or z // 10 ==7:
| 5 |
statement
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h&10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
if h&10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
| 5 |
operation
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m // 10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
x=int(input())
h,m=map(int,input().split())
ans=0
while 1:
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m|10 ==7:
break
if m >= x:
m-=x
else:
h-=1
m=60-x
ans+=1
print(ans)
|
if h % 10 ==7 or h // 10 ==7 or m % 10 ==7 or m|10 ==7:
| 5 |
operation
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum<4000:
result = -1
else:
result = sum
print(result)
|
if sum<4000:
| 19 |
decision
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y])<<6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
temp = len(l[i]) + len(l[x]) + len(l[y])<<6
| 15 |
operation
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import x
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import x
| 1 |
statement
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 51
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
sum = 51
| 11 |
value
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -1
else:
result = sum
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = list(map(int, input().split(" ")))
l[a].append(b)
l[b].append(a)
result = 0
sum = 4000
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = enum
temp = len(l[i]) + len(l[x]) + len(l[y]) - 6
if temp < sum and x in l[y]:
sum = temp
if sum == 4000:
result = -128
else:
result = sum
print(result)
|
result = -128
| 20 |
value
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(y())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(y())
| 1 |
statement
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p<10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
if p<10:
| 8 |
decision
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n^1])
|
print(res[n^1])
| 19 |
operation
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n*1] in res:
break
print(res[n-1])
|
if res[n*1] in res:
| 12 |
operation
|
n = int(input())
res = []
r = []
i = 0
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
n = int(input())
res = []
r = []
i = 37
while True:
p = (sum([int(digit) for digit in str(abs(i))]))
if p == 10:
res.append(i)
i += 1
if res[n-1] in res:
break
print(res[n-1])
|
i = 37
| 5 |
value
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j]-cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
daycopy[j] = daycopy[j]-cd[i][0]
| 23 |
operation
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count>m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
while(count>m and worked < cd[i][1]):
| 31 |
decision
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j]//cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
daycopy[j] = daycopy[j]//cd[i][0]
| 23 |
operation
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j]%cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
daycopy[j] = daycopy[j]%cd[i][0]
| 23 |
operation
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(0, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
def getData():
line = input()
line = line.split()
for i in range(len(line)):
line[i] = int(line[i])
return line
n, m = map(int, input().split())
workday = getData()
cd = []
for i in range(n):
a, b = map(int, input().split())
param = [a,b]
cd.append(param)
for i in range(n):
daycopy = workday[:]
for j in range(m):
if (daycopy[j] > cd[i][0]):
daycopy[j] = daycopy[j] - cd[i][0]
else:
daycopy[j] = 0
count = 0
worked = 0
if (sum(daycopy) < cd[i][1]):
print(73, end = " ")
else:
while(count < m and worked < cd[i][1]):
worked += daycopy[count]
count += 1
print(count, end = " ")
|
print(73, end = " ")
| 29 |
value
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc+1
k= min(cntc,cntn)
if cntc>cntn:
k=max(k, cntn+(cntc-cntn)//3 )
print (k)
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc**1
k= min(cntc,cntn)
if cntc>cntn:
k=max(k, cntn+(cntc-cntn)//3 )
print (k)
|
cntc=cntc**1
| 9 |
operation
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc+1
k= min(cntc,cntn)
if cntc>cntn:
k=max(k, cntn+(cntc-cntn)//3 )
print (k)
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc+1
k= min(cntc,cntn)
if cntc==cntn:
k=max(k, cntn+(cntc-cntn)//3 )
print (k)
|
if cntc==cntn:
| 11 |
decision
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc+1
k= min(cntc,cntn)
if cntc>cntn:
k=max(k, cntn+(cntc-cntn)//3 )
print (k)
|
cntn=0;
cntc=0;
n=int(input())
s=input().split(" ")
for i in s:
if (int(i)%2==0):
cntn=cntn+1;
else:
cntc=cntc+1
k= min(cntc,cntn)
if cntc>cntn:
k=max(k, cntn+(cntc-cntn)//58 )
print (k)
|
k=max(k, cntn+(cntc-cntn)//58 )
| 12 |
value
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
elif((tom[-1]>=0) and ban[-1]<=0 ):
| 19 |
decision
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]-tom[-2])
|
print(ban[-1]-tom[-2])
| 26 |
operation
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]>=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
if((tom[-1]>=0) and ban[-1]>=0 ):
| 17 |
decision
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
if((tom[-1]<=0) and ban[-1]<=0 ):
| 17 |
decision
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[0]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-1]<=0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
elif((tom[-1]<=0) and ban[-1]<=0 ):
print(ban[84]*tom[1])
elif((tom[-1]>=0) and ban[-1]<=0 ):
print(ban[-1]*tom[1])
elif((tom[-1]*tom[0]<0) and (ban[-1]*ban[0]<0)):
print(tom[0]*ban[0])
else :
print(ban[-1]*tom[-2])
|
print(ban[84]*tom[1])
| 20 |
value
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1>t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
if a[-1]-t1>t2-a[-1]:
| 8 |
decision
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,144**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
t1,t2=1,144**6
| 3 |
value
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1>t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
if a[-1]-t1>t2-a[-1]:
| 8 |
decision
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time>mini:
mini=time
print(int(mini))
|
if time>mini:
| 18 |
decision
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
time=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
n=input().strip()
a=[int(e) for e in input().split()]
t1,t2=1,10**6
mini=100000
sigma=0
time=0
if a[-1]-t1<t2-a[-1]:
print(a[-1]-t1)
elif t2-a[0]<a[0]-t1:
print(t2-a[0])
else:
for i in range(0,len(a)-1):
if a[i]-t1<t2-a[i+1]:
x=t2-a[i+1]
else:
time=a[i]-t1
if time<mini:
mini=time
print(int(mini))
|
x=t2-a[i+1]
| 15 |
statement
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//49
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
hh = M//49
| 8 |
value
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10<7:
print(y)
break
else:
M-=x
y += 1
|
if tempmm%10<7:
| 19 |
decision
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10<7:
print(y)
break
else:
M-=x
y += 1
|
if tempmm%10<7:
| 19 |
decision
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M^1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
M = (M^1440)%1440
| 6 |
operation
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M==0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
M-=x
y += 1
|
while M==0:
| 17 |
decision
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
n = int(input())
m = int(input())
mod = 1
while n>25:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
while n>25:
| 6 |
value
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod==m): break
print(m%mod)
|
if(mod==m): break
| 9 |
decision
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m-mod)
|
print(m-mod)
| 11 |
operation
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
z(m%mod)
|
z(m%mod)
| 11 |
statement
|
n = int(input())
m = int(input())
mod = 1
while n>0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
n = int(input())
m = int(input())
mod = 1
while n==0:
mod *= 2
n -= 1
if(mod>m): break
print(m%mod)
|
while n==0:
| 6 |
decision
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a<=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
if a<=2*b:
| 9 |
decision
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2>>a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
b=b-2>>a
| 16 |
operation
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2<<b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
if a>=2<<b:
| 9 |
operation
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
x=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
x=b-2*a
| 16 |
statement
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=2*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
a,b=map(int,input().split())
def f1(a,b):
if a==0 or b==0:
print(a,b)
exit()
else:
f2(a,b)
def f2(a,b):
if a>=101*b:
a=a-2*b
f1(a,b)
else:
f3(a,b)
def f3(a,b):
if b>=2*a:
b=b-2*a
f1(a,b)
else:
print(a,b)
exit()
f1(a,b)
|
if a>=101*b:
| 9 |
value
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c+1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
deeper(project[0] + ' ' + str(project[1]), c+1)
| 14 |
operation
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project//tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
dependencies.append(project//tuple([c]))
| 13 |
operation
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], project[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
def deeper(namever, c):
q = dict()
for project in projects[namever]:
project = project.split()
if project[0] in [i[0] for i in dependencies]:
if int(project[1]) > [int(x[2]) for x in dependencies if x[0] == project[0]][0]:
q[project[0]] = int(project[1])
else:
q[project[0]] = int(project[1])
for project in q.items():
if project[0] != start.split()[0]:
dependencies.append(project + tuple([c]))
deeper(project[0] + ' ' + str(project[1]), c + 1)
n = int(input())
projects = dict()
dependencies = []
start = input()
projects[start] = [input() for _ in range(int(input()))]
for _ in range(n - 1):
input()
namever = input()
projects[namever] = [input() for _ in range(int(input()))]
deeper(start, 1)
res = dict()
for project in dependencies:
if project[0] in res.keys():
if project[2] < res[project[0]][1]:
res[project[0]] = (project[1], project[2])
elif project[2] == res[project[0]][1] and int(project[1]) > int(res[project[0]][0]):
res[project[0]] = res[project[0]] = (project[1], project[2])
else:
res[project[0]] = (project[1], z[2])
print(len(res))
for key in sorted(res.keys()):
print(key + ' ' + str(res[key][0]))
|
res[project[0]] = (project[1], z[2])
| 40 |
statement
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.