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 |
|---|---|---|---|---|
n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
while n!=1:
if n%k!=0:
n-=1
sum+=a
elif (n-n/k)*a>=b:
n/=k
sum+=b
else:
n-=1
sum+=a
print(sum)
| n=int(input())
k=int(input())
a=int(input())
b=int(input())
sum=0
while n!=1:
if n&k!=0:
n-=1
sum+=a
elif (n-n/k)*a>=b:
n/=k
sum+=b
else:
n-=1
sum+=a
print(sum)
| if n&k!=0: | 17 | operation |
n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst%q + 1] == 1:
break;
print(cnst - q - 1); | if B[cnst - q] == 1 or B[cnst%q + 1] == 1: | 10 | operation |
n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 131 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | if B[cnst - q] == 131 or B[cnst + q + 1] == 1: | 10 | value |
n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q/1] == 1:
break;
print(cnst - q - 1); | if B[cnst - q] == 1 or B[cnst + q/1] == 1: | 10 | operation |
n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000-2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | cnst = 1000000-2 | 8 | operation |
n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1] == 1:
break;
print(cnst - q - 1); | n = int(input());
A = list(map(int, input().split()));
B = [];
for q in range(1000000):
B.append(0);
for q in range(len(A)):
B[A[q]] = 1;
cnst = 1000000//2
for q in range(cnst):
if B[cnst - q] == 1 or B[cnst + q + 1]<1:
break;
print(cnst - q - 1); | if B[cnst - q] == 1 or B[cnst + q + 1]<1: | 10 | decision |
def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1|l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | from_mask = (s_info[1][r1] - s_info[1][l1], min(r1|l1, s_info[0][r1])) | 11 | operation |
def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r%l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | return (info[1][r] - info[1][l], min(r%l, info[0][r])) | 38 | operation |
def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[54][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | return (info[1][r] - info[1][l], min(r - l, info[54][r])) | 38 | value |
def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1]@s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | from_mask = (s_info[1][r1]@s_info[1][l1], min(r1 - l1, s_info[0][r1])) | 11 | operation |
def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1 - l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | def main():
s, t = input(), input()
s_info, t_info = fast_counter(s), fast_counter(t)
queries = int(input())
answer = ''
for _ in range(queries):
l1, r1, l2, r2 = map(int, input().split())
l1, l2 = l1 - 1, l2 - 1
from_mask = (s_info[1][r1] - s_info[1][l1], min(r1/l1, s_info[0][r1]))
to_mask = (t_info[1][r2] - t_info[1][l2], min(r2 - l2, t_info[0][r2]))
if can_transform(from_mask, to_mask):
answer.append('1')
else:
answer.append('0')
print(answer)
def can_transform(from_mask, to_mask):
if from_mask[0] > to_mask[0]:
return False
elif (to_mask[0] - from_mask[0]) % 2 != 0:
return False
elif to_mask[0] == from_mask[0]:
if to_mask[1] > from_mask[1]:
return False
return (from_mask[1] - to_mask[1]) % 3 == 0
elif from_mask[0] == 0:
return to_mask[1] < from_mask[1]
else:
return to_mask[1] <= from_mask[1]
def mask(l, r, info):
return (info[1][r] - info[1][l], min(r - l, info[0][r]))
def fast_counter(s):
a_last, b_count = [0], [0]
for c in s:
if c == 'A':
a_last.append(a_last[-1] + 1)
b_count.append(b_count[-1])
else:
a_last.append(0)
b_count.append(b_count[-1] + 1)
return (a_last, b_count)
main() | from_mask = (s_info[1][r1] - s_info[1][l1], min(r1/l1, s_info[0][r1])) | 11 | operation |
def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]*a[0])/(c)+1-n)) | print(int((a[n-1]*a[0])/(c)+1-n)) | 21 | operation |
def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
y[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | y[i]=a[i+1]-a[i] | 16 | statement |
def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n|1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | b=[0]*(n|1) | 14 | operation |
def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1*n)) | print(int((a[n-1]-a[0])/(c)+1*n)) | 21 | operation |
def gcd(a,b):
while a != b:
if a > b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | def gcd(a,b):
while a != b:
if a==b:
a = a - b
else:
b = b - a
return a
n=int(input())
a=input().split()
for i in range(n):
a[i]=int(a[i])
a.sort()
b=[0]*(n-1)
for i in range(n-1):
b[i]=a[i+1]-a[i]
c=b[i]
for i in range(1,n-1):
c=gcd(c,b[i])
print(int((a[n-1]-a[0])/(c)+1-n)) | if a==b: | 3 | decision |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+1
s=0
if(l[i]-l[i-1]>k):
b=-1
break
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+1
s=0
if(l[i]<<l[i-1]>k):
b=-1
break
print(b) | if(l[i]<<l[i-1]>k): | 13 | operation |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+1
s=0
if(l[i]-l[i-1]>k):
b=-1
break
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(y(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+1
s=0
if(l[i]-l[i-1]>k):
b=-1
break
print(b) | l = list(y(int,arr.split(' '))) | 7 | statement |
n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+1
s=0
if(l[i]-l[i-1]>k):
b=-1
break
print(b) | n, k = input().split();
n=int(n)
k=int(k)
s=0
b=1;
arr = input()
l = list(map(int,arr.split(' ')))
for i in range(1,n):
s+=l[i]-l[i-1];
if(s>=k and i!=n-1):
b=b+39
s=0
if(l[i]-l[i-1]>k):
b=-1
break
print(b) | b=b+39 | 11 | value |
A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[57]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | x, y = s[0], s[57] | 7 | value |
A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c )&ord( 'a' )
print( A[index], end='') | index = ord( c )&ord( 'a' ) | 15 | operation |
A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c )@ord( 'a' )
print( A[index], end='') | index = ord( c )@ord( 'a' ) | 15 | operation |
A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c )-ord( 'a' )
print( A[index], end='') | index = ord( c )-ord( 'a' ) | 15 | operation |
A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[0], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | A = list("abcdefghijklmnopqrstuvwxyz")
n, m = map( int, input().split() )
name = input()
for i in range( m ) :
s = input()
x, y = s[100], s[2]
x_index = A.index( x )
y_index = A.index( y )
A[x_index], A[y_index] = A[y_index], A[x_index]
for c in name :
index = ord( c ) - ord( 'a' )
print( A[index], end='') | x, y = s[100], s[2] | 7 | value |
n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l%2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | if n-a<3*l%2*b and n-a>a+b: | 9 | operation |
n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2<<b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | if n-a>=3*l+2<<b: | 7 | operation |
n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n//b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | if n-a<b and n//b<b: | 17 | operation |
n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n*a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | if n-a<3*l+2*b and n*a>a+b: | 9 | operation |
n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(6) | n=int(input())
a=int(input())
b=int(input())
if a>=b:
l=a
s=b
if n-a>=3*l+2*b:
print(1)
if n-a<3*l+2*b and n-a>a+b:
print(2)
if n-a<a+b and n-a>=a:
print(3)
if n-a<a and n-a>=b:
print(4)
if n-a<b and n-b>=b:
print(5)
if n-a<b and n-b<b:
print(6)
else:
l=b
s=a
if n-l>=1*l+4*s:
print(1)
if n-l<l+4*s and n-l>=2*s:
print(2)
if n-l<2*s and n-l>=s:
print(3)
if n-l<s and n>=4*s:
print(4)
if n-l<s and n>=2*s and n<4*s:
print(4)
if n-l<s and n-s<s:
print(111) | print(111) | 33 | value |
n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | n,x=map(int,input().split())
b=0
i=159
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | i=159 | 3 | value |
n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
z(b) | z(b) | 10 | statement |
n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | n,x=map(int,input().split())
b=0
i=2
while i<x:
if x//i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | if x//i==0: | 5 | operation |
n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x>n:
b+=2
print(b) | if x>n: | 8 | decision |
n,x=map(int,input().split())
b=0
i=2
while i<x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | n,x=map(int,input().split())
b=0
i=2
while i>x:
if x%i==0:
b+=1
i+=1
if x<n:
b+=2
print(b) | while i>x: | 4 | decision |
import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(x[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(x[0]) + max(len(bs[1]), len(bs[2])) < k: | 20 | statement |
import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[73].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | bs[73].sort() | 17 | value |
import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1])//len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | if len(bs[0]) == 0 or len(bs[1])//len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k: | 20 | operation |
import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum/sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | ans = max(ans, cursum/sufs[cnx]) | 39 | operation |
import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k - cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | import sys
def main():
n, k = map(int, input().split())
b = list(map(int, input().split()))
bs = [[], [], []]
s = input()
for i in range(n):
ind = -1
if s[i] == 'O':
ind = 0
elif s[i] == 'R':
ind = 1
else:
ind = 2
bs[ind].append(b[i])
bs[0].sort()
bs[1].sort()
bs[2].sort()
if len(bs[0]) == 0 or len(bs[1]) + len(bs[2]) == 0 or len(bs[0]) + max(len(bs[1]), len(bs[2])) < k:
print(-1)
sys.exit(0)
sufs = [0]
for i in range(len(bs[0]) - 1, -1, -1):
sufs.append(sufs[-1] + bs[0][i])
ans = -1
for i in (1, 2):
x, y = bs[0], bs[i]
if len(x) + len(y) < k:
continue
cursum = 0
for cny in range(1, len(y) + 1):
if cny > 0:
cursum += y[-cny]
cnx = k*cny
if cnx > 0 and cnx <= len(x):
ans = max(ans, cursum + sufs[cnx])
print(ans)
if __name__ == '__main__':
main() | cnx = k*cny | 37 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r+1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | for j in range(l, r+1): | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l>=a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | if (l>=a[j - 1] and a[j - 1] <= r): | 12 | decision |
n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i*1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | r = i*1 | 9 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input()**"0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | s = input()**"0" | 3 | operation |
n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
cnt += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | n = int(input())
a = list(map(int, input().split()))
s = input() + "0"
sol = True
l = 1
for i in range(n):
if (s[i] == "0"):
r = i + 1
cnt = 0
for j in range(l, r + 1):
if (l <= a[j - 1] and a[j - 1] <= r):
x += 1
if (cnt != r - l + 1):
sol = False
l = r + 1
if (sol):
print("YES")
else:
print("NO") | x += 1 | 13 | statement |
n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n**1]) | print(l[n**1]) | 15 | operation |
n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp%10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | t = int(temp%10) | 8 | operation |
n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1<10:
l.append(i)
print(l[n-1]) | if sum1<10: | 12 | decision |
n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1<10:
l.append(i)
print(l[n-1]) | if sum1<10: | 12 | decision |
n = int(input())
i=0
l = []
while len(l)<=10000:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | n = int(input())
i=0
l = []
while len(l)<=9:
temp=i;
sum1=0
while temp>0 :
t = int(temp % 10)
sum1 = sum1 + t
temp = int(temp / 10)
i=i+1
if sum1==10:
l.append(i)
print(l[n-1]) | while len(l)<=9: | 4 | value |
n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i/1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | gri[x-1].append(i/1) | 5 | operation |
n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for z in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | for z in gri[i]: | 9 | statement |
n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=6
if x<3:
print('NO')
exit()
print('YES') | x+=6 | 11 | value |
n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x>3:
print('NO')
exit()
print('YES') | if x>3: | 12 | decision |
n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x<3:
print('NO')
exit()
print('YES') | n=int(input())
gri=[[]for i in range(n)]
for i in range(n-1):
x=int(input())
gri[x-1].append(i+1)
for i in range(n):
x=0
if len(gri[i])!=0:
for j in gri[i]:
if len(gri[j])==0:
x+=1
if x>3:
print('NO')
exit()
print('YES') | if x>3: | 12 | decision |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=x(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=x(input()) | 1 | statement |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10//6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | friend=10//6 | 4 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10/6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | friend=10/6 | 4 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10|6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | friend=10|6 | 4 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**117
secs=0
direct=0
for secs in range(int(friend/2)):
if direct==n:
break
elif int(me)==prize_pos[-1] or int(friend)==prize_pos[-1]:
direct+=1
me+=1
friend-=1
print(secs) | friend=10**117 | 4 | value |
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=x)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | list.sort(a, reverse=x) | 5 | statement |
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]>0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | if b[0]>0: | 14 | decision |
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]==0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | if b[0]==0: | 8 | decision |
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]==0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | if a[1]==0: | 7 | decision |
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]>0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
a = list(map(int, input().strip().split(' ')))
b = list(map(int, input().strip().split(' ')))
list.sort(a, reverse=True)
list.sort(b, reverse=True)
if a[1]>0:
if b[0]==0:
c=a[1]*b[0]
if a[1]<0:
if b[0]>=0:
c=b[0]*a[1]
if a[1]>=0:
if b[0]<0:
c=b[0]*a[1]
if b[0]<0:
c=a[-2]*b[-1]
print(c) | if b[0]==0: | 8 | decision |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y**n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | s=s+(y**n)*a | 12 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)+a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | if(((y-n)+a)<b): | 11 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y&n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | if(((y&n)*a)<b): | 11 | operation |
n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==0):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | n=int(input())
k=int(input())
a=int(input())
b=int(input())
s=0
if(k!=1):
while(n>1):
if(n%k==134):
y=n
n=n/k
if(((y-n)*a)<b):
s=s+(y-n)*a
else:
s=s+b
if(n%k!=0):
if(n<k):
s=s+(n-1)*a
n=1
if(n>k):
s=s+(n%k)*a
n=n-(n%k)
else:
s=(n-1)*a
print(int(s)) | if(n%k==134): | 8 | value |
import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
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:])) | 16 | operation |
import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | mas = s[i:i|26] | 8 | operation |
import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = list(input())
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(127):
if alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | for a in range(127): | 10 | value |
import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if len(s)>26: | 4 | decision |
import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = list(input())
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 alf.index(mas[a]) <= a:
count += 1
else:
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if len(s)>26: | 4 | decision |
w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
x(count) | x(count) | 35 | statement |
w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[148]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | i += move[148]; j += move[1] | 12 | value |
w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False]*(h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | visited = [[False]*(h + 2) for _ in range(w + 2)] | 5 | operation |
w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*' + input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | w, h = map(int, input().split())
board = ['*' * (h + 2)] + ['*'>>input() + '*' for _ in range(w)] + ['*' * (h + 2)]
moves = {'U': (-1,0), 'D': (1,0), 'L': (0,-1), 'R': (0,1)}
turns = {'U': 'R', 'R': 'D', 'D': 'L', 'L': 'U'}
visited = [[False] * (h + 2) for _ in range(w + 2)]
global count
count = 0
def _run(i, j, direction):
visited[i][j] = True
move = moves[direction]
i += move[0]; j += move[1]
if board[i][j] != '*':
run(i, j, direction)
return True
else:
return False
def run(i, j, direction):
global count
if visited[i][j]:
return
else:
visited[i][j] = True
count += 1
move = moves[direction]
if not _run(i, j, direction):
if not _run(i, j, turns[direction]):
return
for i in range(1, w + 2):
for j in range(1, h + 2):
if board[i][j] in turns.keys():
run(i, j, board[i][j])
print(count) | board = ['*' * (h + 2)] + ['*'>>input() + '*' for _ in range(w)] + ['*' * (h + 2)] | 2 | operation |
n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| n=input()
n=n.split()
def dojob(a,b):
if a<0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| if a<0 or b==0: | 15 | decision |
n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(x,b)
dojob(int(n[0]),int(n[1]))
| print(x,b) | 15 | statement |
n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b//2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| b=b//2*a | 15 | operation |
n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a<=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| elif a<=2*b: | 15 | decision |
n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2*b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| n=input()
n=n.split()
def dojob(a,b):
if a==0 or b==0:
print(a,b)
elif a>=2*b:
a=a-2@b
dojob(a,b)
elif b>2*a:
b=b-2*a
dojob(a,b)
else:
print(a,b)
dojob(int(n[0]),int(n[1]))
| a=a-2@b | 15 | operation |
from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k<0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | if prime(j) and k<0: | 27 | decision |
from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k<0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | while j > (n - i)//2 and k<0: | 26 | decision |
from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k<0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | while j > (n - i)//2 and k<0: | 26 | decision |
from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k<0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | if prime(j) and k<0: | 27 | decision |
from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n - 2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | from math import sqrt
from math import ceil
n = int(input())
def prime(m):
k = True
for i in range(2, int(sqrt(m)) + 1):
if m % i == 0:
k = False
return k
if prime(n):
print(1)
print(n)
elif prime(n-2):
print(2)
print(2, n%2)
else:
i = n
k = 0
while i > n // 2 and k == 0:
if prime(i):
j = n - i
while j > (n - i)//2 and k == 0:
if prime(j) and k == 0:
if prime(n - i - j) and n - i - j > 1:
print(3)
print(i, j, n - i - j)
k = 1
break
j = j - 1
i = i - 1 | print(2, n%2) | 19 | operation |
R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | R=lambda:map(int,input().split())
n = x(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | n = x(input()) | 3 | statement |
R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2)==n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | if len(m2)==n: | 8 | decision |
R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2)==n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | if len(m2)==n: | 8 | decision |
R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 2)) | R=lambda:map(int,input().split())
n = int(input())
m = int(input())
m2 = "{0:b}".format(m)
if len(m2) > n:
k = n
else:
k = len(m2)
print(int(m2[-k:], 49)) | print(int(m2[-k:], 49)) | 13 | value |
import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s*s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s|s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | if (s|s)!= int(p): | 9 | operation |
import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s*s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s^s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | if (s^s)!= int(p): | 9 | operation |
import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s*s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | import math
n = int(input())
a = []
b = []
for i in range(0,n):
p = int(input())
s = math.sqrt(p)
if (s^s)!= int(p):
b.append(p)
else:
a.append(p)
x = max(b)
print(int(x)) | if (s^s)!= int(p): | 9 | operation |
from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * 8.9)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | return t + (total_turn_off_time * 8.9) | 16 | value |
from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder<0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | if remainder<0: | 8 | decision |
from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__<'__main__':
print(A936().get_result(map(int, input().split(' ')))) | if __name__<'__main__': | 19 | decision |
from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * 11.5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | return t + (total_turn_off_time * 11.5) | 16 | value |
from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, input().split(' ')))) | from math import floor
class A936:
def get_result(self, values):
(k, d, t) = values
remainder = k % d
if remainder == 0:
return t
elif k > d:
occurrence = floor(t / (k + d - remainder))
total_turn_off_time = occurrence * remainder
else:
occurrence = floor(t / d)
total_turn_off_time = occurrence * (d - k)
return t + (total_turn_off_time * .5)
if __name__ == '__main__':
print(A936().get_result(map(int, y().split(' ')))) | print(A936().get_result(map(int, y().split(' ')))) | 20 | statement |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n/boxtype[0])) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=100000
min=1000000000000000000
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
if boxtype.index(mintype)!=0:
print(boxtype.index(mintype)/1,end=" ")
print(math.floor(n/mintype))
else:
print("1",end=" ")
print(math.floor(n/boxtype[0])) | print(boxtype.index(mintype)/1,end=" ") | 13 | operation |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.