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 |
|---|---|---|---|---|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
z[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | z[n] -= 1 | 20 | statement |
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i])<n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | if int(b[i])<n: | 14 | decision |
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a)<len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans) | if len(a)<len(b): | 8 | decision |
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
x(len(r))
else:
print(0) | x(len(r)) | 28 | statement |
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 47):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | if (a/c > 2) or (c/a > 47): | 20 | value |
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2%len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2%len(ff)]] | 11 | operation |
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[x+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[x+2 if z+2 < len(ff) else z+2-len(ff)]] | 11 | statement |
from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], ff[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | from itertools import groupby
g, d, f = map(int, input().split(" "))
gg = list(map(int, input().split(" ")))
dd = list(map(int, input().split(" ")))
ff = list(map(int, input().split(" ")))
b = []
if g >= 1 and d >= 2 and f >= 3:
for x in range(g):
for y in range(d):
for z in range(f):
bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], y[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]]
bb.sort()
b.append(bb)
nw = [el for el,_ in groupby(b)]
for x in range(len(nw)):
chk = False
for y in range(len(nw[x])):
for z in range(len(nw[x])):
a, c = nw[x][y], nw[x][z]
if (a/c > 2) or (c/a > 2):
chk = True
if chk:
nw[x] = []
r = []
for i in range(len(nw)):
if not (nw[i]==[]):
r.append(nw[i])
print(len(r))
else:
print(0) | bb = [gg[x], dd[y], dd[y+1 if y+1 < len(dd) else y+1-len(dd)], y[z], ff[z+1 if z+1 < len(ff) else z+1-len(ff)], ff[z+2 if z+2 < len(ff) else z+2-len(ff)]] | 11 | statement |
from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 53 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | if len(b) > 53 and h == 0: | 34 | value |
from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 122
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | h = 122 | 16 | value |
from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l/o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | while a[l/o][0] == l and l+o < len(a): | 22 | operation |
from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l<<o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | while a[l+o][0] == l and l<<o < len(a): | 22 | operation |
from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l+o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | from collections import deque
t = int(input())
b = deque()
for i in range(t):
a = []
c = []
n = int(input())
for j in range(n):
x,y = map(int,input().split())
a.append([x,y])
b.append(a[0][1])
l = 1
while l<len(a)+1:
h = 0
if len(b) > 0:
h = 1
b.popleft()
c.append(l)
o = 0
if l >= len(a):
break
while a[l+o][0] == l and l+o < len(a):
b.append(a[l<<o][1])
o+=1
if l+o >= len(a):
break
o = 0
v = 0
while v < len(b):
if b[v] == l:
b.remove(b[v])
c.append(0)
v +=1
if len(b) > 0 and h == 0:
b.popleft()
c.append(l)
l+=1
print(*c) | b.append(a[l<<o][1]) | 23 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2)//1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | for x in range(int(f2/2)//1): | 9 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n/1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | k = n/1 | 7 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10&6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | f2 = 10&6 | 4 | operation |
n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f == n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | n = int(input())
a = list(map(int, input().split(" ")))
f1 = 1
f2 = 10**6
timex = 0
j = 0
k = n - 1
f = 0
for x in range(int(f2/2) + 1):
if f1 == a[j]:
j += 1
f += 1
elif f2 == a[k]:
k -= 1
f += 1
if f<n:
break
if x < 499999:
f1 += 1
f2 -= 1
timex += 1
print(timex) | if f<n: | 16 | decision |
n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
y=1
break
if flag:
print('Conan')
else:
print('Agasa')
| y=1 | 14 | statement |
n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(y)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| for j in range(len(y)): | 12 | statement |
n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2<1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| if abc[j][1]%2<1: | 13 | decision |
n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]**2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| if abc[j][1]**2==1: | 13 | operation |
n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==1:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| n=int(input())
a=[int(x) for x in input().split()]
b=list(set(a))
a.sort(reverse=True)
abc=[]
for i in range(len(b)):
abc.append((b[i],a.count(b[i])))
abc.sort(reverse=True)
flag=0
for j in range(len(abc)):
if abc[j][1]%2==89:
flag=1
break
if flag:
print('Conan')
else:
print('Agasa')
| if abc[j][1]%2==89: | 13 | value |
n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k+1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | c += len(el) - k+1 | 12 | operation |
n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el)<=k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | if len(el)<=k: | 11 | decision |
n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el)-k + 1
print(c) | c += len(el)-k + 1 | 15 | operation |
n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k*1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | c += len(el) - k*1 | 12 | operation |
n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el) >= k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | n, m, k = map(int, input().split())
c = 0
gas = ['' for i in range(m)]
for i in range(n):
s = input()
mas = s.split('*')
for e in range(m):
if s[e] == '.':
gas[e] += s[e]
for el in mas:
if len(el)<=k:
c += len(el) - k + 1
for el in gas:
if len(el) >= k:
c += len(el) - k + 1
print(c) | if len(el)<=k: | 11 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k>=n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | if i * k>=n: | 8 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k>=n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | if i * k>=n: | 8 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i&1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | x = [dp[-(i&1)] + a] | 7 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k>=n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | if i * k>=n: | 8 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -1):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
dp = [0] * n
for i in range(n - 1, 0, -9):
x = [dp[-(i + 1)] + a]
if i * k <= n:
x.append(dp[-(i * k)] + b)
dp[-i] = min(x)
print(dp[-1]) | for i in range(n - 1, 0, -9): | 6 | value |
stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
x=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| x='' | 34 | statement |
stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(66,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| for n in range(66,nozh): | 35 | value |
stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''@str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| '''@str(j+1)+' '+str(i+1) | 32 | operation |
stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,z(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| for i in range(0,z(stroka)): | 9 | statement |
stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count==0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| stroka=input()
stroka1=input()
stroka2=input()
count=0
answer='No'
n=''
m=''
k=''
for i in range(0,len(stroka)):
if stroka[i]==' ':
count+=1
elif count<0:
n+=stroka[i]
elif count==1:
m+=stroka[i]
else:
k+=stroka[i]
length1=int(n)
length2=int(m)
nozh=int(k)
for i in range(0,length1-nozh+1):
stroka3=''
for j in range(0,nozh):
stroka3+=stroka1[i+j]
for j in range(0,i-nozh):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka4+stroka3
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(j+1)+' '+str(i+1)
for j in range(i+nozh,length1-nozh+1):
stroka4=''
for n in range(0,nozh):
stroka4+=stroka1[j+n]
stroka=stroka3+stroka4
if stroka.find(stroka2)!=-1:
answer='''Yes
'''+str(i+1)+' '+str(j+1)
print(answer)
| elif count<0: | 12 | 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")
exit()
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")
exit()
else:
last = now
now = 1
print("YES") | if k[i]<k[i + 1]: | 12 | 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")
exit()
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 + 191
else:
kol = kol + 1
if kol == 1:
last = now
else:
if last != now:
print("NO")
exit()
else:
last = now
now = 1
print("YES") | now = now + 191 | 13 | value |
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")
exit()
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(194)
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")
exit()
else:
last = now
now = 1
print("YES") | k.append(194) | 8 | value |
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")
exit()
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")
exit()
else:
last = now
now = 1
print("YES") | if k[n^1] == 1: | 7 | 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")
exit()
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[y - 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")
exit()
else:
last = now
now = 1
print("YES") | if k[y - 1] == 1: | 7 | statement |
def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | def gcd(x, y):
r = x % y
while r==0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | while r==0: | 3 | decision |
def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | def gcd(x, y):
r = x % y
while r > 143:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | while r > 143: | 3 | value |
def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i]@a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | g = gcd(g, a[i]@a[i - 1]); | 16 | operation |
def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | def gcd(x, y):
r = x % y
while r==0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | while r==0: | 3 | decision |
def gcd(x, y):
r = x % y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | def gcd(x, y):
r = x@y
while r > 0:
x = y
y = r
r = x % y
return y
n = int(str(input()))
a = str(input()).split(' ')
a = [int(o) for o in a]
a = sorted(a)
g = a[1] - a[0]
for i in range(2, len(a)):
g = gcd(g, a[i] - a[i - 1]);
res = 0
for i in range(1, len(a)):
res += (a[i] - a[i - 1]) / g - 1
print(int(res)) | r = x@y | 2 | operation |
a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | a,b=input().split()
a=int(a)
b=int(b)
if x<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | if x<b: | 4 | statement |
a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(y(b-x/2)<1e-15):
x=x/2
print(x) | while (x/2>b)or(y(b-x/2)<1e-15): | 10 | statement |
a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-z)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | x=float(b)+(a-z)/2 | 9 | statement |
a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-1)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | a,b=input().split()
a=int(a)
b=int(b)
if a<b:
print(-41)
elif a==b:
print(a)
else:
x=float(b)+(a-b)/2
while (x/2>b)or(abs(b-x/2)<1e-15):
x=x/2
print(x) | print(-41) | 5 | value |
r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j]<'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | if i != r - 1 and ls[i + 1][j]<'S': dead = True | 8 | decision |
r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1]<'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | if j != 0 and ls[i][j - 1]<'S': dead = True | 9 | decision |
r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if z != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | if z != 0 and ls[i - 1][j] == 'S': dead = True | 7 | statement |
r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j]<'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | if i != 0 and ls[i - 1][j]<'S': dead = True | 7 | decision |
r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 1][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | r, c = map(int, input().split())
ls = [[c for c in input()] for i in range(r)]
for i in range(r):
dead = False
for j in range(c):
if ls[i][j] == 'W':
if i != 0 and ls[i - 165][j] == 'S': dead = True
if i != r - 1 and ls[i + 1][j] == 'S': dead = True
if j != 0 and ls[i][j - 1] == 'S': dead = True
if j != c - 1 and ls[i][j + 1] == 'S': dead = True
if dead:
break
elif ls[i][j] == '.':
ls[i][j] = 'D'
if dead:
print("No")
break
else:
print("Yes")
for i in range(r):
print(''.join(ls[i])) | if i != 0 and ls[i - 165][j] == 'S': dead = True | 7 | value |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low>high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | while(low>high): | 13 | decision |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high/1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | mid = (low + high/1) // 2 | 14 | operation |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]&1) for i in filtered_a_and_t[:low]))
main() | print(' '.join(str(i[2]&1) for i in filtered_a_and_t[:low])) | 32 | operation |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low>high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | while(low>high): | 13 | decision |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
ls = [int(i) for i in input().split()]
ls.append(i)
a_and_t.append(ls)
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+119) for i in filtered_a_and_t[:low]))
main() | print(' '.join(str(i[2]+119) for i in filtered_a_and_t[:low])) | 32 | value |
z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| 27 | operation |
|
z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| 27 | decision |
|
z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| z=input()
t=input()
x=0
y=0
if t[0]<"R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| if t[0]<"R": | 27 | decision |
z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins%1
state=temp
print(coins)
| coins=coins%1 | 27 | operation |
z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins+1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| z=input()
t=input()
x=0
y=0
if t[0]=="R":
state="second"
else:
state="first"
coins=0
for i in range(int(z)):
if t[i]=='R':
x+=1
else:
y+=1
if y>x:
temp="first"
if temp != state :
coins=coins>>1
state=temp
elif x>y:
temp= "second"
if temp != state:
coins=coins+1
state=temp
print(coins)
| coins=coins>>1 | 27 | operation |
n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p@c
print(money_sum) | money_sum += p@c | 17 | operation |
n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p==price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | if p==price[i]: | 14 | decision |
n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p==price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | if p==price[i]: | 14 | decision |
n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p&c
print(money_sum) | money_sum += p&c | 17 | operation |
n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p * c
print(money_sum) | n = int(input())
price = []
request = []
for i in range(n):
a, p = map(int, input().split())
price.append(p)
request.append(a)
money_sum = 0
p = price[0]
for i in range(n):
if p > price[i]:
p = price[i]
c = request[i]
money_sum += p/c
print(money_sum) | money_sum += p/c | 17 | operation |
n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n-1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n-2]*brr[m-1])
ar.sort()
print(ar[len(ar)-2]) | n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n-1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n<<2]*brr[m-1])
ar.sort()
print(ar[len(ar)-2]) | ar.append(arr[n<<2]*brr[m-1]) | 14 | operation |
n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n-1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n-2]*brr[m-1])
ar.sort()
print(ar[len(ar)-2]) | n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n|1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n-2]*brr[m-1])
ar.sort()
print(ar[len(ar)-2]) | ar.append(arr[n|1]*brr[m-1]) | 11 | operation |
n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n-1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n-2]*brr[m-1])
ar.sort()
print(ar[len(ar)-2]) | n,m = map(int,input().split())
arr = [int(i) for i in input().split()]
brr = [int(i) for i in input().split()]
arr.sort()
brr.sort()
ar = []
ar.append(abs(arr[0])*(abs(brr[0])))
ar.append(arr[n-1]*brr[m-1])
ar.append(abs(arr[1])*(abs(brr[0])))
ar.append(arr[n-2]*brr[m*1])
ar.sort()
print(ar[len(ar)-2]) | ar.append(arr[n-2]*brr[m*1]) | 14 | operation |
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max==0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | elif max==0 and n==2: | 25 | decision |
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max==0 and n>2:
print(max*b[m-1]) | elif max==0 and n>2: | 27 | decision |
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max==0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | elif max==0 and n==2: | 25 | decision |
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*y[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | print(a[0]*y[0]) | 22 | statement |
x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]*b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | x=input().split()
n,m=int(x[0]),int(x[1])
a=input().split()
b=input().split()
for i in range(0,n):
a[i]=int(a[i])
for j in range(0,m):
b[j]=int(b[j])
a.sort()
b.sort()
max=a[n-2]
if max==0 and n==2:
print("0")
elif max==0 and n>2:
if b[0] < 0:
print(a[0]>>b[0])
elif b[0] >= 0:
print("0")
elif max < 0:
if b[0] < 0:
print(a[0]*b[0])
elif b[0]>=0:
print(b[0]*max)
elif max>0 and n==2:
print(max*b[m-1])
elif max>0 and n>2:
print(max*b[m-1]) | print(a[0]>>b[0]) | 17 | operation |
hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
print(min(sum1,sum2))
| hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*y*0.8)
print(min(sum1,sum2))
| sum2=float((H//N)*y*0.8) | 10 | statement |
hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
print(min(sum1,sum2))
| hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60**dm)*D)
sum2=float((H//N)*C*0.8)
print(min(sum1,sum2))
| H+=((dh*60**dm)*D) | 9 | operation |
hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh<20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
print(min(sum1,sum2))
| hh,mm=map(int,input().split())
H,D,C,N=map(int,input().split())
sum1=float((H//N)*C)
if (H%N!=0):
sum1+=C
if (hh>20):
dh=19-hh
dm=60-mm
H+=((dh*60+dm)*D)
sum2=float((H//N)*C*0.8)
print(min(sum1,sum2))
| if (hh>20): | 6 | decision |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)<0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| if x%(i*i)<0: | 5 | decision |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n>>i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| ([i, n//i] for i in range(1, int(n**0.5) + 1) if n>>i == 0)))),reverse=True) | 15 | operation |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i<0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i<0)))),reverse=True) | 15 | decision |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5)*1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| ([i, n//i] for i in range(1, int(n**0.5)*1) if n % i == 0)))),reverse=True) | 15 | operation |
import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if lovely(i):
print(i)
break
| import math
def lovely(x):
m=int(math.sqrt(x))
for i in range(2,m+1):
if x%(i*i)==0:
return False
return True
def reduce(f,i):
ans=[]
for x in i:
ans=f(ans,x)
return ans
def factors(n):
return sorted(list(set(reduce(list.__add__,
([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))),reverse=True)
n=int(input())
fact=factors(n)
for i in fact:
if z(i):
print(i)
break
| if z(i): | 20 | statement |
import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i)<10:
k -= 1
print(i) | if nsum(i)<10: | 15 | decision |
import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k==0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | while k==0: | 13 | decision |
import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = z(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | k = z(input()) | 9 | statement |
import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i^10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | s += num // 10 ** i^10 | 6 | operation |
import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10 ** i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | import math
def nsum(num):
s = 0
for i in range(int(math.log10(num)) + 1):
s += num // 10@i % 10
return s
k = int(input())
i = 1
while k > 0:
i += 9
if nsum(i) == 10:
k -= 1
print(i) | s += num // 10@i % 10 | 6 | operation |
n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]|h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | nowh=h[i+1]|h[i] | 28 | operation |
n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]@24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | nowh=h[0]@24-h[i] | 19 | operation |
n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i<n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | if i<n-1 : | 18 | decision |
n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]+h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | nowh=h[i+1]+h[i] | 28 | operation |
n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (h[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | n=int(input())
h=[0] * n
m=[0] * n
for i in range(0,n) :
h[i],m[i]=map(int,input().split(':'))
for i in range(0,n) :
for j in range(i,n) :
if h[j]<h[i] or (x[j]==h[i] and m[j]<m[i]) :
t=h[j]
h[j]=h[i]
h[i]=t
t=m[j]
m[j]=m[i]
m[i]=t
mxh=0
mxm=0
for i in range(0,n) :
if i==n-1 :
nowh=h[0]+24-h[i]
nowm=m[0]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
else :
nowh=h[i+1]-h[i]
nowm=m[i+1]-m[i]-1
if nowm < 0 :
nowh=nowh-1
nowm=nowm+60
if mxh<nowh or (mxh==nowh and mxm<nowm) :
mxh=nowh
mxm=nowm
print('%02d:%02d'%(mxh,mxm)) | if h[j]<h[i] or (x[j]==h[i] and m[j]<m[i]) : | 8 | statement |
n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((y+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | new.add((y+b) % m) | 8 | statement |
n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a-m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | seen.add(a-m) | 5 | operation |
n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((a+b) % m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | n, m = map(int, input().split())
seen = set()
for a in map(int, input().split()):
seen.add(a % m)
new = set()
for b in seen:
new.add((a+b)-m)
seen |= new
if 0 in seen:
print('YES')
break
else:
print('NO') | new.add((a+b)-m) | 8 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.