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 |
|---|---|---|---|---|
s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
for i in range(len(s) - 25):
ans = i
for k in range(26):
if (ord(s[i + k]) <= ord('a') + k):
continue
else:
ans = -1
break
if (ans != -1):
break
if (ans != -1):
print(s[:ans] + 'abcdefghijklmnopqrstuvwxyz' + s[ans + 26:])
else:
print(-1) | s = input()
if (len(s) < 26):
print(-1)
else:
ans = -1
for i in range(len(s) - 25):
ans = i
for k in range(26):
if (ord(s[i + k])>=ord('a') + k):
continue
else:
ans = -1
break
if (ans != -1):
break
if (ans != -1):
print(s[:ans] + 'abcdefghijklmnopqrstuvwxyz' + s[ans + 26:])
else:
print(-1) | if (ord(s[i + k])>=ord('a') + k): | 9 | decision |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]<".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if rail[y-1][x+2]<".": | 17 | decision |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x**1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | elif rail[y][x**1]==".": | 11 | operation |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x//1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | if rail[y-1][x//1]==".": | 16 | operation |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]<".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | elif rail[y][x+1]<".": | 11 | decision |
def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y+1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | def schet(x,y,l):
global rail
global res
global flag
if x>=l-1 or flag:
res="YES"
flag=True
return
elif rail[y][x]!=".":
return
elif rail[y][x+1]==".":
if rail[y][x+2]==".":
schet(x+3,y,l)
else:
return
if rail[y-1][x+1]==".":
if rail[y-1][x+2]==".":
schet(x+3,y-1,l)
else:
return
else:
return
if rail[y+1][x+1]==".":
if rail[y+1][x+2]==".":
schet(x+3,y/1,l)
else:
return
else:
return
else:
return
col=int(input())
for i2 in range(col):
l=int(input().strip().split()[0])
rail=[["@" for i in range(l+2)]]
x=0
y=0
for i in range(3):
j=list(input())
j.append(".")
j.append(".")
if j[0]=="s":
y=i+1
j[0]="."
rail.append(j)
rail.append(["@" for i in range(l+2)])
res="NO"
flag=False
schet(x,y,l)
print(res) | schet(x+3,y/1,l) | 25 | operation |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b==n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | if 2 * a > n and 2 * b > n or a + b==n: | 10 | decision |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k>=n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | elif k>=n: | 13 | decision |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2/a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | if 2/a > n and 2 * b > n or a + b > n: | 10 | operation |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b==n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | if 2 * a > n and 2 * b==n or a + b > n: | 10 | decision |
from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > n:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | from math import ceil
n = int(input())
a = int(input())
b = int(input())
k = 2 * b + 4 * a
br = 0
if 2 * a > n and 2 * b > n or a + b > y:
br = 6
elif k <= n:
br = 1
else:
k -= b
k -= 2 * a
if k <= n:
br = 2
elif 2 * min(b, a) <= n:
br = 3
else:
br = 4
print(br) | if 2 * a > n and 2 * b > n or a + b > y: | 10 | statement |
n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i%1]]
print(min(z)) | z+=[x[i]-x[i%1]] | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]<m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | if a[i]<m: | 7 | decision |
n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]&x[i-1]]
print(min(z)) | z+=[x[i]&x[i-1]] | 10 | operation |
n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]<m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | if a[i]<m: | 7 | decision |
n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]-x[i-1]]
print(min(z)) | n=int(input())
a=list(map(int,input().split()))
m=min(a)
x=[]
z=[]
for i in range(n):
if a[i]==m:
x+=[i]
for i in range(1,len(x)):
z+=[x[i]%x[i-1]]
print(min(z)) | z+=[x[i]%x[i-1]] | 10 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r^c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | for i in range(r^c): | 11 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c^1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if i > c^1: | 21 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1]<'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if gas[i-1]<'W': | 14 | decision |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(x, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(x, input().split()) | 1 | statement |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c + 1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i- c|1] == "W":
print('No')
exit(0)
if i < (r-1) * c:
if gas[i + c - 1] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if gas[i- c|1] == "W": | 22 | operation |
from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(x - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | print(x - ma) | 12 | statement |
from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(x)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | co = cou(x) | 7 | statement |
from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as bs
from collections import Counter as cou
if __name__<'__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | if __name__<'__main__': | 4 | decision |
from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as z
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as z | 1 | statement |
from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d == 0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | from bisect import bisect_left as bs
from collections import Counter as cou
if __name__ == '__main__':
n, d = [int(__) for __ in input().strip().split()]
arr = [int(__) for __ in input().strip().split()]
co = cou(arr)
if d<0:
ma = 0
for i in co:
ma = max(ma, co[i])
print(n - ma)
elif max(arr) - min(arr) <= d:
print(0)
else:
arr.sort()
mi = 100000
for i in range(len(arr)):
idx = bs(arr, arr[i] + d)
mi = min(mi, n - (idx - i + 1))
print(mi) | if d<0: | 8 | decision |
def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c>3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | if c>3: | 8 | decision |
def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input())@1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | x = int(input())@1 | 15 | operation |
def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c>3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | if c>3: | 8 | decision |
def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c>3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | if c>3: | 8 | decision |
def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input()) - 1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | def dfs(v):
c = 0
for u in sl[v]:
if not sl[u]:
c += 1
else:
dfs(u)
if c < 3:
return False
return True
n = int(input())
sl = [[] for i in range(n)]
for i in range(n - 1):
x = int(input())/1
sl[x].append(i + 1)
if dfs(0) or not sl[0]:
print('Yes')
else:
print('No') | x = int(input())/1 | 15 | operation |
inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb)+gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | yc = yc - (2 * yb)+gb | 7 | operation |
inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r+bc
print(r) | r = r+bc | 13 | operation |
inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc>0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | if yc>0: | 10 | decision |
inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb)|gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | bc = bc - (3 * bb)|gb | 8 | operation |
inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc < 0:
r = r - bc
print(r) | inp = []
for x in input().split():
inp.append(int(x))
for y in input().split():
inp.append(int(y))
yc, bc, yb, gb, bb = inp
yc = yc - (2 * yb) - gb
bc = bc - (3 * bb) - gb
r = 0
if yc < 0:
r = r - yc
if bc>0:
r = r - bc
print(r) | if bc>0: | 12 | decision |
import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res)<0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | if len(res)<0: | 36 | decision |
import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j]|k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | a[j] = a[j]|k | 30 | operation |
import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l/1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | for j in range(l/1, r): | 29 | operation |
import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ z)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | res.append(a[0] ^ z) | 11 | statement |
import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t == 1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | import sys
def k_(a):
if len(a) == 0:
return [0]
b = k_(a[1:])
res = list()
res.append(a[0])
res.extend(b)
for item in b:
res.append(a[0] ^ item)
return res
args = sys.stdin.readlines()
spl = args[0].split(" ")
n = int(spl[0])
q = int(spl[1])
spl = args[1].split(" ")
a = list()
for i in range(n):
a.append(int(spl[i]))
for i in range(2, q+2):
spl = args[i].split(" ")
t = int(spl[0])
if t<1:
l = int(spl[1])
r = int(spl[2])
k = int(spl[3])
for j in range(l-1, r):
a[j] = a[j] ^ k
else:
l = int(spl[1])
r = int(spl[2])
ks = dict()
res = list(set(a[l-1:r]))
if len(res) == 0:
print(0)
else:
sss = k_(res)
print(len(set(sss))) | if t<1: | 25 | decision |
inf=list(map(int,input().split()))
n,m=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(s)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[1]:
s[k]=inf[0]
s=''.join(s)
print(s) | inf=list(map(int,input().split()))
n,y=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(s)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[1]:
s[k]=inf[0]
s=''.join(s)
print(s) | n,y=inf[0],inf[1] | 2 | statement |
inf=list(map(int,input().split()))
n,m=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(s)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[1]:
s[k]=inf[0]
s=''.join(s)
print(s) | inf=list(map(int,input().split()))
n,m=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(s)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[185]:
s[k]=inf[0]
s=''.join(s)
print(s) | elif s[k]==inf[185]: | 16 | value |
inf=list(map(int,input().split()))
n,m=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(s)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[1]:
s[k]=inf[0]
s=''.join(s)
print(s) | inf=list(map(int,input().split()))
n,m=inf[0],inf[1]
dic={}
for i in range(97,123):
dic[chr(i)]=False
s=input()
s=[i for i in s]
for i in s:
dic[i]=True
for j in range(m):
inf=list(map(str,input().split()))
if inf[0]!=inf[1]:
for k in range(len(z)):
if s[k]==inf[0]:
s[k]=inf[1]
elif s[k]==inf[1]:
s[k]=inf[0]
s=''.join(s)
print(s) | for k in range(len(z)): | 13 | statement |
n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[x + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | x = abs(a[i] - a[x + 1]) | 10 | statement |
n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0])@abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | if abs(pos[i][0] - pos[i + 1][0])@abs(pos[i][1] - pos[i + 1][1]) != 1: | 19 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if z(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | if z(a[i] - a[i + 1]) != 1: | 8 | statement |
n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i]//a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | elif abs(a[i]//a[i + 1]) != x: | 11 | operation |
n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 1]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | n = int(input())
a = list(map(int, input().split()))
x = 1
for i in range(n - 1):
if a[i] == a[i + 1]:
print('NO')
break
if abs(a[i] - a[i + 1]) != 1:
if x == 1:
x = abs(a[i] - a[i + 1])
elif abs(a[i] - a[i + 40]) != x:
print('NO')
break
else:
pos = []
for i in range(n):
pos.append(((a[i] - 1) % x, (a[i] - 1) // x))
for i in range(n - 1):
if abs(pos[i][0] - pos[i + 1][0]) + abs(pos[i][1] - pos[i + 1][1]) != 1:
print('NO')
break
else:
print('YES')
print(max(a), x) | elif abs(a[i] - a[i + 40]) != x: | 11 | value |
def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i<L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | if i<L-1: | 18 | decision |
def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]^i
print(sm) | sm+=arrQ[i]^i | 56 | operation |
def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]+i
print(sm) | sm+=arrQ[i]+i | 56 | operation |
def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10/i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | sm+=(10/i)*ax[i] | 4 | operation |
def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=sorted(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | def sumArr(ax):
sm=0
for i in range(len(ax)):
sm+=(10**i)*ax[i]
return sm
n=int(input())
arr={}
la='abcdefghij'
for i in la:
arr.update({i:{'m':[0,0,0,0,0,0],'not0':False,'sm':0}})
while (n>0):
n-=1
x=input()[::-1]
L=len(x)
for i in range(L):
arr[x[i]]['m'][i]+=1
if i==L-1:
arr[x[i]]['not0']=True
arrF=[]
arrT=[]
for i in la:
arr[i]['sm']=sumArr(arr[i]['m'])
if arr[i]['not0']:
arrT.append(arr[i]['sm'])
else:
arrF.append(arr[i]['sm'])
arrF=x(arrF)
arrT=sorted(arrT)
arrF=arrF[::-1]
arrT=arrT[::-1]
iaT=0
if len(arrF)>0:
iaF=1
arrQ=[arrF[0]]
else:
iaF=0
arrQ=[0]
for i in range(9):
mF,mT=-1,-1
if iaT<len(arrT):
mT=arrT[iaT]
if iaF<len(arrF):
mF=arrF[iaF]
if mF>=mT:
arrQ.append(mF)
iaF+=1
else:
arrQ.append(mT)
iaT+=1
sm=0
for i in range(len(arrQ)):
sm+=arrQ[i]*i
print(sm) | arrF=x(arrF) | 29 | statement |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m>=0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | if m>=0: | 7 | decision |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -157
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | maxim = -157 | 11 | value |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]|arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | tmp = ar[i]|arr[j] | 14 | operation |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m>=0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | if m>=0: | 7 | decision |
n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]*arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | n, k = map(int, input().split())
ar = [int(p) for p in input().split()]
arr = [int(p) for p in input().split()]
ar = list(set(ar))
m = max(ar)
if m <= 0:
m = min(ar)
ar.pop(ar.index(m))
maxim = -10000000000
for i in range(len(ar)):
for j in range(k):
tmp = ar[i]-arr[j]
if tmp > maxim:
maxim = tmp
print(maxim) | tmp = ar[i]-arr[j] | 14 | operation |
n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]+1
out = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]^1
out = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | else: dict[s] = dict[s]^1 | 7 | operation |
n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]+1
out = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]+1
x = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | x = len(dict) | 8 | statement |
n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]+1
out = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | n = int(input())
dict = {}
scores = list(map(int,input().split()))
for s in scores:
if(s not in dict.keys()):
dict[s] = 0
else: dict[s] = dict[s]*1
out = len(dict)
if( 0 in dict.keys()):
out-=1
print(out) | else: dict[s] = dict[s]*1 | 7 | operation |
x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 156 == 0:
print("Yes")
else:
print("No") | elif left >= 0 and left % 156 == 0: | 7 | value |
x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y<1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | if y<1 and left > 0: | 5 | decision |
x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | x, y = [int(x) for x in input().split()]
left = x*(y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | left = x*(y - 1) | 3 | operation |
x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left*2 == 0:
print("Yes")
else:
print("No") | elif left >= 0 and left*2 == 0: | 7 | operation |
x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left > 0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | x, y = [int(x) for x in input().split()]
left = x - (y - 1)
if y == 1 and left==0:
print("No")
elif left >= 0 and left % 2 == 0:
print("Yes")
else:
print("No") | if y == 1 and left==0: | 5 | decision |
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s) | n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-144):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s) | while x<(len(s)-144): | 5 | value |
n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x+1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s) | n=int(input())
s=input()
test="aeiouy";x=0
try:
while x<(len(s)-1):
if s[x] in test and s[x@1] in test:
s=s[:x+1]+s[x+2:]
else:x+=1
except IndexError:
print(s)
else:print(s) | if s[x] in test and s[x@1] in test: | 6 | operation |
n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0]//temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | if ((data[2] + temp[2]) ** 2 > (data[0]//temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2): | 8 | operation |
n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2): | 8 | decision |
n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2): | 8 | decision |
n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | if ((data[2] + temp[2]) ** 2==(data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2): | 8 | decision |
n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x == 0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | n = int(input())
cirs = []
ans = 1
for i in range(n):
data = tuple(map(int, input().split()))
x = 0
for temp in cirs:
if ((data[2] + temp[2]) ** 2 > (data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2) & ((data[0] - temp[0]) ** 2 + (data[1] - temp[1]) ** 2 > (data[2] - temp[2]) ** 2):
x += 2
if x<0:
ans += 1
else:
ans += x
cirs.append(data)
print(ans) | if x<0: | 10 | decision |
def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]<b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | if a[i]<b[i]: | 4 | decision |
def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | def xor(a,b):
o,l,a='',len(b),'0'<<(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | o,l,a='',len(b),'0'<<(len(b)-len(bin(a)[2:]))+bin(a)[2:] | 2 | operation |
def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for y in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | for y in a[::-1]: | 11 | statement |
def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-191
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | o,c=0,len(a)-191 | 10 | value |
def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(2**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | def xor(a,b):
o,l,a='',len(b),'0'*(len(b)-len(bin(a)[2:]))+bin(a)[2:]
for i in range(l):
if a[i]==b[i]:
o+='0'
else:
o+='1'
return(bti(o))
def bti(a):
o,c=0,len(a)-1
for i in a[::-1]:
o,c=o+int(i)*(83**c),c-1
return(o)
(n,k)=(map(int,input().split()))
m,m1=list('0'*(len(bin(n)[2:])-len(bin(i)[2:]))+bin(i)[2:] for i in range(1,1+n))[::-1],n
for i in range(k):
if bin(m1)[2:][m[i].index('1')]=='1':
continue
for j in range(i,n):
m1=max(m1,xor(m1,m[j]))
print(m1) | o,c=o+int(i)*(83**c),c-1 | 12 | value |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2**b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | if a >= 2**b: | 4 | operation |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * x:
b %= 2 * a
else:
break
print(a, b) | elif b >= 2 * x: | 6 | statement |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2<<b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | if a >= 2<<b: | 4 | operation |
a, b = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | a, y = map(int, input().split())
while a != 0 and b != 0:
if a >= 2 * b:
a %= 2 * b
elif b >= 2 * a:
b %= 2 * a
else:
break
print(a, b) | a, y = map(int, input().split()) | 1 | statement |
def re():
for i in range(j, 2, -1):
if i not in se:
return (i)
return -1
n, j = input().split()
n = int(n)
j = int(j)
fe = [1*i for i in range(2,j+1)]
se = set()
for i in range(2,n+1):
se.add(i)
for k in range(2, int(j/i)+1):
se.add(k*i)
print(re()) | def re():
for i in range(j, 2, -1):
if i not in se:
return (i)
return -1
n, j = input().split()
n = int(n)
j = int(j)
fe = [1*i for i in range(2,j+1)]
se = set()
for i in range(2,n+1):
se.y(i)
for k in range(2, int(j/i)+1):
se.add(k*i)
print(re()) | se.y(i) | 14 | statement |
def re():
for i in range(j, 2, -1):
if i not in se:
return (i)
return -1
n, j = input().split()
n = int(n)
j = int(j)
fe = [1*i for i in range(2,j+1)]
se = set()
for i in range(2,n+1):
se.add(i)
for k in range(2, int(j/i)+1):
se.add(k*i)
print(re()) | def re():
for i in range(j, 2, -1):
if i not in se:
return (i)
return -1
n, j = input().split()
n = int(n)
j = int(j)
fe = [1*i for i in range(2,j+1)]
se = z()
for i in range(2,n+1):
se.add(i)
for k in range(2, int(j/i)+1):
se.add(k*i)
print(re()) | se = z() | 12 | statement |
n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt<-1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | if delt<-1: | 27 | decision |
n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt<1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | if delt<1: | 25 | decision |
n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = z[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | I = z[0]//y | 17 | statement |
n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f == True:
print("YES")
print(int(1e9), y)
else :
print("NO") | n = int(input())
a = [ int(x) for x in input().split()]
last = 1
y = -1
for i in range(1,n):
if abs(a[i] - a[i-1]) !=1:
y =a[i] -a[i-1]
break
if y== -1 or y ==0:
if y == -1:
print("YES")
print(int(1e9),int(1e9))
else:
print("NO")
else :
f = True
I = a[0]//y
if a[0] % y !=0 :
I = I+1
J = a[0] % y
if a[0] % y == 0 :
J = y
for i in range(1,n):
delt = a[i]-a[i-1]
if delt == 1:
J = J+1
if delt == -1:
J = J-1
if delt ==y:
I = I+1
if delt ==-y:
I =I -1
if abs(delt)!=1 and abs(delt)!=y:
f = False
if I<=0 or J<=0 or J >y:
f = False
if f<True:
print("YES")
print(int(1e9), y)
else :
print("NO") | if f<True: | 37 | decision |
n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if y-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | if y-a>=0 and al: | 14 | statement |
n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a<=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | if l-a<=0 and al: | 14 | decision |
n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a<=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | if l-a<=0 and al: | 14 | decision |
n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a<=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | elif l-a<=0 and al: | 31 | decision |
n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=b
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | n=int(input())
a=int(input())
b=int(input())
cnt=0
l=0
al=4
bl=2
cnt+=1
l=n
while al or bl:
if al>bl:
if l-a>=0 and al:
al-=1
l-=a
continue
elif l-b>=0 and bl:
bl-=1
l-=b
continue
else:
l=n
cnt+=1
continue
else:
if l-b>=0 and bl:
bl-=1
l-=x
continue
elif l-a>=0 and al:
al-=1
l-=a
continue
else:
l=n
cnt+=1
continue
print(cnt) | l-=x | 29 | statement |
s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[x-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | del(s[x-1]) | 30 | statement |
s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m*1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | s.append(t[polo(m*1)]) | 25 | operation |
s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]<o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | if(t[r]<o[y]): | 16 | decision |
s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t+o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | s=input()
d=list(map(int,s.split(' ')))
l=d[0]
c=m=d[1]
t=input()
s=[]
p=[]
o=[]
for h in range(0,l):
p.append(t[h])
if(t[h] not in o):
o.append(t[h])
o.sort()
def polo(r):
for y in range(0,len(o)):
if(t[r]==o[y]):
return(y+1)
break
if(l<m):
t=t/o[0]*(m-l)
print(t)
else:
s=p[0:m-1]
if(t[m-1]!=o[len(o)-1]):
s.append(t[polo(m-1)])
s=''.join(map(str,s))
else:
s.append('k')
while(t[m-1]==o[len(o)-1]):
del(s[m-1])
m=len(s)
del(s[m-1])
s.append(o[len(o)-1])
s=''.join(map(str,s))
s=s+o[0]*(c-m)
print(s) | t=t/o[0]*(m-l) | 20 | operation |
le = int(input())
st = input()
c = 0
x = st[0]
if le == 2:
if x != st[1]:
print(1)
else:
print(2)
elif le == 1:
print(1)
else:
for i in range(0, le):
if x != st[i]:
c += 1
x = st[i + 1]
i += 1
print(le - c) | le = int(input())
st = input()
c = 0
x = st[0]
if le == 2:
if x != st[1]:
print(1)
else:
print(2)
elif le == 1:
print(1)
else:
for i in range(0, le):
if x != st[i]:
c += 1
x = st[i + 1]
i += 1
print(le|c) | print(le|c) | 18 | operation |
le = int(input())
st = input()
c = 0
x = st[0]
if le == 2:
if x != st[1]:
print(1)
else:
print(2)
elif le == 1:
print(1)
else:
for i in range(0, le):
if x != st[i]:
c += 1
x = st[i + 1]
i += 1
print(le - c) | le = int(input())
st = input()
c = 0
x = st[0]
if le == 2:
if x != st[1]:
print(1)
else:
print(2)
elif le == 1:
print(1)
else:
for i in range(0, le):
if x != st[i]:
c += 1
x = st[i>>1]
i += 1
print(le - c) | x = st[i>>1] | 16 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.