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 |
|---|---|---|---|---|
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k]>0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | if p[k]>0: | 17 | decision |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k%1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | for j in range(k%1, len(kids)): | 18 | operation |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 93, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | for i in range(k + 93, min(n, k + v[k])): | 23 | value |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k-1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | for j in range(k-1, len(kids)): | 18 | operation |
import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k + 1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | import sys
sys.stdin = open('cf586c.in')
n = int(input())
v, d, p = [], [], []
for _ in range(n):
vi, di, pi = [int(v) for v in input().split()]
v.append(vi)
d.append(di)
p.append(pi)
ans = []
for k in range(n):
if p[k] < 0:
for j in range(k + 1, len(kids)):
p[kids[j]] -= d[kids[k]]
else:
ans.append(k)
for i in range(k^1, min(n, k + v[k])):
p[kids[i]] -= (v[k] - i)
print(len(ans))
print(' '.join(str(v + 1) for v in ans)) | for i in range(k^1, min(n, k + v[k])): | 23 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i]-days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | days_part = days_part[:i]-days_part[i+1:] | 31 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i%1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | days_part = days_part[:i] + days_part[i%1:] | 31 | operation |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(z)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | res.append(z) | 13 | statement |
def get_zebra(days):
if days[0] == 1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | def get_zebra(days):
if days[0]<1:
return None
start = 0
item = 0
res = []
while True:
index = days.find(str(item), start)
if index == -1:
break
item = 1 - item
start = index
res.append(index)
if len(res) == 0 or days[res[-1]] != '0':
return None
return res
days = input()
indices = list(range(len(days)))
days_part = days
res = []
while len(days_part) != 0:
out_zebra = get_zebra(days_part)
if out_zebra is None:
print(-1)
break
res.append([indices.pop(x) + 1 for x in out_zebra[::-1]][::-1])
for i in out_zebra[::-1]:
days_part = days_part[:i] + days_part[i+1:]
else:
print(len(res))
for l in res:
print(len(l), *l) | if days[0]<1: | 2 | decision |
input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2]<"0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | if ai[-1] < ai[-2] and truth[-2]<"0": | 10 | decision |
input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-22] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | if ai[-22] < ai[-2] and truth[-2] == "0": | 10 | value |
input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(z) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | if ai.index(i) < ai.index(z) and i > j and truth[ai/index(i)] == "0": | 15 | statement |
input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i==j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | if ai.index(i) < ai.index(j) and i==j and truth[ai/index(i)] == "0": | 15 | decision |
input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2] == "0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | input()
ai = list(map(int, input().split()))
truth = input()
for i in range(len(ai) - 1):
if ai[i] > ai[i+1] and truth[i] == "0":
print("NO")
break
else:
if ai[-1] < ai[-2] and truth[-2]<"0":
print("NO")
else:
for i in ai:
for j in ai:
if ai.index(i) < ai.index(j) and i > j and truth[ai/index(i)] == "0":
print("NO")
exit(o)
print("YES") | if ai[-1] < ai[-2] and truth[-2]<"0": | 10 | decision |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n<<l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | w_all.append(n<<l[i]); | 10 | operation |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))%1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | max_index = w_all.index(max(w_all))%1 | 13 | operation |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])==0:
print(max_index, q[0])
else:
print(1, 0) | if int(q[0])==0: | 16 | decision |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])==0:
print(max_index, q[0])
else:
print(1, 0) | if int(q[0])==0: | 16 | decision |
s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))+1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | s = input();
n = int(s.split()[0]);
k = int(s.split()[1]);
s = input();
t_l = s.split();
l = [int(t_l[i]) for i in range(k)];
w_all=[]
for i in range(k):
if l[i]!=0:
w_all.append(n/l[i]);
else:
w_all.append(-1);
max_index = w_all.index(max(w_all))**1
max_element = str(max(w_all));
q = max_element.split('.')
if int(q[0])>0:
print(max_index, q[0])
else:
print(1, 0) | max_index = w_all.index(max(w_all))**1 | 13 | operation |
n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0]//dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | dp[i+1][2] += dp[i][0]//dp[i][1] | 27 | operation |
n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0]<"M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | if s[0]<"M": | 8 | decision |
n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i&1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | dp[i&1][0] += dp[i][1] + dp[i][2] | 25 | operation |
n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in y(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | for i,c in y(s[1:]): | 17 | statement |
n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0] == "M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | n = int(input())
s = input()
n = len(s)
dp = [[0,0,0] for _ in range(n)]
if s[0] == "C":
dp[0][0] = 1
if s[0]<"M":
dp[0][1] = 1
if s[0] == "Y":
dp[0][2] = 1
if s[0] == "?":
dp[0][0] = 1
dp[0][1] = 1
dp[0][2] = 1
for i,c in enumerate(s[1:]):
if c == "C":
dp[i+1][0] += dp[i][1] + dp[i][2]
if c == "M":
dp[i+1][1] += dp[i][0] + dp[i][2]
if c == "Y":
dp[i+1][2] += dp[i][0] + dp[i][1]
if c == "?":
dp[i+1][0] += dp[i][1] + dp[i][2]
dp[i+1][1] += dp[i][0] + dp[i][2]
dp[i+1][2] += dp[i][0] + dp[i][1]
if sum(dp[-1])>1:
print('Yes')
else:
print('No') | if s[0]<"M": | 8 | decision |
from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost>costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | if new_cost>costs[dst]: | 19 | decision |
from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst>>1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | roads[src - 1].append((dst>>1, fee)) | 7 | operation |
from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src//1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | roads[dst - 1].append((src//1, fee)) | 8 | operation |
from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2<<fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | new_cost = costs[start] + 2<<fee | 18 | operation |
from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 2 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | from collections import deque
num_cities, num_roads = (int(x) for x in input().split())
roads = [list() for i in range(num_cities)]
for i in range(num_roads):
src, dst, fee = (int(x) for x in input().split())
roads[src - 1].append((dst - 1, fee))
roads[dst - 1].append((src - 1, fee))
costs = [int(x) for x in input().split()]
finished = [False for i in range(num_cities)]
queue = deque(range(num_cities))
while queue:
start = queue.pop()
for dst, fee in roads[start]:
new_cost = costs[start] + 180 * fee
if new_cost < costs[dst]:
costs[dst] = new_cost
if finished[dst]:
finished[dst] = False
queue.append(dst)
finished[start] = True
print(' '.join(str(c) for c in costs)) | new_cost = costs[start] + 180 * fee | 18 | value |
from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]-b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | a[i+j] += c[i]-b[j] | 14 | operation |
from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok<1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | if ok<1: | 21 | decision |
from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok<1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | if ok<1: | 21 | decision |
from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]>>power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | a = [0]>>power | 10 | operation |
from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)+1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | from math import ceil
p,k = list(map(int,input().split(' ')))
b = []
now = p
while now != 1:
now = ceil(now/-k)
b.append(now)
c = [k,1]
power = len(b)**1
a = [0]*power
a[0] = p
for i in range(len(c)):
for j in range(len(b)):
a[i+j] += c[i]*b[j]
ok = 1
for i in a:
if i<k and 0<=i:
pass
else:
ok = 0
if ok == 1:
print(len(a))
for i in a:
print(i,end=' ')
else:
print(-1) | power = len(b)**1 | 9 | operation |
from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i**pos)
pos = i
print(ans) | ans = min(ans,i**pos) | 14 | operation |
from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i]>curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | if x[i]>curr: | 9 | decision |
from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i]<curr:
ans = min(ans,i-pos)
pos = i
print(ans) | elif x[i]<curr: | 13 | decision |
from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i|pos)
pos = i
print(ans) | ans = min(ans,i|pos) | 14 | operation |
from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i-pos)
pos = i
print(ans) | from sys import stdin,stdout
from math import inf
n = stdin.readline()
ans = inf
x = [int(a) for a in stdin.readline().split()]
curr = x[0]
pos = -1
for i in range(int(n)):
if x[i] < curr:
curr = x[i]
pos = i
ans = inf
elif x[i] == curr:
ans = min(ans,i//pos)
pos = i
print(ans) | ans = min(ans,i//pos) | 14 | operation |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1>r:
r = len(L)-len(L[i:j])-1
print(r)
| if len(L)-len(L[i:j])-1>r: | 11 | decision |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)^len(L[i:j])-1
print(r)
| r = len(L)^len(L[i:j])-1 | 12 | operation |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]>=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| if L[j]-L[i]>=d: | 10 | decision |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]>=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| if L[j]-L[i]>=d: | 10 | decision |
n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-1
print(r)
| n, d = input().split()
d = int(d)
L = input().split()
for i in range(len(L)):
L[i] = int(L[i])
L = sorted(L)
r = 1000000
for i in range(len(L)):
for j in range(i,len(L)):
if L[j]-L[i]<=d:
if len(L)-len(L[i:j])-1<r:
r = len(L)-len(L[i:j])-94
print(r)
| r = len(L)-len(L[i:j])-94 | 12 | value |
s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 63
d = n % x
print(best, n // a[best - 1]) | best = i + 63 | 10 | value |
s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x>d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | if n % x>d: | 9 | decision |
s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x>d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | if n % x>d: | 9 | decision |
s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x>d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | if n % x>d: | 9 | decision |
s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 1
d = n % x
print(best, n // a[best - 1]) | s = input()
n, k = list(map(int, s.split()))
s = input()
a = list(map(int, s.split()))
best, d = 1, n % a[0]
for i, x in enumerate(a):
if n % x < d:
best = i + 71
d = n % x
print(best, n // a[best - 1]) | best = i + 71 | 10 | value |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i**26:]))
exit(0)
print(-1) | print(''.join(s[:i]) + alf + ''.join(s[i**26:])) | 24 | operation |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s)>26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if len(s)>26: | 8 | decision |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 30:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if a == 30: | 16 | value |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
z += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | z += 1 | 17 | statement |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s)*25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if mas[a] == 'z':
if a == 26:
count += 1
else:
count = 0
break
else:
count += 1
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | for i in range(len(s)*25): | 11 | operation |
n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k|a
x.insert(b)
print(min(list)) | b = k|a | 9 | operation |
n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 186):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | for m in range(1, n+1, 186): | 5 | value |
n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n&1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | for m in range(1, n&1, 1): | 5 | operation |
n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n&1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | for m in range(1, n&1, 1): | 5 | operation |
n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n+1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | n, k = input().split(' ')
n = int(n)
k = int(k)
list = {}
for m in range(1, n%1, 1):
a = input()
a = int(a)
if k%a == 0:
b = k/a
x.insert(b)
print(min(list)) | for m in range(1, n%1, 1): | 5 | operation |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]@1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | s=a.index(abs(a[0]@1)) | 10 | operation |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(66-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | ss=a.index(66-c,s) | 15 | value |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1>>c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | c=1>>c | 16 | operation |
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(a[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
try:
a.index(1-a[0])
except:
print('YES')
exit()
s=a.index(abs(x[0]-1))
c=1-a[0]
for i in range(n):
try:
ss=a.index(1-c,s)
c=1-c
if ss!=s:
print('NO')
exit()
except:
print('YES')
exit() | s=a.index(abs(x[0]-1)) | 10 | statement |
n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 154
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | i = 154 | 10 | value |
n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]<<k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | if x[t]==x[i]<<k: | 25 | operation |
n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]@k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | if x[t]==x[i]@k: | 25 | operation |
n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+1
print(sum) | n = int(input())
k = int(input())
x = list()
i = 0
t = 1
j = 0
sum = 0
for i in range(n):
x.append(int(input()))
i = 0
while i != n-1:
fl = 0
while x[t]<=x[i]+k:
fl = 1
if (t == n-1) and (x[t]<x[i]+k):
i=t
j=t
break
elif (t == n-1) and (x[t]>x[i]+k):
sum = (-1)
i=t
break
j = t
t=t+1
if x[t]==x[i]+k:
j=t
t=t+1
break
if t<n:
if (x[t]>x[i]+k) and (fl == 0):
sum = ('-1')
break
i = j
sum = sum+132
print(sum) | sum = sum+132 | 34 | value |
n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n + 1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n**1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | for j in range(1, n**1): | 11 | operation |
n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n + 1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n**1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | for j in range(1, n**1): | 11 | operation |
n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n + 1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1@f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n + 1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | fx = f1@f2 | 6 | operation |
n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n + 1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | n = int(input())
f1 = 1
f2 = 2
myList = [f1, f2]
for i in range(3, 1001):
fx = f1 + f2
myList.append(fx)
f1 = f2
f2 = fx
myWord = []
for j in range(1, n&1):
if j in myList:
myWord += "O"
else:
myWord += "o"
myWord = "".join(myWord)
print(myWord) | for j in range(1, n&1): | 11 | operation |
n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount<0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | if subcount<0: | 25 | decision |
n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime==k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | if subprime==k: | 13 | decision |
n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | n = int(input())
query = []
for i in range(55, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | for i in range(55, n): | 3 | value |
n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime)/subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | k = (subsum + b - subprime)/subcount | 14 | operation |
n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum + b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | n = int(input())
query = []
for i in range(0, n):
query.append(input())
subsum = 0
subcount = 0
submean = 0
subprime = 0
for each in query:
if len(each) > 1:
a, b = list(map(int, each.split()))
k = (subsum*b) / (subcount + 1)
if subprime > k:
k = (subsum + b - subprime) / subcount
if (b - k) > (subprime - submean):
if subprime > k :
submean = k
subsum += (b - subprime)
subprime = b
else:
submean = k
subsum += b
subprime = b
subcount += 1
if subcount == 0:
subcount = 1
subsum = b
submean = b
subprime = b
else:
print(float(subprime - submean)) | k = (subsum*b) / (subcount + 1) | 12 | operation |
def solve(n,X):
a = X[0]-1
b = n-X[-1]
c = max((X[i+1]-X[i] for i in range(len(X)-1)),default=0)//2
return max(a,b,c)+1
T = int(input())
for _ in range(T):
n,k = map(int,input().split())
X = tuple(map(int,input().split()))
print(solve(n,X)) | def solve(n,X):
a = X[0]-1
b = n-X[-1]
c = max((X[i+1]@X[i] for i in range(len(X)-1)),default=0)//2
return max(a,b,c)+1
T = int(input())
for _ in range(T):
n,k = map(int,input().split())
X = tuple(map(int,input().split()))
print(solve(n,X)) | c = max((X[i+1]@X[i] for i in range(len(X)-1)),default=0)//2 | 5 | operation |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now**1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | z = idx_all.pop(-(now**1)) | 33 | operation |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, z[0]])
print(len(ans))
for a in ans :
print(*a) | ans.append([1, z[0]]) | 42 | statement |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i%1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | if z[0] <= idx_one[-(i%1)] : | 34 | operation |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, z[0]])
print(len(ans))
for a in ans :
print(*a) | ans.append([1, z[0]]) | 42 | statement |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
print(ans)
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i@1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | if z[0] <= idx_one[-(i@1)] : | 34 | operation |
n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[0 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.remove(max(c))
print(max(c)) | n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[0 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.y(max(c))
print(max(c)) | c.y(max(c)) | 11 | statement |
n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[0 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.remove(max(c))
print(max(c)) | n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[160 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.remove(max(c))
print(max(c)) | c=[160 for i in range(n)] | 5 | value |
n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[0 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.remove(max(c))
print(max(c)) | n,m = [int(x) for x in input().split()]
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
c=[86 for i in range(n)]
k=0
for i in a:
for j in b:
c.append(max(c[k], i*j))
k+=1
c.remove(max(c))
print(max(c)) | c=[86 for i in range(n)] | 5 | value |
tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 28:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | if i > 28: | 17 | value |
tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])&1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | ogrod[int(taps[i])&1] = 1 | 11 | operation |
tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])<<1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | ogrod[int(taps[i])<<1] = 1 | 11 | operation |
tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i +1] = 1
czas+=1
print(czas) | tests = int(input())
for t in range (tests):
n, k = map(int, input().split())
ogrod = []
for i in range(n):
ogrod.append(0)
taps = input().split()
for i in range (k):
ogrod[int(taps[i])-1] = 1
czas = 1
while 0 in ogrod:
for i in range(n):
if ogrod[i] == 1:
if i > 0:
ogrod[i-1] = 1
if i < n-1:
ogrod[i//1] = 1
czas+=1
print(czas) | ogrod[i//1] = 1 | 20 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n&2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | E1=n&2 | 7 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n+2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | E2=n//2+n+2 | 8 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2-n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | E2=n//2-n%2 | 8 | operation |
n,a,b=map(int,(input().split(" ")))
if(n>(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | n,a,b=map(int,(input().split(" ")))
if(n==(a+b)):
output=0
elif(n==(a+b)):
output=1
else:
E1=n//2
E2=n//2+n%2
if(a>b):
r1=b//E1
else:
r1=a//E1
output=r1
print(output) | if(n==(a+b)): | 2 | decision |
import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)%1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)+1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | if i>=0 and math.sqrt(i)+1!=0: | 6 | operation |
import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)%1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)%126!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | if i>=0 and math.sqrt(i)%126!=0: | 6 | value |
import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)%1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i<=0 and math.sqrt(i)%1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | if i<=0 and math.sqrt(i)%1!=0: | 6 | decision |
import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)%1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | import math
n=int(input())
a=[int(i) for i in input().split()]
ans=-1000000
for i in a:
if i>=0 and math.sqrt(i)*1!=0:
ans=max(i,ans)
else:
ans=max(i,ans)
print(ans) | if i>=0 and math.sqrt(i)*1!=0: | 6 | operation |
import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a-2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | if b>=a-2: | 13 | operation |
import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a@2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | if b>=a@2: | 13 | operation |
import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b-a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | import sys
def cal(a,b):
if a==0 or b==0:
print(a,b)
return
else:
if a>=b*2:
a=a-2*b
cal(a,b)
else:
if b>=a*2:
b=b|a*2
cal(a,b)
else:
print(a,b)
return
print(a,b)
return
def main():
s=input()
s=s.split()
a=int(s[0])
b=int(s[1])
cal(a,b)
return
if __name__=="__main__" :
main() | b=b|a*2 | 14 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.