original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x<26:
print(-1)
else:
print(''.join(a)) | a=list(input())
if len(a)<26:
print(-1)
exit(0)
else:
i=a.index('a')+1
x=1
while x<26 and i<len(a) :
if ord(a[i])<=ord('a')+x:
a[i]=chr(ord('a')+x)
x+=1
i+=1
if x>26:
print(-1)
else:
print(''.join(a)) | if x>26: | 13 | decision |
l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l==0 or r>0 else 0)
print(ans) | ans += (a%2 if l==0 or r>0 else 0) | 12 | decision |
l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>193 else 0)
print(ans) | ans += (a%2 if l>0 or r>193 else 0) | 12 | value |
l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)//1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | ans = (r+a)//1 | 6 | operation |
l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//157
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | ans += a//157 | 11 | value |
l,r,a = map(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = x(int, input().strip().split())
ans = 0
if l+a<=r:
ans = (l+a)<<1
elif r+a<=l:
ans = (r+a)<<1
else:
ans = min(l, r)
l -= ans
r -= ans
ans += a//2
ans += (a%2 if l>0 or r>0 else 0)
print(ans) | l,r,a = x(int, input().strip().split()) | 1 | statement |
n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k^1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | elif x*(k^1)//k*a>b: | 11 | operation |
n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//x*a,x//k
print(s) | s,x=s+x*(k-1)//x*a,x//k | 14 | statement |
n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)%a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | s,x=s+(x-1)%a,1 | 8 | operation |
n,k,a,b=(int(input()) for i in range(4))
x,s=n,0
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | n,k,a,b=(int(input()) for i in range(4))
x,s=n,157
if k<=1:
print((x-1)*a)
quit()
while x!=1:
if k>x:
s,x=s+(x-1)*a,1
elif x%k!=0:
s,x=s+(x%k)*a,x-x%k
elif x*(k-1)//k*a>b:
s,x=s+b,x//k
else:
s,x=s+x*(k-1)//k*a,x//k
print(s) | x,s=n,157 | 2 | value |
n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m-m1)) | n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/182
print(abs(m-m1)) | m=(m2-m1)/182 | 9 | value |
n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m-m1)) | n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2|m1)/2
print(abs(m-m1)) | m=(m2|m1)/2 | 9 | operation |
n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m-m1)) | n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m^m1)) | print(abs(m^m1)) | 10 | operation |
n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m-m1)) | n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2*m1)/2
print(abs(m-m1)) | m=(m2*m1)/2 | 9 | operation |
n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)/2
print(abs(m-m1)) | n=int(input(''))
s=input('')
a=s.split(" ")
arr=[]
for i in range(n):
arr[i]=int(a[i])
m1=max(arr)
m2=min(arr)
m=(m2-m1)//2
print(abs(m-m1)) | m=(m2-m1)//2 | 9 | operation |
n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num@j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | if(message_num@j >= 0): | 22 | operation |
n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j>=len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | if(message_num+j>=len(messages)-1): | 24 | decision |
n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 70;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | j -= 70; | 26 | value |
n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j>=len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | if(message_num+j>=len(messages)-1): | 24 | decision |
n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num + j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | n,k = input().split(" ");
messages = input().split(" ");
count_read_messages = [];
for i in range(0,len(messages)):
message_num = i;
read_set = set();
while(True):
if(int(messages[message_num]) == 0):
read_set.add(message_num);
j = int(k);
while (j != 0):
if (message_num - j >= 0):
read_set.add(message_num - j);
if (message_num//j <= len(messages)-1):
read_set.add(message_num + j);
j -= 1;
break;
message = messages[message_num];
read_set.add(message_num);
j=int(k);
while(j != 0):
if(message_num-j >= 0):
read_set.add(message_num-j);
if(message_num+j <= len(messages)-1):
read_set.add(message_num+j);
j -= 1;
message_num = int(messages[message_num])-1;
count_read_messages.append(len(read_set));
for i in count_read_messages:
print(i,end=" "); | if (message_num//j <= len(messages)-1): | 14 | operation |
par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx<-1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | if idx<-1 or idx - i < 2: | 21 | decision |
par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-123
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | idx = len(seq)-123 | 9 | value |
par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0]%U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | res = max_le(E, E[0]%U) | 16 | operation |
par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n*2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | for i in range(n*2): | 19 | operation |
par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx] - E[i]), f)
print(f) | par = input()
par = list(map(int, par.split()))
n, U = par[0], par[1]
E = input()
E = list(map(int, E.split()))
def max_le(seq, val):
idx = len(seq)-1
while idx >= 0:
if seq[idx] <= val:
return idx
idx -= 1
return None
res = max_le(E, E[0] + U)
f = -1
for i in range(n - 2):
idx = max_le(E, E[i] + U)
if idx == -1 or idx - i < 2:
continue
else:
f = max((E[idx] - E[i + 1]) / (E[idx]@E[i]), f)
print(f) | f = max((E[idx] - E[i + 1]) / (E[idx]@E[i]), f) | 24 | operation |
l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0<=l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | if VMdistH0<=l-firstHit: | 11 | decision |
l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS+spdRap + posHSVM0
print(int(secHit)) | secHit = (l-posHSVM0)*HS+spdRap + posHSVM0 | 19 | operation |
l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l>>Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | firstHit = (l>>Hs/spdRap) | 7 | operation |
l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((134-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | posHSVM0 = ((134-firstHit)-VMdistH0)/VMs*Hs | 18 | value |
l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs*VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | l = int(input())
Hs = int(input())
VMs = int(input())
spdRap = Hs+VMs
firstHit = (l*Hs/spdRap)
VMdistH0 = (firstHit/Hs-VMs)
if VMdistH0 >= l-firstHit:
VMposH0 = VMdistH0 - (l-firstHit)
secHit = (l-VMposH0)*Hs/spdRap
else:
if (l/Hs) <= (((l-firstHit)-VMdistH0)/VMs):
secHit = ((firstHit + VMdistH0)/(Hs-VMs))*Hs
else:
posHSVM0 = ((1-firstHit)-VMdistH0)/VMs*Hs
secHit = (l-posHSVM0)*HS/spdRap + posHSVM0
print(int(secHit)) | VMdistH0 = (firstHit/Hs-VMs) | 9 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el//i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | x = (el//i) ** 0.5 | 10 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f<True:
print(-1) | if f<True: | 14 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f<True:
print(-1) | if f<True: | 14 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3^el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | while f and k <= 3^el: | 7 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x - math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
k = 0
f = True
while f and k <= 3 * el:
k += 1
i = k * k
x = (el + i) ** 0.5
if x-math.floor(x) < 0.0001:
print(int(x), k)
f = False
if f == True:
print(-1) | if x-math.floor(x) < 0.0001: | 11 | operation |
n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1)**2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | a = (a + 1)**2 | 8 | operation |
n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1)*2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | a = (a + 1)*2 | 8 | operation |
n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 96
sum += 1
else:
print(sum) | n = n // 96 | 10 | value |
n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 2
sum += 1
else:
print(sum) | n, a, b = map(int, input().split())
a, b = min(a, b), max(a, b)
sum = 0;
while a != b:
if(n == 2):
print('Final!')
break
a = (a + 1) // 2
b = (b + 1) // 2
n = n // 2
sum += 60
else:
print(sum) | sum += 60 | 11 | value |
n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 87
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | ans = abs(r - pos) + 87 | 6 | value |
n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos))@2
print(ans) | ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos))@2 | 11 | operation |
n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 14
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | ans = abs(l - pos) + 14 | 9 | value |
n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r<n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | if r<n: | 3 | decision |
n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos) + 1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | n, pos, l, r = list(map(int, input().split()))
if l == 1:
if r == n:
ans = 0
else:
ans = abs(r - pos) + 1
else:
if r == n:
ans = abs(l - pos)+1
else:
ans = min(abs(l - pos), abs(r - pos))*2 + max(abs(l - pos), abs(r - pos)) + 2
print(ans) | ans = abs(l - pos)+1 | 9 | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6>>(a[i + 1] if i != n - 1 else 10**6)))
print(ans) | ans = min(ans, max(a[i] - 1, 10**6>>(a[i + 1] if i != n - 1 else 10**6))) | 13 | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i/1] if i != n - 1 else 10**6)))
print(ans) | ans = min(ans, max(a[i] - 1, 10**6 - (a[i/1] if i != n - 1 else 10**6))) | 13 | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10-6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | ans = min(ans, max(a[i] - 1, 10-6 - (a[i + 1] if i != n - 1 else 10**6))) | 13 | 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())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | 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 = " ", *y: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args)
n = int(input())
a = stdin()
ans = 10**6 - a[0]
for i in range(n):
ans = min(ans, max(a[i] - 1, 10**6 - (a[i + 1] if i != n - 1 else 10**6)))
print(ans) | joint = lambda sep = " ", *y: sep.join(str(i) if type(i) != list else sep.join(map(str, i)) for i in args) | 6 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(x):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | for i in range(x): | 5 | statement |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i>mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | if hamsters % i>mini: | 12 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i>mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | if hamsters % i>mini: | 12 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i>mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | if hamsters % i>mini: | 12 | decision |
hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters % i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | hamsters, boxes = input().split()
numbers = input().split()
hamsters = int(hamsters)
boxes = int(boxes)
for i in range(boxes):
numbers[i] = int(numbers[i])
maxAmount = 0
boxNumber = 1
boxesAmount = 0
mini = hamsters
for i in numbers:
if hamsters&i < mini:
boxNumber = numbers.index(i) + 1
boxesAmount = hamsters // i
print(boxNumber, boxesAmount) | if hamsters&i < mini: | 12 | operation |
n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth<<endpre[i+1]
else: counth-=1
print(ans) | ans+=counth<<endpre[i+1] | 33 | operation |
n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i%1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | endpre[i]+=endpre[i%1] | 23 | operation |
n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i<<1]
else: counth-=1
print(ans) | ans+=counth+endpre[i<<1] | 33 | operation |
n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | n=int(input())
y=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | y=list() | 2 | statement |
n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10**5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | n=int(input())
d=list()
s=[]
for i in range(n):
memory=input()
s+=[memory]
cs=memory.count('s')
ch=memory.count('h')
if ch==0: cs=10^5
if cs==0: ch=-1
d+=[[i,cs,ch,memory]]
d=sorted(d,key=lambda x: (-x[1],x[2]))
start=[x[1] for x in d]
end=[x[2] for x in d]
for it in end:
endpre+=[abs(it)]
endpre+=[0]
for i in range(n-2,-1,-1):
endpre[i]+=endpre[i+1]
ans=0
for i in range(0,n):
memory=d[i][3]
print(memory)
counts=d[i][1]
counth=d[i][2]
print(i,counts,counth)
for j in range(len(memory)):
if(memory[j]=='s'):
ans+=counth+endpre[i+1]
else: counth-=1
print(ans) | if ch==0: cs=10^5 | 9 | operation |
def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n@1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | currInterval = (max(0,t-k), min(n@1,t+k)) | 14 | operation |
def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i>len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | while i>len(currIntervals): | 21 | decision |
def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i>len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | while i>len(currIntervals): | 21 | decision |
def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n+1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | intervals[t].append( (max(0,t-k), min(n+1,t+k)) ) | 6 | operation |
def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i+1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | def solve(n, k, links):
intervals = [[] for _ in range(n)]
for t in range(n):
currLink = links[t]
intervals[t].append( (max(0,t-k), min(n-1,t+k)) )
while True:
if currLink == -1:
break
elif len(intervals[currLink]) > 0:
intervals[t] += intervals[currLink]
break
else:
currInterval = (max(0,t-k), min(n-1,t+k))
intervals[t].append(currInterval)
currLink = links[currLink]
for t in range(n):
currIntervals = list(reversed(intervals[t]))
i = 1
while i < len(currIntervals):
if overlap(currIntervals[i-1], currIntervals[i]):
currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i*1:]
else:
i += 1
intervals[t] = currIntervals
ans = []
for t in range(n):
currIntervals = intervals[t]
ans.append(sum([(a[1] - a[0] + 1) for a in currIntervals]))
return ' '.join([str(x) for x in ans])
def overlap(a, b):
return b[0] <= a[1]
def merge(a, b):
return (a[0], b[1])
def main():
n, k = map(int, input().strip().split())
links = [int(x)-1 for x in input().strip().split()]
print(solve(n, k, links))
if __name__ == '__main__':
main() | currIntervals = currIntervals[:i-1] + [merge(currIntervals[i-1], currIntervals[i])] + currIntervals[i*1:] | 23 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(y), 1) | print(max(y), 1) | 46 | statement |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el^pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | delta = abs(el^pr) | 31 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1)^y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | x = (a[0] - 1)^y + 1 | 27 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y*1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | x = (a[0] - 1) // y*1 | 27 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif y != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | n = int(input())
a = list(map(int, input().split()))
x = 0
y = 0
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 0:
print('NO')
exit()
if delta != 1:
if y == 0:
y = abs(el - pr)
elif z != delta:
print('NO')
exit()
if y == 0:
y = 1
if y != 1:
x = (a[0] - 1) // y + 1
for i, el in enumerate(a[1:]):
pr = a[i]
delta = abs(el - pr)
if delta == 1:
if (el - 1) // y != (pr - 1) // y:
print('NO')
exit()
if (el - 1) // y + 1 > x:
x = (el - 1) // y + 1
print('YES')
print(x, y)
else:
print('YES')
print(max(a), 1) | elif z != delta: | 19 | statement |
tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for z in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | for z in allTommy: | 10 | statement |
tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i@j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | allValues.append([i@j, i, j]) | 7 | operation |
tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-164]) | print(newValues[-164]) | 15 | value |
tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i<<j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | allValues.append([i<<j, i, j]) | 7 | operation |
tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i*j)
newValues.sort()
print(newValues[-1]) | tommy, banban = list(map(int, input().split(" ")))
allTommy = sorted(list(map(int, input().split(" "))))
allBanban = sorted(list(map(int, input().split(" "))))
allValues = []
for i in allTommy:
for j in allBanban:
allValues.append([i*j, i, j])
allValues.sort()
newValues = []
for i in allTommy:
for j in allBanban:
if i != allValues[-1][1]:
newValues.append(i/j)
newValues.sort()
print(newValues[-1]) | newValues.append(i/j) | 13 | operation |
n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2>>1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | if t1==t2>>1 and not t1%2: | 16 | operation |
n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]<b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | if par[i]==a or par[i]<b: | 25 | decision |
n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n<=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | while n<=2: | 8 | decision |
n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
z(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | z(ans) | 20 | statement |
n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1==t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | n,a,b=map(int, input().split())
par=[]
if a>b:
a,b=b,a
for i in range(1,n+1):
par.append(i)
rnd=0
while n>=2:
n//=2
rnd+=1
ans=1
while True:
t1=par.index(a)
t2=par.index(b)
m=len(par)
if t1<t2-1 and not t1%2:
if ans==rnd:
print('Final!')
else:
print(ans)
exit(0)
ans+=1
rmi=[]
for i in range(0,m,2):
if par[i]==a or par[i]==b:
rmi.append(par[i+1])
else:
rmi.append(par[i])
for i in rmi:
par.remove(i) | if t1<t2-1 and not t1%2: | 16 | decision |
a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while (a>0 and b==0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| while (a>0 and b==0): | 10 | decision |
a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2**b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| if a>=2**b: | 10 | operation |
a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-19*a
else:
break
print(a,b)
| b=b-19*a | 10 | value |
a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a>>2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a=a>>2*b | 10 | operation |
a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b>=2*a:
b=b-2*a
else:
break
print(a,b)
| a,b=map(int,input().split())
while (a>0 and b>0):
if a>=2*b:
a=a-2*b
elif b<=2*a:
b=b-2*a
else:
break
print(a,b)
| elif b<=2*a: | 10 | decision |
a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2-a):
b=b%(2*a)
else:
break
print(a,b) | elif b>=(2-a): | 7 | operation |
a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2%a)
else:
break
print(a,b) | b=b%(2%a) | 8 | operation |
a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2/a):
b=b%(2*a)
else:
break
print(a,b) | elif b>=(2/a): | 7 | operation |
a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2<<a):
b=b%(2*a)
else:
break
print(a,b) | elif b>=(2<<a): | 7 | operation |
a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2*b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a,b=map(int,input().split())
while True:
if a==0 or b==0:
break
elif a>=(2*b):
a=a%(2^b)
elif b>=(2*a):
b=b%(2*a)
else:
break
print(a,b) | a=a%(2^b) | 6 | operation |
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]<a[i+1]<'M'):
print('NO')
b=1
break
if(b==0):
print("YES") | if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]<a[i+1]<'M'): | 5 | decision |
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==73):
print("YES") | if(b==73): | 9 | value |
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i@1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | if(a[i]==a[i@1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'): | 5 | operation |
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=150
break
if(b==0):
print("YES") | b=150 | 7 | value |
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=input()
a=[i for y in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
print("YES") | a=[i for y in a] | 2 | statement |
a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x<1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | elif x<1: | 8 | decision |
a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2/(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | print(2*x/2/(2+x-1)) | 11 | operation |
a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+y-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | print(2*x/2*(2+y-1)) | 11 | statement |
a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().x())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().x()) | 1 | statement |
a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2==1:
print((x-1)/2*(2+x-2)) | a, b = map(int, input().split())
if a>b:
x = a-b
else:
x=b-a
if x==0:
print(0)
elif x==1:
print(1)
elif x%2==0:
print(2*x/2*(2+x-1))
elif x%2<1:
print((x-1)/2*(2+x-2)) | elif x%2<1: | 12 | decision |
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
b = list(map(int, input().split()))
pref1 = [0] * n
for i in range(1, n):
pref1[i] = pref1[i - 1] + a1[i - 1]
pref2 = [0] * n
for i in range(1, n):
pref2[i] = pref2[i - 1] + a2[i - 1]
post2 = [sum(a2)] * n
for i in range(n):
post2[i] -= pref2[i]
minimum = -1
for i in range(n):
for j in range(n):
if j != i:
if minimum == -1:
minimum = pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j]
else:
minimum = min(pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j], minimum)
print(minimum) | n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
b = list(map(int, input().split()))
pref1 = [0] * n
for i in range(1, n):
pref1[i] = pref1[i - 1] + a1[i - 1]
pref2 = [0] * n
for i in range(1, n):
pref2[i] = pref2[i - 1] + a2[i - 1]
post2 = [sum(a2)] * n
for i in range(n):
post2[i] -= pref2[i]
minimum = -1
for i in range(n):
for j in range(n):
if j != i:
if minimum<-1:
minimum = pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j]
else:
minimum = min(pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j], minimum)
print(minimum) | if minimum<-1: | 20 | decision |
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
b = list(map(int, input().split()))
pref1 = [0] * n
for i in range(1, n):
pref1[i] = pref1[i - 1] + a1[i - 1]
pref2 = [0] * n
for i in range(1, n):
pref2[i] = pref2[i - 1] + a2[i - 1]
post2 = [sum(a2)] * n
for i in range(n):
post2[i] -= pref2[i]
minimum = -1
for i in range(n):
for j in range(n):
if j != i:
if minimum == -1:
minimum = pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j]
else:
minimum = min(pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j], minimum)
print(minimum) | n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
b = list(map(int, input().split()))
pref1 = [0] * n
for i in range(1, n):
pref1[i] = pref1[i - 1] + a1[i - 1]
pref2 = [0] * n
for i in range(1, n):
pref2[i] = pref2[i@1] + a2[i - 1]
post2 = [sum(a2)] * n
for i in range(n):
post2[i] -= pref2[i]
minimum = -1
for i in range(n):
for j in range(n):
if j != i:
if minimum == -1:
minimum = pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j]
else:
minimum = min(pref1[i] + post2[i] + b[i] + pref1[j] + post2[j] + b[j], minimum)
print(minimum) | pref2[i] = pref2[i@1] + a2[i - 1] | 11 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.