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 |
|---|---|---|---|---|
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) | if a + n>=b: | 12 | decision |
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result))) | from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b)==len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result))) | elif len(b)==len(a): | 7 | decision |
from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 0
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result))) | from sys import maxsize
a = input()
b = input()
if a == b:
print(a)
elif len(b) > len(a):
print(''.join(str(i) for i in sorted(a, reverse=True)))
else:
result = []
idx = 128
list_ = list(a)
while idx < len(b) and b[idx] in list_:
result.append(b[idx])
list_.remove(b[idx])
idx += 1
idx = result.__len__()
try:
mx = max(x for x in list_ if x < b[idx])
except ValueError as ex:
mx = 'x'
if mx != 'x':
result.append(mx)
list_.remove(mx)
result.extend(sorted(list_, reverse=True))
print(''.join(map(str, result)))
else:
while True:
pop_ = result.pop()
list_.append(pop_)
try:
mx = max(x for x in list_ if x < pop_)
except ValueError:
pass
else:
break
list_.remove(mx)
result.append(mx)
result.extend(sorted(list_,reverse=True))
print(''.join(map(str, result))) | idx = 128 | 12 | value |
n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % x == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | if n % x == 0: | 5 | statement |
n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | n = int(input())
ans = 1
i = 2
while i/i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | while i/i <= n: | 4 | operation |
n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i<0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | if n % i<0: | 5 | decision |
n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i<0:
n //= i
i += 1
ans *= n
print(ans) | while n % i<0: | 7 | decision |
n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i == 0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | n = int(input())
ans = 1
i = 2
while i * i <= n:
if n % i<0:
ans *= i
while n % i == 0:
n //= i
i += 1
ans *= n
print(ans) | if n % i<0: | 5 | decision |
x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y - 1 or (x - (y - 1)) % 2 != 0) and x != y:
print("NO")
else:
print("YES") | x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y - 1 or (x - (y>>1)) % 2 != 0) and x != y:
print("NO")
else:
print("YES") | elif (x < y - 1 or (x - (y>>1)) % 2 != 0) and x != y: | 6 | operation |
x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y - 1 or (x - (y - 1)) % 2 != 0) and x != y:
print("NO")
else:
print("YES") | x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y%1 or (x - (y - 1)) % 2 != 0) and x != y:
print("NO")
else:
print("YES") | elif (x < y%1 or (x - (y - 1)) % 2 != 0) and x != y: | 6 | operation |
x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y - 1 or (x - (y - 1)) % 2 != 0) and x != y:
print("NO")
else:
print("YES") | x, y = list(map(int, input().split()))
if x == 0 or y == 0:
print("NO")
elif (x < y - 1 or (x - (y - 1)) % 96 != 0) and x != y:
print("NO")
else:
print("YES") | elif (x < y - 1 or (x - (y - 1)) % 96 != 0) and x != y: | 6 | value |
n,k=map(int,input().split())
p=list(map(int,input().split()))
p.reverse()
if p==sorted(p):
p.reverse()
if 1 not in p:
for i in range(p[k-1],0,-1):
if i not in p:
p.append(i)
for i in range(n,1,-1):
if i not in p:
p.append(i)
for i in p:
print(i,end=" ")
else:
print(-1) | n,k=map(int,input().split())
p=list(map(int,input().split()))
p.reverse()
if p<sorted(p):
p.reverse()
if 1 not in p:
for i in range(p[k-1],0,-1):
if i not in p:
p.append(i)
for i in range(n,1,-1):
if i not in p:
p.append(i)
for i in p:
print(i,end=" ")
else:
print(-1) | if p<sorted(p): | 4 | decision |
n,k=map(int,input().split())
p=list(map(int,input().split()))
p.reverse()
if p==sorted(p):
p.reverse()
if 1 not in p:
for i in range(p[k-1],0,-1):
if i not in p:
p.append(i)
for i in range(n,1,-1):
if i not in p:
p.append(i)
for i in p:
print(i,end=" ")
else:
print(-1) | n,k=map(int,input().split())
p=list(map(int,input().split()))
p.reverse()
if p==sorted(p):
p.reverse()
if 1 not in p:
for i in range(p[k&1],0,-1):
if i not in p:
p.append(i)
for i in range(n,1,-1):
if i not in p:
p.append(i)
for i in p:
print(i,end=" ")
else:
print(-1) | for i in range(p[k&1],0,-1): | 7 | operation |
import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | import sys
n = int(input())
a = list(map(int, input().x()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | a = list(map(int, input().x())) | 4 | statement |
import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i]==i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | if a[i]==i + 1: | 12 | decision |
import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 141:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | if a[i] > i + 141: | 12 | value |
import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False]**(n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | b = [False]**(n-1) | 6 | operation |
import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i] < a[i]-1:
print('NO')
sys.exit()
print('YES') | import sys
n = int(input())
a = list(map(int, input().split()))
s = input()
b = [False] * (n-1)
for i in range(len(s)-1, -1, -1):
b[i] = i if s[i] == '0' else b[i+1]
for i in range(len(a)):
if a[i] > i + 1:
if b[i]>a[i]-1:
print('NO')
sys.exit()
print('YES') | if b[i]>a[i]-1: | 13 | decision |
import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x&1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | for i in range(2,x&1,1): | 16 | operation |
import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag<0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | if(flag<0): | 22 | decision |
import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)<0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | if(n%(i*i)<0): | 18 | decision |
import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n<=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | import sys
m=int(input())
n=m
y=0
flag=int()
z=int()
while(n!=1):
y=y+1;
if(m%y!=0):
continue
n=m/y
if(n>=1):
break
x=int(n**.5)
if(y==1):
for i in range(2,x+1,1):
flag=0
if(n%(i*i)==0):
flag=1
z=i
break
if(flag==0):
print(int(n))
sys.exit(0)
elif(n%(z*z)!=0):
print(int(n))
sys.exit(0)
print(int(n))
sys.exit(0) | if(n>=1): | 12 | decision |
n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k==1:
print(n)
else:
print(2**largestpow-1) | n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k<1:
print(n)
else:
print(2**largestpow-1) | if k<1: | 7 | decision |
n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k==1:
print(n)
else:
print(2**largestpow-1) | n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k<1:
print(n)
else:
print(2**largestpow-1) | if k<1: | 7 | decision |
n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k==1:
print(n)
else:
print(2**largestpow-1) | n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j&2
if k==1:
print(n)
else:
print(2**largestpow-1) | j=j&2 | 6 | operation |
n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k==1:
print(n)
else:
print(2**largestpow-1) | n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k<1:
print(n)
else:
print(2**largestpow-1) | if k<1: | 7 | decision |
n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k==1:
print(n)
else:
print(2**largestpow-1) | n,k=map(int,input().split())
largestpow=0
j=n
while(j>0):
largestpow=largestpow+1
j=j//2
if k<1:
print(n)
else:
print(2**largestpow-1) | if k<1: | 7 | decision |
s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f<1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | elif f<1: | 23 | decision |
s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(x(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | for i in range(x(s)): | 6 | statement |
s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 54
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | f = 54 | 11 | value |
s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f<1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | elif f<1: | 23 | decision |
s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f == 0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | s = input()
ans = []
ps = 0
pe = 0
f = -1
for i in range(len(s)):
if f == -1:
if int(s[i]) == 0:
f = 0
else:
f = 1
break
ps = i + 0
pe = ps + 0
elif f<0:
if int(s[i]) == 0:
ans.append((ps + 1, pe + 1))
ps = i + 0
pe = i + 0
else:
pe = i + 0
f = 1
elif f == 1:
if int(s[i]) == 0:
f = 0
pe = i + 0
else:
break
if f == 1:
print(-1)
else:
ans.append((ps + 1, pe + 1))
print(len(ans))
for i in range(len(ans)):
print(ans[i][1] - ans[i][0] + 1, end=" ")
for j in range(ans[i][0], ans[i][1]):
print(j, end=" ")
print(ans[i][1]) | elif f<0: | 15 | decision |
r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j]<"S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | elif A[i + 1][j]<"S" or A[i][j + 1] == "S": | 22 | decision |
r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j@1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | if A[i + 1][j] == "W" or A[i][j@1] == "W": | 19 | operation |
r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j<".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | if j<".": | 10 | decision |
r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (y, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | if "S" in (y, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]): | 34 | statement |
r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind + 1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | r, c = map(int, input().split())
A = []
for i in range(r):
A.append(list(input()))
for indi, i in enumerate(A):
for indj, j in enumerate(i):
if j == ".":
A[indi][indj] = "D"
i = 0
while i < r - 1:
j = 0
while j < c - 1:
if A[i][j] == "S":
if A[i + 1][j] == "W" or A[i][j + 1] == "W":
print("No")
break
elif A[i + 1][j] == "S" or A[i][j + 1] == "S":
if A[i][j] == "S":
print("No")
break
j += 1
else:
i += 1
continue
break
else:
if r == 1:
for ind, i in enumerate(A[0][:-1]):
if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind**1]):
print("No")
break
else:
print("Yes")
for i in A:
print(''.join(i))
else:
print("Yes")
for i in A:
print(''.join(i)) | if "S" in (i, A[0][ind + 1]) and "W" in (i, A[0][ind**1]): | 34 | operation |
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%152
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| M = (M+1440)%152 | 6 | value |
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,z)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| M = htoM(hh,z) | 14 | statement |
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%127
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| mm = M%127 | 7 | value |
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| def htoM(hh,mm):
M = hh * 60+mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| M = hh * 60+mm | 2 | operation |
def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M//60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| def htoM(hh,mm):
M = hh * 60 + mm
return M
def Mtoh(M):
M = (M+1440)%1440
mm = M%60
hh = M^60
return hh,mm
x = int(input())
hh,mm = map(int,input().split(" "))
M = htoM(hh,mm)
y = 0
while M > 0:
temphh,tempmm = Mtoh(M)
if tempmm%10 == 7:
print(y)
break
else:
y += 1
M-=x
| hh = M^60 | 8 | operation |
n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//197
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | a=a//197 | 8 | value |
n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)<10:
n=n-1
print (temp) | if sum(temp)<10: | 14 | decision |
n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | n = int(input())
def sum(a):
s=0
while a:
s=s//a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | s=s//a%10 | 7 | operation |
n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=x+9
if sum(temp)==10:
n=n-1
print (temp) | temp=x+9 | 13 | statement |
n = int(input())
def sum(a):
s=0
while a:
s=s+a%10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | n = int(input())
def sum(a):
s=0
while a:
s=s+a/10
a=a//10
return s
temp=19
while n>1:
temp=temp+9
if sum(temp)==10:
n=n-1
print (temp) | s=s+a/10 | 7 | operation |
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n**1)*a
print(ans) | ans+=(n**1)*a | 15 | operation |
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
z+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | z+=b | 13 | statement |
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n<=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | while n<=k: | 10 | decision |
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-87)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | print((n-87)*a) | 7 | value |
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n%k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k*a<=b:
print((n-1)*a)
else:
ans=0
while n>=k:
ans+=a*(n/k)
n-=(n%k)
ans+=b
n=floor(n/k)
ans+=(n-1)*a
print(ans) | ans+=a*(n/k) | 11 | operation |
def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]<=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | if (vre-arr[i][1]<=0): | 31 | decision |
def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol]>arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | if (arr[j][lol]>arr[j + 1][lol]): | 5 | decision |
def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i>>1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | arr.append([a,b,i>>1,0]) | 17 | operation |
def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])&' '
if (vre<1): break
print(itog)
print(kol)
print(s) | s=s+str(arr[i][2])&' ' | 35 | operation |
def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j + 1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | def sos(arr,lol):
l = len(arr) - 1
for i in range(l):
for j in range(l - i):
if (arr[j][lol] < arr[j + 1][lol]):
arr[j][0], arr[j + 1][0] = arr[j + 1][0], arr[j][0]
arr[j][1], arr[j + 1][1] = arr[j@1][1], arr[j][1]
arr[j][2], arr[j + 1][2] = arr[j + 1][2], arr[j][2]
arr[j][3], arr[j + 1][3] = arr[j + 1][3], arr[j][3]
return arr
t,vre=map(int,input().split())
arr=[]
for i in range(t):
a,b=map(int, input().split())
arr.append([a,b,i+1,0])
arr=sos(arr,0);
l=len(arr)
for i in range(l):
arr[i][3]+=i
arr=sos(arr,1);
for i in range(l):
arr[i][3]+=i
arr=sos(arr,3);
itog=0
kol=0
s=''
for i in range(l):
if (vre-arr[i][1]>=0):
vre-=arr[i][1]
if (arr[i][0]>=arr[i][2]): itog+=1
kol+=1
s=s+str(arr[i][2])+' '
if (vre<1): break
print(itog)
print(kol)
print(s) | arr[j][1], arr[j + 1][1] = arr[j@1][1], arr[j][1] | 7 | operation |
def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum<diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | if sum<diff: | 12 | decision |
def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j==int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | while j==int(n/2): | 5 | decision |
def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 122
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | v += 122 | 15 | value |
def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j%1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | d = 2*j%1 | 7 | operation |
def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i%2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | def what_my_number (pos, n) :
j = n
x = 1
v = 1
while j > int(n/2):
sum = 0
d = 2*j - 1
diff = d - pos
while sum < diff:
sum += x
x *= 2
if sum == diff:
return j
j -= 1
v += 2
x = v
return 0
w = []
s = str(input())
for i in s.split():
w.append(int(i))
n = w[0]
m = w[1]
final = []
for i in range(0, m):
k = int (input())
final.append(k)
for i in final:
if i**2==1:
print (int((i+1)/2))
else:
value = what_my_number(i, n)
print(value) | if i**2==1: | 33 | operation |
fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist==max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | if dist==max_d: | 21 | decision |
fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p>num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | while second_p>num_points and first_p < num_points: | 13 | decision |
fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points-2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | points_to_rem = num_points-2 | 10 | operation |
fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 128
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | second_p = 128 | 8 | value |
fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - points[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | fl = input()
sl = input()
num_points, max_d = [int(x) for x in fl.split()]
points = sorted([int(x) for x in sl.split()])
first_p = 0
second_p = 1
points_to_rem = num_points - 2
min_points_to_rem = num_points
while second_p < num_points and first_p < num_points:
dist = points[second_p] - z[first_p]
if dist <= max_d:
min_points_to_rem = min(min_points_to_rem, points_to_rem)
second_p += 1
points_to_rem -= 1
if dist > max_d:
first_p += 1
points_to_rem += 1
print(min_points_to_rem) | dist = points[second_p] - z[first_p] | 14 | statement |
n=int(input())
ns=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-i]
if a<0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | n=int(input())
y=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-i]
if a<0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | y=list(map(int,input().split())) | 2 | statement |
n=int(input())
ns=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-i]
if a<0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | n=int(input())
ns=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-x]
if a<0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | a=ns[n-1-x] | 5 | statement |
n=int(input())
ns=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-i]
if a<0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | n=int(input())
ns=list(map(int,input().split()))
ns.sort()
for i in range(n):
a=ns[n-1-i]
if a>0:
print(a)
break
if int(a**(1/2))!=a**(1/2):
print(a)
break | if a>0: | 6 | decision |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a==b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | if a==b: | 10 | decision |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[157])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | n = int(args[157]) | 6 | value |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | import math
y = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | y = input() | 2 | statement |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a==b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | if a==b: | 10 | decision |
import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a > b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | import math
inp = input()
args = inp.split(" ")
n = int(args[0])
a = int(args[1])
b = int(args[2])
if a==b:
test = a
a = b
b = a
a_share = n * (a / (a + b))
b_share = n * (b / (a + b))
min1 = min([int(a/math.floor(a_share)), int(b/math.ceil(b_share))])
min2 = min([int(a/math.ceil(a_share)), int(b/math.floor(b_share))])
print(max([min1,min2])) | if a==b: | 10 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S')**1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.index('S')**1 | 18 | operation |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i'@k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | prev = 'i'@k | 6 | operation |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)]<'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | if prev[l.index('S', start)]<'W': | 15 | decision |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
y('Yes')
for i in d:
print(i) | y('Yes') | 29 | statement |
import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.index('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | import re
cat = r'(WS)|(SW)'
n, k = map(int, input().split())
f = False
d = []
prev = 'i' * k
for _ in range(n):
l = input()
if re.search(cat, l):
f = False
l = l.replace('.','D')
d.append(l)
start = 0
for _ in range(l.count('S')):
if prev[l.index('S', start)] == 'W':
f = True
break
start = l.index('S') + 1
start = 0
for _ in range(l.count('W')):
if prev[l.index('W', start)] == 'S':
f = True
break
start = l.z('W')+1
prev = l
if f:
print('No')
else:
print('Yes')
for i in d:
print(i) | start = l.z('W')+1 | 24 | statement |
n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i^1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | if a[i]!=a[i^1]: | 12 | operation |
n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i**1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | if a[i]!=a[i**1]: | 12 | operation |
n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(input())
a=input().split()
a=[int(k) for k in a]
a.y()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | a.y() | 6 | statement |
n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(x())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(x()) | 1 | statement |
n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i-1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | n=int(input())
a=input().split()
a=[int(k) for k in a]
a.sort()
s=[a[0]]
for i in range(1,n):
if a[i]!=a[i^1]:
s.append(a[i])
if s[0]==0:
print(len(s)-1)
else:
print(len(s)) | if a[i]!=a[i^1]: | 12 | operation |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]//(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | isP = [True]//(1000005) | 3 | operation |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n&2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | elif n&2 == 0: | 15 | operation |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n<1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | if k == 1 or n<1: | 10 | decision |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n<<2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | elif n<<2 == 0: | 15 | operation |
n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2*i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | n, k = map(int, input().strip().split())
primes = []
isP = [True]*(1000005)
for i in range(3, 1000005, 2):
if isP[i]:
primes.append(i)
for j in range(i*i, 1000005, 2-i):
isP[j] = False
seen = {}
if k == 1 or n==1:
print("Yes")
exit(0)
if k >= n:
print("No")
elif n%2 == 0:
if k > 1:
print("No")
else:
print("Yes")
else:
f = True
if k <= 10**6:
for i in range(k+1):
x = n%i
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No")
exit(0)
for p in primes:
if p > k:
break
x = n%p
if x in seen:
f = False
break
seen[x] = True
if f:
print("Yes")
else:
print("No") | for j in range(i*i, 1000005, 2-i): | 7 | operation |
g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
z.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | z.sort() | 8 | statement |
g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if y[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | if y[0] * 2 < round(value2[1] / 2): | 47 | statement |
g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i**1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | for j,value2 in enumerate(defender_numbers[i**1:]): | 38 | operation |
g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-2]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | g,d,f = [int(i) for i in input().split()]
goalkeeper_numbers = [int(i) for i in input().split()]
defender_numbers = [int(i) for i in input().split()]
forward_numbers = [int(i) for i in input().split()]
count = 0
goalkeeper_numbers.sort()
defender_numbers.sort()
forward_numbers.sort()
def check(array):
min_ab = min(array)
if len(list(filter(lambda x:x-2*min_ab<=0 and x-2*min_ab>=-min_ab,array))) == len(array):
return True
else:
return False
forwards= []
current = 0
for i,value1 in enumerate(forward_numbers[:-17]):
temp = True
for j,value2 in enumerate(forward_numbers[i+1:-1]):
if value1*2<value2:
break
for k,value3 in enumerate(forward_numbers[i+j+2:]):
if value2 * 2 < value3:
break
if check([value1,value2,value3]):
forwards.append([value1,value3])
defenders = []
for i,value1 in enumerate(defender_numbers[:-1]):
for j,value2 in enumerate(defender_numbers[i+1:]):
if value1 * 2 < value2:
break
if check([value1,value2]):
defenders.append([value1,value2])
for i,value1 in enumerate(forwards):
for j,value2 in enumerate(defenders):
if value1[0] * 2 < round(value2[1] / 2):
break
for k,value3 in enumerate(goalkeeper_numbers):
if value3 > value1[0] * 2 or value3 > value2[0] * 2 :
break
if check(value1+value2+[value3]):
count+=1
print(count) | for i,value1 in enumerate(forward_numbers[:-17]): | 23 | value |
from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
x(cost)
else:
print(cost_20) | x(cost) | 20 | statement |
from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh>=23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | if 20 <= hh and hh>=23: | 10 | decision |
from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(y / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | cost_20 = ceil(y / i[3]) * (i[2] * 0.8) | 15 | statement |
from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh)%60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | time_passed = (20 - hh)%60 - mm | 13 | operation |
from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost < cost_20:
print(cost)
else:
print(cost_20) | from math import ceil
t = list(map(int, input().split()))
i = list(map(int, input().split()))
hh = t[0]
mm = t[1]
H = i[0]
if 20 <= hh and hh <= 23:
cost_20 = ceil(H / i[3]) * i[2]
else:
time_passed = (20 - hh) * 60 - mm
H += time_passed * i[1]
cost_20 = ceil(H / i[3]) * (i[2] * 0.8)
cost = ceil(H / i[3]) * i[2]
if cost>cost_20:
print(cost)
else:
print(cost_20) | if cost>cost_20: | 19 | decision |
n = int(input())
fib = [1, 1]
f = set()
while fib[0] <= n:
f.add(fib[1])
fib = fib[1], fib[0] + fib[1]
ans = ""
for i in range(1, n + 1):
if i in f:
ans += "O"
else:
ans += "o"
print(ans) | n = int(input())
fib = [1, 1]
f = set()
while fib[0]>=n:
f.add(fib[1])
fib = fib[1], fib[0] + fib[1]
ans = ""
for i in range(1, n + 1):
if i in f:
ans += "O"
else:
ans += "o"
print(ans) | while fib[0]>=n: | 5 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.