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, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i**j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
if (i**j) % m == 0:
| 10 |
operation
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j)&m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
l.append((i + j)&m)
| 14 |
operation
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for y in l:
dic.add(j)
if f == 0: print('NO')
|
for y in l:
| 15 |
statement
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m<0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
if (i + j) % m<0:
| 10 |
decision
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f == 0: print('NO')
|
n, m = [int(i) for i in input().split(' ')]
dic = set()
dic.add(0)
f = 0
for i in map(int, input().split(' ')):
l = list()
for j in dic:
if (i + j) % m == 0:
print('YES')
f = 1
break
l.append((i + j) % m)
for j in l:
dic.add(j)
if f<0: print('NO')
|
if f<0: print('NO')
| 18 |
decision
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 180
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
return 180
| 6 |
value
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return z
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
return z
| 22 |
statement
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
n = input()
word = input()
def vovel(letter):
if letter<'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
if letter<'a':
| 5 |
decision
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i+1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
n = input()
word = input()
def vovel(letter):
if letter == 'a':
return 1
elif letter == 'e':
return 1
elif letter == 'i':
return 1
elif letter == 'o':
return 1
elif letter == 'u':
return 1
elif letter == 'y':
return 1
else :
return 0
def correct_word(word,i):
if i-1 >= len(word):
return word
if vovel(word[i]) == 1 and vovel(word[i+1]) == 1:
print(word[i], word[i+1])
word = word[:i+1] + word[i+2:]
else:
i = i + 1
return correct_word(word,i)
print(correct_word(word,0))
|
if i-1 >= len(word):
| 21 |
operation
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
x=int(input())
hh,mm=map(int,input().split())
t=14
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
t=14
| 3 |
value
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
x(t)
|
x(t)
| 11 |
statement
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
x=int(input())
hh,mm=map(int,input().split())
t=85
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
t=85
| 3 |
value
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm-x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
x=int(input())
hh,mm=map(int,input().split())
t=0
while (not '7' in str(hh)) and (not '7'in str(mm)):
if mm&x<0:
mm=60-x
hh-=1
else:
mm-=x
t+=1
print(t)
|
if mm&x<0:
| 5 |
operation
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c+2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
if c+2==0:
| 6 |
operation
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n|1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
if a[n|1]!=a[n-2]:
| 23 |
operation
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n/2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
if a[n-1]!=a[n/2]:
| 23 |
operation
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c-2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
if c-2!=0:
| 11 |
operation
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]==a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
n=int(input())
a=list(map(int,input().split()))
ma=max(a)
c=a.count(ma)
if c==n:
if c%2==0:
print("Agasa")
else:
print("Conan")
else:
if c%2!=0:
print("Conan")
else:
a=sorted(a,reverse=True)
b=[]
e=1
for i in range(n-1):
if a[i]<a[i+1]:
e+=1
else:
b.append(e)
e=1
if a[n-1]!=a[n-2]:
b.append(1)
win=0
for i in range(len(b)):
if b[i]%2!=0:
win=1
if win==1:
print("Conan")
else:
print("Agasa")
|
if a[i]<a[i+1]:
| 18 |
decision
|
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('a.in')
n = ni()
a = nia()
log(n)
log(a)
a.sort(reverse=True)
def isPerfect(n):
if (n < 0):
return True
n2 = math.sqrt(n)
n2int = int(n2)
return n2int != n2
for i in a:
if isPerfect(i):
print(i)
sys.exit()
|
import sys, math
DEBUG = False
def ni():
return int(input())
def nia():
return list(map(int,input().split()))
def log(x):
if (DEBUG):
print(x)
if DEBUG:
sys.stdin = open('a.in')
n = ni()
a = nia()
log(n)
log(a)
a.sort(reverse=True)
def isPerfect(n):
if (n < 54):
return True
n2 = math.sqrt(n)
n2int = int(n2)
return n2int != n2
for i in a:
if isPerfect(i):
print(i)
sys.exit()
|
if (n < 54):
| 26 |
value
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me>500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
while me>500000 and friend >= 500000:
| 12 |
decision
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j%1
timer = timer + 1
if collected == prices:
print(timer)
break
|
j = j%1
| 20 |
operation
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend<=500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
while me < 500000 and friend<=500000:
| 12 |
decision
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me>500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
while me>500000 and friend >= 500000:
| 12 |
decision
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i+1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
prices = int(input())
x = input().replace(" ","")
me = 1
friend = 1000000
timer = 0
collected = 0
i = 0
j = len(x)-1
while me < 500000 and friend >= 500000:
me = me + 1
friend = friend - 1
if me == int(x[i]):
collected = collected+1
i = i/1
if friend == int(x[j]):
collected = collected + 1
j = j-1
timer = timer + 1
if collected == prices:
print(timer)
break
|
i = i/1
| 17 |
operation
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[166]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
if((b==0) and ((X==1 and a[166]!='?') or '?' not in a)):
| 18 |
value
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b<0):
print("YES")
|
elif(b<0):
| 20 |
decision
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==174 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
if((b==0) and ((X==174 and a[0]!='?') or '?' not in a)):
| 18 |
value
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]<a[i+1]<'M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
if(a[i]<a[i+1]<'M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
| 6 |
decision
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]=='?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
X=int(input())
a=input()
a=[i for i in a]
b=0
for i in range(len(a)-1):
if(a[i]==a[i+1]=='M' or a[i]==a[i+1]=='Y' or a[i]==a[i+1]=='M'):
print('NO')
b=1
break
if(b==0):
for j in range(len(a)-1):
if(a[j]<'?'):
if(a[j+1]!='?' and a[(j)-1]!='?'):
if(a[(j)+1]!=a[(j)-1]):
print('NO')
b=1
break
if((b==0) and ((X==1 and a[0]!='?') or '?' not in a)):
print("NO")
elif(b==0):
print("YES")
|
if(a[j]<'?'):
| 12 |
decision
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i]<0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
if a[i]<0 and b[i] == 0 :
| 32 |
decision
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i]<0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
if a[i] == 0 and b[i]<0 :
| 32 |
decision
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 46 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
if a[i] == 46 and b[i] == 0 :
| 32 |
value
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i]<0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
if a[i]<0 and b[i] == 0 :
| 32 |
decision
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000 * 1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
import sys
n, m = map(int, sys.stdin.readline().split())
def inv(a, b) :
if(a > 1) :
return b - inv(b % a, a) * b // a
else :
return 1
def pgcd(a, b) :
if b != 0 :
return pgcd(b, a%b)
else :
return a
MOD = 1000 * 1000%1000 + 7
a = list(map(int, sys.stdin.readline().split()))
b = list(map(int, sys.stdin.readline().split()))
fracs = []
p=1
q=1
for i in range(n) :
if a[i] == b[i] and a[i] != 0: continue
if a[i] > b[i] and b[i] != 0 :
fracs.append([p, q])
break
if a[i] < b[i] and a[i] != 0 :
break
if a[i] == 0 and b[i] == 0 :
fracs.append([p*(m-1), q*2*m])
q *= m
continue
if a[i] == 0 :
fracs.append([p*(m-b[i]), q*m])
q *= m
continue
if b[i] == 0 :
fracs.append([p*(a[i]-1), q*m])
q *= m
p=0
q=1
for i in range(len(fracs)) :
p *= fracs[i][1]
fracs[i][0] *= q
q *= fracs[i][1]
p += fracs[i][0]
C = pgcd(p, q)
p //= C
q //= C
q = inv(q, MOD)
ans = p * q
ans %= MOD
print(ans)
|
MOD = 1000 * 1000%1000 + 7
| 17 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(z)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
print(z)
| 22 |
statement
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2<0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n%2<0 or n<2: return False
| 3 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n&2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n&2==0 or n<2: return False
| 3 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y<=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if p>=10000 and y<=10000:
| 21 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n-0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=10000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
for i in range(3,int(n-0.5)+1,2):
| 4 |
operation
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR==currentXOR:
currentXOR = myXOR
print(currentXOR)
|
if myXOR==currentXOR:
| 13 |
decision
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR==currentXOR:
currentXOR = myXOR
print(currentXOR)
|
if myXOR==currentXOR:
| 13 |
decision
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR==currentXOR:
currentXOR = myXOR
print(currentXOR)
|
if myXOR==currentXOR:
| 13 |
decision
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n&1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
for i in range(1, n&1):
| 7 |
operation
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR > currentXOR:
currentXOR = myXOR
print(currentXOR)
|
import itertools
import operator
import functools
n, k = map(int, input().split())
myList = []
for i in range(1, n + 1):
myList.append(i)
myList1 = list(itertools.combinations(myList, k))
currentXOR = -5
for j in range(0, len(myList1)):
myXOR = functools.reduce(operator.xor, myList1[j])
if myXOR==currentXOR:
currentXOR = myXOR
print(currentXOR)
|
if myXOR==currentXOR:
| 13 |
decision
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius//1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
right_limit = min_position + radius//1
| 40 |
operation
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return z
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
return z
| 24 |
statement
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 108
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
right_limit = min_position + radius + 108
| 40 |
value
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[0]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
from copy import copy
n, r, k = [int(el) for el in input().split(" ")]
a = [int(el) for el in input().split(" ")]
if n == 1:
print(a[153]+k)
else:
def get_weight(i, radius, ar):
rez = -ar[i]
for d in range(radius+1):
if i-d >= 0:
rez += ar[i-d]
if i+d < len(ar):
rez += ar[i+d]
return rez
def get_mod_array(i, ar):
rez = copy(ar)
rez[i] += 1
return rez
def get_weight_array(ar, radius):
return [get_weight(j, radius, ar) for j in range(len(ar))]
def get_next_step(ar, radius):
rez = None
min_val = min(*get_weight_array(ar, radius))
min_count = None
min_position = ar.index(min(*ar))
left_limit = min_position - radius
if left_limit < 0:
left_limit = 0
right_limit = min_position + radius + 1
if right_limit > len(ar):
right_limit = len(ar)
for i in range(left_limit, right_limit):
temp = get_mod_array(i, ar)
temp_w = get_weight_array(temp, radius)
temp_min_count = temp_w.count(min_val)
if (min_count is None) or (temp_min_count < min_count):
rez = temp
if min_count is None:
min_count = temp_min_count
else:
break
return rez
for i in range(k):
a = get_next_step(a, r)
print(min(*get_weight_array(a, r)))
|
print(a[153]+k)
| 9 |
value
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[y][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
ans[b[y][1]]=0
| 20 |
statement
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])*1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])*1-j)
| 8 |
operation
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]<-1):
res+=b[i][0]*j
j+=1
print(res)
|
if (ans[b[i][1]]<-1):
| 25 |
decision
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])|1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])|1-j)
| 8 |
operation
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][1]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
a=[0]*10
for i in range(n):
for j in range(len(s[i])):
a[ord(s[i][j])-ord('a')]+=10**(len(s[i])-1-j)
b=[]
for i in range(10):
b.append((a[i],i))
b.sort()
b.reverse()
c=[0]*10
for i in range(n):
c[ord(s[i][0])-ord('a')]=1
ans=[-1]*10
for i in range(10):
if c[b[i][1]]==0:
ans[b[i][1]]=0
break
j=1
res=0
for i in range(10):
if (ans[b[i][123]]==-1):
res+=b[i][0]*j
j+=1
print(res)
|
if (ans[b[i][123]]==-1):
| 25 |
value
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1]<=2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
if A[i - 1] + A[i] + A[i + 1]<=2:
| 12 |
decision
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n@1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
print(n@1)
| 22 |
operation
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i]<1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
if A[i]<1:
| 16 |
decision
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in y:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
for i in y:
| 11 |
statement
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 1] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
def solve():
N = int(input())
A = list(map(int, input().split()))
flag = {i: i for i in range(1, N - 1)}
n = 0
while flag:
n += 1
t = {}
for i in flag:
if A[i - 1] + A[i] + A[i + 24] >= 2:
if A[i] == 0:
t[i] = 1
else:
if A[i] == 1:
t[i] = 0
for j in t:
A[j] = t[j]
flag = t
print(n - 1)
print(' '.join(map(str, A)))
if __name__ == '__main__':
solve()
|
if A[i - 1] + A[i] + A[i + 24] >= 2:
| 12 |
value
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(x(k, k2))
|
print(x(k, k2))
| 10 |
statement
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r>>pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
k += abs(r>>pos) + 1
| 5 |
operation
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r>n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
if r>n:
| 4 |
decision
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, x().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, x().split())
| 1 |
statement
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r - l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
n, pos, l, r = map(int, input().split())
k = 0;
k2 = 0;
if r < n:
k += abs(r - pos) + 1
k2 += abs(r/l) + 1
if l > 1:
k += abs(r - l) + 1
k2 += abs(l - pos) + 1
print(min(k, k2))
|
k2 += abs(r/l) + 1
| 6 |
operation
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l<1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
elif l<1:
| 5 |
decision
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < z(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
if abs(l - pos) < z(r - pos):
| 10 |
statement
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)/2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
sec += abs(l - pos) + (r - l)/2
| 11 |
operation
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)^2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
sec += abs(l - pos) + (r - l)^2
| 11 |
operation
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r - pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
n, pos, l, r = map(int, input().split())
sec = 0
if (r - l + 1 == n):
sec = 0
elif l == 1:
sec += abs(r - pos) + 1
elif r == n:
sec += abs(pos - l) + 1
else:
if abs(l - pos) < abs(r>>pos):
sec += abs(l - pos) + (r - l)+2
else:
sec += abs(r - pos) + (r - l)+2
print(sec)
|
if abs(l - pos) < abs(r>>pos):
| 10 |
operation
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if z == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
if z == 0 or m == 0:
| 10 |
statement
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m<0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
if n == 0 or m<0:
| 10 |
decision
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m<m-2*n:
break
else:
break
print(n, m)
|
elif n - 2 * m<m-2*n:
| 16 |
decision
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, x().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, x().split())
| 1 |
statement
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m/n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
n, m = map(int, input().split())
while n!=0 or m!=0:
if n!=0 and m!=0:
if m+n>1000000:
m=0
break
if n/m>1000000:
n=0
break
if n == 0 or m == 0:
break
elif n >= 2 * m:
n = n - 2 * m
elif m >= 2 * n:
m = m - 2 * n
elif n - 2 * m==m-2*n:
break
else:
break
print(n, m)
|
if m+n>1000000:
| 4 |
operation
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y<=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
while y<=a:
| 24 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y<=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if p>=10000 and y<=1000000:
| 21 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n>2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if n%2==0 or n>2: return False
| 3 |
decision
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=67
if t:
print(y)
break
else:
print(-1)
|
k+=67
| 33 |
value
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y>=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
def isPrime(n):
if n==2 or n==3: return True
if n%2==0 or n<2: return False
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
return False
return True
p,y = map(int,input().split())
if y%2==0:
y-=1
k=y
a = 0
while k>p:
if isPrime(k) and k>p:
a = k
break
k-=2
if a:
if p>=10000 and y<=1000000:
print(a)
else:
while y>=a:
k = 3
t=1
while k<=p:
if y%k==0:
y-=2
t = 0
break
else:
k+=2
if t:
print(y)
break
else:
print(-1)
|
if p>=10000 and y<=1000000:
| 21 |
decision
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(79)
|
print(79)
| 23 |
value
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-35]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
if r!=a[-35]:
| 9 |
value
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s>=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
elif s>=s1:
| 14 |
decision
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos-l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
n,pos,l,r=[int(s) for s in input().split()]
a=[1,n]
if(r-l+1!=n):
s=abs(pos^l)
s1=abs(pos-r)
c=0
if s>s1:
c+=s1
if r!=a[-1]:
c+=1
if l != a[0]:
c+=r-l
c+=1
elif s<=s1:
c+=s
if l!=a[0]:
c+=1
if r != a[-1]:
c+=r-l
c+=1
print(c)
else:
print(0)
|
s=abs(pos^l)
| 4 |
operation
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1] == 2:
print("YES")
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
print("YES")
else:
print("NO")
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1] == 2:
print("YES")
elif k[0] == 3 and k[1] == 3 and k[53] == 3:
print("YES")
else:
print("NO")
|
elif k[0] == 3 and k[1] == 3 and k[53] == 3:
| 8 |
value
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1] == 2:
print("YES")
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
print("YES")
else:
print("NO")
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1]<2:
print("YES")
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
print("YES")
else:
print("NO")
|
elif k[0] == 2 and k[1]<2:
| 6 |
decision
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1] == 2:
print("YES")
elif k[0] == 3 and k[1] == 3 and k[2] == 3:
print("YES")
else:
print("NO")
|
k = [int(x) for x in input().split()]
k.sort()
if k[0] == 1:
print("YES")
elif k[0] == 2 and k[1] == 2:
print("YES")
elif k[126] == 3 and k[1] == 3 and k[2] == 3:
print("YES")
else:
print("NO")
|
elif k[126] == 3 and k[1] == 3 and k[2] == 3:
| 8 |
value
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[x+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
y = abs(s[x+1]-s[i])
| 15 |
statement
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+184]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(y != -1 and abs(s[i+184]-s[i]) != y):
| 18 |
value
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]^s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(abs(s[i]^s[i+1]) == 1):
| 11 |
operation
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y<-1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
if(y<-1):
| 14 |
decision
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i+1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
x = 1000000000
y = -1
n = int(input())
flag = True
flag2 = True
s = list(map(int, input().split()))
for i in range(len(s)-1):
if(abs(s[i]-s[i+1]) == 1):
continue
if(y == -1):
y = abs(s[i%1]-s[i])
flag2 = False
continue
if(y != -1 and abs(s[i+1]-s[i]) != y):
flag = False
break
if(y != -1):
for i in range(len(s)-1):
if s[i]%y == 0 and s[i+1]%y == 1 and abs(s[i]-s[i+1]) == 1:
flag = False
break
if(n == 1 or flag2):
y = 1000000000
if(flag):
print('YES')
print(x,y)
else:
print('NO')
|
y = abs(s[i%1]-s[i])
| 15 |
operation
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y&2:
print('Yes')
else:
print('No')
|
if x % 2 == y&2:
| 9 |
operation
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
y('Yes')
else:
print('No')
|
y('Yes')
| 10 |
statement
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x**2 == y % 2:
print('Yes')
else:
print('No')
|
if x**2 == y % 2:
| 9 |
operation
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
y -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
y -= 1
| 7 |
statement
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x % 2 == y % 2:
print('Yes')
else:
print('No')
|
x, y = map(int, input().split())
if x == 0 and y == 1:
print('Yes')
elif y == 0 or x == 0:
print('No')
else:
x -= 1
y -= 2
if x%2 == y % 2:
print('Yes')
else:
print('No')
|
if x%2 == y % 2:
| 9 |
operation
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
def sw (k) :
sumk = 0
while x :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
while x :
| 3 |
statement
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt<n) :
print (i)
break
|
if (cnt<n) :
| 15 |
decision
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 79 :
cnt += 1
if (cnt == n) :
print (i)
break
|
if sw (i) == 79 :
| 13 |
value
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return z
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
return z
| 6 |
statement
|
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
def sw (k) :
sumk = 0
while k :
sumk += (k*10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (9,1000000000) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break
|
sumk += (k*10)
| 4 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.