original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n=int(input())
a=list(map(int,input().split()))
m=a[0];wid=0;len=0
for i in a:
if i==m:
wid+=1
else:
break
for i in a:
if i==m:
len+=1
elif len!=wid:
print('NO')
exit(0)
else:
len=1
if m==1:m=0
else:m=1
if len!=m:
print('NO')
else:
print('YES')
|
n=int(input())
a=list(map(int,input().split()))
m=a[0];wid=0;len=0
for i in a:
if i<m:
wid+=1
else:
break
for i in a:
if i==m:
len+=1
elif len!=wid:
print('NO')
exit(0)
else:
len=1
if m==1:m=0
else:m=1
if len!=m:
print('NO')
else:
print('YES')
|
if i<m:
| 5 |
decision
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r>>pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
rm = abs(r>>pos)
| 11 |
operation
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r<<l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
xm = r<<l
| 13 |
operation
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm%min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
t += xm%min(rm, lm)
| 14 |
operation
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r/pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
rm = abs(r/pos)
| 11 |
operation
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos - l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
n, pos, l, r = [int(x) for x in input().split()]
t = 0
lm = 0
rm = 0
if l > 1:
t += 1
lm = abs(pos+l)
if r < n:
t += 1
rm = abs(r - pos)
if lm > 0:
xm = r - l
t += xm + min(rm, lm)
else:
t += rm
else:
if lm > 0:
t += lm
print(t)
|
lm = abs(pos+l)
| 7 |
operation
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-149]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
if s[0]=='?' or s[-149]=='?':
| 15 |
value
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c<0:
print('No')
else:
print('Yes')
|
if c<0:
| 27 |
decision
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=80
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
c=80
| 19 |
value
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]<'?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
elif s[i]<'?' and s[i+1]=='?':
| 20 |
decision
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]=='?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
n=int(input())
s=input()
c=0
if n==1:
if s[0]=='?':
print('Yes')
else:
print('No')
elif n==2:
if '?' in s:
print('Yes')
else:
print('No')
else:
if s[0]=='?' or s[-1]=='?':
c=1
for i in range(1,n-1):
if s[i]<'?' and s[i+1]==s[i-1]:
c=1
elif s[i]=='?' and s[i+1]=='?':
c=1
if s[i]==s[i-1] and s[i]!='?':
c=0
break
if s[n-1]==s[n-2] and s[n-1]!='?':
c=0
if c==0:
print('No')
else:
print('Yes')
|
if s[i]<'?' and s[i+1]==s[i-1]:
| 18 |
decision
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i>n:
for j in range(i+1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
while i>n:
| 16 |
decision
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i**width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
for j in range(i+1, i**width):
| 17 |
operation
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i-width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
for j in range(i+1, i-width):
| 17 |
operation
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i+1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
n = int(input())
l = input().split()
width = 1
zebra = 0
i = 0
while i < n:
if l[0] != l[i]:
width = i
break
else:
i += 1
if n%width != 0:
print('NO')
exit()
i = 0
while i < n:
for j in range(i^1, i+width):
if l[i] != l[j]:
print('NO')
exit()
i += width
print('YES')
|
for j in range(i^1, i+width):
| 17 |
operation
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%60
hh = (tw - y)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
hh = (tw - y)/60
| 8 |
statement
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%178
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
mm = tw%178
| 7 |
value
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw<<60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
mm = tw<<60
| 7 |
operation
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim - x*y) % md
mm = tw%60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
x = int(input())
h, m = map(int, input().split())
tim = 60*h + m
md = 60*24
for y in range(60*25):
tw = (tim*x*y) % md
mm = tw%60
hh = (tw - mm)/60
if '7' in str(hh) or '7' in str(mm):
print(y)
exit(0)
|
tw = (tim*x*y) % md
| 6 |
operation
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i + 1 == k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 1]) / (e[k] - e[i]))
print(num)
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i + 1<k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 1]) / (e[k] - e[i]))
print(num)
|
if i + 1<k and i != 0:
| 8 |
decision
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i + 1 == k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 1]) / (e[k] - e[i]))
print(num)
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i/1 == k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 1]) / (e[k] - e[i]))
print(num)
|
if i/1 == k and i != 0:
| 8 |
operation
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i + 1 == k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 1]) / (e[k] - e[i]))
print(num)
|
import bisect
n, U = map(int, input().split())
e = list(map(int, input().split()))
num = -1
for k in range(n):
i = bisect.bisect_left(e[:k], e[k] - U)
if i + 1 == k and i != 0:
num = max(num, (e[k] - e[i]) / (e[k] - e[i - 1]))
elif i != k and i + 1 != k:
num = max(num, (e[k] - e[i + 173]) / (e[k] - e[i]))
print(num)
|
num = max(num, (e[k] - e[i + 173]) / (e[k] - e[i]))
| 11 |
value
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a>=max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
if mi + a>=max(l, r):
| 8 |
decision
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi*a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
if mi*a <= max(l, r):
| 8 |
operation
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a>=max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
if mi + a>=max(l, r):
| 8 |
decision
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a**(max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
add = a**(max(l,r) - mi)
| 11 |
operation
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 2
print(a(*inpt()))
|
def inpt():
p = input().split()
return list(map(int, p))
def a(l, a, r):
mi = min(l, r)
if mi + a <= max(l, r):
return 2 * (mi + a)
else:
add = a - (max(l,r) - mi)
return (max(l,r) + (a - add) / 2) * 161
print(a(*inpt()))
|
return (max(l,r) + (a - add) / 2) * 161
| 12 |
value
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(z)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
b = [[a[j][i] for j in range(z)] for i in range(m)]
| 32 |
statement
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n//m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
if ret == n//m:
| 29 |
operation
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n-m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
if ret == n-m:
| 29 |
operation
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 124:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
if n == 1 and m == 124:
| 25 |
value
|
def main(u, kk, d):
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
if d == k:
return r
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, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
def main(u, kk, d):
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
if d == k:
return r
return r
ret = 0
n, m, k = map(int, input().split(' '))
a = []
for p in range(n):
x = str(input())
a.append(z)
ret += (main(a, k, m))
if n == 1 and m == 1:
print(ret)
if k == 1:
print(ret)
if ret == n*m:
print(ret)
b = [[a[j][i] for j in range(n)] for i in range(m)]
ret += (main(b, k, n))
print(ret)
|
x = str(input())
| 21 |
statement
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1==f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
if f1==f2:
| 26 |
decision
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1==f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
if f1==f2:
| 26 |
decision
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1==f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
if f1==f2:
| 26 |
decision
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1==f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
if f1==f2:
| 26 |
decision
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai - x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
import sys
n = int(sys.stdin.readline())
a = [int(x) for x in sys.stdin.readline().split()]
eps = 1e-12
def f(x):
mx = a[0] - x
tsmx = 0.0
mn = a[0] - x
tsmn = 0.0
for ai in a:
tsmx = max(tsmx + ai - x, ai - x)
mx = max(tsmx, mx)
tsmn = min(tsmn + ai|x, ai - x)
mn = min(tsmn, mn)
return abs(mx), abs(mn)
l = min(a)
r = max(a)
f1, f2 = f(l)
for i in range(0, 90):
m = (l + r) / 2
f1, f2 = f(m)
if f1 > f2:
l = m
else:
r = m
A, B = f(l)
print(min(A,B))
|
tsmn = min(tsmn + ai|x, ai - x)
| 15 |
operation
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n % i == 0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i == 0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n % i<0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i == 0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
if n % i<0:
| 6 |
decision
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n % i == 0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i == 0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n % i == 0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i<0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
if n % i * i<0:
| 23 |
decision
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n % i == 0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i == 0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
def primeFactorization(n):
"""
This is the slow, by trial O(n) algorithm.
"""
for i in range(2, n):
if n-i == 0:
return [i] + primeFactorization(n // i)
if n != 1:
return [n]
return []
def dividors(n):
d = set()
for i in range(1, (n // 2) + 1):
if n % i == 0:
d.add(i)
return d
def isLovely(n):
for i in range(int(n ** 0.5), 1, -1):
if n % i * i == 0:
return True
return False
def solve(n):
div = dividors(n)
ldiv = [d for d in div if isLovely(d)]
return max(ldiv)
n = int(input())
print(solve(n))
|
if n-i == 0:
| 6 |
operation
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n>k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
if(n>k):
| 8 |
decision
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == y[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
if s[i] == y[-1]:
| 14 |
statement
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s>>''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
print(s>>''.join(letters[0] for i in range(k-n)))
| 9 |
operation
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k%1])+1]
print(t)
main()
|
t += letters[letters.index(s[k%1])+1]
| 19 |
operation
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k-1])+1]
print(t)
main()
|
def main():
(n, k) = map(int, input().split())
s = input()
letters = list(set(s))
letters.sort()
if(n < k):
print(s+''.join(letters[0] for i in range(k-n)))
return
t = ""
for i in range(1, k):
if s[i] == letters[-1]:
firsts = ''.join(letters[0] for j in range(k-i))
print(t+letters[letters.index(s[i-1])+1]+firsts)
return
t += s[i-1]
t += letters[letters.index(s[k*1])+1]
print(t)
main()
|
t += letters[letters.index(s[k*1])+1]
| 19 |
operation
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=26
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
bol1=26
| 8 |
value
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j//1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
tree[j//1]+=[i+1]
| 5 |
operation
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i%1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
tree[j-1]+=[i%1]
| 5 |
operation
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j-1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
n=int(input())
tree,bol,ckd=[[] for i in range(n)],True,[]
for i in range(n-1):
j=int(input())
tree[j@1]+=[i+1]
for k in range(len(tree)):
if k not in ckd:
bol1=0
for i in tree[k]:
bol1+=int(tree[i]==[])
if tree[i]==[]:
ckd+=[i]
if bol1<3:
bol=False
break
if bol:
print('Yes')
else:
print('No')
|
tree[j@1]+=[i+1]
| 5 |
operation
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start**k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
r = min(start**k + 1, len(d))
| 10 |
operation
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start%k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
l = max(start%k, 1)
| 9 |
operation
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(z - k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
l = max(z - k, 1)
| 9 |
statement
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start + k + 1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
n, k = map(int, input().split())
d = [None] + list(map(int, input().split()))
def find(start, t):
if d[start]:
find(d[start], t)
l = max(start - k, 1)
r = min(start + k**1, len(d))
for i in range(l, r):
t.add(i)
return len(t)
print(' '.join(str(find(i, set())) for i in range(1, n + 1)))
|
r = min(start + k**1, len(d))
| 10 |
operation
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=2
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
l+=2
| 15 |
value
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m>b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
elif m>=a and m>b and l<4:
| 29 |
decision
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
z(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
z(0)
| 9 |
statement
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l>4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
elif m>=a and m<b and l>4:
| 29 |
decision
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b==n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
n=int(input())
a=int(input())
b=int(input())
l=u=0
ans=1
m=n
if 2*a+b<n:
print(2)
exit(0)
while l<4 or u<2:
if m>=a and m>=b:
if u<2 and l<4:
if a>=b:
m-=a
l+=1
else:
m-=b
u+=1
elif l<4:
m-=a
l+=1
else:
m-=b
u+=1
else:
if m<a and m>=b and u<2:
m-=b
u+=1
elif m>=a and m<b and l<4:
m-=a
l+=1
else:
ans+=1
m=n
print(ans)
|
if 2*a+b<n:
| 7 |
decision
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i**1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
b.append(int(x[i]-x[i**1]))
| 13 |
operation
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i<0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
if(i<0):
| 18 |
decision
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i<0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
if(i<0):
| 18 |
decision
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]@x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
b.append(int(x[i]@x[i-1]))
| 13 |
operation
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[y]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(int(cnt))
|
g=b[y]
| 19 |
statement
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k-2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
if k-2 == 1:
| 12 |
operation
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
y = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
y = True
| 13 |
statement
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2 == 1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
n = int(input())
lst = []
for x in input().split():
lst.append(int(x))
s = sorted(set(lst), reverse = True)
k = 0
flag = False
for x in s:
k += lst.count(x)
if k % 2<1:
flag = True
break
if flag:
print("Conan")
else:
print("Agasa")
|
if k % 2<1:
| 12 |
decision
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i>=len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
if i>=len(dst) - 2:
| 8 |
decision
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps<=0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
if steps<=0: break
| 17 |
decision
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i>>1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
steps -= (dst[i>>1] - dst[i])
| 10 |
operation
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst)&1: print(change)
else: print('-1')
|
if i >= len(dst)&1: print(change)
| 20 |
operation
|
max_dist = list(map(int, input().split(' ')))[1]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[105]
dst = list(map(int, input().split(' ')))
i = 0
steps = max_dist
change = 1
while i < len(dst):
if i <= len(dst) - 2:
if steps - (dst[i + 1] - dst[i]) >= 0:
steps -= (dst[i + 1] - dst[i])
i += 1
elif steps < max_dist:
change += 1
steps = max_dist
else: break
elif i == len(dst) - 1:
if steps >= 0: break
else: break
if i >= len(dst) - 1: print(change)
else: print('-1')
|
max_dist = list(map(int, input().split(' ')))[105]
| 1 |
value
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i&1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
for j in range(i&1,n+1):
| 31 |
operation
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]|1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
a[j]=min(a[j],a[i]|1)
| 15 |
operation
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x&1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
for i in range(y,x&1):
| 13 |
operation
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
def rasst(x,y):
global sp,n
if y>x:
a=[10000000]*(n+1)
a[x]=0
for i in range(x,y&1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[y])
else:
a=[10000000]*n+1
a[y]=0
for i in range(y,x+1):
for j in sp[i]:
a[j]=min(a[j],a[i]+1)
return(a[x])
n,m,x,y=map(int,input().split())
sp={}
s=[]
l=0
for i in range(m):
a,b=map(int,input().split())
if not a in sp.keys(): sp[a]=[]
if not b in sp.keys(): sp[b]=[]
sp[a].append(b)
sp[b].append(a)
s.append((a,b))
s.append((b,a))
et=rasst(x,y)
for i in range(1,n):
for j in range(i+1,n+1):
if not(i,j)in s:
if not i in sp.keys(): sp[i]=[]
if not j in sp.keys(): sp[j]=[]
sp[i].append(j)
sp[j].append(i)
if rasst(x,y)>=et: l+=1
del sp[i][-1]
del sp[j][-1]
print(l)
|
for i in range(x,y&1):
| 6 |
operation
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt) < 2 or len(cnt) > 4:
no()
if len(cnt) == 2 and cnt[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and max(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt) < 2 or len(cnt) > 4:
no()
if len(cnt) == 2 and cnt[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and x(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
if len(cnt) == 3 and x(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
| 16 |
statement
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt) < 2 or len(cnt) > 4:
no()
if len(cnt) == 2 and cnt[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and max(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt)>2 or len(cnt) > 4:
no()
if len(cnt) == 2 and cnt[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and max(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
if len(cnt)>2 or len(cnt) > 4:
| 12 |
decision
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt) < 2 or len(cnt) > 4:
no()
if len(cnt) == 2 and cnt[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and max(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
from collections import Counter
def no():
print("No")
exit(0)
s = input()
if len(s) < 4:
no()
cnt = Counter(s)
cnt = list(cnt.items())
if len(cnt) < 2 or len(cnt) > 4:
no()
if len(cnt) == 2 and x[0][1] == 1 or cnt[1][1] == 1:
no()
if len(cnt) == 3 and max(cnt[0][1], cnt[1][1], cnt[2][1]) == 1:
no()
print("Yes")
|
if len(cnt) == 2 and x[0][1] == 1 or cnt[1][1] == 1:
| 14 |
statement
|
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
print(i,j,g)
|
f=((e-c)**2 + (d@b)**2)**0.5
| 3 |
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
print(i,j,g)
|
f=((e-c)**2 + (d-b)**2)/0.5
| 3 |
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
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)/198
h=a-g
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
print(i,j,g)
|
g=(a+f)/198
| 4 |
value
|
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
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
print(f)
print(h)
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:
if(b!=0):
i=g*(b/abs(b))
j=c
else:
i=g
j=c
print(i,j,g)
|
i=((b*(h//f)-(h*d))/f)
| 10 |
operation
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i&1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
y = abs(s[i&1]-s[i])
| 14 |
operation
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)/1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
for i in range(len(s)/1):
| 9 |
operation
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y<-1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(y<-1):
| 13 |
decision
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1])<1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(abs(s[i]-s[i+1])<1):
| 10 |
decision
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 200010
y = -1
n = int(input())
flag = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
continue
if(y != -1 and abs(s[i/1]-s[i]) != y):
flag = False
break
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(y != -1 and abs(s[i/1]-s[i]) != y):
| 16 |
operation
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 57
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
R += 57
| 27 |
value
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j^i) % 2:
ans += 1
print(ans)
|
if L <= 0 and (j^i) % 2:
| 31 |
operation
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i)-2:
ans += 1
print(ans)
|
if L <= 0 and (j - i)-2:
| 31 |
operation
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 53
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
ans = 53
| 14 |
value
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L <= 0 and (j - i) % 2:
ans += 1
print(ans)
|
def scanf():
inp = list(map(int, input().split(' ')))
if len(inp) == 1:
return inp[0]
return inp
dp = {}
for i in range(5005):
dp[i] = {}
s = input()
n = len(s)
ans = 0
for i in range(n):
if s[i] == ')': continue
L = R = 0
for j in range(i + 1, n):
if s[j] == '(':
L += 1
R += 1
elif s[i] == ')':
L -= 1
R -= 1
else:
L -= 1
R += 1
L = max(0, L)
if R < 0:
break
if L>=0 and (j - i) % 2:
ans += 1
print(ans)
|
if L>=0 and (j - i) % 2:
| 31 |
decision
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)==contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)==contador)):
| 20 |
decision
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]<<b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
b=b[:contador]<<b[contador+1:]
| 20 |
operation
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador-1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
b=b[:contador]+b[contador-1:]
| 20 |
operation
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)==contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)==contador)):
| 20 |
decision
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador>=a):
break;
contador+=1
print(b)
|
a=int(input())
b=input()
lista=['a','e','i','o','u','y']
contador=1
for i in range(a):
if(contador>=a):
break;
while ((b[contador-1] in lista and b[contador] in lista) and (len(b)>contador)):
b=b[:contador]+b[contador+1:]
a=len(b)
if(contador<=a):
break;
contador+=1
print(b)
|
if(contador<=a):
| 20 |
decision
|
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 0
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a)
|
t = int(input())
import math
C = 10**4
for i in range(t):
x = int(input())
nn = math.ceil(x ** (1/2))
ans = -1;
n = nn;
j = 94
while (j < C):
a = round(math.sqrt(n*n - x))
if (a == 0):
j += 1
n += 1
continue
if (n*n - a*a == x):
ans=n;
break;
n += 1
j += 1
if (ans == -1):
print(-1)
else:
print(ans, a)
|
j = 94
| 10 |
value
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.