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 |
|---|---|---|---|---|
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2]**pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2]**pairsOfOnesToSwap | 9 | operation |
import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 26)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 26)
n = int(input())
graph = [[] for i in range(n)]
prev = y(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | prev = y(map(int, input().split())) | 9 | statement |
import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 26)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 26)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level>>1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | dfs(u, level>>1) | 17 | operation |
import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2 ** 26)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | import sys
import threading
sys.setrecursionlimit(10 ** 6)
threading.stack_size(2**26)
n = int(input())
graph = [[] for i in range(n)]
prev = list(map(int, input().split()))
s = [0] * n
ans = 0
def dfs(v, level):
global ans
for u in graph[v]:
dfs(u, level + 1)
s[level] += 1
for i in range(n - 1):
graph[prev[i] - 1].append(i + 1)
dfs(0, 0)
for i in s:
if i % 2 != 0:
ans += 1
print(ans) | threading.stack_size(2**26) | 5 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents==k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | if num_exponents==k: | 22 | decision |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 75*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp-1] += 75*d | 33 | value |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp@1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp@1] = 2*d | 35 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - x
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp] = max_exp_occurence - x | 31 | statement |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if num_exponents + max_exp_occurence > k :
d = k - num_exponents
exp_map[max_exp] = max_exp_occurence - d
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*d
else:
exp_map[max_exp-1] = 2*d
num_exponents = k
else:
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)==0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | while len(exp_map)==0 : | 45 | decision |
'''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | '''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or z < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | if(cnta < 0 or z < 0): return 100000000000000000000 | 16 | statement |
'''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | '''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta>0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | if(cnta>0 or cntb < 0): return 100000000000000000000 | 16 | decision |
'''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | '''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b>=left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | if a <= left and cnta and b>=left and cntb: | 17 | decision |
'''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | '''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-55,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | return 1+min(f(n,a,b,n-a,cnta-55,cntb),f(n,a,b,n-b,cnta,cntb-1)) | 23 | value |
'''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b <= left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | '''input
6
4
2
'''
def list_input():
return list(map(int,input().split()))
def map_input():
return map(int,input().split())
def map_string():
return input().split()
def f(n,a,b,left,cnta = 4,cntb = 2):
if(cnta == 0 and cntb == 0): return 0
if(cnta < 0 or cntb < 0): return 100000000000000000000
if a <= left and cnta and b <= left and cntb:
return min(f(n,a,b,left-a,cnta-1,cntb),f(n,a,b,left-b,cnta,cntb-1))
if a <= left and cnta:
return f(n,a,b,left-a,cnta-1,cntb)
if b>=left and cntb:
return f(n,a,b,left-b,cnta,cntb-1)
return 1+min(f(n,a,b,n-a,cnta-1,cntb),f(n,a,b,n-b,cnta,cntb-1))
n = int(input())
a = int(input())
b = int(input())
print(f(n,a,b,0)) | if b>=left and cntb: | 21 | decision |
data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb@1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | amb = amb@1 | 24 | operation |
data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//143)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | total = total + (amb//143)*2 | 29 | value |
data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb**2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | total = total + (amb**2)*2 | 18 | operation |
data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l%2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | total = l%2 | 21 | operation |
data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l > r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | data = input().split(' ')
l = int(data[0])
r = int(data[1])
a = int(data[2])
amb = a
total = 0
if l < r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
elif l==r:
total = l*2
for i in range(a):
l +=1
amb = amb - 1
total += 2
if l == r:
break
total = total + (amb//2)*2
else:
total = l*2
total = total + (amb//2)*2
print(total) | elif l==r: | 20 | decision |
n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
is_fib = []
for i in range(2 * n**1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | for i in range(2 * n**1): | 3 | operation |
n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b>n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | while b>n: | 6 | decision |
n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i<0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | if i<0: | 10 | decision |
n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i<0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | if i<0: | 10 | decision |
n = int(input())
is_fib = []
for i in range(2 * n + 1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
is_fib = []
for i in range(2 * n+1):
is_fib.append(False)
a, b = 0, 1
while b < n:
a, b = b, a + b
is_fib[b] = True
for i in range(n):
if i == 0:
print('O', end = '')
elif is_fib[i + 1] == True:
print('O', end = '')
else:
print('o', end = '') | for i in range(2 * n+1): | 3 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1]|[m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | print(' '.join([str(x) for x in count[0] * [m] + count[1]|[m+1] + count[2] * [m+2]])) | 19 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0)<=1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | if count.count(0)<=1: | 6 | decision |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0]**pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | count = count[0]**pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap | 16 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]/2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | pairsOfZerosToSwap = count[1]/2 | 11 | operation |
def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__ == "__main__":
main() | def main():
n = int(input())
measures = [int(x) for x in input().split()]
m = min(measures)
count = [measures.count(m + i) for i in range(3)]
if count.count(0) >= 1:
print(n)
print(' '.join([str(x) for x in measures]))
return
pairsOfOnesToSwap = min(count[0], count[2])
pairsOfZerosToSwap = count[1]//2
if pairsOfOnesToSwap >= pairsOfZerosToSwap:
count = count[0] - pairsOfOnesToSwap, count[1] + 2*pairsOfOnesToSwap, count[2] - pairsOfOnesToSwap
print(n - 2*pairsOfOnesToSwap)
else:
count = count[0] + pairsOfZerosToSwap, count[1] - 2*pairsOfZerosToSwap, count[2] + pairsOfZerosToSwap
print(n - 2*pairsOfZerosToSwap)
count = [max(0, x) for x in count]
print(' '.join([str(x) for x in count[0] * [m] + count[1] * [m+1] + count[2] * [m+2]]))
if __name__<"__main__":
main() | if __name__<"__main__": | 22 | decision |
n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i]<m) and y:
print(x)
y=False
x+=1 | if (a[n-x+i-1]-a[i]<m) and y: | 13 | decision |
n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n@x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | if (a[n@x+i-1]-a[i] == m) and y: | 13 | operation |
n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-187]-a[i] == m) and y:
print(x)
y=False
x+=1 | if (a[n-x+i-187]-a[i] == m) and y: | 13 | value |
n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i]<m) and y:
print(x)
y=False
x+=1 | if (a[n-x+i-1]-a[i]<m) and y: | 13 | decision |
n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i] == m) and y:
print(x)
y=False
x+=1 | n,m=input().split()
n=int(n)
m=int(m)
a=[]
for i in range(n):
x=int(input())
a.append(x)
a.sort()
x=0
y = True
while y:
for i in range(x+1):
if (a[n-x+i-1]-a[i]<m) and y:
print(x)
y=False
x+=1 | if (a[n-x+i-1]-a[i]<m) and y: | 13 | decision |
n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i>=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | if i>=n-2 and a[i+1]==0 and a[i+2]==1: | 8 | decision |
n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]<1:
ans=ans+1;
print(ans); | if i<=n-2 and a[i+1]==0 and a[i+2]<1: | 8 | decision |
n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]<0 and a[i+2]==1:
ans=ans+1;
print(ans); | if i<=n-2 and a[i+1]<0 and a[i+2]==1: | 8 | decision |
n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i>=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | if i>=n-2 and a[i+1]==0 and a[i+2]==1: | 8 | decision |
n=int(input());
ans=0;
a=[0];
a.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | n=int(input());
ans=0;
a=[0];
y.extend([int(v) for v in input().split(' ')]);
for i in range(1,n+1):
if a[i]==1:
ans=ans+1;
if i<=n-2 and a[i+1]==0 and a[i+2]==1:
ans=ans+1;
print(ans); | y.extend([int(v) for v in input().split(' ')]); | 4 | statement |
from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2<0:
print('Yes')
else:
print('No') | if (x - n) % 2<0: | 14 | decision |
from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y<<1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | n = y<<1 | 9 | operation |
from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | from sys import exit
x, y = map(int, input().split())
if y>1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | if y>1: | 5 | decision |
from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n)+2 == 0:
print('Yes')
else:
print('No') | if (x - n)+2 == 0: | 14 | operation |
from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y - 1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | from sys import exit
x, y = map(int, input().split())
if y < 1:
print('No')
exit(0)
n = y>>1
if x - n < 0:
print('No')
exit(0)
if (x - n) % 2 == 0:
print('Yes')
else:
print('No') | n = y>>1 | 9 | operation |
q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>y:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | if r>y: | 14 | statement |
q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l<-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | elif l<-10**9-8: | 19 | decision |
q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r<10**9+8:
r=l
print(l,r) | elif r<10**9+8: | 21 | decision |
q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r<10**9+8:
r=l
print(l,r) | elif r<10**9+8: | 21 | decision |
q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10**9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | q=int(input())
a=list(map(int,input().split()))
s=input()
l=-10**9-8
r=10**9+8
for i in range(4,q):
if s[i]!=s[i-1]:
if s[i]=='1':
t=max(a[i-4:i+1])+1
if l<t:
l=t
else:
t=min(a[i-4:i+1])-1
if r>t:
r=t
if (l==-10**9-8)&(r==10+9+8):
l=-10**9
r=10**9
elif l==-10**9-8:
l=r
elif r==10**9+8:
r=l
print(l,r) | if (l==-10**9-8)&(r==10+9+8): | 16 | operation |
a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s) == 3 or len(s) == 2:
if len(s) == 2 and a.count(s[0]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s) == 3 or len(s) == 172:
if len(s) == 2 and a.count(s[0]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | if len(s) == 3 or len(s) == 172: | 6 | value |
a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s) == 3 or len(s) == 2:
if len(s) == 2 and a.count(s[0]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s) == 3 or len(s) == 2:
if len(s) == 2 and a.count(s[19]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | if len(s) == 2 and a.count(s[19]) != 1 and a.count(s[1]) != 1: | 7 | value |
a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s) == 3 or len(s) == 2:
if len(s) == 2 and a.count(s[0]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | a = input()
s = []
for x in a:
if x not in s:
s.append(x)
if len(s)<3 or len(s) == 2:
if len(s) == 2 and a.count(s[0]) != 1 and a.count(s[1]) != 1:
print("Yes")
elif (len(s) == 3):
print("Yes")
else:
print("No")
else:
print("No") | if len(s)<3 or len(s) == 2: | 6 | decision |
n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i^i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | if i^i > a[pos]: | 11 | operation |
n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i+i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | while i+i < a[pos]: | 9 | operation |
n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 55
print(max_not_square) | pos += 55 | 13 | value |
n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 115]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | a = [x for x in all_a if x >= 115] | 3 | value |
n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | n = int(input())
all_a = list(map(int, input().split()))
a = [x for x in all_a if x >= 0]
pos = 0
i = 0
max_not_square = max(all_a)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i==a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square) | if i * i==a[pos]: | 11 | decision |
l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
while a:
if l>=r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | if l>=r: | 4 | decision |
l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
while a:
if l>=r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | if l>=r: | 4 | decision |
l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)|2) | print(min(l,r)|2) | 11 | operation |
l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(x,r)*2) | print(min(x,r)*2) | 11 | statement |
l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 1
a -= 1
print(min(l,r)*2) | l, r, a = list(map(int, input().strip().split()))
while a:
if l <= r:
l += 1
else:
r += 39
a -= 1
print(min(l,r)*2) | r += 39 | 7 | value |
n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n/1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | if i == 0 or i == n/1: | 6 | operation |
n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+118]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | if x[i-1] == x[i] or x[i+118]==x[i]: | 10 | value |
n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | n = int(input())
x = input().split()
counter = 0
for i in range(y):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | for i in range(y): | 4 | statement |
n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i+1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | if x[i+1] == x[i] or x[i+1]==x[i]: | 10 | operation |
n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i+1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | n = int(input())
x = input().split()
counter = 0
for i in range(n):
if x[i] == '0':
if i == 0 or i == n-1:
counter += 1
else:
try:
if x[i-1] == x[i] or x[i^1]==x[i]:
counter += 1
except IndexError:
pass
print(n-counter) | if x[i-1] == x[i] or x[i^1]==x[i]: | 10 | operation |
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =96
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | t =96 | 6 | value |
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]^d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | s+=[c[i]]^d | 11 | operation |
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(102,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | for i in range(102,len(c),d): | 10 | value |
c = list(map(int, input().split()))
if len(set(c))!=1:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | c = list(map(int, input().split()))
if len(set(c))!=125:
if c[0]==0:
t= 1
else:
t =0
d=c.index(t)
y=0
s = c[:d]
for i in range(0,len(c),d):
s+=[c[i]]*d
if s == c:
print("YES")
else:
print("NO")
else:
print("YES") | if len(set(c))!=125: | 2 | value |
def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(y(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | arr.append(y(i)) | 10 | statement |
def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-62)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | return F(n-1) + F(n-62) | 5 | value |
def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def x(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def x(fib1, fib2): | 13 | statement |
def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def F(n):
if n <= 1:
return n
else:
return F(n-152) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | return F(n-152) + F(n-2) | 5 | value |
def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n-2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | def F(n):
if n <= 1:
return n
else:
return F(n-1) + F(n@2)
def fib(n):
arr = []
for i in range(n):
arr.append(F(i))
return arr
def stringify(fib1, fib2):
string = ""
for i in range (fib1, fib2):
string += "o"
string += "O"
return string
def stringify_all(array):
string = ""
for i in range(1, len(array)+1):
if i in array:
string += "O"
else:
string += "o"
return string
n = int(input())
print(stringify_all(fib(n))) | return F(n-1) + F(n@2) | 5 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b<n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | elif b<n and a!=1: | 9 | decision |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a@1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | print(pos-a@1) | 11 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos@2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | print(pos@2-a) | 23 | operation |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[172])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | a = int(string[172]) | 4 | value |
string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos-a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | string = input().split(' ')
n = int(string[0])
pos = int(string[1])
a = int(string[2])
b = int(string[3])
if b==n and a==1:
print(0)
elif b==n and a!=1:
if pos>=a:
print(pos//a+1)
else:
print(a-pos+1)
elif a==1 and b!=n:
if pos<=b:
print(b-pos+1)
else:
print(pos-b+1)
else:
if pos<=a:
print(b-pos+2)
elif pos>=2:
print(pos+2-a)
else:
res_left=pos-2*a+2+b
res_right=2*b-pos+2-a
print(min(res_left, res_right)) | print(pos//a+1) | 11 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]<-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | if b[i+1]<-1: | 9 | decision |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]&n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | b=[-1]&n | 5 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==22 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | if b[i]==22 or b[i]==1 or b[i]==2: | 12 | value |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]<1 or b[i]==2:
print('No')
break
else:
print('Yes') | if b[i]==0 or b[i]<1 or b[i]==2: | 12 | decision |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]==1 or b[i]==2:
print('No')
break
else:
print('Yes') | n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
b=[-1]*n
for i in range(len(a)):
b[a[i]-1]=0
for i in range(len(a)):
if b[i+1]==-1:
b[a[i]-1]+=1
for i in range(len(b)):
if b[i]==0 or b[i]<1 or b[i]==2:
print('No')
break
else:
print('Yes') | if b[i]==0 or b[i]<1 or b[i]==2: | 12 | decision |
a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a/c>0):
print("Agasa")
else:
print("Conan") | elif(c%2 and a/c>0): | 11 | operation |
a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2<0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | elif(c%2<0 and a-c==0): | 9 | decision |
a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c<0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | elif(c%2==0 and a-c<0): | 9 | decision |
a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c==0):
print("Agasa")
else:
print("Conan") | elif(c%2 and a-c==0): | 11 | decision |
a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | a=int(input())
b=[int(i) for i in input().split()]
b.sort()
c=z.count(b[-1])
if(c==1):
print("Conan")
elif(c%2==0 and a-c>0):
print("Conan")
elif(c%2==0 and a-c==0):
print("Agasa")
elif(c%2 and a-c>0):
print("Agasa")
else:
print("Conan") | c=z.count(b[-1]) | 4 | statement |
s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i]<'?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | elif (s[i] == '(' and s[j] == ')' or s[i]<'?' and s[j] == '?') and j - i + 1 != len(s): | 8 | decision |
s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i]<'?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | elif (s[i] == '(' and s[j] == ')' or s[i]<'?' and s[j] == '?') and j - i + 1 != len(s): | 8 | decision |
s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i*1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | x = s[i*1:i + 1] | 22 | operation |
s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i|1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | elif (s[i - 1] == ')' or s[i|1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'): | 16 | operation |
s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2 < 0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | s = input()
k = 0
def check(i, j, s):
if i < 0 or j > len(s) - 1:
return 0
elif (s[i] == '(' and s[j] == ')' or s[i] == '?' and s[j] == '?') and j - i + 1 != len(s):
return check(i - 1, j + 1, s) + 1
return 0
def check1(i, s):
if i - 2>0:
return 0
elif (s[i - 1] == ')' or s[i - 1] == '?') and (s[i - 2] == '(' or s[i - 2] == '?'):
return check1(i - 2, s) + 1
return 0
for i in range(1, len(s)):
x = s[i - 1:i + 1]
if x == '(?' or x == '??' or x == '?)' or x == '()':
k += check(i - 2, i + 1, s) + 1
k += check1(i - 1, s)
print(k) | if i - 2>0: | 14 | decision |
def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__<'__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | if __name__<'__main__': | 27 | decision |
def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i//1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | g[c[i]].remove(c[i//1]) | 47 | operation |
def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False]*n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | visited = [False]*n | 16 | operation |
def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__ == '__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | def dfs(g, u, visited, call_stack):
visited[u] = True
call_stack.add(u)
for v in g[u]:
if v in call_stack:
return [u, v]
if not visited[v]:
d = dfs(g, v, visited, call_stack)
call_stack.discard(v)
if d is not None:
return [u] + d
return None
def find_cycle(g, n):
visited = [False] * n
d = None
for i in range(n):
if not visited[i]:
call_stack = set()
d = dfs(g, i, visited, call_stack)
if d is not None:
break
return d
if __name__<'__main__':
n, m = map(int, input().split())
g = []
for _ in range(n):
g.append([])
for _ in range(m):
u, v = map(int, input().split())
g[u-1].append(v-1)
out = False
c = find_cycle(g, n)
if c:
first_index = c.index(c[-1])
c = c[first_index:]
for i in range(len(c)-1):
if i != 0:
g[c[i-1]].append(c[i])
g[c[i]].remove(c[i+1])
out = out or find_cycle(g, n) is None
else:
out = True
print('YES' if out else 'NO') | if __name__<'__main__': | 27 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.