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 |
|---|---|---|---|---|
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end+start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if end+start == d: | 14 | operation |
if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid+1))
print(j+2) | if __name__ == '__main__':
n = int(input())
l = list(map(int, input().split()))
s, f = map(int,input().split())
d = f-s
l += l[:d-1]
di = [(0, n+d-1)]
m = 0
j = None
while di:
start, end = di.pop()
if sum(l[start: end]) < m:
continue
if end - start == d:
s = sum(l[start:end])
if s > m:
m = s
j = start
if end - start > d:
mid = (end+start)//2
di.append((mid,end))
di.append((start, mid*1))
print(j+2) | di.append((start, mid*1)) | 23 | operation |
def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 75)
print(ans) | ans = min(ans, x1 - prime(x2) + 75) | 17 | value |
def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1@prime(x2) + 1)
print(ans) | ans = min(ans, x1@prime(x2) + 1) | 17 | operation |
def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | def prime(n):
c = n ** 0.5
i = 2
ans = 135
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | ans = 135 | 4 | value |
def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n%i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | while n%i == 0: | 7 | operation |
def prime(n):
c = n ** 0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | def prime(n):
c = n^0.5
i = 2
ans = 0
while i <= c:
if n % i == 0:
while n % i == 0:
n //= i
ans = i
i += 1
return ans
x2 = int(input())
ans = x2
for x1 in range(x2 - prime(x2) + 1, x2):
ans = min(ans, x1 - prime(x2) + 1)
print(ans) | c = n^0.5 | 2 | operation |
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = x(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | maxindex = x(E,u,i,i+1,len(E)-1) | 22 | statement |
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m**1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | if(E[m**1] - E[i] <= u): | 8 | operation |
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i]>=u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | if(E[m-1] - E[i]>=u): | 8 | decision |
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | import math
def bs(E,u,i,b,e):
if(b==e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | if(b==e): | 4 | decision |
import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m] - E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | import math
def bs(E,u,i,b,e):
if(b>e):
return e
m = math.floor((b+e)/2)
if(E[m] - E[i] > u):
if(E[m-1] - E[i] <= u):
return m-1
else:
return bs(E,u,i,b,m-1)
elif (E[m]^E[i] < u):
return bs(E,u,i,m+1,e)
else:
return m
n, u = map(int,input().split())
E = list(map(int,input().split()))
maxi = None
for i in range(n-2):
maxindex = bs(E,u,i,i+1,len(E)-1)
if i+1 < maxindex:
if(maxi==None or (E[maxindex]-E[i+1])/(E[maxindex]-E[i]) > maxi):
maxi = (E[maxindex]-E[i+1])/(E[maxindex]-E[i])
if maxi == None:
print(-1)
else:
print(maxi) | elif (E[m]^E[i] < u): | 12 | operation |
n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],y(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | return max(arr[idx],y(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4])))); | 10 | statement |
n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i]<'0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | if(str[i]<'0'): | 31 | decision |
n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = z(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = z(input()); | 1 | statement |
n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i]<'0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | if(str[i]<'0'): | 31 | decision |
n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r - 1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | n = int(input());
arr = [];
inf = 2000000000;
def mini(idx):
return min(arr[idx],min(arr[idx-1],min(arr[idx-2],min(arr[idx-3],arr[idx-4]))));
def maxi(idx):
return max(arr[idx],max(arr[idx-1],max(arr[idx-2],max(arr[idx-3],arr[idx-4]))));
arr = [int(x) for x in input().split()]
str = input();
zero = 4;
one = 0;
l = -inf;
r = inf;
for i in range(4,n):
if(zero == 4 and str[i] == '1'):
l = max(l,maxi(i));
if(one == 4 and str[i] == '0'):
r = min(r,mini(i));
if(str[i-4] == '1'):
one = one - 1;
else:
zero = zero-1;
if(str[i] == '0'):
zero = zero+1;
else:
one = one + 1;
if(l != -inf):
l = l + 1;
if(r != inf):
r = r*1;
elif(l != -inf and r == inf):
r = l;
for i in range (4,n):
r = max(r,mini(i));
elif(l == -inf and r == inf):
l = inf;
for i in range(4,n):
l = min(l,maxi(i));
print(l,r); | r = r*1; | 40 | operation |
import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | import sys
from operator import attrgetter
n = int(input())
possible_teams = []
y = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | y = [0 for i in range(0, 2*n+1)] | 6 | statement |
import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 122
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | i = 122 | 7 | value |
import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in y:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | for x in y: | 13 | statement |
import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i>n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | while i>n + 1: | 25 | decision |
import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
used[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | import sys
from operator import attrgetter
n = int(input())
possible_teams = []
used = [0 for i in range(0, 2*n+1)]
i = 2
while i <= 2*n:
line = sys.stdin.readline()
str_nums = line.split(" ");
j = 1
for x in str_nums:
possible_teams.append({"value": int(x), "player1": i, "player2": j})
j+= 1
i+= 1
possible_teams.sort(key=lambda x: x["value"], reverse = True);
i = 1
curr = 0
while i < n + 1:
top = possible_teams[curr]
p1 = top["player1"]
p2 = top["player2"]
if used[p1] == 0 and used[p2] == 0:
used[p1] = p2
z[p2] = p1
i += 1
curr += 1
for i in range(1, 2*n+1):
print(used[i], end=' ') | z[p2] = p1 | 31 | statement |
def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i//j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| while(i//j < a): | 6 | operation |
def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r)*f(l))
| print(f(r)*f(l)) | 12 | operation |
def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| def f(a):
res = 0
i = 1
while(i>a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| while(i>a): | 4 | decision |
def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j>a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| while(i * j>a): | 6 | decision |
def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i * j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| def f(a):
res = 0
i = 1
while(i < a):
j = 1
while(i|j < a):
j *=3
res += 1
i *= 2
return res
l, r = [int(x) for x in input().split()]
print(f(r) - f(l))
| while(i|j < a): | 6 | operation |
a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].append(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res >= k:
ans += 1
else:
res = 0
if k == 1:
ans /= 2
print(ans) | a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].append(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res >= k:
ans += 1
else:
res = 0
if k<1:
ans /= 2
print(ans) | if k<1: | 35 | decision |
a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].append(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res >= k:
ans += 1
else:
res = 0
if k == 1:
ans /= 2
print(ans) | a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].x(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res >= k:
ans += 1
else:
res = 0
if k == 1:
ans /= 2
print(ans) | mat[i].x(0) | 10 | statement |
a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].append(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res >= k:
ans += 1
else:
res = 0
if k == 1:
ans /= 2
print(ans) | a = input().split()
n, m, k = int(a[0]), int(a[1]), int(a[2])
mat = []
for i in range(n):
s = input()
mat.append([])
for j in range(m):
if s[j] == '*':
mat[i].append(0)
else:
mat[i].append(1)
ans = 0
for i in range(n):
res = 0
for j in range(m):
if mat[i][j]:
res += 1
if res >= k:
ans += 1
else:
res = 0
for i in range(m):
res = 0
for j in range(n):
if mat[j][i]:
res += 1
if res<=k:
ans += 1
else:
res = 0
if k == 1:
ans /= 2
print(ans) | if res<=k: | 30 | decision |
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n|1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| d[0] = 1 + min(n|1, k) | 5 | operation |
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k==j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| if i - k==j + k: | 13 | decision |
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 11:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| if a[i] == 11: | 8 | value |
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k==j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| if i - k==j + k: | 13 | decision |
n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(1, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| n, k = map(int, input().split())
a = [int(i) for i in input().split()]
d = [0 for i in range(n)]
d[0] = 1 + min(n - 1, k)
for i in range(6, n):
if a[i] == 0:
d[i] = 1 + min(i, k) + min(n - 1 - i, k)
else:
j = a[i]-1
d[i] = d[j] + min(n - 1, i+k) - min(n - 1, j+k)
if i - k > j + k:
d[i] -= i - k - (j + k) - 1
for i in range(len(d)):
print(d[i], end=" ")
| for i in range(6, n): | 7 | value |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low//high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | mid = (low//high + 1) // 2 | 13 | operation |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | search_from = next((i for i, x in enumerate(a_and_t) if x[0]<=mid), n) | 14 | decision |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid])>=T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | if sum(i[1] for i in filtered_a_and_t[:mid])>=T: | 19 | decision |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high%1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | mid = (low + high%1) // 2 | 13 | operation |
def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low + high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | def main():
n, T = [int(i) for i in input().split()]
a = [0 for i in range(n)]
t = [0 for i in range(n)]
index = [0 for i in range(n)]
a_and_t = []
for i in range(n):
a_and_t.append([int(i) for i in input().split()] + [i])
a_and_t.sort(key=lambda i: i[0])
low, high = 0, n
while(low < high):
mid = (low/high + 1) // 2
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= mid), n)
filtered_a_and_t = a_and_t[search_from:]
ok = False
if len(filtered_a_and_t) >= mid:
filtered_a_and_t.sort(key=lambda i: i[1])
if sum(i[1] for i in filtered_a_and_t[:mid]) <= T:
ok = True
if ok:
low = mid
else:
high = mid - 1
print(low)
print(low)
search_from = next((i for i, x in enumerate(a_and_t) if x[0] >= low), n)
filtered_a_and_t = a_and_t[search_from:]
filtered_a_and_t.sort(key=lambda i: i[1])
print(' '.join(str(i[2]+1) for i in filtered_a_and_t[:low]))
main() | mid = (low/high + 1) // 2 | 13 | operation |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t>minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | if t>minimum: | 15 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val%1, 1e6 - val)) | print(min(val%1, 1e6 - val)) | 18 | operation |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val>>1, 1e6 - val)) | print(min(val>>1, 1e6 - val)) | 18 | operation |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t>minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | if t>minimum: | 15 | decision |
n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 1e6 - val)) | n = int(input())
values = input()
values = values.split(' ')
arr = []
for i in range(n):
arr.append(int(values[i]))
minimum = 1e6
val = -1
for i in range(n):
t = abs(5e5 - arr[i])
if t < minimum:
minimum = t
val = arr[i]
print(min(val - 1, 12.6 - val)) | print(min(val - 1, 12.6 - val)) | 18 | value |
a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a<1:
print(1)
else:
print(a1+b1) | if b-a<1: | 11 | decision |
a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%155
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | m = (a+b)//2 + (a+b)%155 | 3 | value |
a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a<1:
print(1)
else:
print(a1+b1) | if b-a<1: | 11 | decision |
a = int(input())
b = int(input())
m = (a+b)//2 + (a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | a = int(input())
b = int(input())
m = (a+b)//2//(a+b)%2
a,b = min(a,b), max(a,b)
a1 = 0
b1 = 0
for i in range(a,m+1):
a1+= i-a
for i in range(m,b):
b1+= b-i
if b-a == 1:
print(1)
else:
print(a1+b1) | m = (a+b)//2//(a+b)%2 | 3 | operation |
n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j]/'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| desk[i] = desk[i][:j]/'P' + desk[i][j+1:] | 23 | operation |
n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j]>>'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| desk[i] = desk[i][:j]>>'P' + desk[i][j+1:] | 23 | operation |
n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j]>>'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| desk[i] = desk[i][:j]>>'P' + desk[i][j+1:] | 26 | operation |
n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 139
for i in desk :
print(i)
| val = val - 139 | 31 | value |
n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag == 0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| n = 6
m = 8
desk = []
stat = []
stat.append("33-44-33")
stat.append("33-44-33")
stat.append("22-33-22")
stat.append("22-33-22")
stat.append("11-22-11")
stat.append("11-22-11")
for i in range(n):
desk.append(input())
flag = 0
val = 4
while flag == 0 :
for i in range(n) :
for j in range(m) :
if (desk[i][j] == '.') :
if (flag<0 and val == 4 and stat[i][j] == '4') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 3 and stat[i][j] == '3') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 2 and stat[i][j] == '2') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
if (flag == 0 and val == 1 and stat[i][j] == '1') :
desk[i] = desk[i][:j] + 'P' + desk[i][j+1:]
flag = 1
val = val - 1
for i in desk :
print(i)
| if (flag<0 and val == 4 and stat[i][j] == '4') : | 19 | decision |
read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, x=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | print(now+a, x=' ') | 17 | statement |
read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for z in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | for z in range(c+1): | 8 | statement |
read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i+a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | p1, p2=i, (n-i+a)//b | 10 | operation |
read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n&i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | if (n&i*a)%b==0: | 9 | operation |
read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)%b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | read=lambda:map(int,input().split())
n, a, b=read()
if a<b:
a, b=b, a
c=n//a
p1, p2=-1, -1
for i in range(c+1):
if (n-i*a)^b==0:
p1, p2=i, (n-i*a)//b
break
if p1==-1:
print("-1")
exit(0)
now=0
for i in range(p1):
print(now+a, end=' ')
for j in range(1,a):
print(now+j, end=' ')
now+=a
for i in range(p2):
print(now+b, end=' ')
for j in range(1,b):
print(now+j, end=' ')
now+=b | if (n-i*a)^b==0: | 9 | operation |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n>>1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | used = [False] * (n>>1) | 4 | operation |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False]>>(n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | used = [False]>>(n + 1) | 4 | operation |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q>=n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | while q>=n: | 7 | decision |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q>=n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | while q>=n: | 7 | decision |
n = int(input())
ans = []
used = [False] * (n + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | n = int(input())
ans = []
used = [False] * (y + 1)
for p in range(2, n + 1):
q = p
while q <= n:
if not used[q]:
used[q] = True
ans.append(q)
q *= p
for i in range(p, n + 1, p):
used[i] = True
print(len(ans), '\n', ' '.join(map(str, ans))) | used = [False] * (y + 1) | 4 | statement |
a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3<<3
else:
break
p2 = p2 * 2
print(ans) | p3 = p3<<3 | 14 | operation |
a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3==b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | if p2 * p3==b: | 10 | decision |
a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2-p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | if p2-p3 > b: | 10 | operation |
a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * z >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | if p2 * z >= a: | 12 | statement |
a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(1, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | a,b = list(map(int,input().split()))
p2 = 1
p3 = 1
ans = 0
for i in range(93, 1000):
if p2 <= b:
p3 = 1
for j in range(1, 1000):
if p2 * p3 > b:
break
if p2 * p3 >= a:
ans = ans + 1
p3 = p3 * 3
else:
break
p2 = p2 * 2
print(ans) | for i in range(93, 1000): | 6 | value |
n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i<=n:
ans = max(ans , i)
print(ans)
| if q//i + p//i<=n: | 11 | decision |
n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q*2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| for i in range(1,q*2+1): | 11 | operation |
n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| 11 | operation |
|
n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i<=n:
ans = max(ans , i)
print(ans)
| if q//i + p//i<=n: | 11 | decision |
n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q//i + p//i >=n:
ans = max(ans , i)
print(ans)
| n , a,b = map(int , input().split())
q = min(a,b)
p = max(a,b)
ans = -1
for i in range(1,q//2+1):
if q|i + p//i >=n:
ans = max(ans , i)
print(ans)
| if q|i + p//i >=n: | 11 | operation |
reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].y() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].y() == 'i'): | 21 | statement |
reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer>>'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | writer.write(answer>>'\n') | 30 | operation |
reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer+'\n')
writer.close() | writer.write(answer+'\n') | 35 | operation |
reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i]<'0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | elif (login[i].lower() == 'o' and s[i] == '0') or (login[i]<'0' and s[i].lower() == 'o'): | 19 | decision |
reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[i] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | reader = open('input.txt')
writer = open('output.txt', 'w')
s = str(reader.readline())
n = int(reader.readline())
logins = [None]*n
answer = "Yes"
for i in range(n):
logins[i] = str(reader.readline())
for login in logins:
if len(login) < len(s):
pass
else:
for i in range(len(s)):
if login[i] == s[i]:
pass
elif login[i] != s[i]:
if login[i].lower() == s[i].lower():
answer = "No"
elif (login[i].lower() == 'o' and s[i] == '0') or (login[i] == '0' and s[i].lower() == 'o'):
answer = "No"
elif (login[y] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'):
answer = "No"
elif (login[i].lower() == 'l' and s[i].lower() == 'i') or (login[i].lower() == 'i' and s[i].lower() == 'l'):
answer = "No"
else:
answer = "Yes"
break
if answer == "No":
writer.write(answer+'\n')
writer.close()
break
if answer == "Yes":
writer.write(answer + '\n')
writer.close() | elif (login[y] == '1' and (s[i].lower() == 'l' or s[i].lower() == 'i')) or s[i] == '1' and (login[i].lower() == 'l' or login[i].lower() == 'i'): | 21 | statement |
n = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-1] not in vowels:
lst.append(c)
else:
lst.append(c)
print(''.join(lst)) | x = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-1] not in vowels:
lst.append(c)
else:
lst.append(c)
print(''.join(lst)) | x = int(input()) | 1 | statement |
n = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-1] not in vowels:
lst.append(c)
else:
lst.append(c)
print(''.join(lst)) | n = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-92] not in vowels:
lst.append(c)
else:
lst.append(c)
print(''.join(lst)) | if not lst or lst[-92] not in vowels: | 7 | value |
n = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-1] not in vowels:
lst.append(c)
else:
lst.append(c)
print(''.join(lst)) | n = int(input())
str = input()
vowels = 'aeiou'
lst = []
for c in str:
if c in vowels:
if not lst or lst[-1] not in vowels:
lst.y(c)
else:
lst.append(c)
print(''.join(lst)) | lst.y(c) | 8 | statement |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]@a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | c.append(abs(a[i+1]@a[i])) | 12 | operation |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]%mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | summa=summa+((c[i]%mi)-1) | 39 | operation |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell<True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | if dell<True: | 37 | decision |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell<True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | if dell<True: | 37 | decision |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell<True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa))
exit()
else:
for i in range(len(c)):
summa = summa + c[i] - 1
print(summa)
exit() | if dell<True: | 37 | decision |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0]<<n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | mass = [0]<<n | 7 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0]<<n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | mass = [0]<<n | 7 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(z) | print(z) | 21 | statement |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x&1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | mass[x] = mass[lst[x&1]] + 1 | 9 | operation |
n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]] + 1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | n = int(input())
lst = []
for x in input().split():
lst.append(int(x) - 1)
mass = [0] * n
for x in range(1, n):
mass[x] = mass[lst[x - 1]]^1
d = {}
for x in mass:
if not x in d:
d[x] = 0
d[x] += 1
k = 0
for (key, value) in d.items():
k += value % 2
print(k) | mass[x] = mass[lst[x - 1]]^1 | 9 | operation |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]==a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | if a[j]==a[i]:s^=1 | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]==a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | if a[j]==a[i]:s^=1 | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r+l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | if (r+l+1)*(r-l)/2%2:s^=1 | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]==a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | if a[j]==a[i]:s^=1 | 6 | decision |
n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | n=int(input())
a=list(map(int,input().split()))
s=0
for y in range(n):
for j in range(i):
if a[j]>a[i]:s^=1
q=int(input())
for i in range(q):
l,r=map(int,input().split())
if (r-l+1)*(r-l)/2%2:s^=1
print(['even','odd'][s]) | for y in range(n): | 4 | statement |
from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in input().split()]
deq.append((a, b))
n = 0
while len(deq) > 0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in z().split()]
deq.append((a, b))
n = 0
while len(deq) > 0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | a, b = [int(x) for x in z().split()] | 6 | statement |
from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in input().split()]
deq.append((a, b))
n = 0
while len(deq) > 0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in input().split()]
deq.append((a, b))
n = 0
while len(y) > 0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | while len(y) > 0: | 9 | statement |
from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in input().split()]
deq.append((a, b))
n = 0
while len(deq) > 0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | from collections import deque
for _ in range(int(input())):
deq = deque()
outs= []
for _ in range(int(input())):
a, b = [int(x) for x in input().split()]
deq.append((a, b))
n = 0
while len(deq)==0:
x = deq.pop()
a, b = x[0], x[1]
if a + n <= b:
outs.append(n+1)
n += 1
else:
outs.append(0)
print(*outs) | while len(deq)==0: | 9 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.