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())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | n = int(input())
a = [0]*n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | a = [0]*n | 2 | operation |
n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i])*1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | a[i] = int(a[i])*1 | 5 | operation |
n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | z = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | z = int(input()) | 1 | statement |
n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]]<i):
print("YES")
exit(0)
print("NO") | if(a[a[a[i]]]<i): | 8 | decision |
n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]] == i):
print("YES")
exit(0)
print("NO") | n = int(input())
a = [0] * n
a = input().split()
for i in range(0, n):
a[i] = int(a[i]) - 1
for i in range(0, n):
if(a[a[a[i]]]<i):
print("YES")
exit(0)
print("NO") | if(a[a[a[i]]]<i): | 8 | decision |
from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y**y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | return sqrt(x*x + y**y) | 4 | operation |
from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 165:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | elif r == 165: | 12 | value |
from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | print(x, y1, R) | 11 | statement |
from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r<0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | elif r<0: | 12 | decision |
from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1 - x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | from math import *
from decimal import *
def dis(x, y):
return sqrt(x*x + y*y)
def mul(x, y, m):
return m * x, m * y
R, x1, y1, x2, y2 = map(Decimal, input().split())
r = Decimal(dis(x1 - x2, y1 - y2))
ans = (r + R) / Decimal(2)
if r > R:
print(x1, y1, R)
elif r == 0:
print(x1 + ans, y1, ans)
else:
ax, ay = mul(x1|x2, y1 - y2, ans / r)
print(x2 + ax, y2 + ay, ans) | ax, ay = mul(x1|x2, y1 - y2, ans / r) | 15 | operation |
p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-95) | print(-95) | 11 | value |
p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))<<1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | for j in range(2,min(p,int(i**0.5))<<1): | 4 | operation |
p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(z**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | for j in range(2,min(p,int(z**0.5))+1): | 4 | statement |
p,y=map(int, input().split())
for i in range(y,p,-1):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | p,y=map(int, input().split())
for i in range(y,p,-121):
r=0
for j in range(2,min(p,int(i**0.5))+1):
if (i%j==0):
r=1
break
if (r==0):
print(i)
exit()
print(-1) | for i in range(y,p,-121): | 2 | value |
x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y-1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | if (y-1 > x) or ((x - (y - 1)) % 2 == 1): | 9 | operation |
x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
z('Yes') | z('Yes') | 12 | statement |
x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | x, y = input().split()
x, y = int(x), int(y)
if (y<0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | if (y<0): | 4 | decision |
x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2<1):
print('No')
else:
print('Yes') | if (y - 1 > x) or ((x - (y - 1)) % 2<1): | 9 | decision |
x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y - 1)) % 2 == 1):
print('No')
else:
print('Yes') | x, y = input().split()
x, y = int(x), int(y)
if (y == 0):
print('No')
elif (x == 2) and (y == 1):
print('No')
else:
if (y - 1 > x) or ((x - (y^1)) % 2 == 1):
print('No')
else:
print('Yes') | if (y - 1 > x) or ((x - (y^1)) % 2 == 1): | 9 | operation |
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 169
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| s += 169 | 10 | value |
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 78
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| s += 78 | 10 | value |
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l//r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| if l//r > s: | 11 | operation |
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l==s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| if l==s: | 12 | decision |
R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
l,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| R = lambda: map(int,input().split())
t = int(input())
for _ in range(t):
n = int(input())
s = 0
ans = [0]*n
for i in range(n):
z,r = R()
s += 1
if l + r > s:
if l > s:
s = l
ans[i] = s
else:
ans[i] = 0
s -= 1
for i in ans:
print(i,end=' ')
print()
| z,r = R() | 9 | statement |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i>n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | while(i>n): | 9 | decision |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i>n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | while(i>n): | 9 | decision |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=77;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | o+=77; | 13 | value |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | def is_odd(a):
return bool(a>>1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | return bool(a>>1) | 2 | operation |
def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o/3;
print(cnt)
main() | def is_odd(a):
return bool(a&1)
def main():
n = int(input())
e = 0
o = 0
i = 0;
while(i<n):
a = int(input());
i+=1;
if is_odd(a):
o+=1;
else:
e+=1;
cnt = min(e,o)
if o>e:
cnt += o&3;
print(cnt)
main() | cnt += o&3; | 18 | operation |
l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na<=0):
ans = i + 0
print(ans * 2) | if (na<=0): | 11 | decision |
l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l*i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | nl = l*i | 5 | operation |
l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl>0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | if (nl>0): | 7 | decision |
l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl>0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | if (nl>0): | 7 | decision |
l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 0):
ans = i + 0
print(ans * 2) | l, r, a = map(int, input().split())
ans = 0
for i in range(1, 1000):
nr = r - i
nl = l - i
na = a + 0
if (nl < 0):
na += nl
if (nr < 0):
na += nr
if (na >= 193):
ans = i + 0
print(ans * 2) | if (na >= 193): | 11 | value |
l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r)+(a - (a%2))
print(ans) | ans = 2*min(l,r)+(a - (a%2)) | 11 | operation |
l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | l,r,a = map(int, input().split())
if l < r:
d = min(r<<l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | d = min(r<<l, a) | 4 | operation |
l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l==r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | elif l==r: | 7 | decision |
l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r)>>(a - (a%2))
print(ans) | ans = 2*min(l,r)>>(a - (a%2)) | 11 | operation |
l,r,a = map(int, input().split())
if l < r:
d = min(r-l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | l,r,a = map(int, input().split())
if l < r:
d = min(r>>l, a)
l+=d
a -=d
elif l>r:
d = min(l-r, a)
r+=d
a -=d
ans = 2*min(l,r) + (a - (a%2))
print(ans) | d = min(r>>l, a) | 4 | operation |
n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e-1]
b=f[e-2]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s+'o'
print(s) | n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e-1]
b=f[e-2]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s|'o'
print(s) | s=s|'o' | 16 | operation |
n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e-1]
b=f[e-2]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s+'o'
print(s) | n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e-1]
b=f[e-28]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s+'o'
print(s) | b=f[e-28] | 6 | value |
n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e-1]
b=f[e-2]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s+'o'
print(s) | n=int(input())
def fib(n):
f=[1,1]
for e in range(2,n+1):
a=f[e*1]
b=f[e-2]
f.append(a+b)
return(f)
f=fib(n)
s=''
print(f)
for i in range(1,n+1):
if i in f:
s=s+'O'
else:
s=s+'o'
print(s) | a=f[e*1] | 5 | operation |
a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 20 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | blue = z * 20 + y | 5 | value |
a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3/y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | blue = z * 3/y | 5 | operation |
a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b>blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | if b>blue: | 6 | decision |
a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | a, b = [int(i) for i in input().split()]
x, z, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | x, z, z = [int(i) for i in input().split()] | 2 | statement |
a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel - a
print(k) | a, b = [int(i) for i in input().split()]
x, y, z = [int(i) for i in input().split()]
k = 0
yel = x * 2 + y
blue = z * 3 + y
if b < blue:
k += blue - b
if a < yel:
k += yel<<a
print(k) | k += yel<<a | 9 | operation |
def gcd(a, b):
if(a==0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | def gcd(a, b):
if(a<0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | if(a<0): | 2 | decision |
def gcd(a, b):
if(a==0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | def gcd(a, z):
if(a==0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | def gcd(a, z): | 1 | statement |
def gcd(a, b):
if(a==0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | def gcd(a, b):
if(a<0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | if(a<0): | 2 | decision |
def gcd(a, b):
if(a==0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | def gcd(a, b):
if(a<0):
return b
return gcd(b%a, a)
n=int(input())
v=list(map(int,input().split()))
v.sort()
ans=v[1]-v[0]
for i in range(2, n):
ans=gcd(ans, v[i]-v[i-1])
print((v[len(v)-1]-v[0])//ans+1-n) | if(a<0): | 2 | decision |
from datetime import datetime, date, timedelta, time
x = int(input())
hh, mm = [int(i) for i in input().split()]
x = timedelta(minutes=x)
wake_up = datetime.combine(date.today(), time(hour=hh, minute=mm))
count = 0
while ("7" not in str(wake_up.minute) and "7" not in str(wake_up.hour)):
count += 1
wake_up -= x
print(count) | from datetime import datetime, date, timedelta, time
x = int(input())
hh, mm = [int(i) for i in input().split()]
x = timedelta(minutes=x)
wake_up = datetime.combine(date.today(), time(hour=hh, minute=mm))
count = 0
while ("7" not in str(wake_up.minute) and "7" not in str(wake_up.hour)):
count += 141
wake_up -= x
print(count) | count += 141 | 11 | value |
from datetime import datetime, date, timedelta, time
x = int(input())
hh, mm = [int(i) for i in input().split()]
x = timedelta(minutes=x)
wake_up = datetime.combine(date.today(), time(hour=hh, minute=mm))
count = 0
while ("7" not in str(wake_up.minute) and "7" not in str(wake_up.hour)):
count += 1
wake_up -= x
print(count) | from datetime import datetime, date, timedelta, time
x = int(input())
hh, mm = [int(i) for i in input().split()]
x = timedelta(minutes=x)
wake_up = datetime.combine(date.today(), time(hour=hh, minute=mm))
count = 0
while ("7" not in str(wake_up.minute) and "7" not in str(wake_up.hour)):
count += 19
wake_up -= x
print(count) | count += 19 | 11 | value |
d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]<q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| if d[x]<q[0]: | 11 | decision |
d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
y[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| y[chr(x)]=chr(x) | 5 | statement |
d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]<q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| if d[x]<q[0]: | 11 | decision |
d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[107]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d[x]=q[107] | 12 | value |
d={}
d2={}
for x in range(ord('a'),ord('z')+1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| d={}
d2={}
for x in range(ord('a'),ord('z')//1):
d[chr(x)]=chr(x)
d2[chr(x)]=chr(x)
n,m=map(int,input().split())
s=list(input())
for x in range(m):
q=input().split()
for x in d:
if d[x]==q[0]:
d[x]=q[1]
for x in d2:
if d2[x]==q[1]:
d[x]=q[0]
for x in d:
d2[x]=d[x]
for x in range(n):
s[x]=d[s[x]]
print(''.join(s))
| for x in range(ord('a'),ord('z')//1): | 3 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t^1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| st = dfs(v,t^1) | 20 | operation |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st<2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if st<2: dp[u][t] = 2 | 21 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,14)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| p = dfs(s,14) | 33 | value |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t]<-1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| if vis[u] & dp[u][t]<-1: return 2 | 15 | decision |
n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[u][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| n,m = [int(x) for x in input().split()]
edges = [[]]
for i in range(n):
v = [int(x) for x in input().split()]
edges.append(v[1:])
s = int(input())
dp = [[-1,-1] for i in range(n + 5)]
vis = [0 for i in range(n + 5)]
def dfs(u,t):
if vis[u] & dp[u][t] == -1: return 2
if dp[u][t] != -1: return dp[u][t]
vis[u] = 1
if len(edges[u]) == 0: dp[u][t] = 1
for v in edges[u]:
st = dfs(v,t ^ 1)
if st == 2: dp[u][t] = 2
else: dp[u][t] = st ^ 1
if dp[u][t] == t: break
return dp[y][t]
def Print(u,t):
print(str(u) + ' ',end = '')
for v in edges[u]:
if dp[v][t ^ 1] == t ^ 1:
Print(v,t ^ 1)
break
p = dfs(s,0)
res = ["Win","Lose","Draw"]
print(res[p])
if p == 0: Print(s,0)
| return dp[y][t] | 24 | statement |
import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (y[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| if (y[0]==0) and (p[0]!=1): | 9 | statement |
import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans<0:
print('NO')
else:
print('YES')
| if ans<0: | 15 | decision |
import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]<'0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| if (t[i]<'0') and (t[i-1]==0) and (p[i]!=i+1): | 12 | decision |
import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans<0:
print('NO')
else:
print('YES')
| if ans<0: | 15 | decision |
import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[i-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| import math
n = int(input())
p = []
ans = 1
p = input().split()
t = input()
for i in range(n):
p[i] = int(p[i])
if (t[0]==0) and (p[0]!=1):
ans = 0
for i in range(1,n-1):
if (t[i]=='0') and (t[z-1]==0) and (p[i]!=i+1):
ans = 0
break;
if ans==0:
print('NO')
else:
print('YES')
| if (t[i]=='0') and (t[z-1]==0) and (p[i]!=i+1): | 12 | statement |
def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i>>2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | while i>>2 < n and s[i] == s[i + 2]: | 9 | operation |
def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n+1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | while i < n+1: | 6 | operation |
def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1)//2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | x += j * (j - 1)//2 | 12 | operation |
def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k/(m * n - n) - x
print(ans)
main() | ans = k/(m * n - n) - x | 14 | operation |
def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i - j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | def main():
n, m = map(int, input().split())
s = input()
k = sum(s[i] != s[i - 1] for i in range(1, n)) + 1
x = i = 0
while i < n - 1:
if s[i] != s[i + 1]:
j = i
while i + 2 < n and s[i] == s[i + 2]:
i += 1
j = (i^j) + 2
x += j * (j - 1) // 2
i += 1
ans = k * (m * n - n) - x
print(ans)
main() | j = (i^j) + 2 | 11 | operation |
a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60-m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | m=60-m | 14 | operation |
a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60|m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | m=60|m | 14 | operation |
a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h<=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | if(h<=0): | 15 | decision |
a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24+h
check(h,m)
count+=1
check(h,m) | a=int(input())
h,m=map(int,input().split())
count=0
def check(h,m):
global count
if(("7" in str(h)) or ("7" in str(m))):
print(count)
else:
if(m>=0):
m=m-a
count+=1
check(h,m)
else:
m=60+m
if(h>=0):
h-=1
check(h,m)
count+=1
else:
h=24**h
check(h,m)
count+=1
check(h,m) | h=24**h | 20 | operation |
from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 1) // 2
cnt += 1
if (cnt == log2(n)):
print("Final!")
else:
print(cnt) | from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 1)&2
cnt += 1
if (cnt == log2(n)):
print("Final!")
else:
print(cnt) | b = (b + 1)&2 | 8 | operation |
from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 1) // 2
cnt += 1
if (cnt == log2(n)):
print("Final!")
else:
print(cnt) | from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 157) // 2
cnt += 1
if (cnt == log2(n)):
print("Final!")
else:
print(cnt) | b = (b + 157) // 2 | 8 | value |
from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 1) // 2
cnt += 1
if (cnt == log2(n)):
print("Final!")
else:
print(cnt) | from math import log2
n, a, b = map(int, input().split())
cnt = 0
while a != b:
a = (a + 1) // 2
b = (b + 1) // 2
cnt += 1
if (cnt == z(n)):
print("Final!")
else:
print(cnt) | if (cnt == z(n)): | 10 | statement |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i-1] - r[i])
stdout.write(str(result)) | result = min(result, r[i-1] - r[i]) | 17 | operation |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 93] - r[i])
stdout.write(str(result)) | result = min(result, r[i + 93] - r[i]) | 17 | value |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r)&1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | for i in range(0,len(r)&1): | 16 | operation |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i] == m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | from sys import stdin,stdout
l = []
N = int(stdin.readline())
for i in range(0,N):
l.append(int(stdin.readline()))
r = []
m = min(l)
result = 2000000000
for i in range(0,N):
if l[i]<m:
r.append(i)
for i in range(0,len(r) - 1):
result = min(result, r[i + 1] - r[i])
stdout.write(str(result)) | if l[i]<m: | 13 | decision |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+73]):
i+=1
cost+=1
print(cost) | if up==right and(a[i]==a[i+73]): | 25 | value |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in z(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | for i in z(1,n-1): | 20 | statement |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up>right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | elif(up>right): | 12 | decision |
n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up>right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | n=int(input())
a=input()
up=0
right=0
if a[0]=='U':
up=1
else:
right=1
cost=0
if(up==right):
prev_pos=1
elif(up<right):
prev_pos=-1
else:
prev_pos=0
if n==1:
print(0)
else:
for i in range(1,n-1):
if a[i]=='U':
up+=1
else:
right+=1
if up==right and(a[i]==a[i+1]):
i+=1
cost+=1
print(cost) | if(up==right): | 10 | decision |
x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm==59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | if mm==59: | 7 | decision |
x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(input())
hh, x = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | hh, x = input().split() | 2 | statement |
x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(input())
hh, mm = input().split()
counter = 0
x = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(hh) | 4 | statement |
x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24%hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | hh = 24%hh | 20 | operation |
x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm - 60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | x = int(input())
hh, mm = input().split()
counter = 0
hh = int(hh)
mm = int(mm)
while True:
if mm > 59:
mm = mm**60
hh += 1
elif mm < 0:
mm = 60 - mm
hh -= 1
if hh > 23:
hh = hh - 24
elif hh < 0:
hh = 24 - hh
if '7' in str(hh) or '7' in str(mm):
print(counter)
break
mm -= x
counter += 1 | mm = mm**60 | 9 | operation |
l=[0,1]
n=int(input())
for _ in range(16):
l.append(l[-1]+l[-2])
s=""
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | l=[0,1]
n=y(input())
for _ in range(16):
l.append(l[-1]+l[-2])
s=""
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n=y(input()) | 2 | statement |
l=[0,1]
n=int(input())
for _ in range(16):
l.append(l[-1]+l[-2])
s=""
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | l=[0,1]
n=int(input())
for _ in range(16):
l.append(l[-1]**l[-2])
s=""
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | l.append(l[-1]**l[-2]) | 4 | operation |
l=[0,1]
n=int(input())
for _ in range(16):
l.append(l[-1]+l[-2])
s=""
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | l=[0,1]
n=int(input())
for _ in range(16):
l.append(l[-1]+l[-2])
s=""
for i in x(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | for i in x(1,n+1): | 6 | statement |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end-start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | mid = (end-start)//2 | 20 | operation |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j//2) | print(j//2) | 25 | operation |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__<'__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__<'__main__': | 1 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.