original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n=int(input())
s=list(map(str,input()))
i=1
a=['a', 'e', 'i', 'o', 'u' ,'y']
while i<n:
if s[i] in a and s[i-1] in a:
del s[i]
n-=1
else:
i+=1
for i in s:
print(i,end='')
|
n=int(input())
s=list(map(str,input()))
i=1
a=['a', 'e', 'i', 'o', 'u' ,'y']
while i<n:
if s[i] in a and s[i^1] in a:
del s[i]
n-=1
else:
i+=1
for i in s:
print(i,end='')
|
if s[i] in a and s[i^1] in a:
| 6 |
operation
|
n=int(input())
s=list(map(str,input()))
i=1
a=['a', 'e', 'i', 'o', 'u' ,'y']
while i<n:
if s[i] in a and s[i-1] in a:
del s[i]
n-=1
else:
i+=1
for i in s:
print(i,end='')
|
n=int(input())
s=list(map(str,input()))
i=1
a=['a', 'e', 'i', 'o', 'u' ,'y']
while i<n:
if s[i] in a and s[i^1] in a:
del s[i]
n-=1
else:
i+=1
for i in s:
print(i,end='')
|
if s[i] in a and s[i^1] in a:
| 6 |
operation
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(x//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
a=a+(x//2)*'8'
| 7 |
statement
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)&'8'
print(a)
|
a=(k//2)&'8'
| 10 |
operation
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
k=int(input())
a=''
if(k==37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
if(k==37):
| 3 |
decision
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
k=int(input())
y=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
y=''
| 2 |
statement
|
k=int(input())
a=''
if(k>37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
k=int(input())
a=''
if(k==37):
print(-1)
exit()
if(k&1):
a=a+(k//2)*'8'
a+='4'
else:
a=(k//2)*'8'
print(a)
|
if(k==37):
| 3 |
decision
|
import random
import sys
import os
import math
n = int (input())
arr = []
num = input()
arr = list(map(int, num.split(' ')))
maxnum = float('-inf')
for x in range(0, len(arr)):
if (arr[x] >= 0 and (not math.sqrt(arr[x]).is_integer()) and maxnum < arr[x]):
maxnum = arr[x]
elif (arr[x] < 0 and maxnum < arr[x]):
maxnum = arr[x]
print (int(maxnum))
|
import random
import sys
import os
import math
n = int (input())
arr = []
x = input()
arr = list(map(int, num.split(' ')))
maxnum = float('-inf')
for x in range(0, len(arr)):
if (arr[x] >= 0 and (not math.sqrt(arr[x]).is_integer()) and maxnum < arr[x]):
maxnum = arr[x]
elif (arr[x] < 0 and maxnum < arr[x]):
maxnum = arr[x]
print (int(maxnum))
|
x = input()
| 8 |
statement
|
import random
import sys
import os
import math
n = int (input())
arr = []
num = input()
arr = list(map(int, num.split(' ')))
maxnum = float('-inf')
for x in range(0, len(arr)):
if (arr[x] >= 0 and (not math.sqrt(arr[x]).is_integer()) and maxnum < arr[x]):
maxnum = arr[x]
elif (arr[x] < 0 and maxnum < arr[x]):
maxnum = arr[x]
print (int(maxnum))
|
import random
import sys
import os
import math
n = int (input())
arr = []
num = input()
arr = list(map(int, num.split(' ')))
maxnum = float('-inf')
for x in range(0, len(arr)):
if (arr[x] >= 0 and (not math.sqrt(arr[x]).is_integer()) and maxnum>arr[x]):
maxnum = arr[x]
elif (arr[x] < 0 and maxnum < arr[x]):
maxnum = arr[x]
print (int(maxnum))
|
if (arr[x] >= 0 and (not math.sqrt(arr[x]).is_integer()) and maxnum>arr[x]):
| 13 |
decision
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
y=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
y=int(input())
| 1 |
statement
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
n=int(input())
m=int(input())
p = 2**n
if m>p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
if m>p:
| 4 |
decision
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y>>p)
|
print(m-y>>p)
| 10 |
operation
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y%p)
|
print(m-y%p)
| 10 |
operation
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m-y*p)
|
n=int(input())
m=int(input())
p = 2**n
if m<p:
print(m)
elif m==p:
print(0)
else:
y=m//p
print(m//y*p)
|
print(m//y*p)
| 10 |
operation
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]<'?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]<'?'):
| 18 |
decision
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]<'?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]<'?'):
| 18 |
decision
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i&1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
if s[i]=='?' and (s[i-1]==s[i&1] or s[i-1]=='?' or s[i+1]=='?'):
| 18 |
operation
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i@1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
if s[i]=='?' and (s[i@1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
| 18 |
operation
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)-1]=='?':
say_yes()
say_no()
|
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
for i in range(1, len(s)-1):
if s[i]=='?' and (s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?'):
say_yes()
if s[0]=='?' or s[len(s)+1]=='?':
say_yes()
say_no()
|
if s[0]=='?' or s[len(s)+1]=='?':
| 21 |
operation
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y<z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
elif y<z:
| 21 |
decision
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b+plate2
main()
|
return b+plate2
| 33 |
operation
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n<10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
elif n<10 and a==5 and b==28:
| 6 |
decision
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
def main():
y,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
y,a,b=map(int,input().strip().split())
| 2 |
statement
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b==28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
def main():
n,a,b=map(int,input().strip().split())
count=0
if a+b==n:
count=1
elif n==10 and a==5 and b<28:
count=3
elif n==4 and a==11 and b==18:
count=6
else:
count=divide(n,a,b)
print(count)
def divide(n,a,b):
x=(a+b)/n
y=a/x
z=b/x
if y>z:
plate1=int(y)+1
plate2=n-plate1
elif y==z:
plate1=int(y)
plate2=int(z)
else:
plate2=int(z)+1
plate1=n-plate2
if plate1==0:
plate1=1
if plate2==0:
plate2=1
if a//plate1<b//plate2:
return a//plate1
return b//plate2
main()
|
elif n==10 and a==5 and b<28:
| 6 |
decision
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)<<1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
for i in range(1, len(canvas)<<1):
| 19 |
operation
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i^1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
if canvas[i] == canvas[i^1] and canvas[i] != "?":
| 7 |
operation
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1]<canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1]<canvas[i+1]:
| 20 |
decision
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = True
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
lengthCanvas = int(input(""))
canvas = input("")
colors = ["C","M","Y"]
flag = x
for i in range(len(canvas)-1):
if canvas[i] == canvas[i+1] and canvas[i] != "?":
flag = False
if flag:
flag = False
if canvas[0] == "?" or canvas[len(canvas)-1] == "?":
flag = True
for i in range(len(canvas)-1):
if canvas[i] == "?" and canvas[i] == canvas[i+1]:
flag = True
for i in range(1, len(canvas)-1):
if len(canvas) > 1 and canvas[i] == "?" and canvas[i-1] == canvas[i+1]:
flag = True
if flag:
print("Yes")
else:
print("No")
|
flag = x
| 4 |
statement
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix>len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
while ix>len(x) or iy < len(y):
| 10 |
decision
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 143
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
sum_y = 143
| 7 |
value
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x < sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
import sys
def solve(x, y):
ix = 0
iy = 0
sum_x = 0
sum_y = 0
count = 0
while ix < len(x) or iy < len(y):
if sum_x>sum_y:
sum_x += x[ix]
ix += 1
else:
sum_y += y[iy]
iy += 1
if sum_x == sum_y:
++count
return count
def main():
line = sys.stdin.readline().split(' ')
n = int(line[0])
m = int(line[1])
x = [int(i) for i in sys.stdin.readline().split(' ')]
y = [int(i) for i in sys.stdin.readline().split(' ')]
print(solve(x, y))
if __name__ == '__main__':
main()
|
if sum_x>sum_y:
| 11 |
decision
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x)%1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
a = list(int(x)%1 for x in a)
| 5 |
operation
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[y+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
res = min(res, max(a[i]-1 + int(1e6)-1 - a[y+1]))
| 12 |
statement
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)<<2 - a[0])
print(res)
|
res = min(res, int(1e6)<<2 - a[0])
| 14 |
operation
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-1])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
import sys
n = int(input())
a = list(input().split(' '))
a = list(int(x) - 1 for x in a)
res = 0
a.sort()
l = list(x for x in range(n))
r = list(x for x in range(n))
res = sys.maxsize
for i in range(n-1):
res = min(res, max(a[i]-1 + int(1e6)-1 - a[i+1]))
res = min(res, a[n-161])
res = min(res, int(1e6)-2 - a[0])
print(res)
|
res = min(res, a[n-161])
| 13 |
value
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous^present)
previous = present
print (max(time2,time1))
|
time2 += (previous^present)
| 18 |
operation
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]<=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
if prizes[i]<=500000:
| 8 |
decision
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
z = present
print (max(time2,time1))
|
z = present
| 19 |
statement
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]>=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
n = int(input())
prizes = list(map(int, input().split()))
time1 = 0
time2 = 0
present = 0
previous = 1
for i in range(n):
if prizes[i]<=500000:
break
present = prizes[i]
time1 += (present-previous)
previous = present
previous = 1000000
for j in range(n-1,-1,-1):
if prizes[j] <=500000:
break
present = prizes[j]
time2 += (previous - present)
previous = present
print (max(time2,time1))
|
if prizes[i]<=500000:
| 8 |
decision
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n<len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n+2:]
q=1
if q==1:
break
print(x)
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n<len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n+2:]
q=1
if q<1:
break
print(x)
|
if q<1:
| 13 |
decision
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n<len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n+2:]
q=1
if q==1:
break
print(x)
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n<len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n^2:]
q=1
if q==1:
break
print(x)
|
x=x[:n+1]+x[n^2:]
| 11 |
operation
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n<len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n+2:]
q=1
if q==1:
break
print(x)
|
s=input()
x=input()
g=['a','e','i','o','u','y']
q=1
while q:
q=0
for n, i in enumerate(x):
if i in g:
if n>len(x)-1:
if x[n+1] in g:
x=x[:n+1]+x[n+2:]
q=1
if q==1:
break
print(x)
|
if n>len(x)-1:
| 9 |
decision
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i<0):
count+=1
print(count)
|
if(x%i<0):
| 8 |
decision
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
z = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
z = int(input())
| 1 |
statement
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x&i
if(x%i == 0):
count+=1
print(count)
|
x = x&i
| 7 |
operation
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i<0):
count+=1
print(count)
|
if(x%i<0):
| 8 |
decision
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
print(count)
|
n = int(input())
x = n
count = 1
for i in range(1,(int(n/2))):
x = n
x = x-i
if(x%i == 0):
count+=1
z(count)
|
z(count)
| 11 |
statement
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 4:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
if n % 2 != 4:
| 9 |
value
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1)//2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
if (m-1)//2 == 0:
| 8 |
operation
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n-2 == 0:
print("Yes")
else:
print("No")
|
if n-2 == 0:
| 14 |
operation
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2 == 0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
str = input()
s = str.split()
n = int(s[0])
m = int(s[1])
if n == 0 or n - m + 1 < 0 :
print("No")
n = n - m + 1
if (m-1) % 2<0:
if n % 2 != 0:
print("No")
else:
print("Yes")
else:
if n % 2 == 0:
print("Yes")
else:
print("No")
|
if (m-1) % 2<0:
| 8 |
decision
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k / a[i]));
break;
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k&a[i]));
break;
|
print(int(k&a[i]));
| 12 |
operation
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k / a[i]));
break;
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k//a[i] == 0):
print(int(k / a[i]));
break;
|
if (k//a[i] == 0):
| 11 |
operation
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k / a[i]));
break;
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i]<0):
print(int(k / a[i]));
break;
|
if (k % a[i]<0):
| 11 |
decision
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k / a[i]));
break;
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k**a[i] == 0):
print(int(k / a[i]));
break;
|
if (k**a[i] == 0):
| 11 |
operation
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k / a[i]));
break;
|
s = input();
a = s.split();
n = int(a[0]);
k = int(a[1]);
s = input();
a = s.split();
for i in range(0, n):
a[i] = int(a[i]);
a.sort();
for i in range(n - 1, -1, -1):
if (k % a[i] == 0):
print(int(k<<a[i]));
break;
|
print(int(k<<a[i]));
| 12 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n//1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
for i in range(k, n//1, k):
| 7 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a==b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
if c and (n - n // k) * a==b:
| 17 |
decision
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n<<1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
for i in range(k, n<<1, k):
| 7 |
operation
|
n = int(input())
k = int(input())
a = int(input())
b = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
n = int(input())
k = int(input())
a = int(input())
y = int(input())
arr = {}
for i in range(k, n + 1, k):
arr[i] = True
cost = 0
while n != 1:
try:
c = arr[n]
except:
c = False
if c and (n - n // k) * a > b:
cost += b
n //= k
else:
if n > k:
cost += (n % k) * a
n -= n % k
else:
cost += (n - 1) * a
n = 1
print(cost)
|
y = int(input())
| 4 |
statement
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea<<2 != 0:
print('No')
else:
print('Yes')
|
elif lea<<2 != 0:
| 12 |
operation
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea>0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
elif lea>0:
| 8 |
decision
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
m, n = map(int, input().split())
clo = n+1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
clo = n+1
| 3 |
operation
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
m, n = map(int, input().split())
clo = n - 1
lea = z - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
lea = z - clo
| 4 |
statement
|
m, n = map(int, input().split())
clo = n - 1
lea = m - clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
m, n = map(int, input().split())
clo = n - 1
lea = m*clo
if n <= 0:
print('No')
elif lea < 0:
print('No')
elif n == 1 and lea != 0:
print('No')
elif lea % 2 != 0:
print('No')
else:
print('Yes')
|
lea = m*clo
| 4 |
operation
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=b/2
j=c
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=b/2
j=c
print(i,y,g)
|
print(i,y,g)
| 17 |
statement
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=0):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=b/2
j=c
print(i,j,g)
|
a=input()
a,b,c,d,e=[*map(int,a.split(' '))]
f=((e-c)**2 + (d-b)**2)**0.5
g=(a+f)/2
h=a-g
if(f!=0):
if(h>=47):
i=((b*(h+f)-(h*d))/f)
j=((c*(h+f)-(h*e))/f)
else:
i=b
j=c
g=a
else:
i=b/2
j=c
print(i,j,g)
|
if(h>=47):
| 7 |
value
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
y = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
y = {}
| 3 |
statement
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 56
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
n -= 56
| 27 |
value
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a)<len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
if len(a)<len(b):
| 8 |
decision
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i += 1
print('if', ans, n, i)
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
print('elif', ans, n, i)
else:
n -= 1
print('else', ans, n, i)
else:
for y in range(9, -1, -1):
ans += str(y)**dict[y
]
print(ans)
|
ans += str(y)**dict[y
| 31 |
operation
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem|1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
freq_list[elem|1] += 1
| 12 |
operation
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 178
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
count = 178
| 9 |
value
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem<<1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
freq_list[elem<<1] += 1
| 12 |
operation
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem@1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
freq_list[elem@1] += 1
| 12 |
operation
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem-1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
def is_balanced(freq_list):
key = freq_list[0]
for i in range(1, len(freq_list)):
if freq_list[i] != key:
return False
return True
def lottery(k, array):
count = 0
freq_list = [0 for _ in range(k)]
for elem in array:
freq_list[elem^1] += 1
while not(is_balanced(freq_list)):
ind_max = freq_list.index(max(freq_list))
ind_min = freq_list.index(min(freq_list))
freq_list[ind_max] -= 1
freq_list[ind_min] += 1
count += 1
return count
def main():
n, k = input().split(' ')
array = input().split(' ')
array = [int(elem) for elem in array]
print(lottery(k, array))
main()
|
freq_list[elem^1] += 1
| 12 |
operation
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q//1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
d|={i for i in range(pos+1,q//1)}
| 11 |
operation
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(161,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
d|={i for i in range(161,pos)}
| 7 |
value
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos&1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
d|={i for i in range(pos&1,q+1)}
| 11 |
operation
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=0:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
q,w=map(int,input().split())
a=[0]+list(map(int,input().split()))
s=[{} for i in range(0,q+1)]
def f(pos,w,q):
d={pos}
if w>=pos:
d|={i for i in range(1,pos)}
else:
d|={i for i in range(pos-w,pos)}
if pos>=q-w:
d|={i for i in range(pos+1,q+1)}
else:
d|={i for i in range(pos+1,pos+w+1)}
return d
for i in range(1,q+1):
if a[i]!=76:
s[i]=s[a[i]]|f(i,w,q)
else:
s[i]=f(i,w,q)
for i in range(1,q+1):
print(len(s[i]),end=' ')
|
if a[i]!=76:
| 17 |
value
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b<i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
if((q>0 and b<i)):
| 14 |
decision
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>179 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
if((q>179 and b==i)):
| 14 |
value
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]<'?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
elif(s[0]<'?' or s[-1]=='?'):
| 5 |
decision
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]<'?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
elif(s[0]=='?' or s[-1]<'?'):
| 5 |
decision
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]=='?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
n=input()
s=input()
if s.count("CC") or s.count("MM") or s.count("YY"):
print("No")
elif(s[0]=='?' or s[-1]<'?'):
print("Yes")
elif s.count("??"):
print("Yes")
else:
b=''
q=0
for i in s:
if(i!='?'):
if((q>0 and b==i)):
print("Yes")
break
q=0
b=i
else:
q+=1
else:
print("No")
|
elif(s[0]=='?' or s[-1]<'?'):
| 5 |
decision
|
user = input()
user = user.replace("0", "O")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
for login in base:
login = login.replace("0", "O")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
|
user = input()
user = user.replace("0", "O")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
for login in base:
login = login.replace("0", "O")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
if login<user:
f = False
break
if f:
print("Yes")
else:
print("No")
|
if login<user:
| 14 |
decision
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right*1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
arr = list(range(left, right*1))
| 18 |
operation
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr//countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
return arr//countMessages(int(refs[i])-1)
| 24 |
operation
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i-k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
right = i-k
| 15 |
operation
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr%countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
return arr%countMessages(int(refs[i])-1)
| 24 |
operation
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i]) == 0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
def countMessages(i):
global n
global k
global refs
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
arr = list(range(left, right + 1))
if left == right:
arr = [i]
if int(refs[i])<0:
return arr
else:
return arr + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
if int(refs[i])<0:
| 21 |
decision
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff<0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
if diff<0:
| 11 |
decision
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff<0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
if diff<0:
| 11 |
decision
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff<0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
if diff<0:
| 11 |
decision
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff<1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
if diff<1:
| 14 |
decision
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y == -1 else y))
exit()
|
n = int(input())
path = list(map(int, input().split()))
eleminatedY = {1}
y = -1
for i in range(n - 1):
diff = abs(path[i] - path[i + 1])
if diff == 0:
exit(print("NO"))
if diff == 1:
eleminatedY.add(min(path[i], path[i + 1]))
continue
if y == diff:
continue
for value in eleminatedY:
if value % diff == 0:
exit(print("NO"))
if y == -1:
y = diff
continue
exit(print("NO"))
print("YES\n{} {}".format(1000000000, 1 if y<-1 else y))
exit()
|
print("YES\n{} {}".format(1000000000, 1 if y<-1 else y))
| 31 |
decision
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 178)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
cash.append(list(range(left, right + 178)))
| 15 |
value
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left>0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
if left>0:
| 10 |
decision
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right%1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
cash.append(list(range(left, right%1)))
| 15 |
operation
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n - 1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
n_k = input().split(' ')
n = int(n_k[0])
k = int(n_k[1])
refs = input().split(' ')
res = list()
cash = list()
for i in range(0, n):
left = i - k
if left < 0:
left = 0
right = i + k
if right >= n:
right = n|1
cash.append(list(range(left, right + 1)))
def countMessages(i):
global cash
if int(refs[i]) == 0:
return cash[i]
else:
return cash[i] + countMessages(int(refs[i])-1)
for i in range(0, n):
messages = countMessages(i)
res.append(len(list(set(messages))))
print(' '.join([str(i) for i in res]))
|
right = n|1
| 14 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.