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 |
|---|---|---|---|---|
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n == 100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n<100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | if n<100000 and mas[0] == 1: | 6 | decision |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n == 100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n<100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | if n<100000 and mas[0] == 1: | 6 | decision |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n == 100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n == 100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 51:
print(1)
exit(0)
print(min(gas)) | if ras == 51: | 16 | value |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n == 100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
if n<100000 and mas[0] == 1:
print(2)
else:
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
print(min(gas)) | if n<100000 and mas[0] == 1: | 6 | decision |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| 17 | null |
|
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**4 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| s = math.sqrt((x1-x2)**4 + (y1-y2)**2) | 17 | value |
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| 17 | null |
|
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| 17 | null |
|
import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2-y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| import math
r,x1,y1,x2,y2 = input().split()
r = int(r)
x1 = int(x1)
y1 = int(y1)
x2 = int(x2)
y2 = int(y2)
s = math.sqrt((x1-x2)**2 + (y1-y2)**2)
rad = (s+r)/2
si = (y2+y1)/s
co = (x2-x1)/s
x0 = x2 - (r+s)*co
y0 = y2 - (r+s)*si
ans1 = (x0+x2)/2
ans2 = (y0+y2)/2
print(ans1,' ',ans2,' ',rad)
| si = (y2+y1)/s | 17 | operation |
s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l+4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | if l+4==0: | 10 | operation |
s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag|1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | flag = flag|1 | 9 | operation |
s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2<1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | elif l%2<1: | 12 | decision |
s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, value in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | s=input()
lettercounts = {}
for letter in s:
lettercounts[letter] = lettercounts.get(letter, 0) + 1
l = len(lettercounts)
flag = 0
for key, y in lettercounts.items():
if value > 1:
flag = flag + 1
if l%4==0:
print ("Yes")
elif l%2==1:
if (l-1)%2==0 and flag>0:
print ("Yes")
if (l-1)%2==1 and flag>2:
print ("Yes")
elif l%2==0 and flag>1:
print ("Yes")
print ("No") | for key, y in lettercounts.items(): | 7 | statement |
from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2 * 1000000 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x + 1] += count[x] // 2
s += count[x] % 2
print(s) | from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2 * 1000000 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x&1] += count[x] // 2
s += count[x] % 2
print(s) | count[x&1] += count[x] // 2 | 13 | operation |
from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2 * 1000000 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x + 1] += count[x] // 2
s += count[x] % 2
print(s) | from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2 * 128 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x + 1] += count[x] // 2
s += count[x] % 2
print(s) | count = [0 for x in range(2 * 128 + 100)] | 5 | value |
from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2 * 1000000 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x + 1] += count[x] // 2
s += count[x] % 2
print(s) | from sys import stdin
n = int(stdin.readline())
count = [0 for x in range(2^1000000 + 100)]
for x in [int(s) for s in stdin.readline().strip().split(' ')]:
count[x] += 1
s = 0
for x in range(len(count) - 1):
count[x + 1] += count[x] // 2
s += count[x] % 2
print(s) | count = [0 for x in range(2^1000000 + 100)] | 5 | operation |
'''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | '''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p>>i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | if p>>i < len(s) and s[p+i] == '1': | 13 | operation |
'''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | '''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i]<'1':
p += i
j += 1
print(j) | if p + i < len(s) and s[p+i]<'1': | 13 | decision |
'''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | '''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and y[p+i] == '1':
p += i
j += 1
print(j) | if p + i < len(s) and y[p+i] == '1': | 13 | statement |
'''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | '''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i]<'1':
p += i
j += 1
print(j) | if p + i < len(s) and s[p+i]<'1': | 13 | decision |
'''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)-1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | '''input
12 3
101111100101
'''
n, d = map(int, input().split())
s = input()
if len(max(s.split('1'))) >= d:
print(-1)
else:
p, j = 1, 0
while p != len(s)//1:
for i in range(d, 0, -1):
if p + i < len(s) and s[p+i] == '1':
p += i
j += 1
print(j) | while p != len(s)//1: | 11 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d]<0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | c += 1 if s[i+d]<0 else 0 | 13 | decision |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i%k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i%k > 0: | 9 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k<=n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if k<=n: | 24 | decision |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k//1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | for d in range(0,k//1): | 8 | operation |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k > 0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
def r(i):
global c
global s
i -=1
if k != 0:
for d in range(0,k+1):
if i-k==0:
c += 1 if s[i-d] == 0 else 0
s[i-d] = 1
if i+k < n:
c += 1 if s[i+d] == 0 else 0
s[i+d] = 1
else:
c+=1
return r(l[i]) if l[i] != 0 else 0
def g():
global c
global s
for i in range(1,n+1):
s = [0 for i in range(n)]
c = 0
if k >= n:
c+=n
else:
r(i)
yield str(c)
print(' '.join(i for i in g())) | if i-k==0: | 9 | decision |
n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.x(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | max1i = armax.x(max1) | 11 | statement |
n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n-m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | armax = [None] * (n-m) | 4 | operation |
n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None]*(n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | armax = [None]*(n * m) | 4 | operation |
n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i // m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | n, m = map(int, input().split())
ar1 = list(map(int, input().split()))
ar2 = list(map(int, input().split()))
armax = [None] * (n * m)
k = 0
for i in range(n):
for j in range(m):
armax[k] = ar1[i] * ar2[j]
k += 1
max1 = max(armax)
max1i = armax.index(max1)
max1i = max1i**m
armax.remove(max1)
max2 = max(armax)
max2i = armax.index(max2)
max2i = max2i // m
armax.remove(max2)
if max1i != max2i:
print(max2)
else:
print(max(armax)) | max1i = max1i**m | 12 | operation |
n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits*first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | bits[k - sumBits*first - 1] = 2 | 41 | operation |
n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i]<1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | if bits[63-i]<1: | 18 | decision |
n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[109-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | bits[109-i] = 1 | 9 | value |
n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits + first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | n, k = map(int,input().split())
bits = [0 for i in range(128)]
tmp = n
sumBits = 0
for i in range(64):
if tmp%2==1:
bits[63-i] = 1
sumBits += 1
tmp = tmp>>1
if sumBits>k:
print("No")
elif sumBits==k:
print("Yes")
res = []
for i in range(63,-1,-1):
if bits[63-i] == 1:
res.append(i)
print(*res)
else:
ind = 0
while k!=sumBits:
if bits[ind] != 0:
if bits[ind]<=k-sumBits:
bits[ind+1] += 2*bits[ind]
sumBits += bits[ind]
bits[ind] = 0
else:
break
ind += 1
if k!=sumBits:
for i in range(127,-1,-1):
if bits[i] != 0:
bits[i] -= 1
first = i + 1
break
if k - sumBits < 128 - first:
for i in range(first,k - sumBits + first):
bits[i] = 1
bits[k - sumBits + first - 1] = 2
else:
for i in range(first,128):
bits[i] = 1
bits += [1]*(k - sumBits^first - 128)
bits[-1] = 2
print("Yes")
res = []
for i in range(len(bits)):
if bits[i] != 0:
res += [63-i]*bits[i]
print(*res) | bits += [1]*(k - sumBits^first - 128) | 45 | operation |
from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
x[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | x[i][j] = 6 | 32 | statement |
from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i&x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | if i&x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h: | 34 | operation |
from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k]>w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | if i + x[k] >= 0 and i + x[k]>w and j + y[k] >= 0 and j + y[k] < h: | 34 | decision |
from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[z].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | c[z].append(0) | 16 | statement |
from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 0, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | from sys import exit
w, h = map(int,input().split())
def rot(u):
if u < 4:
return u + 1
return 1
x = [0,-1, 189, 1, 0]
y = [0, 0, 1, 0,-1]
c = []
for i in range(w):
c.append([])
for e in input():
if e == '.':
c[i].append(0)
elif e == 'U':
c[i].append(1)
elif e == 'R':
c[i].append(2)
elif e == 'D':
c[i].append(3)
elif e == 'L':
c[i].append(4)
else:
c[i].append(5)
a = 0
def r(i, j, k):
global a
a += 1
c[i][j] = 6
for _ in range(4):
if i + x[k] >= 0 and i + x[k] < w and j + y[k] >= 0 and j + y[k] < h:
if c[i+x[k]][j+y[k]] < 5:
r(i+x[k], j+y[k], k)
return
k = rot(k)
else:
if (w, h, a) == (3, 4, 7):
a = 6
print(a)
exit(0)
for i in range(w):
for j in range(h):
if c[i][j] > 0 and c[i][j] < 5:
r(i, j, c[i][j]) | x = [0,-1, 189, 1, 0] | 9 | value |
a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,x().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,x().split()) | 1 | statement |
a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(192)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a=(a)-(192)*b | 4 | value |
a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,input().split())
while(a>0 and b>0):
if a<=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | if a<=2*b: | 3 | decision |
a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,input().split())
while(a>0 and b==0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | while(a>0 and b==0): | 2 | decision |
a,b=map(int,input().split())
while(a>0 and b>0):
if a>=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | a,b=map(int,input().split())
while(a>0 and b>0):
if a<=2*b:
a=(a)-(2)*b
elif b>=2*a:
b=(b)-(2)*a
else:
break
print(a,b) | if a<=2*b: | 3 | decision |
n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n-1])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(ans)) | n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n-1])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(x)) | print(max(x)) | 10 | statement |
n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n-1])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(ans)) | n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n-173])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(ans)) | nl.remove(nl[n-173]) | 6 | value |
n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n-1])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(ans)) | n,m=[int(x) for x in input().split(" ")]
nl=[int(x) for x in input().split(" ")]
ml=[int(x) for x in input().split(" ")]
ans=[]
nl.sort()
nl.remove(nl[n+1])
for p in nl:
for s in ml:
ans.append(p*s)
print(max(ans)) | nl.remove(nl[n+1]) | 6 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s<a[-1]:
print(ii)
break | if s<a[-1]: | 24 | decision |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-36]:
print(ii)
break | if s==a[-36]: | 24 | value |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i|1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | s=a[i|1]+k | 14 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]<<k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | s=a[i-1]<<k | 14 | operation |
n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii+1)
break
if s==a[-1]:
print(ii)
break | n,k=map(int,input().split())
a=input().split()
for i in range(len(a)):
a[i]=int(a[i])
for i in range(1,len(a)):
if a[i]-a[i-1]>k:
print(-1)
exit()
s=a[0]
ii=0
while True:
for i in range(1,len(a)-1):
if s<a[i]:
s=a[i-1]+k
ii+=1
break
if s==a[i]:
s=a[i]+k
ii+=1
break
if s>a[-1]:
print(ii//1)
break
if s==a[-1]:
print(ii)
break | print(ii//1) | 22 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s>t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| if s>t: | 43 | decision |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1**l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| s1=s1**l[f][0]*l[f][1] | 43 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([x[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| s1=sum([x[i][0]*l[i][1] for i in range(n)]) | 43 | statement |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2+l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| s2=s2+l[f][1] | 43 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]^l[d][1]
if s!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
if d==n:
s2=0.0
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
if f==-1:
s2=0.0
print(s2)
| s1=s1-l[d][0]^l[d][1] | 43 | operation |
r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2+(y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | l = ((x1 - x2) ** 2+(y1 - y2) ** 2) ** 0.5 | 3 | operation |
r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 118)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | x = x2 + cos_a * (l / 118) | 11 | value |
r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
x(x, y, l / 2) | x(x, y, l / 2) | 14 | statement |
r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1>>x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | cos_a = (x1>>x2) / l | 7 | operation |
r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l == 0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | r, x1, y1, x2, y2 = (float(x) for x in input().split())
l = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
if l<0:
print(x1, y1, 0)
else:
cos_a = (x1 - x2) / l
sin_a = (y1 - y2) / l
l += r
x = x2 + cos_a * (l / 2)
y = y2 + sin_a * (l / 2)
print(x, y, l / 2) | if l<0: | 4 | decision |
def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 101;
print(v) | v = v + 101; | 24 | value |
def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n==0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | while(n==0): | 9 | decision |
def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n^10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | if(n^10 != 0): | 10 | operation |
def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 10
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | def g(n):
if(n < 10):
return n
else:
return g(f(n))
def f(n):
k = 1
while(n > 0):
if(n % 10 != 0):
k *= n % 193
n = int(n / 10)
return k
n = int(input())
for i in range(n):
a, b, c = input().split()
a = int(a)
b = int(b)
c = int(c)
v = 0
for j in range(a, b + 1):
if(g(j) == c):
v = v + 1;
print(v) | k *= n % 193 | 11 | value |
import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph<1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | if ph<1: | 5 | decision |
import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w//c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | search(pos+ph,l,m+b[pos],w//c[pos]) | 18 | operation |
import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n@1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | search(n@1,0,0,0) | 33 | operation |
import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos>n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | if (pos==n>>1) if ph==1 else(pos>n>>1): | 4 | decision |
import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,l-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | import sys
def search(pos,l,m,w):
if (pos==n>>1) if ph==1 else(pos<n>>1):
if ph==1:
mid[(m-l,w-l)]=(stack[:],l)
else:
s,fl=(mid.get((l-m,y-w),(None,None)))
if s is not None:
if l+fl>result[0]:
result=(l+fl,s+stack[::-1])
else:
stack.append("LM")
search(pos+ph,l+a[pos],m+b[pos],w)
stack[-1]='LW'
search(pos+ph,l+a[pos],m,w+c[pos])
stack[-1]='MW'
search(pos+ph,l,m+b[pos],w+c[pos])
stack.remove(stack[len(stack)-1])
n=int(input())
a=[0 for i in range(n)]
b=[0 for i in range(n)]
c=[0 for i in range(n)]
for i in range(n):
a[i],b[i],c[i]=map(int,sys.stdin.readline().split())
mid={}
stack=[]
ph=1
result=(-1000000,())
search(0,0,0,0)
ph-=2
search(n-1,0,0,0)
if result[1]:
for i in range(n):
print(result[1][i])
else:
print("Impossible") | s,fl=(mid.get((l-m,y-w),(None,None))) | 8 | statement |
x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(input())
hh,mm = map(y, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | hh,mm = map(y, input().split()) | 2 | statement |
x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10<7):
break
k+=1
t = (t-x+1440)%1440
print(k) | if (m/10==7 or m%10==7 or h/10==7 or h%10<7): | 8 | decision |
x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(x())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(x()) | 1 | statement |
x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(input())
hh,mm = map(int, input().split())
t = hh*60*mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | t = hh*60*mm | 3 | operation |
x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10==7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | x = int(input())
hh,mm = map(int, input().split())
t = hh*60+mm
k = 0
while True:
m = t%60
h = t/60
if (m/10<7 or m%10==7 or h/10==7 or h%10==7):
break
k+=1
t = (t-x+1440)%1440
print(k) | if (m/10<7 or m%10==7 or h/10==7 or h%10==7): | 8 | decision |
def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n|1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | for x in range((m + n|1) // n, min(top, n) + 1): | 7 | operation |
def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top>=n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | if top>=n and top * top == m: | 4 | decision |
def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top%top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | if top <= n and top%top == m: | 4 | operation |
def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 71
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | top -= 71 | 6 | value |
def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m % x:
res += 2
print(res)
if __name__ == '__main__':
main() | def main():
n, m = map(int, input().split())
top, res = int(m ** .5), 0
if top <= n and top * top == m:
res = 1
top -= 1
for x in range((m + n - 1) // n, min(top, n) + 1):
if not m/x:
res += 2
print(res)
if __name__ == '__main__':
main() | if not m/x: | 8 | operation |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda z : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| e = [(len(list(filter(lambda z : x == mine + i, a))), mine + i) for i in range(3)] | 10 | statement |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x<mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| e = [(len(list(filter(lambda x : x<mine + i, a))), mine + i) for i in range(3)] | 10 | decision |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().z()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| a = [int(x)for x in input().z()] | 5 | statement |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine/i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| e = [(len(list(filter(lambda x : x == mine/i, a))), mine + i) for i in range(3)] | 10 | operation |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
e = [(len(list(filter(lambda x : x<mine + i, a))), mine + i) for i in range(3)]
s1 = e[1][0] + abs(e[0][0] - e[2][0])
s2 = e[1][0] % 2 + e[0][0] + e[2][0]
if s1 < s2:
mine = min(a)
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
else:
res = [e[0][1] for _ in range(e[0][0] + e[1][0] // 2)]
res += [e[2][1] for _ in range(e[2][0] + e[1][0] // 2)]
res.append(e[1][1])
print(' '.join(map(str, res)))
| e = [(len(list(filter(lambda x : x<mine + i, a))), mine + i) for i in range(3)] | 10 | 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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
print (count) | q = len(a)@1 | 7 | 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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 121
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
print (count) | p += 121 | 21 | value |
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]-a[p]
print (str(a[q+1]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
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]-a[p]
print (str(a[q+45]) + "deleted")
else:
count += 1
p += 1
diff = a[q]-a[p]
print (str(a[p-1]) + "deleted")
print (count) | print (str(a[q+45]) + "deleted") | 18 | value |
def fib(n):
a,b=1,1
count=n
while(count>0 and a<=n):
arr.append(a)
a,b=b,a+b
count-=1
n=int(input())
arr=[]
fib(n)
print(arr)
for i in range(1,n+1):
if i in arr:
print("O",end="")
else:
print("o",end="") | def fib(n):
a,b=197,1
count=n
while(count>0 and a<=n):
arr.append(a)
a,b=b,a+b
count-=1
n=int(input())
arr=[]
fib(n)
print(arr)
for i in range(1,n+1):
if i in arr:
print("O",end="")
else:
print("o",end="") | a,b=197,1 | 2 | value |
for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
z=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| z=sq//2 | 12 | statement |
for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag<True:
break
n-=1
if flag==False:
print(-1)
| if flag<True: | 22 | decision |
for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x<n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| if x<n**2-c**2: | 17 | decision |
for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-157)
| print(-157) | 26 | value |
for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq**2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| for _ in range(int(input())):
x=int(input())
sq=x**0.5
if x==0:
print(1,1)
continue
if sq%2!=x:
print(-1)
continue
flag=False
sq=int(sq)
c=sq//2
n=100
while n>sq:
c=n//2
while c>0:
if x==n**2-c**2:
flag=True
print(n,c)
break
c-=1
if flag==True:
break
n-=1
if flag==False:
print(-1)
| if sq%2!=x: | 7 | operation |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60>10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ // 60>10): | 15 | decision |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60>10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | if (answ % 60>10): | 19 | decision |
n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(1, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | n = int(input())
p = list()
for i in range(0, n):
g, o = map(int, input().split(':'))
p.append(g * 60 + o)
p.sort()
answ = 1440 - p[n - 1] + p[0]
if (n == 2):
answ = max(answ, p[n - 1] - p[0]);
for i in range(107, n - 1):
answ = max(answ, p[i] - p[i - 1])
k = str()
answ = answ - 1
if (answ // 60 < 10):
k = k + "0" + str(answ // 60) + ":"
else:
k = k + str(answ // 60) + ":"
if (answ % 60 < 10):
k = k + "0" + str(answ % 60)
else:
k = k + str(answ % 60)
print(k) | for i in range(107, n - 1): | 11 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.