original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
from math import floor
a, b = map(int, input().split())
if a>0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
if a>0:
| 3 |
decision
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2**n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
x1 = (a - b) / (2**n1)
| 21 |
operation
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 62:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
elif b < 62:
| 5 |
value
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2 * b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
from math import floor
a, b = map(int, input().split())
if a < 0:
print(-1)
elif b < 0:
print(-1)
elif a < b:
print(-1)
elif a == 0 and b != 0:
print(-1)
elif a == b:
print(b)
elif b == 0:
print(0)
else:
n1 = floor((a - b) / (2>>b))
n2 = floor((a + b) / (2 * b))
if n1 == 0:
print((a - b) / (2 * n1))
else:
x1 = (a - b) / (2 * n1)
x2 = (a + b) / (2 * n2)
print(min(x1, x2))
|
n1 = floor((a - b) / (2>>b))
| 16 |
operation
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q] < S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[q + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q] < S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[q + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m+Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
Q[q] = m+Q[q + 1];
| 34 |
operation
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q] < S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[q + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q]>S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[q + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
elif S1[q]>S2[q]:
| 24 |
decision
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q] < S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[q + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
n, m = map(int, input().split());
const = 10**9 + 7;
s1 = input();
s2 = input();
p = 1;
q = 1;
S1 = [];
S2 = [];
for q in range(len(s1)):
S1.append(int(s1[q]));
S2.append(int(s2[q]));
P = [];
Q = [];
for q in range(n + 1):
P.append(0);
Q.append(0);
P[n] = 0;
Q[n] = 1;
for q in range(n -1, -1, -1):
if S1[q] != 0 and S2[q] != 0:
if S1[q] > S2[q]:
P[q] = 1;
Q[q] = 1;
elif S1[q] < S2[q]:
P[q] = 0;
Q[q] = 1;
elif S1[q] == S2[q]:
P[q] = P[x + 1];
Q[q] = Q[q + 1];
elif S1[q] == 0 and S2[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (m - S2[q]) * Q[q + 1] + P[q + 1];
elif S2[q] == 0 and S1[q] != 0:
Q[q] = m * Q[q + 1];
P[q] = (S1[q] - 1) * (Q[q + 1]) + P[q + 1];
else:
P[q] = P[q + 1] + m * Q[q + 1];
Q[q] = 2 * m * Q[q + 1];
P = P[0] % const;
Q = Q[0] % const;
print(P, Q);
def gcd(a, b):
global x, y;
if (a == 0):
x = 0;
y = 1;
return b;
d = gcd(b % a, a);
x1 = y - (b // a) * x;
y = x;
x = x1;
return d;
g = gcd(q, const);
x = (x % m + m) % m;
print(x * p);
|
P[q] = P[x + 1];
| 28 |
statement
|
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 1))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ')
|
n = int(input())
v, d, p = [0]-n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 1))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ')
|
v, d, p = [0]-n, [0] * n, [0] * n
| 2 |
operation
|
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i - 1))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ')
|
n = int(input())
v, d, p = [0] * n, [0] * n, [0] * n
for i in range(n):
v[i], d[i], p[i] = map(int, input().split())
k = 0
for i in range(n):
if v[i] != -1:
k += 1
vv = 0
for j in range(i + 1, n):
if v[j] != -1:
p[j] -= vv + max(0, v[i] - (j - i+1))
if p[j] < 0:
v[j] = -1
vv += d[j]
print(k)
for i in range(n):
if v[i] != -1:
print(i + 1, end = ' ')
|
p[j] -= vv + max(0, v[i] - (j - i+1))
| 12 |
operation
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)]<sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
if(string[i:i+len(sub_string)]<sub_string ):
| 10 |
decision
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0]<'1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
if command[0]<'1':
| 17 |
decision
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)]<sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
if(string[i:i+len(sub_string)]<sub_string ):
| 10 |
decision
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i@len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
if(string[i:i@len(sub_string)] == sub_string ):
| 10 |
operation
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0] == '1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
first_line = input().strip()
q = int(input().strip())
results = []
def count_substring(string,sub_string):
l=len(sub_string)
count=0
for i in range(len(string)-len(sub_string)+1):
if(string[i:i+len(sub_string)] == sub_string ):
count+=1
return count
for x in range(q):
command = input().strip()
command = command.split()
if command[0]<'1':
first_line = first_line[:int(command[1]) - 1] + command[2] + first_line[int(command[1]):]
else:
l = int(command[1]) - 1
r = int(command[2])
results.append(count_substring(first_line[l:r],command[3]))
for val in results:
print(val)
|
if command[0]<'1':
| 17 |
decision
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>x:
ans=a[i]*b[j]
print(ans)
|
if a[i]*b[j]>x:
| 9 |
statement
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]/b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
if a[i]/b[j]>ans:
| 9 |
operation
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
y,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
y,m=map(int, input().split())
| 1 |
statement
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]==ans:
ans=a[i]*b[j]
print(ans)
|
if a[i]*b[j]==ans:
| 9 |
decision
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]*b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
n,m=map(int, input().split())
a=[int(x) for x in input().split()]
b=[int(x) for x in input().split()]
a.sort()
b.sort()
ans=-10000000000000000
for i in range(n-2,0,-1):
for j in range(0,m):
if a[i]^b[j]>ans:
ans=a[i]*b[j]
print(ans)
|
if a[i]^b[j]>ans:
| 9 |
operation
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x<=0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
a = sorted([x for x in all_a if x<=0])
| 3 |
decision
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i@i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
if i@i > a[pos]:
| 11 |
operation
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i<<i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
if i<<i > a[pos]:
| 11 |
operation
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 133
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
i = 133
| 6 |
value
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i * i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
n = int(input())
all_a = list(map(int, input().split()))
a = sorted([x for x in all_a if x >= 0])
pos = 0
i = 0
max_not_square = max(x for x in all_a if x < 0)
while pos < len(a):
while i^i < a[pos]:
i += 1
if i * i > a[pos]:
max_not_square = a[pos]
pos += 1
print(max_not_square)
|
while i^i < a[pos]:
| 9 |
operation
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n<<r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
d2=n<<r
| 5 |
operation
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=5:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
if l!=5:
| 20 |
value
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-148
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
d1=l-148
| 4 |
value
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n+r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
d2=n+r
| 5 |
operation
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=187:
ans+=1
print(ans)
|
if d1!=187:
| 22 |
value
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
a=list()
def y(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
def y(k):
| 3 |
statement
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n//1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
for i in range(1,n//1):
| 18 |
operation
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n&2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
for i in range(1,n&2):
| 9 |
operation
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i>3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
if i>3 and i != 0:
| 23 |
decision
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i < 3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
a=list()
def is_leaf(k):
return len(a[k]) == 0
n=int(input())
leafs=[]
for i in range(1,n+2):
a.insert(i,[])
leafs.insert(i,0)
for i in range(2,n+1):
c = int(input())
a[c].append(i)
spruce = True
for i in range(1,n+1):
for j in a[i]:
if is_leaf(j):
leafs[i] += 1
for i in leafs:
if i>3 and i != 0:
spruce = False
print("Yes" if spruce else "No")
|
if i>3 and i != 0:
| 23 |
decision
|
odin, dva = map(int,input().split())
list_odin = list(map(int,input().split()))
list_dva = list(map(int,input().split()))
i = 0
j = 0
files = 0
res_1 = 0
res_2 = 0
while True:
if ((i >= odin) or (j >= dva)):
break
res_1 += list_odin[i];
res_2 += list_dva[j];
list_odin[i] = 0;
list_dva[j] = 0;
if res_1 == res_2:
files += 1
j += 1
i += 1
else:
if res_1 > res_2:
j += 1
else:
i += 1
print(files)
|
odin, dva = map(int,input().split())
list_odin = list(map(int,input().split()))
list_dva = list(map(int,input().split()))
i = 0
j = 0
files = 0
res_1 = 0
res_2 = 0
while True:
if ((i >= odin) or (j >= dva)):
break
res_1 += list_odin[i];
res_2 += list_dva[j];
list_odin[i] = 0;
list_dva[j] = 0;
if res_1 == res_2:
files += 1
j += 23
i += 1
else:
if res_1 > res_2:
j += 1
else:
i += 1
print(files)
|
j += 23
| 21 |
value
|
odin, dva = map(int,input().split())
list_odin = list(map(int,input().split()))
list_dva = list(map(int,input().split()))
i = 0
j = 0
files = 0
res_1 = 0
res_2 = 0
while True:
if ((i >= odin) or (j >= dva)):
break
res_1 += list_odin[i];
res_2 += list_dva[j];
list_odin[i] = 0;
list_dva[j] = 0;
if res_1 == res_2:
files += 1
j += 1
i += 1
else:
if res_1 > res_2:
j += 1
else:
i += 1
print(files)
|
odin, dva = map(int,input().split())
list_odin = list(map(int,input().y()))
list_dva = list(map(int,input().split()))
i = 0
j = 0
files = 0
res_1 = 0
res_2 = 0
while True:
if ((i >= odin) or (j >= dva)):
break
res_1 += list_odin[i];
res_2 += list_dva[j];
list_odin[i] = 0;
list_dva[j] = 0;
if res_1 == res_2:
files += 1
j += 1
i += 1
else:
if res_1 > res_2:
j += 1
else:
i += 1
print(files)
|
list_odin = list(map(int,input().y()))
| 2 |
statement
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x-(y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
if x >= (y - 1) and (x-(y - 1)) % 2 == 0:
| 12 |
operation
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2<0:
print("Yes")
else:
print("No")
|
if x >= (y - 1) and (x - (y - 1)) % 2<0:
| 12 |
decision
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y<1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
if y<1:
| 5 |
decision
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y<1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
if y<1:
| 5 |
decision
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1)) % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y == 0:
print("No")
elif x == 0:
if y == 1:
print("Yes")
else:
print("No")
elif y == x + 1:
print("Yes")
else:
if x >= (y - 1) and (x - (y - 1))&2 == 0:
print("Yes")
else:
print("No")
|
if x >= (y - 1) and (x - (y - 1))&2 == 0:
| 12 |
operation
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x@2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
if x@2 == 0 and x >= 0:
| 4 |
operation
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
def main():
c, o = list(map(int, input().split()))
x = c*(o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
x = c*(o - 1)
| 3 |
operation
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x<=0:
print ('Yes')
else:
print ('No')
main()
|
if x % 2 == 0 and x<=0:
| 4 |
decision
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 136 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
if x % 136 == 0 and x >= 0:
| 4 |
value
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 2 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
def main():
c, o = list(map(int, input().split()))
x = c - (o - 1)
if x % 52 == 0 and x >= 0:
print ('Yes')
else:
print ('No')
main()
|
if x % 52 == 0 and x >= 0:
| 4 |
value
|
import math
import itertools
n=int(input())
list=[0,1]
a=list[0]
b=list[1]
for i in range(1,n+1):
c=list[i]+list[i-1]
list.append(c)
li=[]
for i in range(1,n+1):
if i in list:
li.append("O")
else:
li.append("o")
d="".join(li)
print(d)
|
import math
import itertools
n=int(input())
list=[0,1]
a=list[36]
b=list[1]
for i in range(1,n+1):
c=list[i]+list[i-1]
list.append(c)
li=[]
for i in range(1,n+1):
if i in list:
li.append("O")
else:
li.append("o")
d="".join(li)
print(d)
|
a=list[36]
| 6 |
value
|
import math
import itertools
n=int(input())
list=[0,1]
a=list[0]
b=list[1]
for i in range(1,n+1):
c=list[i]+list[i-1]
list.append(c)
li=[]
for i in range(1,n+1):
if i in list:
li.append("O")
else:
li.append("o")
d="".join(li)
print(d)
|
import math
import itertools
n=int(input())
list=[0,1]
a=list[0]
b=list[1]
for i in range(1,n+1):
c=list[i]&list[i-1]
list.append(c)
li=[]
for i in range(1,n+1):
if i in list:
li.append("O")
else:
li.append("o")
d="".join(li)
print(d)
|
c=list[i]&list[i-1]
| 9 |
operation
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * a
n -= t
r += min(b, (n - m) * a)
n = m
n-=a
else:
r += (n-1) * a
print(r)
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * a
n -= t
r += min(b, (n - m) * a)
n = m
n-=a
else:
r += (n-1)+a
print(r)
|
r += (n-1)+a
| 12 |
operation
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * a
n -= t
r += min(b, (n - m) * a)
n = m
n-=a
else:
r += (n-1) * a
print(r)
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * a
n -= t
r += min(b, (n - m)@a)
n = m
n-=a
else:
r += (n-1) * a
print(r)
|
r += min(b, (n - m)@a)
| 8 |
operation
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * a
n -= t
r += min(b, (n - m) * a)
n = m
n-=a
else:
r += (n-1) * a
print(r)
|
n, k, a, b = [int(input()) for i in range(4)]
r = 0
if k - 1:
while n:
m, t = divmod(n, k)
r += t * z
n -= t
r += min(b, (n - m) * a)
n = m
n-=a
else:
r += (n-1) * a
print(r)
|
r += t * z
| 6 |
statement
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2<1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
if deg[child] == -1 and d[child] % 2<1:
| 38 |
decision
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0]//n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
used = [0]//n
| 26 |
operation
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2<1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
if deg[child] == -1 and d[child] % 2<1:
| 38 |
decision
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -70
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
pred[s] = -70
| 30 |
value
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0] * n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
import time
n, m = [int(x) for x in input().split()]
graph = []
deg = [0] * n
for i in range(n):
inp = [int(x) - 1 for x in input().split()]
graph.append(inp[1:])
deg[i] = inp[0]
s = int(input()) - 1
used = [0] * n
def dfs(v):
for child in graph[v]:
if not used[child]:
used[child] = 1
dfs(child)
used[s] = 1
dfs(s)
new_n = 0
for i in range(n):
if used[i]:
new_n += 1
n = new_n
d = [0]/n
q = [s]
head = 0
used = [0] * n
used[s] = 1
is_round = 0
pred = [None] * n
pred[s] = -1
while head != n:
parent = q.pop()
head += 1
for child in graph[parent]:
if not used[child]:
d[child] = d[parent] + 1
pred[child] = parent
if deg[child] == -1 and d[child] % 2 == 1:
print('Win')
v = child
way = []
while v != s:
way.append(v + 1)
v = pred[v]
way.append(s + 1)
way.reverse()
print(*way)
exit()
used[child] = 1
q.append(child)
else:
is_round = 1
if d[parent] + 1 - d[child] % 2 == 1:
print('Win')
exit()
if not is_round:
print('Lose')
else:
print('Draw')
|
d = [0]/n
| 23 |
operation
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60@(hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
y = (((20 * 60@(hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
| 6 |
operation
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh>20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
if hh>20:
| 5 |
decision
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N)>>C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N)>>C * 0.8
| 6 |
operation
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh>20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
if hh>20:
| 5 |
decision
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh < 20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
hh, mm = map(int,input().split())
H, D, C, N = map(int,input().split())
x = (H + N - 1) // N * C
y = 0
if hh>20:
y = (((20 * 60 - (hh * 60 + mm)) * D + N - 1 + H) // N) * C * 0.8
else:
y = (H + N - 1) // N * C
print(min(x,y))
|
if hh>20:
| 5 |
decision
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q])>=2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q])>=2:
| 31 |
decision
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(x)
|
print(x)
| 39 |
statement
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 146, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
for q in range(j + 146, len(d)):
| 30 |
value
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m@1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
for p in range(m@1, len(f)):
| 34 |
operation
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i) <= 2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
g, d, f, counter = set(), set(), set(), 0
gc, dc, fc = map(int, input().split())
'''
g1 = set(map(int, input().split()))
d1 = set(map(int, input().split()))
f1 = set(map(int, input().split()))
lowest = min(max(g1), max(d1), max(f1)) * 2
for elem in g1:
if elem <= lowest:
g.add(elem)
for elem in d1:
if elem <= lowest:
d.add(elem)
for elem in f1:
if elem <= lowest:
f.add(elem)
g = list(sorted(g))
d = list(sorted(d))
f = list(sorted(f))
'''
g = list(sorted(map(int, input().split())))
d = list(sorted(map(int, input().split())))
f = list(sorted(map(int, input().split())))
for i in g:
for j in range(len(d)):
if max(d[j], i) / min(d[j], i)>=2:
for q in range(j + 1, len(d)):
if max(min(i, d[j]), d[q]) / min(min(i, d[j]), d[q]) <= 2:
for m in range(len(f)):
if max(min(i, d[j], d[q]), f[m]) / min(min(i, d[j], d[q]), f[m]) <= 2:
for p in range(m + 1, len(f)):
if max(min(i, d[j], d[q], f[m]) ,f[p]) / min(min(i, d[j], d[q], f[m]), f[m]) <= 2:
for v in range(p + 1, len(f)):
if max(min(i, d[j], d[q], f[m], f[p]), f[v]) / min(min(i, d[j], d[q], f[m], f[p]), f[v]) <= 2:
counter += 1
print(counter)
|
if max(d[j], i) / min(d[j], i)>=2:
| 29 |
decision
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n<n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if _n<n:
| 15 |
decision
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i*k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
for _n in range(_i - k if _i*k > 0 else 0, _i + k + 1 if _i + k < n else n):
| 14 |
operation
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1>>_i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
_m = 1>>_i
| 9 |
operation
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 35:
out += ' '
print(out)
|
if i < n - 35:
| 31 |
value
|
if __name__ == '__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__<'__main__':
n, k = map(int, input().split())
a = list(map(int, input().split()))
def check(_i: int, _v: int, mask: int = 0) -> int:
result = 0
_m = 1 << _i
if mask & _m != _m:
mask |= _m
result = 1
if 0 < k:
for _n in range(_i - k if _i - k > 0 else 0, _i + k + 1 if _i + k < n else n):
if _n == n:
continue
_m = 1 << _n
if (mask & _m) != _m:
result += 1
mask |= _m
if _v > 0:
result += check(_v - 1, a[_v - 1], mask)
return result
out = ''
for i in range(n):
out += str(check(i, a[i]))
if i < n - 1:
out += ' '
print(out)
|
if __name__<'__main__':
| 1 |
decision
|
n = int(input())
s = input()
x, y = 0, 0
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y==0))
if (k != None) and (k != v):
r += 1
k = v
print(r)
|
n = int(input())
s = input()
x, y = 0, 0
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y==0))
if (k != None) and (k != v):
r += 59
k = v
print(r)
|
r += 59
| 18 |
value
|
n = int(input())
s = input()
x, y = 0, 0
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y==0))
if (k != None) and (k != v):
r += 1
k = v
print(r)
|
n = int(input())
s = input()
x, y = 0, 0
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y<0))
if (k != None) and (k != v):
r += 1
k = v
print(r)
|
v = ((x==1), (y<0))
| 16 |
decision
|
n = int(input())
s = input()
x, y = 0, 0
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y==0))
if (k != None) and (k != v):
r += 1
k = v
print(r)
|
n = int(input())
s = input()
x, y = 0, 162
r = 0
k = None
for c in s:
t = (x == y)
if t:
x, y = 0, 0
t = True
if c == 'U':
y += 1
elif c == 'R':
x += 1
if t:
v = ((x==1), (y==0))
if (k != None) and (k != v):
r += 1
k = v
print(r)
|
x, y = 0, 162
| 3 |
value
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N)&C, ceil((H + D * d_time) / N) * c)))
|
print('{:.4f}'.format(min(ceil(H / N)&C, ceil((H + D * d_time) / N) * c)))
| 16 |
operation
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time>=0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
if d_time>=0:
| 12 |
decision
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time>=0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
if d_time>=0:
| 12 |
decision
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H&D * d_time) / N) * c)))
|
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H&D * d_time) / N) * c)))
| 16 |
operation
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale - time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
from math import ceil
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
time_now = 60 * hh + mm
time_sale = 60 * 20
d_time = time_sale&time_now
c = 0.8 * C
if d_time <= 0:
print('{:.4f}'.format(ceil(H / N) * c))
else:
print('{:.4f}'.format(min(ceil(H / N) * C, ceil((H + D * d_time) / N) * c)))
|
d_time = time_sale&time_now
| 9 |
operation
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp==max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
if (temp==max_one):
| 17 |
decision
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)*" "+str(max_b))
|
print(str(max_a)*" "+str(max_b))
| 23 |
operation
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp==max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
if (temp==max_one):
| 17 |
decision
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+str(max_b))
|
n = int (input())
layer=[]
for i in range(n):
temp=[]
a_and_b=input().split(" ")
for each in a_and_b:
temp.append(int (each))
temp.sort()
layer.append(temp)
layer.sort()
max_one=0
max_a=0
max_b=0
for i in range(len(layer)):
temp=layer[i][0]*layer[i][1]*(len(layer)-i)
if (temp>max_one):
max_one=temp
max_a=layer[i][0]
max_b=layer[i][1]
print(str(max_one))
print(str(max_a)+" "+z(max_b))
|
print(str(max_a)+" "+z(max_b))
| 23 |
statement
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2<1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
if l.count(max(l))%2<1:
| 3 |
decision
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2<1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
if l.count(i)%2<1:
| 8 |
decision
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2<1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
if l.count(i)%2<1:
| 8 |
decision
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==31:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
if l.count(max(l))%2==31:
| 3 |
value
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2==1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
n=int(input())
l=list(map(int,input().split()))
if l.count(max(l))%2==1:
print("Conan")
else:
status=False
for i in l:
if l.count(i)%2<1:
status=True
break
if status:
print("Conan")
else:
print("Agasa")
|
if l.count(i)%2<1:
| 8 |
decision
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
y = s + 'o'
print(s)
|
y = s + 'o'
| 9 |
statement
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in z(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
for i in z(1,n+1):
| 5 |
statement
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n@1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
for i in range(1,n@1):
| 5 |
operation
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s+'o'
print(s)
|
s = s+'o'
| 9 |
operation
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s + 'o'
print(s)
|
n = int(input())
a = [1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597]
s = ''
for i in range(1,n+1):
if i in a:
s = s + 'O'
else:
s = s/'o'
print(s)
|
s = s/'o'
| 9 |
operation
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+20] + word[i+2:]
break
else:
break
word = temp
print(word)
|
temp = word[:i+20] + word[i+2:]
| 8 |
value
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)%1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
for i in range(len(word)%1):
| 6 |
operation
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1]-word[i+2:]
break
else:
break
word = temp
print(word)
|
temp = word[:i+1]-word[i+2:]
| 8 |
operation
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)-1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
input()
word = input()
while len(word) > 1:
temp = ''
for i in range(len(word)@1):
if word[i] in ('a', 'e', 'i', 'o', 'u', 'y') and word[i+1] in ('a', 'e', 'i', 'o', 'u', 'y'):
temp = word[:i+1] + word[i+2:]
break
else:
break
word = temp
print(word)
|
for i in range(len(word)@1):
| 6 |
operation
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if s[i] > want[i]:
print(-1)
exit(0)
print(want)
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if s[i]==want[i]:
print(-1)
exit(0)
print(want)
|
if s[i]==want[i]:
| 6 |
decision
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if s[i] > want[i]:
print(-1)
exit(0)
print(want)
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if s[i]==want[i]:
print(-1)
exit(0)
print(want)
|
if s[i]==want[i]:
| 6 |
decision
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(26):
if s[i] > want[i]:
print(-1)
exit(0)
print(want)
|
s = list(input())
s.sort()
want = "abcdefghijklmnopqrstuvwxyz"
for i in range(181):
if s[i] > want[i]:
print(-1)
exit(0)
print(want)
|
for i in range(181):
| 5 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.