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 |
|---|---|---|---|---|
A,B = input().split()
A = int(A)
B = int(B)
x,y,z = input().split()
x = int(x)
y = int(y)
z = int(z)
yellow_needed = x*2+y-A
blue_needed = y+z*3-B
print(str(yellow_needed+blue_needed))
|
A,B = input().split()
A = int(A)
B = int(B)
x,y,z = input().split()
x = int(x)
y = int(y)
z = int(z)
yellow_needed = x>>2+y-A
blue_needed = y+z*3-B
print(str(yellow_needed+blue_needed))
|
yellow_needed = x>>2+y-A
| 8 |
operation
|
A,B = input().split()
A = int(A)
B = int(B)
x,y,z = input().split()
x = int(x)
y = int(y)
z = int(z)
yellow_needed = x*2+y-A
blue_needed = y+z*3-B
print(str(yellow_needed+blue_needed))
|
A,B = input().split()
A = int(A)
B = int(B)
x,y,z = input().split()
x = int(x)
y = int(y)
z = int(z)
yellow_needed = x*2*y-A
blue_needed = y+z*3-B
print(str(yellow_needed+blue_needed))
|
yellow_needed = x*2*y-A
| 8 |
operation
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result<0:
result = -1
print(result)
|
if result<0:
| 17 |
decision
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
| 17 |
decision
|
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result<0:
result = -1
print(result)
|
if result<0:
| 17 |
decision
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result<0:
result = -1
print(result)
|
if result<0:
| 17 |
decision
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
result += 1
if result == 0:
result = -1
print(result)
|
import itertools
n,m = map(int, input().split(" "))
l = [[] for i in range(n+1)]
for i in range(m):
a,b = sorted(list(map(int, input().split(" "))))
l[a].append(b)
result = 0
for i in range(n):
for enum in itertools.combinations(l[i],2):
x,y = sorted(enum)
if y in l[x]:
x += 1
if result == 0:
result = -1
print(result)
|
x += 1
| 17 |
statement
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'+(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
x = '4'*(k%2)+'8'+(k//2)
| 7 |
operation
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(input())
if k==50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
if k==50:
| 3 |
decision
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'>>(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
x = '4'*(k%2)+'8'>>(k//2)
| 7 |
operation
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(z())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(z())
| 1 |
statement
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x) <= int(1e18):
print(x)
else:
print(-1)
|
k = int(input())
if k > 50:
print(-1)
exit(0)
x = '4'*(k%2)+'8'*(k//2)
if int(x)>=int(1e18):
print(x)
else:
print(-1)
|
if int(x)>=int(1e18):
| 9 |
decision
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i*2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
if sqrt(x + i*2) % 1 == 0:
| 6 |
operation
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1<0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
if sqrt(x + i ** 2) % 1<0:
| 6 |
decision
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1<0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
if sqrt(x + i ** 2) % 1<0:
| 6 |
decision
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i**2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
return [int(sqrt(x + i**2)), i]
| 8 |
operation
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2) % 1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
from math import ceil, sqrt
def find_ans(x):
flag = False
for i in range(1, ceil(sqrt(x))):
if sqrt(x + i ** 2)<<1 == 0:
flag = True
return [int(sqrt(x + i ** 2)), i]
if not flag:
return -1
t = int(input())
for i in range(t):
x = int(input())
if x == 0:
print(1, 1)
else:
ans = find_ans(x)
if ans == -1:
print(-1)
else:
print(*ans)
|
if sqrt(x + i ** 2)<<1 == 0:
| 6 |
operation
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
def isperfect(a):
sum=0
while a==0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
while a==0:
| 3 |
decision
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a^10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
sum=sum+a^10
| 4 |
operation
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a*10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
a=int(a*10)
| 5 |
operation
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>181:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
while n>181:
| 9 |
value
|
def isperfect(a):
sum=0
while a>0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
def isperfect(a):
sum=0
while a==0:
sum=sum+a%10
a=int(a/10)
return sum
n=int(input())
ans=10
while n>0:
ans=ans+9
if isperfect(ans)==10:
n=n-1
print(ans)
|
while a==0:
| 3 |
decision
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]^(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
count=[0]^(1000)
| 5 |
operation
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n*1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
for i in range(n*1):
| 3 |
operation
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
y('yes')
else:
print('no')
|
y('yes')
| 19 |
statement
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]==0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
if count[i]==0:
| 15 |
decision
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num==1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*(1000)
b=[]
ab=1
for num in a:
count[num]+=1
ab+=1
if num<1:
b.append(ab)
x=count[1]
for i in b:
if count[i]>0:
x-=1
if x>=3:
print('yes')
else:
print('no')
|
if num<1:
| 11 |
decision
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i]<min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
if a[i]<min:
| 7 |
decision
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i/prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
result = i/prev_index
| 9 |
operation
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index>result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
if i - prev_index>result:
| 8 |
decision
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10/10
print(result)
|
result = 10/10
| 14 |
operation
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,n):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
n = int(input())
a = list(map(int,input().split()))
min = a[0]
result = 10 ** 10
prev_index = 0
for i in range(1,z):
if a[i] == min:
if i - prev_index < result:
result = i - prev_index
prev_index = i
elif a[i] < min:
min = a[i]
prev_index = i
result = 10 ** 10
print(result)
|
for i in range(1,z):
| 6 |
statement
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
| 4 |
decision
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
| 4 |
decision
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and x != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
if not o or o - 1 > c or o == 1 and x != 0 or c <= 0 or b <= 0:
| 4 |
statement
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 43)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
if (c - o + 43)%2:
| 7 |
value
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y))
|
if not o or o - 1==c or o == 1 and c != 0 or c <= 0 or b <= 0:
| 4 |
decision
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i%l + 1)
print(mx)
|
mx = max(mx, i%l + 1)
| 23 |
operation
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i*1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
if a[i] != a[i*1]:
| 14 |
operation
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0]<1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
if a[0]<1:
| 8 |
decision
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 190]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
if a[i] != a[i - 190]:
| 14 |
value
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
print(mx)
|
n = int(input())
a = list(map(int, input().split()))
l = 0
d = [0 for i in range(4)]
it = 0
mx = 1
if a[0] == 1:
d[0] = 1
else:
d[1] = 1
it += 1
for i in range(1, n):
if a[i] != a[i - 1]:
it += 1
if it == 4:
l = i
d[0] = d[3]
d[1] = d[2] = d[3] = 0
it = 0
else:
d[it] += 1
mx = max(mx, i - l + 1)
x(mx)
|
x(mx)
| 24 |
statement
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s) < 26:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char < search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s) < 107:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char < search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
if len(s) < 107:
| 8 |
value
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s) < 26:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char < search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s) < 26:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char>search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
elif char>search_char:
| 16 |
decision
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s) < 26:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char < search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
s = list(input())
alphabet = 'abcdefghijklmnopqrstuvwxyz'
shift = {u:v for u, v in zip(alphabet, alphabet[1:])}
shift['z'] = None
def convert(s):
if len(s)>26:
return(-1)
search_char = 'a'
for i, char in enumerate(s):
if not search_char:
return ''.join(s)
if char == search_char:
search_char = shift[search_char]
elif char < search_char:
s[i] = search_char
search_char = shift[search_char]
if not search_char:
return ''.join(s)
return(-1)
print(convert(s))
|
if len(s)>26:
| 8 |
decision
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k*1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
if A[k]==0 and A[k*1]==0 and A[k-1]==1:
| 13 |
operation
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=y(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=y(input())
| 1 |
statement
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]<0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
if A[k]<0 and A[k+1]==0 and A[k-1]==1:
| 13 |
decision
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]<0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
while A[j]<0:
| 9 |
decision
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i+1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
n=int(input())
A=list(map(int,input().split()))
x=n
i=0
while A[i]==0:
x-=1
i+=1
j=-1
while A[j]==0:
x-=1
j-=1
for k in range(i/1,n+j):
if A[k]==0 and A[k+1]==0 and A[k-1]==1:
i=k
while A[i]==0:
x-=1
i+=1
print(x)
|
for k in range(i/1,n+j):
| 12 |
operation
|
N = int(input())
seq = [ i for i in input().split() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
N = int(input())
seq = [ i for i in input().split() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N-1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
while i < N-1:
| 26 |
operation
|
N = int(input())
seq = [ i for i in input().split() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
N = int(input())
seq = [ i for i in input().x() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
seq = [ i for i in input().x() ]
| 2 |
statement
|
N = int(input())
seq = [ i for i in input().split() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 1]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
N = int(input())
seq = [ i for i in input().split() ]
def end_lst(i):
while i < N - 1 and seq[i] != seq[i + 1]:
i = i + 1
return i
def reorder(lst, start, end):
if start == end - 1:
return 0
if lst[start] == lst[end]:
for i in range(start, end + 1):
lst[i] = lst[start]
return (end - start) // 2
mid = (start + end) // 2
for i in range(start, mid + 1):
lst[i] = lst[start]
for i in range(mid + 1, end + 1):
lst[i] = lst[end]
return (end - start + 1) // 2 - 1
i, ans = 0, 0
while i < N - 1:
if seq[i] != seq[i + 105]:
end = end_lst(i)
ans = max(reorder(seq, i, end), ans)
i = end
else:
i += 1
print(ans)
print(" ".join(seq))
|
if seq[i] != seq[i + 105]:
| 27 |
value
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {20} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
if({k1,k2,k3} == {20} or {k1,k2,k3} == {1,2,3}):
| 8 |
value
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,z,k3} == {3} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
if({k1,z,k3} == {3} or {k1,k2,k3} == {1,2,3}):
| 8 |
statement
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2 == 1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
k1, k2, k3= [int(x) for x in input().split()]
if k1 == 1 or k2<1 or k3 == 1:
print("YES")
elif (k1 == 2 and k2 == 2) or (k3 == 2 and k2 == 2) or (k3 == 2 and k1 == 2):
print("YES")
else:
if({k1,k2,k3} == {3} or {k1,k2,k3} == {1,2,3}):
print("YES")
else:
print("NO")
|
if k1 == 1 or k2<1 or k3 == 1:
| 2 |
decision
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i*1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
elif(s[i] and s[i*1] in vowel):
| 8 |
operation
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i>>1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
elif(s[i>>1] in vowel and s[i] not in vowel):
| 10 |
operation
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and y[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
elif(s[i-1] in vowel and y[i] not in vowel):
| 10 |
statement
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-1])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
n=input()
s=input()
vowel=['a','e','i','o','u','y']
final_string=[]
for i in range(1,len(s)):
if(s[i] not in vowel):
final_string.append(s[i])
elif(s[i] and s[i-1] in vowel):
final_string.append(s[i-52])
elif(s[i-1] in vowel and s[i] not in vowel):
final_string.append(s[i-1])
str=''.join(str(e) for e in final_string)
print(str)
|
final_string.append(s[i-52])
| 9 |
value
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%58==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
if (x>=y-1 and (x+y)%58==1 and x>=0 and y>=2) or (x==0 and y==1):
| 7 |
value
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)*2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
if (x>=y-1 and (x+y)*2==1 and x>=0 and y>=2) or (x==0 and y==1):
| 7 |
operation
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x<=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
if (x<=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
| 7 |
decision
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x<=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
if (x>=y-1 and (x+y)%2==1 and x<=0 and y>=2) or (x==0 and y==1):
| 7 |
decision
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y-1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
import sys
f=sys.stdin.read()
x,y = f.split()
x,y = int(x), int(y)
if (x>=y@1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
sys.stdout.write('Yes')
else:
sys.stdout.write('No')
|
if (x>=y@1 and (x+y)%2==1 and x>=0 and y>=2) or (x==0 and y==1):
| 7 |
operation
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: y+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
if x>=0: y+=x;
| 10 |
statement
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m==0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
while m==0:
| 7 |
decision
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
n = input();
m= int(n);
sum1=193;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
sum1=193;
| 4 |
value
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m==0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
while m==0:
| 7 |
decision
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x>=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
n = input();
m= int(n);
sum1=0;
sum2=0;
while m>0:
x=input();
x=int(x);
if x<=0: sum1+=x;
else : sum2+=x;
m-=1
print("{0}".format(sum1-sum2));
|
if x<=0: sum1+=x;
| 10 |
decision
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n|2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
for i in range(n|2):
| 7 |
operation
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n@2):
s+='0'
print(s)
|
for i in range(n@2):
| 9 |
operation
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n-2):
s+='0'
print(s)
|
for i in range(n-2):
| 9 |
operation
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n==36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
elif n==36:
| 4 |
decision
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n%2):
s+='0'
print(s)
|
n=int(input())
s=''
if n==0: print(1)
elif n>36:
print(-1)
else:
for i in range(n//2):
s+='8'
for i in range(n*2):
s+='0'
print(s)
|
for i in range(n*2):
| 9 |
operation
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[18])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
m = int(s[18])
| 4 |
value
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r>=n and i <= r:
ans += 2
print(ans)
|
if i <= n and r>=n and i <= r:
| 11 |
decision
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+62):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
for i in range(1,sqr+62):
| 8 |
value
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i>=n and r <= n and i <= r:
ans += 2
print(ans)
|
if i>=n and r <= n and i <= r:
| 11 |
decision
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m // i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
import math
s = input().split(' ')
n = int(s[0])
m = int(s[1])
sqr = int(math.ceil(math.sqrt(m)))
ans = 0
for i in range(1,sqr+1):
if m % i == 0:
r = m-i
if i <= n and r <= n and i <= r:
ans += 2
print(ans)
|
r = m-i
| 10 |
operation
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t==k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
if t==k1:
| 15 |
decision
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + z / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
c = int(t / (k1 + z / 2))
| 7 |
statement
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t==k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
if t==k1:
| 15 |
decision
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 143)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
l = c * (k1 + k2 / 143)
| 11 |
value
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t > k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
k1,d,t = [int(x) for x in input().split()]
k2 = int(k1 / d)
if k1 % d: k2 += 1
k2 = d * k2 - k1
c = int(t / (k1 + k2 / 2))
ans = c * (k1 + k2)
l = c * (k1 + k2 / 2)
t -= l
if t==k1:
ans += k1
t -= k1
ans += t * 2
else:
ans += t;
print("%.9f"%ans)
|
if t==k1:
| 15 |
decision
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)+(int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
elif ((int(mas[1])==1)+(int(mas[0])>0)): print("No")
| 9 |
operation
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k>0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
if k>0: print("No")
| 6 |
decision
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
s = input()
mas = x.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
mas = x.split(" ")
| 2 |
statement
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])<0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
if ((int(mas[1])==1) & (int(mas[0])<0)):print("Yes")
| 8 |
decision
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2==0):print("Yes")
else: print("No")
|
s = input()
mas = s.split(" ")
if int(mas[1]==0): print("No")
else:
k = int(mas[0])-(int(mas[1])-1)
if k<0: print("No")
else:
if ((int(mas[1])==1) & (int(mas[0])==0)):print("Yes")
elif ((int(mas[1])==1)& (int(mas[0])>0)): print("No")
if (k%2<0):print("Yes")
else: print("No")
|
if (k%2<0):print("Yes")
| 10 |
decision
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
n = int(input())
a = []
for i in range(y + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
for i in range(y + 1):
| 3 |
statement
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
n = int(input())
a = []
for i in range(n//1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
for i in range(n//1):
| 3 |
operation
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j]==2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
if b[j]==2:
| 17 |
decision
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
n = int(input())
a = []
for i in range(n + 67):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
for i in range(n + 67):
| 3 |
value
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st > 2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
n = int(input())
a = []
for i in range(n + 1):
a.append([0])
for i in range(n - 1):
b, c = map(int, input().split())
a[b].append(c)
a[c].append(b)
sta = True
for i in range(1, n + 1):
b = []
st = 0
for j in a[i]:
if len(a[j]) != 1:
b.append(len(a[j]) - 2)
for j in range(len(b)):
if b[j] > 2:
st += 1
if st==2:
sta = False
if sta:
print('Yes')
else:
print('No')
|
if st==2:
| 19 |
decision
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)<10:
n=n-1
print (c)
|
if summa(c)<10:
| 11 |
decision
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n==1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
while n==1:
| 9 |
decision
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n==1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
while n==1:
| 9 |
decision
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n==1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
while n==1:
| 9 |
decision
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)==10:
n=n-1
print (c)
|
def summa(a):
summ=0
while a:
summ=summ+a%10
a=a//10
return summ
n=int(input())
c=19
while n>1:
c=c+9
if summa(c)<10:
n=n-1
print (c)
|
if summa(c)<10:
| 11 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.