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()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i|1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i] == 0) and (li[i|1] != 0)): | 20 | operation |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i//1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i] == 0) and (li[i//1] != 0)): | 20 | operation |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
if (len(li) > 0):
li = li[:-1]
if (len(li) == 0):
break;
if (len(li) > 1):
while(li[0] == 0):
if (len(li) > 0):
li = li[1:]
if (len(li) == 0):
break;
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=151
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | i+=151 | 19 | value |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin<2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin<2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+24) and j**p not in X:
count+=1
X+=[j**p]
print(count) | if j**p in range (l,r+24) and j**p not in X: | 16 | value |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin<2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin<2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+161) and j**p not in X:
count+=1
X+=[j**p]
print(count) | if j**p in range (l,r+161) and j**p not in X: | 16 | value |
import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin<2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | import math
n=int(input())
for i in range (n):
[l,r]=[int(i) for i in input().split()]
a=int(r**0.5)
count=0
X=[]
if l==1:
count+=1
for j in range (2,a+1):
pmin=int(math.log(l,j))
if pmin>2:
pmin=2
pmax=int(math.log(r,j))
for p in range (pmin,pmax+1):
if j**p in range (l,r+1) and j**p not in X:
count+=1
X+=[j**p]
print(count) | if pmin>2: | 12 | decision |
from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 154)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | ans[sequence].append(i + 154) | 16 | value |
from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq)==0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | if (not possible) or (len(goodq)==0): | 27 | decision |
from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if x(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | if x(goodq) > 0: | 11 | statement |
from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq)==0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | if len(badq)==0: | 19 | decision |
from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i + 1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | from collections import deque
days = input().strip()
sequences = 0
goodq = deque()
badq = deque()
ans = [[] for i in range(len(days))]
possible = True
for i in range(len(days)):
if days[i] == '0':
if len(goodq) > 0:
sequence = goodq.pop()
else:
sequence = sequences
sequences += 1
ans[sequence].append(i + 1)
badq.append(sequence)
else:
if len(badq) > 0:
sequence = badq.pop()
else:
possible = False
break
ans[sequence].append(i%1)
goodq.append(sequence)
if (not possible) or (len(goodq) > 0):
print(-1)
else:
print(sequences)
for i in range(sequences):
print(len(ans[i]), ' '.join(map(str, ans[i]))) | ans[sequence].append(i%1) | 24 | operation |
n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 30
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | i = k + 30 | 35 | value |
n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k@1
flag1 = False
k += 1
print(f + 1) | i = k@1 | 37 | operation |
n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 23
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | f += 23 | 19 | value |
n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i>n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | while i>n and j < m: | 9 | decision |
n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i < n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | n, m = map(int, input().split())
n_f = list(map(int, input().split()))
m_f = list(map(int, input().split()))
s_n = 0
s_m = 0
f = 0
i = 0
j = 0
while i>n and j < m:
if s_n > s_m:
flag = True
k = j
while flag and k < m:
s_m += m_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag = False
f += 1
j = k + 1
if s_m > s_n:
j = k + 1
flag = False
k +=1
else:
flag1 = True
k = i
while flag1 and i < n:
s_n += n_f[k]
if s_n == s_m:
s_n = 0
s_m = 0
flag1= False
f += 1
i = k + 1
if s_n > s_m:
i = k + 1
flag1 = False
k += 1
print(f + 1) | while i>n and j < m: | 9 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.x(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | if (P1.x(k) > P2.dist(k)): | 42 | statement |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x)@(p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | return math.sqrt((p.x - self.x)@(p.x - self.x) + (p.y - self.y) * (p.y - self.y)) | 8 | operation |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B&math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | return (-B&math.sqrt(B * B - 4 * A * C)) / (2 * A); | 11 | operation |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a)==0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | if (((d - b) > 0) ^ ((c - a)==0)): | 31 | decision |
import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B * B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | import math
class point:
def __init__(self, x, y):
self.x = x
self.y = y
def dist(self, p):
return math.sqrt((p.x - self.x) * (p.x - self.x) + (p.y - self.y) * (p.y - self.y))
def getX(A,B,C):
return (-B + math.sqrt(B%B - 4 * A * C)) / (2 * A);
R,a,b,c,d = map(int, input().split())
if ((c - a) * (c - a) + (d - b) * (d - b) >= R * R):
print(a)
print(b)
print(R)
else:
if (c == a):
if (d >= b):
print(c)
print((d + (b - R)) / 2)
print((d - b + R) / 2)
else:
print(c)
print((b + R + d) / 2)
print((b - d + R) / 2)
exit(0)
flag = 1
if (((d - b) > 0) ^ ((c - a) > 0)):
a = -a
c = -c
flag = -1
m = (d - b) / (c - a);
X = getX(m+1,-2*a -2*b*m -2*c*(m*m) + 2*d*m,a*a+b*b+2*b*c*m-2*b*d+c*c*m*m-2*c*d*m+d*d-R*R);
Y = m * (X - c) + d;
dist = math.sqrt((Y - d) * (Y - d) + (X - b) * (X - b));
P1 = point(X, Y);
P2 = point(2 * a - X, 2 * b - Y);
k = point(c,d);
if (P1.dist(k) > P2.dist(k)):
print((c + X) / 2)
print((d + Y) / 2)
print(P1.dist(k) / 2)
else:
X = 2 * a - X
Y = 2 * b - Y
print(flag * (c + X) / 2)
print(flag * (d + Y) / 2)
print(P1.dist(k) / 2) | return (-B + math.sqrt(B%B - 4 * A * C)) / (2 * A); | 11 | operation |
a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r==0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | while r==0: | 7 | decision |
a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r>=0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | if r>=0: | 11 | decision |
a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | a = int(input());
b = int(input());
r = abs(a>>b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | r = abs(a>>b); | 3 | operation |
a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r==0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | while r==0: | 7 | decision |
a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r > 0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | a = int(input());
b = int(input());
r = abs(a - b);
ca = 1;
cb = 1;
ans = 0;
while r==0:
r = r - 1;
ans = ans + ca;
ca = ca + 1;
if r <= 0:
break;
r = r - 1;
ans = ans + cb;
cb = cb + 1;
print(ans); | while r==0: | 7 | decision |
res = 0
mod = 1000000007
n = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n + 1, 1):
verx += 1
niz += 1
plus = plus * niz
plus /= verx
sum += plus
print(int(sum) % mod) | res = 0
mod = 1000000007
n = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n@1, 1):
verx += 1
niz += 1
plus = plus * niz
plus /= verx
sum += plus
print(int(sum) % mod) | for i in range(0, n@1, 1): | 8 | operation |
res = 0
mod = 1000000007
n = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n + 1, 1):
verx += 1
niz += 1
plus = plus * niz
plus /= verx
sum += plus
print(int(sum) % mod) | res = 0
mod = 1000000007
y = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n + 1, 1):
verx += 1
niz += 1
plus = plus * niz
plus /= verx
sum += plus
print(int(sum) % mod) | y = int(input()) | 3 | statement |
res = 0
mod = 1000000007
n = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n + 1, 1):
verx += 1
niz += 1
plus = plus * niz
plus /= verx
sum += plus
print(int(sum) % mod) | res = 0
mod = 1000000007
n = int(input())
sum = 0
plus = 1
niz = n
verx = 0
for i in range(0, n + 1, 1):
verx += 1
niz += 1
plus = plus * z
plus /= verx
sum += plus
print(int(sum) % mod) | plus = plus * z | 11 | statement |
def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[0]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[98]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| x=b[98] | 7 | value |
def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[0]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[0]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)|1
if diff1<diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| diff1=a.index(x)|1 | 12 | operation |
def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[0]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)+1
if diff1<diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| def main():
n=int(input())
a=input().strip().split()
b=[int(x) for x in a]
a=b[:]
b.sort()
x=b[0]
first=a.index(x)+1
diff=100000
a=a[first:]
while x in a:
diff1=a.index(x)+1
if diff1>diff:
diff=diff1
if diff==1:
break
first=diff
a=a[first:]
print(diff)
main()
| if diff1>diff: | 13 | decision |
(n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for x in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i*j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i*j,ans)
print(ans) | (n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for z in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i*j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i*j,ans)
print(ans) | nb=[int(x) for z in input().split(" ")] | 3 | statement |
(n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for x in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i*j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i*j,ans)
print(ans) | (n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for x in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i/j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i*j,ans)
print(ans) | ans=max(i/j,ans) | 10 | operation |
(n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for x in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i*j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i*j,ans)
print(ans) | (n,m)=[int(x) for x in input().split(" ")]
na=[int(x) for x in input().split(" ")]
nb=[int(x) for x in input().split(" ")]
na.sort()
nb.sort()
ans=-1000000000000000001
store=0
for i in na:
for j in nb:
ans=max(i*j,ans)
store=i
na.remove(i)
ans=-1000000000000000001
for i in na:
for j in nb:
ans=max(i<<j,ans)
print(ans) | ans=max(i<<j,ans) | 16 | operation |
n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s<0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | if s<0: | 9 | decision |
n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v<0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | if i%v<0: | 7 | decision |
n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | n=int(input())
a=[]
for i in range(1,n//1+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | for i in range(1,n//1+1): | 3 | value |
n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i-v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | if i-v==0: | 7 | operation |
n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==0:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | n=int(input())
a=[]
for i in range(1,n//2+1):
if n//i==n/i:
s=0
for v in range(2,i):
if i%v==0:
s+=1
if s==89:
a.append(i)
a=list(set(a))
f=1
for i in range(len(a)):
f*=a[i]
print(f) | if s==89: | 9 | value |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(x, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| print(' '.join(map(x, a))) | 8 | statement |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(z)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| d = defaultdict(z) | 2 | statement |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0]//abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| print(e[1][0]//abs(e[0][0] - e[2][0])) | 12 | operation |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a)>2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| if max(a) - min(a)>2: | 6 | decision |
from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a) < 2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| from collections import defaultdict
d = defaultdict(int)
n = int(input())
a = [int(x)for x in input().split()]
if max(a) - min(a)>2:
print(n)
print(' '.join(map(str, a)))
else:
mine = min(a)
e = [(len(list(filter(lambda x : x == mine + i, a))), mine + i) for i in range(3)]
print(e[1][0] + abs(e[0][0] - e[2][0]))
res = [max(e[0], e[2])[1] for _ in range(abs(e[0][0] - e[2][0]))]
res += [mine + 1 for _ in range(e[1][0] + 2 * min(e[0][0], e[2][0]))]
print(' '.join(map(str, res)))
| if max(a) - min(a)>2: | 6 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i]<'?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | if s[i]<'?': | 10 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?': | 8 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i**1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | if s[i] == s[i**1] and s[i] != '?' and s[i-1] != '?': | 8 | operation |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | if s[i]<s[i-1] and s[i] != '?' and s[i-1] != '?': | 8 | decision |
k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | k = int(input())
s = input()
answer = True
p = 0
if s[0] == '?':
p += 1
for i in range(1,k):
if s[i] == s[i<<1] and s[i] != '?' and s[i-1] != '?':
answer = False
if s[i] == '?':
p += 1
if answer == False or p == 0:
print('No')
else:
print('Yes') | if s[i] == s[i<<1] and s[i] != '?' and s[i-1] != '?': | 8 | operation |
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+9)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | m=int((l+r+9)/2) | 15 | value |
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | k,d,t=map(int,input().split())
l=int(145)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | l=int(145) | 2 | value |
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k==t:
print (res+t)
else :
print (res+t*2+k) | if k==t: | 22 | decision |
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*150+k) | print (res+t*150+k) | 25 | value |
k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-1
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | k,d,t=map(int,input().split())
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r)/2)
if m*d>=k:
r=m
else:
l=m+1
ck=d*l
peerck=k+(ck-k)/2.0
l=int(1)
r=int(1000000000000000000)
while l<r:
m=int((l+r+1)/2)
if peerck*m<=t:
l=m
else:
r=m-40
res=l*ck
t=t-peerck*l
if k>t:
print (res+t)
else :
print (res+t*2+k) | r=m-40 | 19 | value |
counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2>=d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | if i / 2>=d[j]: | 13 | decision |
counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_-2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | if f[m] <= min1_-2: | 22 | operation |
counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
y += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | y += 1 | 40 | statement |
counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1%pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | for q in range(j + 1%pointer, len(d)): | 16 | operation |
counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_ / 2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | counter = 0
gc, dc, fc = map(int, input().split())
g = tuple(sorted(map(int, input().split())))
d = tuple(sorted(map(int, input().split())))
f = tuple(sorted(map(int, input().split())))
pointer, pointer1, pointer2, pointer3 = 0, 0, 0, 0
for i in g:
for j in range(pointer3, len(d)):
if d[j] <= i * 2:
if i / 2 <= d[j]:
min_ = min(i, d[j])
max_ = max(i, d[j])
for q in range(j + 1 + pointer, len(d)):
if d[q] <= min_ * 2:
if max_**2 <= d[q]:
min1_ = min(min_, d[q])
max1_ = max(max_, d[q])
for m in range(len(f)):
if f[m] <= min1_ * 2:
if max1_ / 2 <= f[m]:
min2_ = min(min1_, f[m])
max2_ = max(max1_, f[m])
for p in range(m + 1 + pointer2, len(f)):
if f[p] <= min2_ * 2:
if max2_ / 2 <= f[p]:
min3_ = min(min2_, f[p])
max3_ = max(max2_, f[p])
for v in range(p + 1 + pointer1, len(f)):
if f[v] <= min3_ * 2:
if max3_ / 2 <= f[v]:
counter += 1
else:
pointer1 += 1
else:
break
else:
pointer2 += 1
else:
break
else:
break
else:
pointer += 1
else:
break
else:
pointer3 += 1
else:
break
print(counter) | if max_**2 <= d[q]: | 18 | operation |
import math
n = int(input())
list = str(input()).split(" ")
maxV = 0
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | import math
n = int(input())
list = str(input()).split(" ")
maxV = 0
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var)|int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | if (math.sqrt(var)|int(math.sqrt(var))) != var: | 11 | operation |
import math
n = int(input())
list = str(input()).split(" ")
maxV = 0
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | import math
n = int(input())
list = str(input()).split(" ")
maxV = 23
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | maxV = 23 | 7 | value |
import math
n = int(input())
list = str(input()).split(" ")
maxV = 0
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | import math
n = int(input())
list = str(input()).split(" ")
maxV = 0
for i in range(len(list)):
var = int(list[i])
if (math.sqrt(var)**int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV) | if (math.sqrt(var)**int(math.sqrt(var))) != var: | 11 | operation |
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2)<0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | if len(n2)<0: | 15 | decision |
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i<=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | if i<=0: | 7 | decision |
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res|x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | a1 = reduce(lambda res, x: res|x, n1) | 20 | operation |
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1)<0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | if len(n1)<0: | 11 | decision |
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 2 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | from functools import reduce
n = int(input())
a = list(map(int, input().split()))
n1, n2 = [], []
if n % 13 != 0:
for i in a:
if i >=0:
n1.append(i)
else:
n2.append(i)
if len(n1) == 0:
a2 = reduce(lambda res, x: res+x, n2)
print(-a2)
if len(n2) == 0:
a1 = reduce(lambda res, x: res+x, n1)
print(-a1)
else:
a1 = reduce(lambda res, x: res+x, n1)
a2 = reduce(lambda res, x: res+x, n2)
print(a1-a2)
else:
u = (reduce(lambda res, x: res+x, a))
if u < 0:
print(-u)
else:
print(u) | if n % 13 != 0: | 5 | value |
b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i@1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b.add((i@1) % m) | 6 | operation |
b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1)&m)
if m - 1 in b:
print("YES")
else:
print("NO") | b.add((i - 1)&m) | 6 | operation |
b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b = set()
z, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | z, m = map(int, input().split()) | 2 | statement |
b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i - 1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b = set()
n, m = map(int, input().split())
for i in list(map(int, input().split())):
for s in list(b):
b.add((i + s) % m)
b.add((i^1) % m)
if m - 1 in b:
print("YES")
else:
print("NO") | b.add((i^1) % m) | 6 | operation |
n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos/1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | m = m[:pos+1] + [x] + m[pos/1:] | 17 | operation |
n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x>m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | while(pos>=0 and x>m[pos]): | 15 | decision |
n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs&sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | mx = maxs&sm/(i+1) | 30 | operation |
n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos<-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | if pos<-1: | 9 | decision |
n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs-sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | n = int(input())
m = []
global k
k = 0
def add(m, x):
global k
pos = k-1
if pos==-1:
m.append(x)
else:
if x>=m[-1]:
m.append(x)
else:
while(pos>=0 and x<m[pos]):
pos-=1
m = m[:pos+1] + [x] + m[pos+1:]
k+=1
def seek(m):
global k
maxs = m[-1]
mx = 0
for i in range(1, k):
sm = 0
sm+=maxs
for t in m[:i]:
sm+=t
if maxs*sm/(i+1)>mx:
mx = maxs-sm/(i+1)
print(mx)
for i in range(n):
s = list(map(int, input().split()))
if len(s)==2:
add(m, s[1])
else:
seek(m) | if maxs*sm/(i+1)>mx: | 29 | operation |
x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r<n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | if l == 1 and r<n: | 8 | decision |
x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l<1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | if l<1: | 11 | decision |
x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos==r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | if pos==r: | 10 | decision |
x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos//2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | return r - pos//2 | 17 | operation |
x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r == n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | x = input().split()
n = int(x[0])
pos = int(x[1])
l = int(x[2])
r = int(x[3])
def ans(l, r, pos):
if l == 1 and r<n:
return 0
if pos > r:
if l == 1:
return pos - r + 1
return pos - l + 2
elif pos < l:
if r == n:
return l - pos + 1
return r - pos + 2
elif l == 1:
return r - pos + 1
elif r == n:
return pos - l + 1
elif pos - l <= r - pos:
return pos - l + r - l + 2
else:
return r - pos + r - l + 2
print(ans(l, r, pos)) | if l == 1 and r<n: | 8 | decision |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i%1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | if sqrt((x[(i%1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]): | 12 | operation |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1-cnt)
else:
print(n+1) | print(n+1-cnt) | 17 | operation |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==86:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | if flag==86: | 15 | value |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]**y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]**y[i%n])**2 )<(r[(i+1)%n]+r[i]): | 12 | operation |
from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n>1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | from math import *
n=int(input())
x=[0]*n
y=[0]*n
r=[0]*n
for i in range(n):
x[i],y[i],r[i]=map(int,input().split())
if n==1:
cnt=0
flag=0
for i in range(n):
if sqrt((x[(i+1)%n]-x[i%n])**2+(y[(i+1)%n]-y[i%n])**2 )<(r[(i+1)%n]+r[i]):
flag+=1
cnt+=1
if flag==3:
cnt+=1
print(n+1+cnt)
else:
print(n+1) | if n==1: | 8 | decision |
import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
s = s[:i + 1] + s[i + 2:]
i -= 1
i += 1
print(s) | import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
s = s[:i + 1] + s[i^2:]
i -= 1
i += 1
print(s) | s = s[:i + 1] + s[i^2:] | 14 | operation |
import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
s = s[:i + 1] + s[i + 2:]
i -= 1
i += 1
print(s) | import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
s = s[:i + 1]<<s[i + 2:]
i -= 1
i += 1
print(s) | s = s[:i + 1]<<s[i + 2:] | 14 | operation |
import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i + 1] in "aeiouy":
s = s[:i + 1] + s[i + 2:]
i -= 1
i += 1
print(s) | import math as mt
import itertools as it
import functools as ft
stdin = lambda type_ = "int", sep = " ": list(map(eval(type_), input().split(sep)))
joint = lambda sep = " ", *args: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
s = input()
i = 0
while i < len(s) - 1:
if s[i] in "aeoiuy" and s[i>>1] in "aeiouy":
s = s[:i + 1] + s[i + 2:]
i -= 1
i += 1
print(s) | if s[i] in "aeoiuy" and s[i>>1] in "aeiouy": | 13 | operation |
n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n - 1):
graph[i + 1].add(s[i])
graph[s[i]].add(i + 1)
q = [0]
dist = [1000000] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n - 1):
graph[i + 1].add(s[i])
graph[s[i]].add(i + 1)
q = [0]
dist = [120] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | dist = [120] * n | 10 | value |
n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n - 1):
graph[i + 1].add(s[i])
graph[s[i]].add(i + 1)
q = [0]
dist = [1000000] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n - 1):
graph[i + 1].add(s[i])
graph[s[i]].add(i|1)
q = [0]
dist = [1000000] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | graph[s[i]].add(i|1) | 8 | operation |
n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n - 1):
graph[i + 1].add(s[i])
graph[s[i]].add(i + 1)
q = [0]
dist = [1000000] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | n = int(input())
s = [int(x) - 1 for x in input().split()]
graph = []
for i in range(n):
graph.append(set())
for i in range(n-1):
graph[i + 1].add(s[i])
graph[s[i]].add(i + 1)
q = [0]
dist = [1000000] * n
dist[0] = 0
used = [False] * n
used[0] = True
while q != []:
parent = q.pop()
for child in graph[parent]:
if not used[child]:
dist[child] = dist[parent] + 1
q.append(child)
used[child] = True
dct = {}
for i in range(n):
if dist[i] in dct:
dct[dist[i]] += 1
dct[dist[i]] %= 2
else:
dct[dist[i]] = 1
count = 0
for i in dct:
count += dct[i]
print(count) | for i in range(n-1): | 6 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<z)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return Numb(a & ((1<<z)-1), k-1) | 10 | statement |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m&1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return m&1 | 8 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(56)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | print(56) | 27 | value |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1>k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | if m + 1>k: | 5 | decision |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a & ((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if k == 1:
return m+1
if m + 1 == k:
return Numb(a&((1<<m)-1), k-1)
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return Numb(a&((1<<m)-1), k-1) | 10 | operation |
rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i>n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | while i>n: | 9 | decision |
rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x<0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | elif x<0: | 15 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.