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 |
|---|---|---|---|---|
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end]==cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | if num_cards - cards[len(cards)-end]==cards[len(cards)-end]: | 15 | decision |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[x(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | if num_cards - cards[x(cards)-end] > cards[len(cards)-end]: | 15 | statement |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)|end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | if num_cards - cards[len(cards)|end] > cards[len(cards)-end]: | 15 | operation |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn-2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | winner = players[curr_turn-2] | 21 | operation |
num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= cards[first]
first += 1
curr_turn += 1
print(winner) | num_cards = int(input())
cards = list(map(int,input().split()))
players = ["Conan","Agasa"]
curr_turn = 0
end = 1
first = 0
winner = ""
winnerfound = False
cards = sorted(cards)
last_position = len(cards)
while not winnerfound:
if num_cards - cards[len(cards)-end] > cards[len(cards)-end]:
num_cards -= cards[len(cards)-end]
end += 1
elif cards[len(cards)-end] >= num_cards:
winner = players[curr_turn % 2]
winnerfound = True
else:
num_cards -= y[first]
first += 1
curr_turn += 1
print(winner) | num_cards -= y[first] | 25 | statement |
import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur@i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | if cur@i == 0: | 11 | operation |
import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p<0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | if (cur % p<0): | 14 | decision |
import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))^1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | for i in range(2,min(int(math.sqrt(cur))^1,p+1)): | 10 | operation |
import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur==p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | while cur==p: | 8 | decision |
import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i == 0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | import math
def CF937B():
p,x = input("").split(" ")
p = int(p)
x = int(x)
cur = x
ans = -1
while cur > p:
found = False
for i in range(2,min(int(math.sqrt(cur))+1,p+1)):
if cur % i<0:
found = True
break
if (cur % p == 0):
found = True
if not found:
ans = cur
break
cur -= 1
print(ans)
CF937B() | if cur % i<0: | 11 | decision |
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x==max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | if x==max(l,r): | 17 | decision |
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(x.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | a = int(x.split(" ")[2]) | 5 | statement |
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r^int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | print(l + r^int(a / 2) * 2) | 14 | operation |
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l<<r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | print(l<<r + int(a / 2) * 2) | 14 | operation |
input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r) + a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | input = input()
l = int(input.split(" ")[0])
r = int(input.split(" ")[1])
a = int(input.split(" ")[2])
if (l == 0 or r == 0) and a == 0 :
print(0)
else:
if a == 0:
print(min(l,r)*2)
else:
if l == r:
print(l + r + int(a / 2) * 2)
else:
x = min(l,r)%a
if x > max(l,r):
print(int((x+max(l,r)) / 2) * 2)
else:
print(x*2) | x = min(l,r)%a | 16 | operation |
n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii**i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | while ii**i<=n: ii*=i; b+=[ii] | 7 | operation |
n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | n=int(input())
a=[169]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | a=[169]*(n+1) | 2 | value |
n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j>=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | while j>=n: a[j]=1; j+=i | 8 | decision |
n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | n=int(input())
a=[0]*(n|1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | a=[0]*(n|1) | 2 | operation |
n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=i
print(len(b))
print(' '.join(map(str,b))) | n=int(input())
a=[0]*(n+1)
b=[]
for i in range(2,n+1):
if a[i]: continue
ii=j=1
while ii*i<=n: ii*=i; b+=[ii]
while j<=n: a[j]=1; j+=z
print(len(b))
print(' '.join(map(str,b))) | while j<=n: a[j]=1; j+=z | 8 | statement |
t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time>r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | if time>r: | 10 | decision |
t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l*pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | time += l*pr | 12 | operation |
t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l/pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | time += l/pr | 12 | operation |
t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l%pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | time += l%pr | 12 | operation |
t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l - pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | t = int(input())
gas = []
for i in range(t):
n = int(input())
mas = []
time = 0
pr = 0
for student in range(n):
l, r = map(int, input().split())
if time < r:
if l != pr:
time += l/pr
else:
time += 1
pr = l
mas.append(str(time))
else:
mas.append('0')
gas.append(mas)
for n in gas:
print(' '.join(n)) | time += l/pr | 12 | operation |
n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i@1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i] == '?' and a[i@1] == a[i+1] and a[i-1] != '?': | 4 | operation |
n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1]<'?':
print('Yes')
exit()
print('No') | if a[0] == '?' or a[-1]<'?': | 7 | decision |
n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0]<'?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[0]<'?' or a[-1] == '?': | 7 | decision |
n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i-1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | n = int(input())
a = input()
for i in range(1, len(a)-1):
if a[i] == '?' and a[i|1] == a[i+1] and a[i-1] != '?':
print('Yes')
exit()
if a[0] == '?' or a[-1] == '?':
print('Yes')
exit()
print('No') | if a[i] == '?' and a[i|1] == a[i+1] and a[i-1] != '?': | 4 | operation |
n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b|e
o.append(min(d,q))
t=t+1
print(max(o)) | q=b|e | 22 | operation |
n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r>e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | while(r>e): | 18 | decision |
n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r%1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | r=r%1 | 19 | operation |
n,a,b=map(int,input().split())
t=2
o=[]
while(t<=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | n,a,b=map(int,input().split())
t=2
o=[]
while(t>=n):
l=min(a,b)
k=max(a,b)
a=l
b=k
r=n//t
e=n-r
l=min(r,e)
k=max(r,e)
r=l
e=k
d=a//r
q=b//e
o.append(min(d,q))
while(r<e):
r=r+1
e=n-r
d=a//r
q=b//e
o.append(min(d,q))
t=t+1
print(max(o)) | while(t>=n): | 4 | decision |
n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r%l+1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | if ((r%l+1)//2)%2!=0: | 12 | operation |
n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l%1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | if ((r-l%1)//2)%2!=0: | 12 | operation |
n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)*2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | if ((r-l+1)*2)%2!=0: | 12 | operation |
n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)//2)%2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | n=int(input())
a=list(map(int,input().split()))
value=False
for i in range(n):
for j in range(i+1,n):
if a[i]>a[j]:
value=not value
b=[]
m=int(input())
for i in range(m):
l,r=map(int,input().split())
if ((r-l+1)//2)|2!=0:
value=not value
if value:
b.append("odd")
else:
b.append("even")
print("\n".join(b)) | if ((r-l+1)//2)|2!=0: | 12 | operation |
n=int(input())
a=[0]*(n+2)
a[0]=1
a[1]=1
for i in range(2,n+2):
a[i]=a[i-1]+a[i-2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| n=int(input())
a=[0]*(n**2)
a[0]=1
a[1]=1
for i in range(2,n+2):
a[i]=a[i-1]+a[i-2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| a=[0]*(n**2) | 2 | operation |
n=int(input())
a=[0]*(n+2)
a[0]=1
a[1]=1
for i in range(2,n+2):
a[i]=a[i-1]+a[i-2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| n=int(input())
a=[0]*(n+2)
a[0]=1
a[1]=1
for i in range(2,n+162):
a[i]=a[i-1]+a[i-2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| for i in range(2,n+162): | 5 | value |
n=int(input())
a=[0]*(n+2)
a[0]=1
a[1]=1
for i in range(2,n+2):
a[i]=a[i-1]+a[i-2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| n=int(input())
a=[0]*(n+2)
a[0]=1
a[1]=1
for i in range(2,n+2):
a[i]=a[i-1]+a[i@2]
for i in range(1,n+1):
if i in a:
print('O',end='')
else:
print('o',end='')
| a[i]=a[i-1]+a[i@2] | 6 | operation |
import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3**z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | req_blue = 3**z + y | 16 | operation |
import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A==0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | if req_yellow - A==0: | 20 | decision |
import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[183])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | B = int(crystals[183]) | 6 | value |
import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B==0:
req_add += req_blue - B
print(req_add) | if req_blue - B==0: | 22 | decision |
import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x + y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | import sys
crystals = sys.stdin.readline().split()
A = int(crystals[0])
B = int(crystals[1])
balls = sys.stdin.readline().split()
x = int(balls[0])
y = int(balls[1])
z = int(balls[2])
req_yellow = 2*x<<y
req_blue = 3*z + y
req_add = 0
if req_yellow - A > 0:
req_add += req_yellow - A
if req_blue - B > 0:
req_add += req_blue - B
print(req_add) | req_yellow = 2*x<<y | 15 | operation |
n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=156
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | l+=156 | 7 | value |
n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 161
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | s = 161 | 14 | value |
n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 84
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | s = 84 | 14 | value |
n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i]<a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | if a[i]<a[i-1]: | 6 | decision |
n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i] == a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | n = int(input())
a = [int(s) for s in input().split()]
b = []
l = 1
for i in range(1, n):
if a[i]<a[i-1]:
l+=1
else:
b.append(l)
l = 1
b.append(l)
mx = 0
for i in range(0 if a[0] == 1 else 1, len(b)-3, 2):
s = 0
for j in range(i, i + 4):
s += b[j]
mx = max(mx, s)
for i in range(0, len(b)-1, 1):
mx = max(mx, b[i]+ b[i+1])
print(mx) | if a[i]<a[i-1]: | 6 | decision |
b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now-1):
print(b[i],end='') | for i in range(1,now-1): | 13 | operation |
b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now>>1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | now=now>>1 | 11 | operation |
b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i//1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i//1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'): | 8 | operation |
b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]<'y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]<'y'): | 8 | decision |
b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]=='o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | b=[0]*110
if __name__=="__main__":
n=int(input())
a=input()
now=1
b[1]=a[0]
for i in range(1,n):
if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]<'o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'):
pass
else:
now=now+1
b[now]=a[i]
for i in range(1,now+1):
print(b[i],end='') | if (a[i-1]=='a' or a[i-1]=='e' or a[i-1]=='i' or a[i-1]<'o' or a[i-1]=='u' or a[i-1]=='y') and (a[i]=='a' or a[i]=='e' or a[i]=='i' or a[i]=='o' or a[i]=='u' or a[i]=='y'): | 8 | decision |
import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0]|n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | lengths = [0]|n | 6 | operation |
import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2<0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | if lengths[i] % 2<0: | 37 | decision |
import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2<0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | if lengths[i] % 2<0: | 37 | decision |
import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 169)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | subs[j][lengths[j]] = str(i + 169) | 15 | value |
import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | import sys
days = next(sys.stdin)
n = len(days)
subs = []
lengths = [0] * n
nsub = 0
for i in range(n - 1):
d = int(days[i])
if d:
done = False
for j in range(nsub):
if lengths[j] % 2:
subs[j][lengths[j]] = str(i>>1)
lengths[j] += 1
done = True
break
if not done:
print(-1)
exit()
else:
done = False
for j in range(nsub):
if lengths[j] % 2 == 0:
subs[j][lengths[j]] = str(i + 1)
lengths[j] += 1
done = True
break
if not done:
subs.append([None] * n)
subs[nsub][0] = str(i + 1)
lengths[nsub] = 1
nsub += 1
for i in range(nsub):
if lengths[i] % 2 == 0:
print(-1)
sys.exit()
print(nsub)
for i in range(nsub):
print(lengths[i], " ".join(subs[i][:lengths[i]])) | subs[j][lengths[j]] = str(i>>1) | 15 | operation |
N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]==lst[i+1]:
z+=1
elif lst[i]!=lst[i+1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]<lst[i+1]:
z+=1
elif lst[i]!=lst[i+1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| if lst[i]<lst[i+1]: | 7 | decision |
N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]==lst[i+1]:
z+=1
elif lst[i]!=lst[i+1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]==lst[i+1]:
z+=1
elif lst[i]!=lst[i>>1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| elif lst[i]!=lst[i>>1]: | 9 | operation |
N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]==lst[i+1]:
z+=1
elif lst[i]!=lst[i+1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| N = int(input())
lst = [int(x) for x in input().split()]
lst.sort()
lst.reverse()
z=1
for i in range(N-1):
if lst[i]<lst[i+1]:
z+=1
elif lst[i]!=lst[i+1]:
break
if z%2==1:
print("Conan")
else:
print("Agasa")
| if lst[i]<lst[i+1]: | 7 | decision |
l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2**2
print(suma) | suma += 2*reszta + (a-reszta)//2**2 | 13 | operation |
l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if z > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | if z > a: | 10 | statement |
l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta==a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | if reszta==a: | 10 | decision |
l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | l,r,a=map(int,input().split())
if l > r:
suma = 2+r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | suma = 2+r | 4 | operation |
l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r - l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | l,r,a=map(int,input().split())
if l > r:
suma = 2*r
reszta = l - r
else:
suma = 2*l
reszta = r@l
if reszta > a:
suma += 2*a
else:
suma += 2*reszta + (a-reszta)//2 * 2
print(suma) | reszta = r@l | 8 | operation |
def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i==b):
break
k=ans.index(i)
print(ans[k-1])
main()
| if(i==b): | 23 | decision |
def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k<<1])
main()
| print(ans[k<<1]) | 26 | operation |
def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| def solve(ans,a,m,n):
if(m<n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| if(m<n): | 2 | decision |
def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m+1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| def solve(ans,a,m,n):
if(m==n):
u="".join(a)
ans.append(u)
return
else:
for i in range(m,n):
a[m],a[i]=a[i],a[m]
solve(ans,a,m-1,n)
a[m],a[i]=a[i],a[m]
def main():
ans=list()
a=input()
b=input()
n=len(a)
a=list(a)
m=0
solve(ans,a,m,n)
ans.sort()
for i in ans:
if(i>b):
break
k=ans.index(i)
print(ans[k-1])
main()
| solve(ans,a,m-1,n) | 9 | operation |
N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min&kilo) | print(min&kilo) | 15 | operation |
N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().y())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().y()) | 1 | statement |
N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c>min:
min = c
print(min*kilo) | elif c>min: | 11 | decision |
N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a|b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | c = a|b | 8 | operation |
N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = c
elif c<min:
min = c
print(min*kilo) | N,kilo = map(int,input().split())
i = 0
min = -1
while i<N:
i+=1
a, b = map(int,input().split())
c = a/b
if min==-1:
min = x
elif c<min:
min = c
print(min*kilo) | min = x | 10 | statement |
su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a&10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | if val % 10 == 7 or a&10 == 7 or b % 10 == 7: | 7 | operation |
su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[70], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | a, b = N[70], N[1] | 4 | value |
su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val//60
su += 1
print(su) | a, b = val // 60, val//60 | 11 | operation |
su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10<7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | if val % 10 == 7 or a % 10 == 7 or b % 10<7: | 7 | decision |
su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val // 60, val % 60
su += 1
print(su) | su = 0
x = int(input())
N = list(map(int, input().split()))
a, b = N[0], N[1]
val = 60 * N[0] + N[1]
while True:
if val % 10 == 7 or a % 10 == 7 or b % 10 == 7:
break
else:
val -= x
a, b = val//60, val % 60
su += 1
print(su) | a, b = val//60, val % 60 | 11 | operation |
a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -46):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | for i in range(9, -1, -46): | 8 | value |
a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | a = input()
b = input()
acnt = [0]/10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | acnt = [0]/10 | 3 | operation |
a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | a = input()
b = input()
acnt = [0]**10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | acnt = [0]**10 | 3 | operation |
a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 89
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | f = 89 | 22 | value |
a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(b[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | a = input()
b = input()
acnt = [0] * 10
ans = []
for i in range(len(a)):
acnt[int(a[i])] += 1
if len(a) < len(b):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
else:
acnt2 = []
for i in range(10):
acnt2.append(acnt[i])
for i in range(len(a)):
f = 1
for j in range(9, -1, -1):
if j <= int(b[i]) and acnt[j] > 0:
acnt[j] -= 1
ans.append(j)
f = 0
break
if j < int(b[i]):
for i in range(9, -1, -1):
while acnt[i] > 0:
ans.append(i)
acnt[i] -= 1
break
if f:
ans = []
for j in range(9, -1, -1):
if j < int(y[0]) and acnt2[j] > 0:
ans.append(j)
acnt2[j] -= 1
break
for i in range(9, -1, -1):
while acnt2[i] > 0:
ans.append(i)
acnt2[i] -= 1
break
print(''.join(map(str, ans))) | if j < int(y[0]) and acnt2[j] > 0: | 33 | statement |
n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | n = int(input())
fibs = set()
a, b = 1, 1
while a>=1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | while a>=1000: | 6 | decision |
n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | n = int(input())
fibs = set()
a, b = 1, 1
while a <= 54:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | while a <= 54: | 6 | value |
n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n*1))) | print(''.join('O' if i in fibs else 'o' for i in range(1, n*1))) | 10 | operation |
n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | n = int(input())
fibs = set()
a, b = 1, 1
while a>=1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | while a>=1000: | 6 | decision |
n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n + 1))) | n = int(input())
fibs = set()
a, b = 1, 1
while a <= 1000:
a, b = b, a + b
fibs.add(a)
print(''.join('O' if i in fibs else 'o' for i in range(1, n**1))) | print(''.join('O' if i in fibs else 'o' for i in range(1, n**1))) | 10 | operation |
n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i]|s[i+1:]
ok = False
break
if(ok):
print(s)
break
| s = s[:i]|s[i+1:] | 8 | operation |
n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in x(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| for i in x(1, len(s)): | 6 | statement |
n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i**1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| if (s[i] in bad) and (s[i**1] in bad): | 7 | operation |
n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+59:]
ok = False
break
if(ok):
print(s)
break
| s = s[:i] + s[i+59:] | 8 | value |
n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(1, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| n = input()
s = input()
bad = "aeiouy"
while True:
ok = True
for i in range(194, len(s)):
if (s[i] in bad) and (s[i-1] in bad):
s = s[:i] + s[i+1:]
ok = False
break
if(ok):
print(s)
break
| for i in range(194, len(s)): | 6 | value |
n = int(input())
s = input()
x, y = 0, 0
travel = []
for elem in s:
curt = 0
if elem == 'U':
y += 1
else:
x += 1
if x > y:
travel.append(1)
elif x < y:
travel.append(2)
i, cnt = 0, 0
if travel:
curel = travel[0]
while i < len(travel):
if travel[i] == curel:
while i < len(travel) and travel[i] == curel:
i += 1
else:
cnt += 1
curel = travel[i]
print(cnt) | n = int(input())
s = input()
x, y = 0, 0
travel = []
for elem in s:
curt = 0
if elem == 'U':
y += 1
else:
x += 1
if z > y:
travel.append(1)
elif x < y:
travel.append(2)
i, cnt = 0, 0
if travel:
curel = travel[0]
while i < len(travel):
if travel[i] == curel:
while i < len(travel) and travel[i] == curel:
i += 1
else:
cnt += 1
curel = travel[i]
print(cnt) | if z > y: | 11 | statement |
n = int(input())
s = input()
x, y = 0, 0
travel = []
for elem in s:
curt = 0
if elem == 'U':
y += 1
else:
x += 1
if x > y:
travel.append(1)
elif x < y:
travel.append(2)
i, cnt = 0, 0
if travel:
curel = travel[0]
while i < len(travel):
if travel[i] == curel:
while i < len(travel) and travel[i] == curel:
i += 1
else:
cnt += 1
curel = travel[i]
print(cnt) | n = int(y())
s = input()
x, y = 0, 0
travel = []
for elem in s:
curt = 0
if elem == 'U':
y += 1
else:
x += 1
if x > y:
travel.append(1)
elif x < y:
travel.append(2)
i, cnt = 0, 0
if travel:
curel = travel[0]
while i < len(travel):
if travel[i] == curel:
while i < len(travel) and travel[i] == curel:
i += 1
else:
cnt += 1
curel = travel[i]
print(cnt) | n = int(y()) | 1 | statement |
n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]>=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | n,T=map(int,input().split())
a=list(map(float,input().split()))
t=list(map(float,input().split()))
plus=0
minus=0
for i in range(n):
t[i]-=T
if t[i]>=0:
plus+=t[i]*a[i]
else:
minus-=t[i]*a[i]
res=min(plus, minus)
ans=0
for i in range(n):
if t[i]>0:
if a[i]*t[i]>=res:
ans+=res/t[i]
res=0
else:
ans+=a[i]
res-=a[i]*t[i]
res=min(plus, minus)
for i in range(n):
if t[i]<0:
if -a[i]*t[i]<=res:
ans+=res/(-t[i])
res=0
else:
ans+=a[i]
res+=a[i]*t[i]
print(ans) | if -a[i]*t[i]<=res: | 25 | decision |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.