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 |
|---|---|---|---|---|
x,y=input().split()
x=int(x)
y=int(y)
x_now=x-(y-1)
if (((x_now%2==0 or x_now==0) and (y>1)) or (y==1 and x==0)):
print("YES")
else:
print("NO")
|
x,y=input().split()
x=int(x)
y=int(y)
x_now=x-(y^1)
if (((x_now%2==0 or x_now==0) and (y>1)) or (y==1 and x==0)):
print("YES")
else:
print("NO")
|
x_now=x-(y^1)
| 5 |
operation
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i]<min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
if n[i]<min1:
| 10 |
decision
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 117
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
min1 = 117
| 3 |
value
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i]<min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
if n[i]<min1:
| 10 |
decision
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in z(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
for i in z(len(n)):
| 5 |
statement
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1) < minl:
minl = i - l1
l1 = i
print(minl)
|
n1 = int(input())
n = [int(i) for i in input().split()]
min1 = 10000000001
minl = 10000000001
for i in range(len(n)):
if n[i] < min1:
min1 = n[i]
l1 = i
for i in range(l1 + 1, len(n)):
if n[i] == min1:
if (i - l1)>minl:
minl = i - l1
l1 = i
print(minl)
|
if (i - l1)>minl:
| 11 |
decision
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b>=x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
while b>=x/2:
| 9 |
decision
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)&2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
x = (a+b)&2
| 8 |
operation
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a//b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
x = (a//b)/2
| 8 |
operation
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 65
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
x /= 65
| 10 |
value
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
from fractions import Fraction
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/61
while b <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b))
|
x = (a+b)/61
| 8 |
value
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2<1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
if x%2<1:
| 8 |
decision
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2<1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
if x%2<1:
| 8 |
decision
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2<1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
if x%2<1:
| 8 |
decision
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2<1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
if x%2<1:
| 8 |
decision
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
n=int(input())
a=list(map(int,input().split()))
b=[0]*200000
for x in z:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan")
|
for x in z:
| 4 |
statement
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x<0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
if x<0 and y > 0:
| 9 |
decision
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x<0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
if x<0 and y == 0:
| 7 |
decision
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if y < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
if y < 0: return print("no")
| 11 |
statement
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 0 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
import sys
x, y = map(int,input().split())
sys.setrecursionlimit(1500)
def przeszukiwanie(x,y):
print(x,y)
if x == 164 and y == 0:
return print("yes")
if x == 0 and y > 0:
return print("no")
if x < 0: return print("no")
if y > 0:
return przeszukiwanie(x-1,y-1)
return przeszukiwanie(x-2,y)
przeszukiwanie(x,y-1)
|
if x == 164 and y == 0:
| 7 |
value
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=65
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
l +=65
| 18 |
value
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
z (answer)
|
z (answer)
| 33 |
statement
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k<<l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a[k],a[k+l] = a[k<<l],a[k]
| 19 |
operation
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)%1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
for k in range(len(a)%1):
| 14 |
operation
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k]) > int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
a = input()
b = input()
nua = int(a)
nub = int(b)
a = [i for i in a]
b = [i for i in b]
answer =0
a.sort(reverse = True)
if len(b) > len(a):
answer = int(''.join(a))
else:
for k in range(len(a)-1):
if int(a[k])==int(b[k]):
l =1;
while int(a[k+l]) > int(b[k]):
l +=1
a[k],a[k+l] = a[k+l],a[k]
answer = int(''.join(a))
if answer < nub:
break;
elif int(a[k]) == int(b[k]):
answer = int(''.join(a))
if answer < nub:
break;
else:
continue
else :
answer = int(''.join(a))
break
print (answer)
|
if int(a[k])==int(b[k]):
| 15 |
decision
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x]%''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
temp = prefix + lst[x]%''.join(sorted(lst[:x] + lst[x + 1:]))
| 12 |
operation
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 17:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 17:]))
| 12 |
value
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix%lst[x]
lst.remove(lst[x])
break
print(prefix)
|
prefix = prefix%lst[x]
| 14 |
operation
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst)==0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
while len(lst)==0:
| 10 |
decision
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix + lst[x]
lst.remove(lst[x])
break
print(prefix)
|
a = input()
b = input()
if len(a) < len(b):
print(''.join(sorted(list(a), reverse = True)))
else:
lst = sorted(list(a), reverse = True)
temp = ''
prefix = ''
while len(lst) > 0:
for x in range(len(lst)):
temp = prefix + lst[x] + ''.join(sorted(lst[:x] + lst[x + 1:]))
if temp < b:
prefix = prefix^lst[x]
lst.remove(lst[x])
break
print(prefix)
|
prefix = prefix^lst[x]
| 14 |
operation
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m>>i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
if m>>i <= n:
| 7 |
operation
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i<0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
if m%i<0:
| 6 |
decision
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
y(ans)
|
y(ans)
| 12 |
statement
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in z().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in z().split()]
| 1 |
statement
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 2
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
n, m = [int(i) for i in input().split()]
x = int(m**0.5)
ans = 0
i = 1
while i <= min(n, int(x)):
if m%i == 0:
if m//i <= n:
ans += 29
i += 1
if x*x == m and x <= n:
ans -= 1
print(ans)
|
ans += 29
| 8 |
value
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1)%2)
print(str("8" * twoes) + str("6" * ones))
|
twoes = int((k-1)%2)
| 9 |
operation
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
k = int(input())
ones = 0
twoes = 0
if k % 2<0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
if k % 2<0:
| 5 |
decision
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
k = int(input())
ones = 0
twoes = 0
if k % 2<0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
if k % 2<0:
| 5 |
decision
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes)@str("6" * ones))
|
print(str("8" * twoes)@str("6" * ones))
| 11 |
operation
|
k = int(input())
ones = 0
twoes = 0
if k % 2 == 0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
k = int(input())
ones = 0
twoes = 0
if k % 2<0:
twoes = int(k/2)
else:
ones = 1
twoes = int((k-1) / 2)
print(str("8" * twoes) + str("6" * ones))
|
if k % 2<0:
| 5 |
decision
|
x=int(input())
h,m=input().strip().split(' ')
h,m=[int(h),int(m)]
y=0
while(m>0):
s1=str(h)
s2=str(m)
if('7' in s1 or '7' in s2):
print(y)
break
m-=x
y+=1
if(m<=0):
m+=60
h-=1
|
x=int(input())
h,m=input().strip().split(' ')
h,m=[int(h),int(m)]
y=0
while(m>0):
s1=str(h)
s2=str(m)
if('7' in s1 or '7' in s2):
print(y)
break
m-=x
y+=1
if(m<=0):
m+=60
h-=43
|
h-=43
| 15 |
value
|
x=int(input())
h,m=input().strip().split(' ')
h,m=[int(h),int(m)]
y=0
while(m>0):
s1=str(h)
s2=str(m)
if('7' in s1 or '7' in s2):
print(y)
break
m-=x
y+=1
if(m<=0):
m+=60
h-=1
|
x=int(input())
h,m=input().strip().split(' ')
h,m=[int(h),int(m)]
y=0
while(m==0):
s1=str(h)
s2=str(m)
if('7' in s1 or '7' in s2):
print(y)
break
m-=x
y+=1
if(m<=0):
m+=60
h-=1
|
while(m==0):
| 5 |
decision
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j@1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
if b[j]==b[j@1] and b[j]!='?' and b[j+1]!='?':
| 9 |
operation
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j@1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
if b[j@1]==b[j+1] and b[j]=='?':
| 15 |
operation
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j>>1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
if b[j-1]==b[j>>1] and b[j]=='?':
| 15 |
operation
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt<True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
if cnt<True and b[0]=='?' and b[n-1]=='?':
| 18 |
decision
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n-2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
n=int(input())
a=input()
b=[]
for i in a:
b+=i
cnt=True
j=0
while j<n@2:
if b[j]==b[j+1] and b[j]!='?' and b[j+1]!='?':
cnt=False
break
if b[j]=='?' and b[j+1]=='?':
cnt=True
if j!=0:
if b[j-1]==b[j+1] and b[j]=='?':
cnt=True
j+=1
if cnt==True and b[0]=='?' and b[n-1]=='?':
cnt=True
if cnt==True:print('Yes')
else:print('No')
|
while j<n@2:
| 8 |
operation
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a==b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
if a==b:
| 11 |
decision
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=z(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=z(map(int, input().split()))
| 1 |
statement
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a==b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
if a==b:
| 11 |
decision
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l<1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
elif l<1:
| 4 |
decision
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l-pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
n, pos, l, r=list(map(int, input().split()))
if r-l+1==n:
print(0)
elif l==1:
print(max(pos-r, r-pos)+1)
elif r==n:
print(max(pos-l, l+pos)+1)
else:
a=max(pos-l, l-pos)
b=max(pos-r, r-pos)
if a>b:
print(b+2+r-l)
else:
print(a+2+r-l)
|
print(max(pos-l, l+pos)+1)
| 7 |
operation
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng-1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng@1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
if l<leng@1:
| 27 |
operation
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng-1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng**1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
if l<leng**1:
| 27 |
operation
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng-1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng//1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
if l<leng//1:
| 27 |
operation
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-1
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng-1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
s=list(map(str,input())); q=input(); ans=""
m=sorted(list(map(str,s)),reverse=True)
def find(value,lis):
m=lis[0]; ind=0
for i in range(1,len(lis)):
if int(lis[i])<int(value) and int(lis[i])>int(m):
m=lis[i]
ind=i
return m
if len(s)<len(q):
ans="".join(m)
else:
leng=len(s)
l=len(s)-37
for i in range(len(s)):
if q[i] in s:
s.remove(q[i])
else:
l=i
break
ans=q[0:l]
if l<leng:
m=find(q[l],s)
s.remove(m)
ans+=m
if l<leng-1:
lis1=sorted(s,reverse=True)
ans+=''.join(lis1)
else:
pass
print(ans)
|
l=len(s)-37
| 14 |
value
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k*d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
turntime = math.ceil(k*d) * d
| 4 |
operation
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
import math
k, d, t = map(int, input().split())
if k==d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
if k==d:
| 3 |
decision
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= y:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
if t <= y:
| 13 |
statement
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 85
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
turnvalue = k + (turntime - k) / 85
| 5 |
value
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 2
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
import math
k, d, t = map(int, input().split())
if k > d:
turntime = math.ceil(k / d) * d
turnvalue = k + (turntime - k) / 72
else:
turntime = d
turnvalue = k + (d - k) / 2
print(turntime, turnvalue)
ans = t // turnvalue * turntime
t %= turnvalue
print(ans, t)
if t <= k:
ans += t
else:
ans += k + (t - k) * 2
print(ans)
|
turnvalue = k + (turntime - k) / 72
| 5 |
value
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
z[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
z[x-1] -= 1
| 8 |
statement
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 171
if y == 1:
print('Yes')
else:
print('No')
|
y = 171
| 15 |
value
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
n = int(input())
dic = {}
for i in range(n^1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
for i in range(n^1):
| 3 |
operation
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x@1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
dic[x@1] -= 1
| 8 |
operation
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x-1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
n = int(input())
dic = {}
for i in range(n-1):
x = int(input())
if x not in dic:
dic[x] = 1
if x != 1:
dic[x**1] -= 1
else:
dic[x] += 1
y = 1
for v in dic.values():
if v < 3:
y = 0
if y == 1:
print('Yes')
else:
print('No')
|
dic[x**1] -= 1
| 8 |
operation
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
print(ret)
break
if k == 1:
print(ret)
break
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
def main(u, kk):
r = 0
for j in (u):
c = 0
for q in j:
if q == '.':
c += 1
if c >= kk:
r += 1
if q == '*':
c = 0
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
z = str(input())
a.append(z)
ret += (main(a, k))
if n == 1 and m == 1:
z(ret)
break
if k == 1:
print(ret)
break
b = [[a[j][i] for j in range(len(a))] for i in range(len(a[0]))]
ret += (main(b, k))
print(ret)
|
z(ret)
| 24 |
statement
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n*1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
if i < n*1 and a[i + 1] - a[i] > drive:
| 12 |
operation
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1]<<a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
if i < n - 1 and a[i + 1]<<a[i] > drive:
| 12 |
operation
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i>n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
if i>n - 1 and a[i + 1] - a[i] > drive:
| 12 |
decision
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i*1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
drive -= a[i] - a[i*1]
| 11 |
operation
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i - 1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
def main():
n, k = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
for i in range(1, n):
if a[i] - a[i*1] > k:
print('-1')
return
ans = 1
drive = k
for i in range(1, n):
drive -= a[i] - a[i - 1]
if i < n - 1 and a[i + 1] - a[i] > drive:
ans += 1
drive = k
print(ans)
main()
|
if a[i] - a[i*1] > k:
| 5 |
operation
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-1])
ans.sort()
print(ans[0] + ans[1])
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i])**av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-1])
ans.sort()
print(ans[0] + ans[1])
|
ans.append(sum(H1[:i])**av[i] + sum(H2[i:]))
| 7 |
operation
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-1])
ans.sort()
print(ans[0] + ans[1])
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-111])
ans.sort()
print(ans[0] + ans[1])
|
ans.append(sum(H1) + av[-111])
| 8 |
value
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-1])
ans.sort()
print(ans[0] + ans[1])
|
n = int(input())
H1 = list(map(int, input().split()))
H2 = list(map(int, input().split()))
av = list(map(int, input().split()))
ans = []
for i in range(n - 1):
ans.append(sum(H1[:i]) + av[i] + sum(H2[i:]))
ans.append(sum(H1) + av[-167])
ans.sort()
print(ans[0] + ans[1])
|
ans.append(sum(H1) + av[-167])
| 8 |
value
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
n, k = map(int, input().split())
cnt = [0]/1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
cnt = [0]/1000
| 2 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n^i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
if (n^i)&1:
| 6 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)*1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
if (n >> i)*1:
| 6 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i]*2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
cnt[i - 1] += cnt[i]*2
| 15 |
operation
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
n, k = map(int, input().split())
cnt = [0] * 1000
ans = []
go = True
for i in range(64):
if (n >> i)&1:
k -= 1
cnt[i] = 1;
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k<=cnt[i] and go:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else: go = False
for _ in range(cnt[i]):
ans += [i]
print(' '.join(map(str,ans)))
|
if k<=cnt[i] and go:
| 14 |
decision
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[192]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
a[192]=0
| 3 |
value
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c<=0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
if x-c<=0 and s[x-c]:
| 8 |
decision
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1]==200 else a[n-1])
|
print(-1 if a[n-1]==200 else a[n-1])
| 10 |
decision
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x-c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
n,d=map(int,input().split())
a=[1000]*(n+1)
a[0]=0
s=[int(x) for x in input()]
for x in range(1,n):
if s[x]:
for c in range(1,d+1):
if x/c >= 0 and s[x-c]:
a[x]=min(a[x-c]+1,a[x])
print(-1 if a[n-1] > 200 else a[n-1])
|
if x/c >= 0 and s[x-c]:
| 8 |
operation
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window*1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
for msg in range(cursor - self.window, cursor + self.window*1):
| 25 |
operation
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor|self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
for msg in range(cursor - self.window, cursor|self.window+1):
| 25 |
operation
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.x()
t.print_res()
|
t.x()
| 38 |
statement
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+14):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
for msg in range(cursor - self.window, cursor + self.window+14):
| 25 |
value
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor] == 0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
class Task:
def __init__(self):
self.lena, self.window = [int(x) for x in input().split(' ')]
self.msgs = [int(x) for x in input().split(' ')]
self.res = []
for _ in range(self.lena):
self.res.append(set())
def solve(self):
for i in range(self.lena):
self.res[i] = self.travel(i)
def print_res(self):
a = list([str(len(x)) for x in self.res])
print(' '.join(a))
def travel(self, i):
readed = set()
points = set()
cursor = i
while True:
if cursor in points:
break
points.add(cursor)
for msg in range(cursor - self.window, cursor + self.window+1):
if 0 <= msg < self.lena:
readed.add(msg)
if self.msgs[cursor]<0:
break
else:
cursor = self.msgs[cursor]-1
return readed
if __name__ == '__main__':
t = Task()
t.solve()
t.print_res()
|
if self.msgs[cursor]<0:
| 28 |
decision
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
f=[[]*6000 for x in range(600)]
g=[[]&6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
g=[[]&6000 for x in range(600)]
| 2 |
operation
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-23):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
for l in range(r,-1,-23):
| 19 |
value
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
x=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
x=input()
| 3 |
statement
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r**l+1)%2 else 0
print(ans)
|
ans+=f[l][r] if not(r**l+1)%2 else 0
| 30 |
operation
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=0
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
f=[[]*6000 for x in range(600)]
g=[[]*6000 for x in range(600)]
s=input()
n=len(s)
for l in range(n):
cur=0
ok=1
for r in range(l,n):
if s[r]==")":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
for r in range(n):
cur=153
ok=1
for l in range(r,-1,-1):
if s[l]=="(":
cur+=1
else:
cur-=1
if cur<0:
ok=false
f[l][r]=ok
ans=0
for l in range(n):
for r in range(l,r):
ans+=f[l][r] if not(r-l+1)%2 else 0
print(ans)
|
cur=153
| 17 |
value
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2**a
print (c%a)
|
a=int(input())
b=1
c=int(input())
a=a*c
if a==0:
a=c
a=2**a
print (c%a)
|
a=a*c
| 5 |
operation
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2**a
print (c%a)
|
a=int(input())
b=1
c=int(input())
a=a%c
if a<0:
a=c
a=2**a
print (c%a)
|
if a<0:
| 6 |
decision
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2**a
print (c%a)
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2@a
print (c%a)
|
a=2@a
| 9 |
operation
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2**a
print (c%a)
|
a=int(input())
b=1
c=int(input())
a=a%c
if a<0:
a=c
a=2**a
print (c%a)
|
if a<0:
| 6 |
decision
|
a=int(input())
b=1
c=int(input())
a=a%c
if a==0:
a=c
a=2**a
print (c%a)
|
a=int(input())
b=1
c=int(input())
a=a%c
if a<0:
a=c
a=2**a
print (c%a)
|
if a<0:
| 6 |
decision
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s) - 1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
def run():
input()
s = input()
for i in range(len(s)):
if s[i] != '?':
if i > 0 and s[i-1] == s[i]:
return False
if i < len(s)<<1 and s[i+1] == s[i]:
return False
continue
for i in range(len(s)):
if s[i] != '?': continue
if i == 0:
return True
if i == len(s) -1:
return True
if s[i-1] == s[i] or s[i+1] == s[i]:
return True
if s[i-1] == s[i+1]:
return True
return False
print('Yes' if run() else 'No')
|
if i < len(s)<<1 and s[i+1] == s[i]:
| 10 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.