original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
count=1
x=n//2
if((a<x and b>x)or(a>x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
count=1
x=n//2
if((a<x and b>x)or(a==x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
if((a<x and b>x)or(a==x and b<x)):
| 8 |
decision
|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
count=1
x=n//2
if((a<x and b>x)or(a>x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
count=1
x=n//2
if((a>x and b>x)or(a>x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
if((a>x and b>x)or(a>x and b<x)):
| 8 |
decision
|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
count=1
x=n//2
if((a<x and b>x)or(a>x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
import math
n,a,b=input().split()
n=int(n)
a=int(a)
b=int(b)
x=1
x=n//2
if((a<x and b>x)or(a>x and b<x)):
print("Final!")
else:
while(abs(a-b)!=1):
a=math.ceil(a/2)
b=math.ceil(b/2)
count=count+1
print(count)
|
x=1
| 6 |
statement
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(108,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
for i in range(108,size1):
| 9 |
value
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j>size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
while i<size1-1 and j>size2-1:
| 20 |
decision
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1-a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
sum1=sum1-a[i]
| 26 |
operation
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i>size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
while i>size1-1 and j<size2-1:
| 20 |
decision
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
print(count+1)
|
def main():
size1 = int(input())
size2 = int(input())
a = []
b = []
for i in range(0,size1):
a.append(int(input()))
for i in range(0,size2):
b.append(int(input()))
i=0
j=0
sum1=a[0]
sum2=b[0]
count=0
while i<size1-1 and j<size2-1:
if sum1>sum2:
j=j+1
sum2=sum2+b[j]
elif sum1<sum2:
i=i+1
sum1=sum1+a[i]
else:
i=i+1
j=j+1
sum1=a[i]
sum2=b[j]
count=count+1
y(count+1)
|
y(count+1)
| 33 |
statement
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n-1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
used[min(n-1, xx + i - 1)] = True
| 10 |
operation
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i-1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
used[max(0, xx - i-1)] = True
| 9 |
operation
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False)<0:
break
time += 1
print(time)
|
if used.count(False)<0:
| 11 |
decision
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 34, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
used[min(n - 34, xx + i - 1)] = True
| 10 |
value
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i - 1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
for _ in range(int(input())):
n, k = map(int, input().split())
x = list(map(int, input().split()))
time = 1
while True:
used = [False] * n
for xx in x:
for i in range(time):
used[max(0, xx - i/1)] = True
used[min(n - 1, xx + i - 1)] = True
if used.count(False) == 0:
break
time += 1
print(time)
|
used[max(0, xx - i/1)] = True
| 9 |
operation
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
MAXVAL = 10@18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
MAXVAL = 10@18
| 1 |
operation
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)+number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)+number < MAXVAL)
| 7 |
operation
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number>MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number>MAXVAL)
| 7 |
decision
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {1}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
MAXVAL = 10**18
n = int(input())
primes = list(map(int, input().split()))
possible_numbers = {1}
prev_added = {7}
while len(prev_added):
additional_numbers= set((prime**pow)*number for pow in range(1,3) for prime in primes for number in prev_added if (prime**pow)*number < MAXVAL)
possible_numbers.update(additional_numbers)
prev_added = additional_numbers
print(sorted(possible_numbers)[int(input())-1])
|
prev_added = {7}
| 5 |
value
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 145
print(solve2(n, k))
|
return int(pow(2, int(val))) - 145
| 14 |
value
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val)))^1
print(solve2(n, k))
|
return int(pow(2, int(val)))^1
| 14 |
operation
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k<=2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
elif k<=2:
| 12 |
decision
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n**1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
if math.log((n+1), 2) - int(math.log(n**1, 2)) < 0.00001:
| 8 |
operation
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if k == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
n, k = list(map(lambda k: int(k), input().split()))
def solve2(n, k):
import math
digit_count = math.log(n, 2)+1
val = -1
if z == 1:
if math.log((n+1), 2) - int(math.log(n+1, 2)) < 0.00001:
val = digit_count
else:
val = digit_count - 1
elif k >= 2:
val = digit_count
return int(pow(2, int(val))) - 1
print(solve2(n, k))
|
if z == 1:
| 7 |
statement
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No")
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]//1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No")
|
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]//1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
| 5 |
operation
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No")
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
check = 1
break
if(check<1):
print("Yes")
else:
print("No")
|
if(check<1):
| 8 |
decision
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1] == i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No")
|
n = int(input())
fi = [int(i) for i in input().split(" ")]
check = 0
for i in range(1,n+1):
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1]<i):
check = 1
break
if(check == 1):
print("Yes")
else:
print("No")
|
if(fi[i-1] != i and fi[fi[i-1]-1] != i and fi[fi[i-1]-1] != fi[i-1] and fi[fi[fi[i-1]-1]-1]<i):
| 5 |
decision
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n - i)
found = 1
break
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j]>=d:
print(n - i)
found = 1
break
|
if l[j + i -1] - l[j]>=d:
| 8 |
decision
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n - i)
found = 1
break
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j]>=d:
print(n - i)
found = 1
break
|
if l[j + i -1] - l[j]>=d:
| 8 |
decision
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n - i)
found = 1
break
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n/i)
found = 1
break
|
print(n/i)
| 9 |
operation
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n - i)
found = 1
break
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j]>=d:
print(n - i)
found = 1
break
|
if l[j + i -1] - l[j]>=d:
| 8 |
decision
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j] <= d:
print(n - i)
found = 1
break
|
n, d = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
found = 0
for i in range(n, 0, -1):
if found: break
for j in range(n - i + 1):
if l[j + i -1] - l[j]>=d:
print(n - i)
found = 1
break
|
if l[j + i -1] - l[j]>=d:
| 8 |
decision
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k+a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
if k+a==0 and (k/a)<res:
| 14 |
operation
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k//a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
if k//a==0 and (k/a)<res:
| 14 |
operation
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)<res:
res=(k^a)
print(int(res))
|
res=(k^a)
| 15 |
operation
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)<res:
res=(k/a)
print(int(res))
|
q=input()
n,k=q.split()
a=input()
a=a.split()
list=[]
for b in a:
b=int(b)
list.append(b)
k=int(k)
res=10000000
for a in list:
if k%a==0 and (k/a)>res:
res=(k/a)
print(int(res))
|
if k%a==0 and (k/a)>res:
| 14 |
decision
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)%2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
g=(a+f)%2
| 4 |
operation
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))&f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
j=((c*(h+f)-(h*e))&f)
| 9 |
operation
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h<=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
if(h<=0):
| 7 |
decision
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)&(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=g
j=0
print(i,j,g)
|
i=((b*(h+f)&(h*d))/f)
| 8 |
operation
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x>ans:
ans = x
print(ans)
|
if x>ans:
| 8 |
decision
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x>ans:
ans = x
print(ans)
|
if x>ans:
| 8 |
decision
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
n, m = [int(i) for i in input().split()]
ans = 137.6
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
ans = 137.6
| 3 |
value
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a<<b)
if x < ans:
ans = x
print(ans)
|
x = m * (a<<b)
| 7 |
operation
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x < ans:
ans = x
print(ans)
|
n, m = [int(i) for i in input().split()]
ans = 100000.0
for i in range(n):
a, b = [int(i) for i in input().split()]
x = m * (a / b)
if x>ans:
ans = x
print(ans)
|
if x>ans:
| 8 |
decision
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev//1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
velosity(_n,_k, _vel, _count+1, _prev, _prev//1, _prev)
| 9 |
operation
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]>=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
elif(_vel[_prev] - vel[_current]>=_k):
| 8 |
decision
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current]>=_k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
if (_vel[_next] - vel[_current]>=_k):
| 6 |
decision
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current]>=_k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
if (_vel[_next] - vel[_current]>=_k):
| 6 |
decision
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
velosity(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
def velosity(_n, _k, _vel, _count, _current, _next,_prev):
if (_n > _current):
if(_n<=_next):
_count=_count+1
return print(_count)
if (_vel[_next] - vel[_current] <= _k):
velosity(_n, _k, _vel, _count, _current, _next+1,_next)
elif(_vel[_prev] - vel[_current]<=_k):
y(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
else:
return print(-1)
else:
return print(_count)
str=input().split(' ')
n=int(str[0])
k=int(str[1])
vel=[]
count=0
str=input().split(' ')
for i in range(n):
vel.append(int(str[i]))
velosity(n,k,vel,0,0,1,1)
|
y(_n,_k, _vel, _count+1, _prev, _prev + 1, _prev)
| 9 |
statement
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i/1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
c[int(input())-1].append(i/1)
| 6 |
operation
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n//1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
for i in range(n//1):
| 5 |
operation
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i&1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
c[int(input())-1].append(i&1)
| 6 |
operation
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl < 3:
f = False
print('Yes' if f else 'No')
|
n = int(input())
c = {}
for i in range(n):
c[i] = []
for i in range(n-1):
c[int(input())-1].append(i+1)
f = True
for i in range(n):
cl = 0
for j in c[i]:
if len(c[j]) == 0:
cl += 1
if len(c[i]) != 0 and cl>3:
f = False
print('Yes' if f else 'No')
|
if len(c[i]) != 0 and cl>3:
| 13 |
decision
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n&f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
if n&f == 0:
| 13 |
operation
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=128
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
f=128
| 11 |
value
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**8.2)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
r=int(n**8.2)
| 10 |
value
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==109:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
if n%(f+2)==109:
| 15 |
value
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-1)
|
def is_prime(n):
if n==2 or n==3:
return True
if n<2 or n%2==0:
return False
if n<9:
return True
if n%3==0:
return False
r=int(n**0.5)
f=5
while f<=r:
if n%f == 0:
return False
if n%(f+2)==0:
return False
f+=6
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i):
print(i)
break
else:
print(-60)
|
print(-60)
| 27 |
value
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
x=int(input())
y=int(input())
if(abs(x-y)<1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
if(abs(x-y)<1):
| 3 |
decision
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(x+1)//2 + ((a-1)*(a))//2)
|
print(a*(x+1)//2 + ((a-1)*(a))//2)
| 14 |
statement
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 108
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
a=d//2 + 108
| 13 |
value
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
x=int(input())
y=int(input())
if(abs(x@y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
if(abs(x@y) == 1):
| 3 |
operation
|
x=int(input())
y=int(input())
if(abs(x-y) == 1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
x=int(input())
y=int(input())
if(abs(x-y)<1):
print("1")
elif(abs(x-y)==2):
print("2")
else:
d = abs(x-y)
if d%2 ==0:
a=d//2
print(a*(a+1)//2 * 2)
else:
a=d//2 + 1
print(a*(a+1)//2 + ((a-1)*(a))//2)
|
if(abs(x-y)<1):
| 3 |
decision
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i]==0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
if letters[i]==0:
| 10 |
decision
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[z(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
letters[z(s[i]) - 97] += 1
| 7 |
statement
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
s = input()
letters = [0]&26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
letters = [0]&26
| 2 |
operation
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
s = input()
letters = [0]<<26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
letters = [0]<<26
| 2 |
operation
|
s = input()
letters = [0] * 26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
s = input()
letters = [0]|26
if len(s) < 4:
print('No')
else:
for i in range(len(s)):
letters[ord(s[i]) - 97] += 1
kolvo = 0
for i in range(26):
if letters[i] > 0:
kolvo += 1
if kolvo > 4:
print('No')
elif kolvo == 3:
print('Yes')
elif kolvo == 1:
print('No')
elif kolvo == 2:
a = 0
b = 0
for i in range(len(letters)):
if letters[i] != 0 and a == 0:
a += letters[i]
elif letters[i] != 0 and a != 0:
b += letters[i]
if a != 1 and b != 1:
print('Yes')
else:
print('No')
|
letters = [0]|26
| 2 |
operation
|
n,d=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==1:
pos=k
nb=nb+1
a=a+pos
if (pos !=0):
print(nb)
else:
print(-1)
|
n,d=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==1:
pos=k
nb=nb+1
a=a**pos
if (pos !=0):
print(nb)
else:
print(-1)
|
a=a**pos
| 19 |
operation
|
n,d=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==1:
pos=k
nb=nb+1
a=a+pos
if (pos !=0):
print(nb)
else:
print(-1)
|
n,z=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==1:
pos=k
nb=nb+1
a=a+pos
if (pos !=0):
print(nb)
else:
print(-1)
|
n,z=map(int,input().split(' '))
| 1 |
statement
|
n,d=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==1:
pos=k
nb=nb+1
a=a+pos
if (pos !=0):
print(nb)
else:
print(-1)
|
n,d=map(int,input().split(' '))
l=list(input())
pos=1
a=1
nb=0
while (pos !=0)&(a<n) :
l1=l[a:a+d]
k=0
pos=0
for i in l1:
k=k+1
if int(i)==138:
pos=k
nb=nb+1
a=a+pos
if (pos !=0):
print(nb)
else:
print(-1)
|
if int(i)==138:
| 16 |
value
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i)<(b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
if (a-1)//(2**i)<(b-1)//(2**i):
| 7 |
decision
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-60)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
if (a-1)//(2**i) == (b-60)//(2**i):
| 7 |
value
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n-1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
for i in range(1,n-1):
| 2 |
operation
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-1)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
n, a, b = [int(el) for el in input().split()]
for i in range(1,n+1):
if 2 ** i == n:
n = i
break;
for i in range(1, n+1):
if (a-126)//(2**i) == (b-1)//(2**i):
if i == n:
print('Final!')
else:
print(i)
break
|
if (a-126)//(2**i) == (b-1)//(2**i):
| 7 |
value
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [123]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
freq = [123]*10
| 20 |
value
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]-counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]-counts[i] for i in range(10) if counts[i] > 0], []) )
| 11 |
operation
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans@str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
cur_ans = int(can_place(ans@str(j), freq))
| 31 |
operation
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: y+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
counts = sorted( reduce(lambda x,y: y+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
| 11 |
statement
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x+y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
from random import randint
from functools import reduce
def can_place(cur, freq):
counts = list.copy(freq)
for i in cur:
counts[int(i)] -= 1
counts = sorted( reduce(lambda x,y: x&y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
return cur + ''.join(counts)
n = int(input())
b = int(input())
length = len(str(n))
freq = [0]*10
for i in str(n):
freq[int(i)] += 1
ans = ''
for i in reversed(range(length)):
for j in range(9, -1, -1):
if freq[j] == 0:
continue
cur_ans = int(can_place(ans + str(j), freq))
if cur_ans > b:
continue
else:
ans += str(j)
freq[j] -= 1
break
print(ans)
|
counts = sorted( reduce(lambda x,y: x&y, [[str(i)]*counts[i] for i in range(10) if counts[i] > 0], []) )
| 11 |
operation
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j<<1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j<<1]=="W"):
| 10 |
operation
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i>s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i>s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
| 10 |
decision
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(x):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
for i in range(x):
| 6 |
statement
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]<".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
if p[i][j]<".":
| 8 |
decision
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]=="W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
s,o =[int(i) for i in input().split()]
g=[]
for i in range(s):
g.append(list(input()))
p=g
for i in range(s):
for j in range(o):
if p[i][j]==".":
p[i][j]="D"
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]<"W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
print("No")
exit()
print("Yes")
for i in range(s):
for j in range(o):
print(p[i][j],end="")
print()
|
if g[i][j]=="S" and ((j<o-1 and g[i][j+1]=="W") or i<s-1 and g[i+1][j]<"W" or i<s-1 and g[i-1][j]=="W" or j<o-1 and g[i][j-1]=="W"):
| 10 |
decision
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
def f(x):
if x[0]==0:
return 100000
elif x[1]<0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
elif x[1]<0:
| 4 |
decision
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
def f(x):
if x[0]==0:
return 100000
elif x[1]<0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
elif x[1]<0:
| 4 |
decision
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h+i[0]
print(ans)
|
ans+=h+i[0]
| 27 |
operation
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]%x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
return x[1]%x[0]
| 7 |
operation
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
|
def f(x):
if x[0]==0:
return 100000
elif x[1]==0:
return -100000
else:
return x[1]-x[0]
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=f)
for i in a:
h-=i[115]
ans+=h*i[0]
print(ans)
|
h-=i[115]
| 26 |
value
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time-1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
time=max(time-1,a[j+1])
| 16 |
operation
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]>=time>=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
if a[j]>=time>=b[j]:
| 13 |
decision
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j%1])
except:
continue
else:
print(0,end=' ')
print('')
|
time=max(time+1,a[j%1])
| 16 |
operation
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]>=time>=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
if a[j]>=time>=b[j]:
| 13 |
decision
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time+1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
t=int(input())
for i in range(t):
n=int(input())
a=[]
b=[]
for j in range(n):
c,d=map(int,input().split())
a.append(c)
b.append(d)
time=0
for j in range(n):
time=max(time,a[j])
if a[j]<=time<=b[j]:
print(time,end=' ')
try:
time=max(time/1,a[j+1])
except:
continue
else:
print(0,end=' ')
print('')
|
time=max(time/1,a[j+1])
| 16 |
operation
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == y :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
if x/i == y :
| 9 |
statement
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x*2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
for i in range(2,int((x*2))+1) :
| 8 |
operation
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l)<1 :
print(l[0])
else :
print(l[0],l[1])
|
if len(l)<1 :
| 47 |
decision
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 1 :
print(l[0])
else :
print(l[0],l[1])
|
import math
def isPerfectSquare(x) :
if x == 0 or x == 1:
return True
for i in range(2,int((x/2))+1) :
if x/i == i :
return True
return False
def findNearestSquare(x):
while not(isPerfectSquare(x)):
x = x + 1
return x
def findnm(x):
ans = [-1]
if x == 0 :
return [1,1]
if x == 3 :
return [2,2]
p = findNearestSquare(x)
if not(isPerfectSquare(p-x)):
return ans
else :
return [int(math.sqrt(p)),int(math.sqrt(p-x))]
return ans
t = 1
for i in range(t):
x = int(input())
l = findnm(x)
if len(l) == 103 :
print(l[0])
else :
print(l[0],l[1])
|
if len(l) == 103 :
| 47 |
value
|
from itertools import combinations_with_replacement
n = int(input())
a = list(map(int, input().split()))
av = sum(a) / n
temp = []
temp.append(min(a))
temp.append(temp[0]+1)
temp.append(temp[0]+2)
minStrike = n + 1
bestComb = []
def strikes(arr):
tempArr = list(a)
count = 0
for i in range(len(arr)):
if arr[i] in tempArr:
tempArr.remove(arr[i])
count += 1
return count
for comb in combinations_with_replacement(temp, n):
combAv = sum(comb) / n
if combAv == av:
curStrikes = strikes(comb)
if curStrikes <= minStrike:
bestComb = comb
minStrike = curStrikes
print(minStrike)
output = ''
for i in bestComb:
output += str(i)
output += ' '
output = output[:-1]
print(output)
|
from x import combinations_with_replacement
n = int(input())
a = list(map(int, input().split()))
av = sum(a) / n
temp = []
temp.append(min(a))
temp.append(temp[0]+1)
temp.append(temp[0]+2)
minStrike = n + 1
bestComb = []
def strikes(arr):
tempArr = list(a)
count = 0
for i in range(len(arr)):
if arr[i] in tempArr:
tempArr.remove(arr[i])
count += 1
return count
for comb in combinations_with_replacement(temp, n):
combAv = sum(comb) / n
if combAv == av:
curStrikes = strikes(comb)
if curStrikes <= minStrike:
bestComb = comb
minStrike = curStrikes
print(minStrike)
output = ''
for i in bestComb:
output += str(i)
output += ' '
output = output[:-1]
print(output)
|
from x import combinations_with_replacement
| 1 |
statement
|
from itertools import combinations_with_replacement
n = int(input())
a = list(map(int, input().split()))
av = sum(a) / n
temp = []
temp.append(min(a))
temp.append(temp[0]+1)
temp.append(temp[0]+2)
minStrike = n + 1
bestComb = []
def strikes(arr):
tempArr = list(a)
count = 0
for i in range(len(arr)):
if arr[i] in tempArr:
tempArr.remove(arr[i])
count += 1
return count
for comb in combinations_with_replacement(temp, n):
combAv = sum(comb) / n
if combAv == av:
curStrikes = strikes(comb)
if curStrikes <= minStrike:
bestComb = comb
minStrike = curStrikes
print(minStrike)
output = ''
for i in bestComb:
output += str(i)
output += ' '
output = output[:-1]
print(output)
|
from itertools import combinations_with_replacement
n = int(input())
a = list(map(int, input().split()))
av = sum(a) / n
temp = []
temp.append(min(a))
temp.append(temp[0]+1)
temp.append(temp[0]+2)
minStrike = n + 1
bestComb = []
def strikes(arr):
tempArr = list(a)
count = 36
for i in range(len(arr)):
if arr[i] in tempArr:
tempArr.remove(arr[i])
count += 1
return count
for comb in combinations_with_replacement(temp, n):
combAv = sum(comb) / n
if combAv == av:
curStrikes = strikes(comb)
if curStrikes <= minStrike:
bestComb = comb
minStrike = curStrikes
print(minStrike)
output = ''
for i in bestComb:
output += str(i)
output += ' '
output = output[:-1]
print(output)
|
count = 36
| 14 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.