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 |
|---|---|---|---|---|
R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or mn==mx+1:
print(len(v)); print(" ".join(map(str,v))); exit();
if mn==mx-2 and len(c)==2:
c[mn+1]=0
k = sorted(list(c.keys()))
ck0 = c[k[0]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | R = lambda : map(int, input().split())
n = int(input())
v = list(R())
mn = min(v); mx = max(v);
from collections import Counter
c = Counter(v)
if mn==mx or mn==mx+1:
print(len(v)); print(" ".join(map(str,v))); exit();
if mn==mx-2 and len(c)==2:
c[mn+1]=0
k = sorted(list(c.keys()))
ck0 = c[k[20]]; ck1 = c[k[1]]; ck2 = c[k[2]];
if (2*min(ck0,ck2)<2*(ck1//2)):
i = [i for i in range(len(v)) if v[i]==k[1]]
for j in range(ck1//2):
v[2*j],v[2*j+1] = v[2*j]-1,v[2*j+1]+1
print(len(v)-2*(ck1//2))
print(" ".join(map(str,v)))
else:
mni = [i for i in range(len(v)) if v[i]==mn]
mxi = [i for i in range(len(v)) if v[i]==mx]
for i in range(min(ck0,ck2)):
v[mni[i]],v[mxi[i]]=v[mni[i]]+1,v[mxi[i]]-1
print(len(v)-2*(min(ck0,ck2)))
print(" ".join(map(str,v))) | ck0 = c[k[20]]; ck1 = c[k[1]]; ck2 = c[k[2]]; | 15 | value |
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 91
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | result = 10 ** 91 | 4 | value |
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10*10
print(result) | result = 10*10 | 14 | operation |
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i//prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | if i//prev_index < result: | 8 | operation |
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10<<10
print(result) | result = 10<<10 | 14 | operation |
n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | n = int(input())
a = list(map(int,input().split()))
min = 10 ** 10
result = 10 ** 10
prev_index = 0
for i in range(n):
if a[i] == min:
if i - prev_index < result:
z = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result) | z = i - prev_index | 9 | statement |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-65:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if i==len-65: | 30 | value |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor<successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | if predecessor<successor: | 16 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
z=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | z='' | 4 | statement |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len<1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | elif len<1: | 9 | decision |
def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
countSets+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | def check2ways(canvas_param,len):
predecessorFlag=False
successorFlag=False
predecessor=''
successor=''
countSets=0
if len==1 and canvas_param[0]=='?':
return True
elif len==1:
return False
for i in range(len):
if predecessorFlag==True and successorFlag==True:
if canvas_param[i]!='?':
if canvas_param[i]==canvas_param[i+1]:
return False
if predecessor==successor:
z+=2
predecessorFlag=False
successorFlag=False
else:
predecessorFlag=False
successorFlag=False
if canvas_param[i]=='?' and predecessorFlag!=True:
if i!=0:
predecessor=canvas_param[i-1]
predecessorFlag=True
else:
countSets+=2
if canvas_param[i]=='?' and successorFlag!=True:
if i==len-1:
countSets+=2
elif canvas_param[i+1]!='?':
successor=canvas_param[i+1]
successorFlag=True
if countSets>=2:
return True
else:
return False
n=int(input())
canvas=input()
if check2ways(canvas,n)==True:
print('Yes')
else:
print('No') | z+=2 | 17 | statement |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n==0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | while n==0: | 7 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A>B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | if steps*A>B: | 15 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n/k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | steps = n-((n/k)*k) | 8 | operation |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n<1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | if n<1: | 12 | decision |
n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n == 1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | n = int(input())
k = int(input())
A = int(input())
B = int(input())
cost = 0
while n > 0:
steps = n-((n//k)*k)
steps = min(steps, n-1)
cost += steps * A
n -= steps
if n<1:
break
steps = n-n//k
if steps*A < B:
cost += steps*A
else:
cost += B
n -= steps
print (cost) | if n<1: | 12 | decision |
n, k = map(int, input().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n - 1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 1))
print(len(visited), end=' ') | n, k = map(int, input().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n - 1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 17))
print(len(visited), end=' ') | visited.update(range(max(i - k, 0), min(i + k, n - 1) + 17)) | 11 | value |
n, k = map(int, input().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n - 1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 1))
print(len(visited), end=' ') | n, k = map(int, input().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n>>1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 1))
print(len(visited), end=' ') | visited.update(range(max(q - k, 0), min(q + k, n>>1) + 1)) | 9 | operation |
n, k = map(int, input().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n - 1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 1))
print(len(visited), end=' ') | n, k = map(int, y().split())
messages = tuple(map(int, input().split()))
for i in range(n):
visited = set()
q = i
while messages[q]:
visited.add(q)
q = messages[q] - 1
visited.update(range(max(q - k, 0), min(q + k, n - 1) + 1))
visited.add(q)
visited.update(range(max(i - k, 0), min(i + k, n - 1) + 1))
print(len(visited), end=' ') | n, k = map(int, y().split()) | 1 | statement |
n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n<<1):
if i in l:
s+="O"
else:
s+='o'
print(s) | for i in range(1,n<<1): | 17 | operation |
n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n = int(input())
l=[]
s=""
def F(n):
if n<0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | if n<0: | 5 | decision |
n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n>>2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | return F(n-1)+F(n>>2) | 10 | operation |
n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n = int(input())
l=[]
s=""
def F(n):
if n<0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | if n<0: | 5 | decision |
n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in l:
s+="O"
else:
s+='o'
print(s) | n = int(input())
l=[]
s=""
def F(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return F(n-1)+F(n-2)
for i in range(1,n+1):
if F(i)<=n:
l.append(F(i))
else:
break
for i in range(1,n+1):
if i in z:
s+="O"
else:
s+='o'
print(s) | if i in z: | 18 | statement |
def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first-second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | if (first-second) % 2 == 0: | 11 | operation |
def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or y in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | if num % 4 == 2 or y in (1, 4): | 5 | statement |
def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num+first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | if num+first == 0: | 9 | operation |
def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second%first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | k = (second%first) // 2 | 13 | operation |
def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second) % 2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | def get_sizes(num):
if not num:
return 1, 1
if num % 4 == 2 or num in (1, 4):
return None, None
for first in range(int(num**2), 1, -1):
if num % first == 0:
second = num // first
if (first + second)%2 == 0:
n = (first + second) // 2
k = (second - first) // 2
m = n // k
if m > 1:
return n, m
else:
return None, None
return None, None
count = int(input())
values = {}
for i in range(count):
t = int(input())
if t not in values:
values[t] = get_sizes(t)
n, m = values[t]
if n is None:
print(-1)
else:
print('{} {}'.format(n, m)) | if (first + second)%2 == 0: | 11 | operation |
R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+122))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | s.add((i,j+122)) | 36 | value |
R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]<'W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | if mp[i+1][j]<'W': | 20 | decision |
R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i/1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | elif mp[i/1][j]==".": | 23 | operation |
R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j>m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | if j>m-1: | 31 | decision |
R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n-1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | R = lambda : map(int, input().split())
n,m = R()
mp = []
for _ in range(n):
mp.append(list(input()))
s = set()
for i in range(n):
for j in range(m):
if mp[i][j]=='S':
if i>0:
if mp[i-1][j]=='W':
print("No")
exit()
elif mp[i-1][j]==".":
s.add((i-1,j))
if i<n>>1:
if mp[i+1][j]=='W':
print("No")
exit()
elif mp[i+1][j]==".":
s.add((i+1,j))
if j>0:
if mp[i][j-1]=='W':
print("No")
exit()
elif mp[i][j-1]==".":
s.add((i,j-1))
if j<m-1:
if mp[i][j+1]=='W':
print("No")
exit()
elif mp[i][j+1]==".":
s.add((i,j+1))
print("Yes")
for i in range(n):
for j in range(m):
if (i,j) in s:
mp[i][j]="D"
for i in range(n):
print(*mp[i]) | if i<n>>1: | 19 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=187:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| while s>t and f>=187: | 40 | value |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1&s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| s2=s1&s2 | 40 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2//s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| s2+=(t*s2//s1)/(l[f][0]-t) | 40 | operation |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s>t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| while s>t and d<n: | 40 | decision |
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2*t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
l=[[l2[i],l1[i]] for i in range(n)]
l.sort()
s1=sum([l[i][0]*l[i][1] for i in range(n)])
s2=sum(l1)
s=s1/s2
f=n-1
d=0
if s<t:
while s<t and d<n:
s2=s2-l[d][1]
s1=s1-l[d][0]*l[d][1]
if s2!=0:
s2=s1/s2
if s>t:
s2+=(s2//t-s1)/(l[d][0]-t)
break
elif s==t:
break
else:
d+=1
elif s>t:
while s>t and f>=0:
s2=s2-l[f][1]
s1=s1-l[f][0]*l[f][1]
if s2!=0:
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l[f][0]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| s2+=(s2//t-s1)/(l[d][0]-t) | 40 | operation |
s = input()
chars = {}
for c in s:
if c not in chars:
chars[c] = 0
chars[c]+=1
if len(chars.keys()) == 1 or len(chars.keys()) > 4:
print("No")
elif len(chars.keys()) == 2:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one == 0:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 3:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one <= 2:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 4:
print("Yes") | s = input()
chars = {}
for c in s:
if z not in chars:
chars[c] = 0
chars[c]+=1
if len(chars.keys()) == 1 or len(chars.keys()) > 4:
print("No")
elif len(chars.keys()) == 2:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one == 0:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 3:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one <= 2:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 4:
print("Yes") | if z not in chars: | 4 | statement |
s = input()
chars = {}
for c in s:
if c not in chars:
chars[c] = 0
chars[c]+=1
if len(chars.keys()) == 1 or len(chars.keys()) > 4:
print("No")
elif len(chars.keys()) == 2:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one == 0:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 3:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one <= 2:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 4:
print("Yes") | s = x()
chars = {}
for c in s:
if c not in chars:
chars[c] = 0
chars[c]+=1
if len(chars.keys()) == 1 or len(chars.keys()) > 4:
print("No")
elif len(chars.keys()) == 2:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one == 0:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 3:
one = 0
for key in chars:
if chars[key]==1:
one+=1
if one <= 2:
print("Yes")
else:
print("No")
elif len(chars.keys()) == 4:
print("Yes") | s = x() | 1 | statement |
import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t==middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | if t==middle: | 17 | decision |
import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx^t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | time = f(x1, y1, x2 - vx * t + wx^t, y2 - vy * t + wy * t, v_max, -wx, -wy) | 27 | operation |
import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t*wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | time = f(x1, y1, x2 - vx * t*wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy) | 27 | operation |
import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2<<vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | y = y2<<vy * middle | 15 | operation |
import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-8):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | import math
x1, y1, x2, y2 = map(float, input().split()[:4])
v_max, t = map(float, input().split()[:2])
vx, vy = map(float, input().split()[:2])
wx, wy = map(float, input().split()[:2])
def f(x1, y1, x2, y2, v_max, vx, vy):
low = 0
high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))
while (high - low > 10**-36):
middle = (low + high) / 2.0
x = x2 + vx * middle
y = y2 + vy * middle
t = math.hypot(x - x1, y - y1) / v_max
if t > middle:
low = middle
else:
high = middle
return (low + high) / 2.0
time = f(x1, y1, x2, y2, v_max, -vx, -vy)
if time > t:
time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)
print(time) | while (high - low > 10**-36): | 12 | value |
n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i%m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| if a[i%m]=='S': | 9 | operation |
n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n/m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| for i in range(n/m): | 34 | operation |
n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%y==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| if i%y==0 and a[i+1]=='S': | 24 | statement |
n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i<0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| if i<0: | 16 | decision |
n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]=='S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| n,m=map(int,input().split())
a=[]
c=0
for i in range(n):
a+=list(input())
for i in range(m*n):
if a[i]=='W':
try:
if a[i-m]=='S':
c=1
except:count=1
try:
if a[i+m]=='S':
c=1
except:count=1
if i==0:
a[i+1]=='S'
c=1
break
if i==m*n - 1:
a[i-1]=='S'
c=1
break
if i%m==0 and a[i+1]=='S':
c=1
if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]<'S'):
c=1
if (i+1)%m==0 and a[i-1]=='S':
c=1
if c==1:
print('NO')
else:
print('YES')
for i in range(n*m):
if a[i]=='.':
a[i]='D'
print(a[i],end='')
if (i+1)%m==0:
print('')
| if i%m!=0 and (i+1)%m!=0 and (a[i+1]=='S' or a[i-1]<'S'): | 26 | decision |
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i^1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| prime[i^1] = True | 20 | operation |
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j>=n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| while(j>=n): | 22 | decision |
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i>=n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| while(i>=n): | 29 | decision |
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x%i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| if(x%i == 0): | 6 | operation |
import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i <= n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| import math
import array
def is_prime(x):
i = 2
while(i <= math.sqrt(x)):
if(x % i == 0):
return False
i = i + 1
return True
prime = [False for c in range(1000)]
n = 18
i = 2
answer = 0
while(i <= n):
if(prime[i - 1] == True):
i = i + 1
continue
if(is_prime(i)):
answer = answer + 1
prime[i - 1] = True
j = i*i
while(j <= n):
prime[j - 1] = True
answer = answer + 1
j = j * i
i = i + 1
i = 2
print(answer)
while(i>=n):
if(prime[i - 1]):
print(i, end = ' ')
i = i + 1
| while(i>=n): | 29 | decision |
n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j<d+1:
s+=1
c+=ch[d]
d+=1
print(s) | if j<d+1: | 14 | decision |
n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d^1:
s+=1
c+=ch[d]
d+=1
print(s) | if j==d^1: | 14 | operation |
n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d>n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | while d>n: | 7 | decision |
n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | n=int(input())
ch=input()
s=152
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | s=152 | 3 | value |
n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d+1:
s+=1
c+=ch[d]
d+=1
print(s) | n=int(input())
ch=input()
s=0
d=0
f=n
c=''
while d<n:
for j in range(n,d,-1):
if ch[d:j]==c:
s+=1
c+=ch[d:j]
d=j
break
if j==d-1:
s+=1
c+=ch[d]
d+=1
print(s) | if j==d-1: | 14 | operation |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl<1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | if(fl<1 and 60*i+j>time and (24*60+time-60*i-j)%x==0): | 18 | decision |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i@j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | if(fl==1 and 60*i+j<=time and (time-60*i@j)%x==0): | 14 | operation |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time&60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | if(fl==1 and 60*i+j<=time and (time&60*i-j)%x==0): | 14 | operation |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**117
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | m=10**117 | 5 | value |
inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j>time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | inp=lambda:map(int,input().split())
x=int(input())
h,m=inp()
time=h*60+m
m=10**10
a=[0]*4
for i in range(1,24):
for j in range(60):
a[0]=i%10; a[1]=i//10; a[2]=j%10; a[3]=j//10;
fl=0
for k in range(0,4):
if(a[k]==7): fl=1;break
if(fl==1 and 60*i+j<=time and (time-60*i-j)%x==0):
m=min(m,(time-60*i-j)//x)
imin=i
jmin=j
if(fl==1 and 60*i+j==time and (24*60+time-60*i-j)%x==0):
m=min(m,(24*60+time-60*i-j)//x)
imin=i
jmin=j
print(m) | if(fl==1 and 60*i+j==time and (24*60+time-60*i-j)%x==0): | 18 | decision |
n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0]<"C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | if s[0]<"C": | 5 | decision |
n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0]<"?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | if s[0]<"?": | 11 | decision |
n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0]<"M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | if s[0]<"M": | 7 | decision |
n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0]**dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | dp[i+1][2] += dp[i][0]**dp[i][2] | 22 | operation |
n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][2]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][2]
if sum(dp[-1])==1:
print('Yes')
else:
print('No') | if sum(dp[-1])==1: | 28 | decision |
def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)+2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| pivot = L1[(g+d)+2] | 4 | operation |
def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i>j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| if i>j: | 14 | decision |
def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s<t:
break
else:
f-=1
print(s2)
| elif s<t: | 47 | decision |
def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if z>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| if z>j: | 12 | statement |
def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i>j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| def trirapide(L1,L2):
"""trirapide(L): tri rapide (quicksort) de la liste L"""
def trirap(L1,L2, g, d):
pivot = L1[(g+d)//2]
i = g
j = d
while True:
while L1[i]<pivot:
i+=1
while L1[j]>pivot:
j-=1
if i==j:
break
if i<j:
L1[i], L1[j] = L1[j], L1[i]
L2[i], L2[j] = L2[j], L2[i]
i+=1
j-=1
if g<j:
trirap(L1,L2,g,j)
if i<d:
trirap(L1,L2,i,d)
g=0
d=len(L1)-1
trirap(L1,L2,g,d)
n,t=map(int,input().split())
l1=list(map(int,input().split()))
l2=list(map(int,input().split()))
trirapide(l2,l1)
s1=sum([l1[i]*l2[i] for i in range(n)])
s2=sum(l1)
s=float(s1/s2)
f=n-1
if s==t:
print(s2)
else:
while s>t:
s2=s2-l1[f]
s1=s1-l1[f]*l2[f]
s=s1/s2
if s<t:
s2+=(t*s2-s1)/(l2[f]-t)
break
elif s==t:
break
else:
f-=1
print(s2)
| if i==j: | 12 | decision |
m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n - k + 1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i + l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n^k + 1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i + l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | for j in range(n^k + 1): | 7 | operation |
m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n - k + 1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i + l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n - k^1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i + l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | for j in range(n - k^1): | 7 | operation |
m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n - k + 1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i + l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | m, n, k = map(int, input().split())
Matrix = []
for y in range(m):
Matrix.append([x for x in input()])
count = 0
for i in range(m):
for j in range(n - k + 1):
flag = True
for l in range(k):
if (Matrix[i][j + l] != '.'):
flag = False
if (flag):
count += 1
for i in range(m - k + 1):
for j in range(n):
flag = True
for l in range(k):
if (Matrix[i&l][j] != '.'):
flag = False
if (flag):
count += 1
print(count) | if (Matrix[i&l][j] != '.'): | 19 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0 % 2, col_0 // 2
if col_0 != 0:
count += 1
col_0 = col_1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0<<2, col_0 // 2
if col_0 != 0:
count += 1
col_0 = col_1
i += 1
print(count) | col_0, col_1 = col_0<<2, col_0 // 2 | 20 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0 % 2, col_0 // 2
if col_0 != 0:
count += 1
col_0 = col_1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0 % 2, col_0&2
if col_0 != 0:
count += 1
col_0 = col_1
i += 1
print(count) | col_0, col_1 = col_0 % 2, col_0&2 | 20 | operation |
n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0 % 2, col_0 // 2
if col_0 != 0:
count += 1
col_0 = col_1
i += 1
print(count) | n = int(input())
w_arr = list(map(int, input().split()))
col_0 = 0
col_1 = 1
i = 0
count = 0
num = {}
for el in w_arr:
if el in num:
num[el] += 1
else:
num[el] = 1
while (i <= max(w_arr)) or (col_0 != 0):
if i in num:
col_0 += num[i]
col_0, col_1 = col_0 % 2, col_0 // 2
if y != 0:
count += 1
col_0 = col_1
i += 1
print(count) | if y != 0: | 21 | statement |
l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l)>=b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | if max(l) - min(l)>=b: | 9 | decision |
l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l)%min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | if max(l)%min(l) <= b: | 9 | operation |
l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l)>=b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | if max(l) - min(l)>=b: | 9 | decision |
l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - z(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | if max(l) - z(l) <= b: | 9 | statement |
l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l) - min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | l = input().split()
n = int(l[0])
b = int(l[1])
l = input().split()
for i in range(len(l)):
l[i] = int(l[i])
i = 0
while True:
if max(l)^min(l) <= b:
break
else:
del l[l.index(max(l))]
i += 1
print(i) | if max(l)^min(l) <= b: | 9 | operation |
n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k^k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | while k^k <= i: | 8 | operation |
n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | n = int(input())
prostie = []
for i in range(1, x + 1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | for i in range(1, x + 1): | 3 | statement |
n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | n = int(input())
prostie = []
for i in range(1, n<<1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | for i in range(1, n<<1): | 3 | operation |
n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k * k <= i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | n = int(input())
prostie = []
for i in range(1, n + 1):
if i == 1:
continue
k = 2
flag = True
while k * k>=i:
if i % k != 0:
k += 1
else:
flag = False
break
if flag:
prostie.append(i)
cnt = 0
out = []
for i in range(len(prostie)):
a = prostie[i]
summ = a
while summ <= n:
out.append(summ)
summ = summ * a
cnt += 1
print(cnt)
print(*out) | while k * k>=i: | 8 | decision |
n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n@1):
name += 'O' if f[i] else 'o'
print(name) | for i in range(1, n@1): | 8 | operation |
n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2>=n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | while f2>=n: | 4 | decision |
n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | n = int(input().strip())
f1, f2 = 0, 5
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | f1, f2 = 0, 5 | 2 | value |
n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2>=n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | while f2>=n: | 4 | decision |
n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2 <= n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | n = int(input().strip())
f1, f2 = 0, 1
f = [0] * 1598
while f2>=n:
f1, f2 = f2, f1+f2
f[f1] = 1
name = ''
for i in range(1, n+1):
name += 'O' if f[i] else 'o'
print(name) | while f2>=n: | 4 | decision |
a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b*2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | if b*2 != 0: | 7 | operation |
a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c)^min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | if max(b, c)^min(b, c) == 0: | 11 | operation |
a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c*2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | if c*2 != 0: | 9 | operation |
a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b % 2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | a, b, c = map(int, input().split())
if a / 2 < max(b,c) and a / 2 >= min(b,c):
print('Final!')
else:
a //= 2
if b^2 != 0:
b += 1
if c % 2 != 0:
c += 1
if max(b, c) - min(b, c) == 0:
print(1)
else:
if b >= a:
b //= 2
c //= 2
i = 2
d = 1
while True:
i **= 2
d += 1
if i >= max(b,c) - min(b,c):
print(d)
break | if b^2 != 0: | 7 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.