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 |
|---|---|---|---|---|
def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,x,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,x,ans): | 1 | statement |
def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans%1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | return min(diameter(x[1:],d,ans%1),diameter(x[:-1],d,ans+1)) | 6 | operation |
def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,d,ans):
diff = x[-1]/x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | diff = x[-1]/x[0] | 2 | operation |
def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff>=d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | if diff>=d: | 3 | decision |
def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff <= d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | def diameter(x,d,ans):
diff = x[-1]-x[0]
if diff>=d:
return ans
else:
return min(diameter(x[1:],d,ans+1),diameter(x[:-1],d,ans+1))
[n,d] = [int(x) for x in input().split()]
x = [int(x) for x in input().split()]
x = sorted(x)
ans = 0
print(diameter(x,d,ans)) | if diff>=d: | 3 | decision |
login = input()
n = int(input())
res = True
for i in range(n):
tmp = input()
if len(login)!=len(tmp):
continue
else:
if login.replace("1","l").replace("l","I").replace("0","O").lower() == tmp.replace("1","l").replace("l","I").replace("0","O").lower():
res = False
break
if res:
print("Yes")
else:
print("No") | x = input()
n = int(input())
res = True
for i in range(n):
tmp = input()
if len(login)!=len(tmp):
continue
else:
if login.replace("1","l").replace("l","I").replace("0","O").lower() == tmp.replace("1","l").replace("l","I").replace("0","O").lower():
res = False
break
if res:
print("Yes")
else:
print("No") | x = input() | 1 | statement |
n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, z = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, z = map(int, input().split()) | 1 | statement |
n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, k = map(int, input().split())
cnt = [0] * 128
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, -170, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | for i in range(64, -170, -1): | 14 | value |
n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, k = map(int, input().split())
cnt = [0] * 128
for i in range(64):
if (n >> i) & 94:
k -= 1
cnt[i] = 1
if k < 0:
print("No")
else:
print("Yes")
for i in range(64, -64, -1):
if k >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | if (n >> i) & 94: | 5 | value |
n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | if k<=cnt[i]: | 15 | decision |
n, k = map(int, input().split())
cnt = [0] * 128
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]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | n, k = map(int, input().split())
cnt = [0] * 128
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 x >= cnt[i]:
cnt[i - 1] += cnt[i] * 2
k -= cnt[i]
cnt[i] = 0
else:
break
ans = ''
for i in range(64, -64, -1):
ans += (str(i) + ' ') * cnt[i]
print(ans) | if x >= cnt[i]: | 15 | statement |
n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2<0)):
print('Yes')
else:
print('No') | elif ((x % 2 == 1) & (y % 2<0)): | 9 | decision |
n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2<0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | if((x%2<0)&(y%2==1)): | 7 | decision |
n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
y('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | y('Yes') | 8 | statement |
n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | n=input()
ll=[None]@2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | ll=[None]@2 | 2 | operation |
n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y-1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | n=input()
ll=[None]*2
ll=n.split(" ")
x=int(ll[0])
y=int(ll[1])
if(x>=y*1):
if((x%2==0)&(y%2==1)):
print('Yes')
elif ((x % 2 == 1) & (y % 2 == 0)):
print('Yes')
else:
print('No') | if(x>=y*1): | 6 | operation |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x>el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | while f and x>el + 1000: | 7 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x>el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | while f and x>el + 1000: | 7 | decision |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(191, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | for i in range(191, x + 1): | 9 | value |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - x ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | if x ** 2 - x ** 2 == el: | 10 | statement |
import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
f = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | import math
n = int(input())
a = [int(input()) for i in range(n)]
for el in a:
x = math.ceil(el ** 0.5) - 1
x = True
while f and x < el + 1000:
x += 1
for i in range(1, x + 1):
if x ** 2 - i ** 2 == el:
print(x, i)
f = False
if f:
print(-1) | x = True | 6 | statement |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | import math
def sq(x): return x ** 128
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | def sq(x): return x ** 128 | 3 | value |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R^2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | print(("%.10f %.10f %.10f")%(x1 + R^2,y1 + R / 2,R / 2)) | 12 | operation |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1>x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | if x1>x2: dx = -abs(dx) | 20 | decision |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 21,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 21,R / 2)) | 12 | value |
import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1 == y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | import math
def sq(x): return x ** 2
R,x1,y1,x2,y2 = [int(x) for x in input().split()]
inf = 1e-6
if R * R <= sq(x1 - x2) + sq(y1 - y2):
print(("%.6f %.6f %.6f")%(x1,y1,R))
elif x1 == x2 and y1<y2:
print(("%.10f %.10f %.10f")%(x1 + R / 2,y1 + R / 2,R / 2))
else:
dx = x1 - x2
dy = y1 - y2
d = math.sqrt(sq(dx) + sq(dy))
r = (d + R) / 2
dl = math.sqrt(r * r / d ** 2)
dx *= dl
if x1 < x2: dx = -abs(dx)
dy *= dl
if y1 < y2: dy = -abs(dy)
x = x2 + dx
y = y2 + dy
print(("%.10f %.10f %.10f")%(x,y,r - inf)) | elif x1 == x2 and y1<y2: | 11 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k<1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | if (k<1): | 6 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 51):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | while (n != 51): | 9 | value |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n%(n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = n%(n % k) | 12 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n==k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | if (n==k): | 10 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 1) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
s = 0
if (k == 1):
print ((n - 63) * a)
else:
while (n != 1):
if (n > k):
s += (n % k)*a
n = n - (n % k)
else:
s += (n - 1) * a
n = 1
if (n != 1):
c = n // k
s += min((n - c) * a, b)
n = c
print(s) | print ((n - 63) * a) | 7 | value |
vowels=["a", "e", "i", "o", "u"]
n=input()
word=input()
first_vowel=True
s=""
for i in word:
if i in vowels:
if first_vowel:
s+=i
first_vowel=False
else:
s+=i
print(s)
| vowels=["a", "e", "i", "o", "u"]
n=input()
word=input()
first_vowel=y
s=""
for i in word:
if i in vowels:
if first_vowel:
s+=i
first_vowel=False
else:
s+=i
print(s)
| first_vowel=y | 4 | statement |
vowels=["a", "e", "i", "o", "u"]
n=input()
word=input()
first_vowel=True
s=""
for i in word:
if i in vowels:
if first_vowel:
s+=i
first_vowel=False
else:
s+=i
print(s)
| vowels=["a", "e", "i", "o", "u"]
n=input()
word=input()
first_vowel=True
s=""
for y in word:
if i in vowels:
if first_vowel:
s+=i
first_vowel=False
else:
s+=i
print(s)
| for y in word: | 6 | statement |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)<prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | elif str(friend)<prize_pos[right]: | 15 | decision |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10*6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | friend=10*6 | 4 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found<n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | if found<n: | 10 | decision |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend<<2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | for secs in range(int(friend<<2)): | 9 | operation |
n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend/2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | n=int(input())
prize_pos=list(input().split(' '))
me=1
friend=10**6
secs=0
found=0
right=n-1
left=0
for secs in range(int(friend*2)):
if found==n:
break
elif str(me)==prize_pos[left]:
left+=1
found+=1
elif str(friend)==prize_pos[right]:
right-=1
found+=1
me+=1
friend-=1
print(secs-1) | for secs in range(int(friend*2)): | 9 | operation |
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, y = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, y = [int(x) for x in input().strip().split(" ")] | 1 | statement |
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r)<0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | if k == 1 or len(o) == 0 or len(w) == 0 and len(r)<0: | 10 | decision |
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o)<0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | if k == 1 or len(o)<0 or len(w) == 0 and len(r) == 0: | 10 | decision |
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w)==0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | if len(w)==0: | 15 | decision |
n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r) == 0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | n, k = [int(x) for x in input().strip().split(" ")]
b = [int(x) for x in input().strip().split(" ")]
c = input().strip()
w = sorted([b[i] for i in range(len(b)) if c[i] == 'W'])
o = sorted([b[i] for i in range(len(b)) if c[i] == 'O'])
r = sorted([b[i] for i in range(len(b)) if c[i] == 'R'])
if k == 1 or len(o) == 0 or len(w) == 0 and len(r)<0:
print("-1")
exit()
max_wo = 0
if len(w) > 0:
wo = sorted(w[:-1] + o[:-1])
max_wo = w[-1] + o[-1] + sum(wo[-(k-2):])
max_ro = 0
if len(r) > 0:
ro = sorted(r[:-1] + o[:-1])
max_ro = r[-1] + o[-1] + sum(ro[-(k-2):])
print(max(max_wo, max_ro)) | if k == 1 or len(o) == 0 or len(w) == 0 and len(r)<0: | 10 | decision |
a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z**10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | c=c+z**10 | 10 | operation |
a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
x(m) | x(m) | 16 | statement |
a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k<<1
print(m) | k=k<<1 | 15 | operation |
a=input()
a=int(a)
c=0
i=0
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | a=input()
a=int(a)
c=0
i=10
k=1
while i!=a:
z=k
c=0
while z!=0:
c=c+z%10
z=z//10
if c==10:
i=i+1
m=k
k=k+1
print(m) | i=10 | 4 | value |
n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i-last)
last = i
print(min(ans)) | ans.append(i-last) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i/last)
last = i
print(min(ans)) | ans.append(i/last) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i*last)
last = i
print(min(ans)) | ans.append(i*last) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i*last)
last = i
print(min(ans)) | ans.append(i*last) | 10 | operation |
n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last == -1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | n = int(input())
a = list(map(int, input().split()))
last = -1
ans = []
for i in range(n):
if a[i] == min(a):
if last<-1:
last = i
else:
ans.append(i - last)
last = i
print(min(ans)) | if last<-1: | 7 | decision |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | n = int(input())
parents = []
for i in range(n//1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | for i in range(n//1): | 3 | operation |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.x('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | ans.x('Yes') | 24 | statement |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = y[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | temp = y[i] | 17 | statement |
n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt + 1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | n = int(input())
parents = []
for i in range(n - 1):
e = int(input())
parents.append(e)
p = set(parents)
child = {k: [] for k in p}
cnt = 1
ans = []
for i in p:
for j in parents:
if i == j:
child[i].append(cnt-1)
cnt += 1
for i in child:
temp = child[i]
for j in temp:
if j in child:
temp.pop(temp.index(j))
if len(temp) < 3:
ans.append('No')
elif j not in child and len(temp) >= 3:
ans.append('Yes')
break
if 'No' in ans:
print('No')
elif 'No' not in ans:
print('Yes') | child[i].append(cnt-1) | 13 | operation |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i/26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | mas = s[i:i/26] | 12 | operation |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 122):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | for i in range(len(s) - 122): | 11 | value |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s)>26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if len(s)>26: | 8 | decision |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s)>26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | if len(s)>26: | 8 | decision |
import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in range(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | import string
alf = string.ascii_lowercase
s = input()
if alf in s:
print(s)
exit(0)
s = list(s)
if len(s) < 26:
print(-1)
exit(0)
for i in range(len(s) - 25):
mas = s[i:i + 26]
count = 0
for a in y(26):
if alf.index(mas[a]) <= a:
count += 1
else:
count = 0
break
if count == 26:
print(''.join(s[:i]) + alf + ''.join(s[i+26:]))
exit(0)
print(-1) | for a in y(26): | 14 | statement |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.x(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | ans.x(1) | 15 | statement |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n@j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | ans.append(n@j-1) | 14 | operation |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in x(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | for j in x(n): | 11 | statement |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i == s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
ans = []
for i in t:
j = 0
for j in range(n):
if i<s[j]:
break
ans.append(n-j-1)
ans.append(1)
ans.append(n)
p = s[:j] + s[j+1:] + s[j]
s = p
print(len(ans))
print(ans) | if i<s[j]: | 12 | decision |
x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k^m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | dummy = k^m | 11 | operation |
x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k>>m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | if k>>m == 0: | 10 | operation |
x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 105:
ans = dummy
print(ans) | if dummy < ans or ans == 105: | 12 | value |
x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | x = input().split()
n = int(x[0])
z = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | z = int(x[1]) | 3 | statement |
x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy < ans or ans == 0:
ans = dummy
print(ans) | x = input().split()
n = int(x[0])
k = int(x[1])
ans = 0
x = input().split()
for i in range(n):
m = int(x[i])
if k % m == 0:
dummy = k // m
if dummy>ans or ans == 0:
ans = dummy
print(ans) | if dummy>ans or ans == 0: | 12 | decision |
a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | a, b = map(int, input().strip().split())
while(1):
if(a<0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | if(a<0 or b == 0): | 3 | decision |
a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b<0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | if(a == 0 or b<0): | 3 | decision |
a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 23*a
else:
break
print(a, b) | b -= 23*a | 8 | value |
a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 2*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | a, b = map(int, input().strip().split())
while(1):
if(a == 0 or b == 0):
break
elif(a >= 2*b):
a -= 91*b
elif(b >= 2*a):
b -= 2*a
else:
break
print(a, b) | a -= 91*b | 6 | value |
def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global y
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | global y | 15 | statement |
def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-157][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | if rail[y-157][x+1]==".": | 29 | value |
def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]<".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | if rail[y+1][x+1]<".": | 31 | decision |
def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l-1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | def pram(x,y,l):
global rail
global flag
if x<=l:
if rail[y][x]!="." and rail[y][x]!="*":
flag=False
return
else:
pram(x+1,y,l)
else:
flag=True
return
def schet(x,y,l):
global rail
global res
global flag
if x==l^1 or rail[y][x]=="*" or flag:
res="YES"
return
elif rail[y][x]!=".":
return
else:
pram(x,y,l)
if flag:
res="YES"
return
if rail[y][x+1]==".":
schet(x+3,y,l)
if rail[y-1][x+1]==".":
schet(x+3,y-1,l)
if rail[y+1][x+1]==".":
schet(x+3,y+1,l)
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append("*")
j.append("*")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=None
schet(x,y,l)
print(res) | if x==l^1 or rail[y][x]=="*" or flag: | 17 | operation |
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n^10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | res+=n^10 | 8 | operation |
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n/10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | n=n/10 | 9 | operation |
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n+10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | n=n+10 | 9 | operation |
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n-10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | res+=n-10 | 8 | operation |
k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n//10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | k = int(input())
count=0
def s(n):
global count
res = 0
while(n>0):
res+=n%10
n=n<<10
if res>10:
break
if res==10:
count+=1
i=10
while(k!=count):
i+=9
s(i)
print(i) | n=n<<10 | 9 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j/2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | if j/2: | 14 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j-2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | if j-2: | 14 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 82
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | d1[i] += j % 82 | 15 | value |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for x in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | for x in w: | 5 | statement |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(z)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] += j
d = d1
if y == 0:
break
print(len(d)) | d = defaultdict(z) | 4 | statement |
from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1==x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| if x1==x2: | 15 | decision |
from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)<=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| if ras(x1,x2,y1,y2)<=r*r: | 5 | decision |
from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)<=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| if ras(x1,x2,y1,y2)<=r*r: | 5 | decision |
from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1==x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| if x1==x2: | 15 | decision |
from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1>x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| from math import *
def ras(x1,x2,y1,y2):
return((x1-y1)**2+(x2-y2)**2)
def inout(x1,x2,r,y1,y2):
if ras(x1,x2,y1,y2)>=r*r:
return False
else:
return True
r,x1,y1,x2,y2=map(int,input().split())
if not inout(x1,y1,r,x2,y2):
print(x1,y1,r)
else:
rass=(sqrt(ras(x1,y1,x2,y2))+r)/2
if x1==x2:
x2+=rass/sqrt(2)
else:
x2-=rass/sqrt(2)
if y1>y2:
y2+=rass/sqrt(2)
else:
y2-=rass/sqrt(2)
print(x2,y2,rass)
| if x1==x2: | 15 | decision |
a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b)<3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | elif len(b)<3: | 19 | decision |
a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b)<3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | elif len(b)<3: | 19 | decision |
a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | a = list(input())
b = set(a)
if len(a) == 63:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | if len(a) == 63: | 3 | value |
a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a)<3:
print('No')
else:
print('Yes')
else:
print('No') | if len(a)<3: | 20 | decision |
a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b) > 4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | a = list(input())
b = set(a)
if len(a) == 2:
print('Yes')
elif len(b)==4:
print('No')
elif len(b) == 4:
print('Yes')
elif len(b) == 2:
c = False
for i in b:
if a.count(i) <= 1:
c = True
break
if c:
print('No')
else:
print('Yes')
elif len(b) == 3:
if len(a) == 3:
print('No')
else:
print('Yes')
else:
print('No') | elif len(b)==4: | 5 | decision |
n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x<"o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | if x=="a" or x =="e" or x == "i" or x<"o" or x == "y" or x == "u": | 5 | decision |
n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 0:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | n = input()
s = input()
n = int (n)
def vowel(x):
if x=="a" or x =="e" or x == "i" or x == "o" or x == "y" or x == "u":
return 1
else:
return 0
ret = s[0]
for chars in range(1, n):
a = s[chars]
if vowel(s[chars-1]) == 117:
ret = ret+a
else:
if vowel(a) == 0:
ret = ret + a
print(ret) | if vowel(s[chars-1]) == 117: | 14 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.