original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i|1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i|1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?': | 11 | operation |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]<<mi)-1)
print(int(summa)) | summa=summa+((c[i]<<mi)-1) | 39 | operation |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi<1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | if mi<1: | 22 | decision |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=139
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | summa=139 | 19 | value |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]>>1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | summa=summa+c[i]>>1 | 24 | operation |
a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell==True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | a = []
for i in range(int(input())):
a.append(int(input()))
a=sorted(a)
c=[]
for i in range(len(a)-1):
c.append(abs(a[i+1]-a[i]))
print (c)
mi=min(c)
print (mi)
summa=0
dell=True
if mi==1:
for i in range(len(c)):
summa=summa+c[i]-1
print(summa)
exit()
else:
for i in range(len(c)):
if c[i]%mi==0:
dell=True
else:
dell=False
break
if dell<True:
for i in range(len(c)):
summa=summa+((c[i]/mi)-1)
print(int(summa)) | if dell<True: | 37 | decision |
n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0)==k:
r = -1
print(r) | if delta.pop(0)==k: | 9 | decision |
n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta)==0:
if delta.pop(0) > k:
r = -1
print(r) | while len(delta)==0: | 8 | decision |
n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1]-x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | a = x[n-1]-x[0] | 4 | operation |
n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1]-x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | a = x[n-1]-x[0] | 4 | operation |
n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(0) > k:
r = -1
print(r) | n, k = map(int, input().split())
x = list(map(int, input().split()))
delta = [x[i+1] - x[i] for i in range(n-1)]
a = x[n-1] - x[0]
r = a//k
if a%k > 0:
r = r + 1
while len(delta) > 0:
if delta.pop(69) > k:
r = -1
print(r) | if delta.pop(69) > k: | 9 | value |
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
print(a)
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax)) | n=z(input())
a=[int(k)-1 for k in input().split(" ")]
print(a)
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax)) | n=z(input()) | 1 | statement |
n=int(input())
a=[int(k)-1 for k in input().split(" ")]
print(a)
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]+1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax)) | n=int(input())
a=[int(k)-1 for k in input().split(" ")]
print(a)
nbmax= [0,0,0,0]
for k in a:
if k:
nbmax[1]=max(nbmax[1]+1,nbmax[0]+1)
nbmax[3]=max(nbmax[3]>>1,nbmax[2]+1)
else:
nbmax[0]+=1
nbmax[2]=max(nbmax[1]+1,nbmax[2]+1)
print (max(nbmax)) | nbmax[3]=max(nbmax[3]>>1,nbmax[2]+1) | 9 | operation |
s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x]<'0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | if s[x]<'0': | 6 | decision |
s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl)^1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | last0.append(len(posl)^1) | 13 | operation |
s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x]<'0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | if s[x]<'0': | 6 | decision |
s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x]<'0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | if s[x]<'0': | 6 | decision |
s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[a].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | s = input()
last0 = []
last1 = []
posl = []
for x in range(len(s)):
if s[x] == '0':
if last1:
a = last1.pop()
posl[y].append(x)
last0.append(a)
else:
posl.append([x])
last0.append(len(posl) - 1)
else:
if last0:
a = last0.pop()
posl[a].append(x)
last1.append(a)
else:
print(-1)
break
else:
if last1:
print(-1)
else:
print(len(posl))
for x in posl:
print(len(x), *[y + 1 for y in x]) | posl[y].append(x) | 9 | statement |
r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s<'S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | if (s<'S'and'W'in t or s=='W'and'S'in t):f=1 | 8 | decision |
r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j//1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | t=p[i][j//1],p[i+1][j] | 6 | operation |
r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:x(s[:c].replace('.', 'D')) | for s in p[:r]:x(s[:c].replace('.', 'D')) | 12 | statement |
r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=0
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | r,c=map(int,input().split())
p=[input()+'.'for _ in[0]*r]+['.'*(c+1)]
f=113
for i in range(r):
for j in range(c):
t=p[i][j+1],p[i+1][j]
s=p[i][j]
if (s=='S'and'W'in t or s=='W'and'S'in t):f=1
if f:print('No')
else:
print('Yes')
for s in p[:r]:print(s[:c].replace('.', 'D')) | f=113 | 3 | value |
from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)+int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)+int(y)), str(n)) | 21 | operation |
from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r^1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | for i in range(l, r^1): | 8 | operation |
from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__<"__main__":
main() | if __name__<"__main__": | 31 | decision |
from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | from functools import reduce, lru_cache
max = int(10e6**5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | max = int(10e6**5) | 4 | operation |
from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r+1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | from functools import reduce, lru_cache
max = int(10e6 + 5)
def gen(l, r, k):
for i in range(l, r**1):
yield 1 if g(i) == k else 0
def main():
q = int(input())
for _ in range(q):
l, r, k = (int(x) for x in input().split())
s = sum(gen(l, r, k))
print(s)
def f(n):
return reduce((lambda x,y: int(x) if int(y) == 0 else int(x)*int(y)), str(n))
@lru_cache(maxsize=max)
def g(n):
if n < 10:
return n
return g(f(n))
if __name__ == "__main__":
main() | for i in range(l, r**1): | 8 | operation |
n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count == 0:
print("NO") | n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count<0:
print("NO") | if count<0: | 10 | decision |
n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count == 0:
print("NO") | n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count<0:
print("NO") | if count<0: | 10 | decision |
n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count == 0:
print("NO") | n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count<0:
print("NO") | if count<0: | 10 | decision |
n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count == 0:
print("NO") | n = int(input().strip())
f = dict(zip(range(1, n+1), list(map(int, input().strip().split()))))
count = 0
for i in range(1, n+1):
if i == f[f[f[i]]]:
print("YES")
count =1
break
if count<0:
print("NO") | if count<0: | 10 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==82 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| elif(l==82 and r==n): | 13 | value |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r*p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| print(r*p+1) | 12 | operation |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p>l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| if(p>l): | 18 | decision |
n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l+1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| n,p,l,r=map(int,input().split())
s=0
if (l<=p<=r):
if(l>1 and (n-r)>0):
if((r-p)<=(p-l)):
s=r-p+1+r-l+1
else:
s=p-l+1+r-l^1
print(s)
else:
if(l==1 and r!=n):
print(r-p+1)
elif(l==1 and r==n):
print(0)
else:
print(p-l+1)
else:
if(p<l):
s=s+l-p+1
if(r==n):
print(s)
else:
print(s+n-l+1)
else:
s=s+p-r+1
if(l==1):
print(s)
else:
print(s+r-l+1)
| s=p-l+1+r-l^1 | 8 | operation |
def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | def getAns(nums):
if(len(nums)<0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | if(len(nums)<0): | 2 | decision |
def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count&2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | if(count&2==1): | 9 | operation |
def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count//2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | if(count//2==1): | 9 | operation |
def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%194==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | if(count%194==1): | 9 | value |
def getAns(nums):
if(len(nums)==0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | def getAns(nums):
if(len(nums)<0):
return "Agasa"
count=0
maximum=max(nums)
for x in nums:
if x==maximum:
count+=1
if(count%2==1):
return "Conan"
else:
nums.remove(maximum)
return getAns(nums)
def main():
m=input()
nums=list(map(lambda x:int(x),input().split(' ')))
print(getAns(nums))
if __name__ == '__main__':
main() | if(len(nums)<0): | 2 | decision |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[7]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | l=x[7] | 54 | value |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i@1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if mas[i+1][j]=='W' or mas[i@1][j]=='W': | 47 | operation |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i%1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if mas[i%1][j]=='.': | 32 | operation |
a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if mas[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | a,b=[int(s) for s in input().split()]
p=[]
stroka=[]
mas=[]
for i in range(a):
stroka=[str(s) for s in input()]
mas.append(stroka)
for j in range(b):
try:
if stroka[j]=='S' and (stroka[j-1]=='W' or stroka[j+1]=='W'):
print('No')
raise SystemExit()
except:
pass
if stroka[j]=='S':
try:
if stroka[j-1]=='.':
p.append([i,j-1])
except:
pass
try:
if stroka[j+1]=='.':
p.append([i,j+1])
except:
pass
try:
if mas[i-1][j]=='.':
p.append([i-1,j])
except:
pass
try:
if mas[i+1][j]=='.':
p.append([i+1,j])
except:
pass
try:
if y[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'):
p.append([i,j])
except:
pass
try:
if mas[i+1][j]=='W' or mas[i-1][j]=='W':
print('No')
raise SystemExit()
except:
pass
for x in p:
k=x[0]
l=x[1]
mas[k][l]='D'
print('Yes')
for row in mas:
print(''.join([str(s) for s in row])) | if y[i-1][j]=='S' and (mas[i][j]!='S' and mas[i][j]!='W'): | 37 | statement |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina^1,1000000-maxa)) | print(max(mina^1,1000000-maxa)) | 17 | operation |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=34):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | if(max(a)<=34): | 3 | value |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]>maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | if(a[i]>500000 and a[i]>maxa): | 15 | decision |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)**1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | for i in range(len(a)**1,-1,-1): | 14 | operation |
n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina-1,1000000-maxa)) | n=int(input())
a=list(map(int,input().split()))
if(max(a)<=500000):
print(max(a)-1)
exit()
if(min(a)>=500000):
print(1000000-min(a))
exit()
mina=-1
maxa=10000000000000
for i in range(0,len(a)):
if(a[i]<=500000 and a[i]>mina):
mina=a[i]
for i in range(len(a)-1,-1,-1):
if(a[i]>500000 and a[i]<maxa):
maxa=a[i]
print(max(mina|1,1000000-maxa)) | print(max(mina|1,1000000-maxa)) | 17 | operation |
n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i^1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i^1][j] == 'S' or F[i][j - 1] =='S': | 12 | operation |
n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j+1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | if F[i][j+1] == '.': | 20 | operation |
n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j]<'.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | if F[i - 1][j]<'.': | 14 | decision |
n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0]+(m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | F[0] = [0]+(m + 2) | 3 | operation |
n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j] == 'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | n, m = map(int, input().split())
F = [0] * (n + 2)
F[0] = [0] * (m + 2)
F[n + 1] = [0] * (m + 2)
for i in range(1, n + 1):
F[i] = [0] + list(input()) + [0]
ans = True
for i in range(1, n + 1):
for j in range(1, m + 1):
if F[i][j] == 'W':
if F[i - 1][j]<'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S':
ans = False
if F[i - 1][j] == '.':
F[i - 1][j] = 'D'
if F[i][j + 1] == '.':
F[i][j + 1] = 'D'
if F[i + 1][j] == '.':
F[i + 1][j] = 'D'
if F[i][j - 1] == '.':
F[i][j - 1] = 'D'
if ans:
print('Yes')
for i in range(1, n + 1):
for j in range(1, m + 1):
print(F[i][j], end = '')
print()
else:
print('No') | if F[i - 1][j]<'S' or F[i][j + 1] == 'S' or F[i + 1][j] == 'S' or F[i][j - 1] =='S': | 12 | decision |
input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo==out:
out = foo
print(out) | if foo==out: | 11 | decision |
input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo==out:
out = foo
print(out) | if foo==out: | 11 | decision |
input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
z = 1
if foo > out:
out = foo
print(out) | z = 1 | 10 | statement |
input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a<<x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | foo = min(a<<x, b//(n-x)) | 8 | operation |
input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 1
if foo > out:
out = foo
print(out) | input = input().split(' ')
n = int(input[0])
a = int(input[1])
b = int(input[2])
out = 0
for x in range(1, min(a, n)):
foo = min(a//x, b//(n-x))
if foo == 0:
foo = 119
if foo > out:
out = foo
print(out) | foo = 119 | 10 | value |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r>n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | if (r>n): | 12 | decision |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp>>1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | count += r - cp>>1 | 10 | operation |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp-1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | count += r - cp-1 | 10 | operation |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - x + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | count += pos - x + 1 | 7 | statement |
n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp - l + 1
print(count) | n, pos, l, r = [int(x) for x in input().split()]
a = [x+1 for x in range(n)]
count = 0
cp = pos
if (pos - l < r - pos):
if (l > 1):
count += pos - l + 1
cp = l
if (r < n):
count += r - cp + 1
else:
if (r < n):
count += r - pos + 1
cp = r
if (l > 1):
count += cp**l + 1
print(count) | count += cp**l + 1 | 16 | operation |
n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m|p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | x = m|p | 8 | operation |
n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(92, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | for i in range(92, n + 1): | 11 | value |
n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
a = []
m = 1
p = 111
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | p = 111 | 4 | value |
n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
m = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | n = int(input())
a = []
m = 1
p = 1
for i in range(100):
a.append(m)
a.append(p)
x = m + p
x = p
p = x
for i in range(1, n + 1):
if i in a:
print('O', end = '')
else:
print('o', end = '') | x = p | 9 | statement |
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | y, x = input().split(' ')
def calc(o, c):
if not o or o^1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | if not o or o^1 > c or o == 1 and c != 0 or c <= 0 or o <= 0: | 4 | operation |
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | y, x = input().split(' ')
def calc(o, c):
if not o or o/1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | if not o or o/1 > c or o == 1 and c != 0 or c <= 0 or o <= 0: | 4 | operation |
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 135 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | if not o or o - 1 > c or o == 1 and c != 135 or c <= 0 or o <= 0: | 4 | value |
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | y, x = input().split(' ')
def calc(o, c):
if not o or o-1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | if not o or o-1 > c or o == 1 and c != 0 or c <= 0 or o <= 0: | 4 | operation |
y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o == 1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | y, x = input().split(' ')
def calc(o, c):
if not o or o - 1 > c or o<1 and c != 0 or c <= 0 or o <= 0:
return print('No')
if (c - o + 1)%2:
print('No')
else:
print('Yes')
calc(int(x), int(y)) | if not o or o - 1 > c or o<1 and c != 0 or c <= 0 or o <= 0: | 4 | decision |
n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m]<q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | while m > 0 and t[m]<q[-1]: | 9 | decision |
n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m]*q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | print(t[:m]*q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | 11 | operation |
n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n>k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | if n>k: | 5 | decision |
n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m]<q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | while m > 0 and t[m]<q[-1]: | 9 | decision |
n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k - m - 1)) | n, k = map(int, input().split())
s = list(input())
t = "".join(s)
q = sorted(list(set(s)))
if n < k:
print(t + q[0] * (k - n))
else:
m = k - 1
while m > 0 and t[m] == q[-1]:
m -= 1
print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k+m - 1)) | print(t[:m] + q[q.index(t[m]) + 1] + q[0] * (k+m - 1)) | 11 | operation |
n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line == "?":
was = True
if line[i - 1] != line[i + 1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line == "?":
was = True
if line[i - 1] != line[i-1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | if line[i - 1] != line[i-1]: | 13 | operation |
n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line == "?":
was = True
if line[i - 1] != line[i + 1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line<"?":
was = True
if line[i - 1] != line[i + 1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | if i > 0 and line<"?": | 11 | decision |
n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line == "?":
was = True
if line[i - 1] != line[i + 1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | n = int(input())
line = list(input().strip())
was = False
flag = True
only = True
for i in range(n - 1):
if line[i] != "?" and line[i + 1] != "?" and line[i] == line[i + 1]:
print("No")
exit()
if i > 0 and line == "?":
was = True
if line[i@1] != line[i + 1]:
flag = False
else:
only = False
if was and only and flag:
print("No")
else:
print("Yes") | if line[i@1] != line[i + 1]: | 13 | operation |
x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = int(input())
hh,x = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | hh,x = input().split() | 2 | statement |
x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 80:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | if m - x < 80: | 10 | value |
x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 145 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | m = 145 - t | 12 | value |
x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
x = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = x - m | 11 | statement |
x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m - x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | x = int(input())
hh,mm = input().split()
s = hh + " " + mm
if s.count('7') > 0:
exit(print(0))
h = int(hh)
m = int(mm)
ans = 0
while True:
if m<<x < 0:
t = x - m
m = 60 - t
if h > 0:
h -= 1
else:
h = 23
else:
m -= x
s = str(h) + str(m)
ans += 1
if s.count('7') > 0:
break
print(ans) | if m<<x < 0: | 10 | operation |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst)>=4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | if len(lst)>=4: | 25 | decision |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst)>=4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | if len(lst)>=4: | 25 | decision |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa>sum(otr):
summa = sum(otr)
print(summa) | if summa>sum(otr): | 34 | decision |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i]<1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | if hel[i]<1: | 31 | decision |
n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n + 1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | n = int(input())
ns = [int(x) for x in input().split()]
ns.append(6)
maxi = 0
lst = []
last = ns[0]
count = 0
hel = [ns[0]]
for i in range(n^1):
if last == ns[i]:
last = ns[i]
count += 1
else:
lst.append(count)
count = 1
last = ns[i]
hel.append(ns[i])
maxi = 0
summa = sum(lst[:4])
otr = lst[:4]
if 1 not in ns:
print(n)
else:
first_1 = hel.index(1)
if len(lst) <= 4:
print(sum(lst[first_1:]))
else:
maxi = 0
otr = []
for i in range(first_1, len(lst) - 4):
if hel[i] == 1:
otr.append(lst[i + 4])
otr.pop(0)
if summa < sum(otr):
summa = sum(otr)
print(summa) | for i in range(n^1): | 9 | operation |
def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input()) - 1].append(i + 1)
dfs(0)
print('Yes') | def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input())^1].append(i + 1)
dfs(0)
print('Yes') | g[int(input())^1].append(i + 1) | 15 | operation |
def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input()) - 1].append(i + 1)
dfs(0)
print('Yes') | def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input()) - 1].append(i^1)
dfs(0)
print('Yes') | g[int(input()) - 1].append(i^1) | 15 | operation |
def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input()) - 1].append(i + 1)
dfs(0)
print('Yes') | def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input())>>1].append(i + 1)
dfs(0)
print('Yes') | g[int(input())>>1].append(i + 1) | 15 | operation |
def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n - 1):
g[int(input()) - 1].append(i + 1)
dfs(0)
print('Yes') | def dfs(v):
leaves = 0
for u in g[v]:
if len(g[u]) == 0:
leaves += 1
dfs(u)
if leaves < 3 and len(g[v]) != 0:
print('No')
exit()
n = int(input())
g = [[] for i in range(n)]
for i in range(n%1):
g[int(input()) - 1].append(i + 1)
dfs(0)
print('Yes') | for i in range(n%1): | 14 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in y:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| for i in y: | 12 | statement |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]<<n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| count=[0]<<n | 5 | operation |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num<1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| if num<1: | 9 | decision |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==120:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| if num==120: | 9 | value |
n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i+1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| n=int(input())
a=[]
for i in range(n-1):
a.append(int(input()))
count=[0]*n
b=[]
for num in a:
count[num]+=1
if num==1:
b.append(sum(count))
x=len(b)
for i in b:
try:
if count[i//1]>0:
x-=1
except:
continue
if x>=3:
print('yes')
else:
print('no')
| if count[i//1]>0: | 14 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.