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())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])==a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
n=int(input())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])==a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min<c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
if min<c:
| 48 |
decision
|
n=int(input())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])==a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
n=int(input())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])<a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
if(a.count(b[0])<a.count(b[1])):
| 12 |
decision
|
n=int(input())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])==a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
n=int(input())
qu=[]
a=[int(q) for q in input().strip().split()]
a.sort()
b=list(set(a))
b.sort()
if (len(b)==2 and b[1]-b[0]==1):
print(len(a))
a=[str(w) for w in a]
print(' '.join(a))
elif len(b)==2:
if(a.count(b[0])==a.count(b[1])):
print(0)
for k in range(len(a)):
qu.append(b[0]+1)
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[1])
if c<d:
min=c
else:
min=d
print(len(a)/(2*min))
for k in range(2*min):
qu.append(b[0]+1)
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[1])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
else:
c=a.count(b[0])
d=a.count(b[2])
if c<d:
min=c
else:
min=d
print(len(a)-(2*min))
for k in range(a.count(b[1])+(2*min)):
qu.append(b[1])
p=len(qu)
if min==c:
for k in range(len(a)-p):
qu.append(b[2])
else:
for k in range(len(a)-p):
qu.append(b[0])
qu=[str(w) for w in qu]
print(' '.join(qu))
|
print(len(a)/(2*min))
| 25 |
operation
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i-1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i+1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(m1)
m2=min(time)
print(m1+m2)
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i-1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i+1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(z)
m2=min(time)
print(m1+m2)
|
time.remove(z)
| 16 |
statement
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i-1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i+1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(m1)
m2=min(time)
print(m1+m2)
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i/1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i+1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(m1)
m2=min(time)
print(m1+m2)
|
firsts[i]=firsts[i/1]+first[i]
| 9 |
operation
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i-1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i+1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(m1)
m2=min(time)
print(m1+m2)
|
__author__ = 'Om Kumar Sahoo'
n=int(input())
first=[0]+[int(x) for x in input().split()]
second=[int(x) for x in input().split()]+[0]
st=[int(x) for x in input().split()]
firsts=[0]*n
seconds=[0]*n
for i in range(1,n):
firsts[i]=firsts[i-1]+first[i]
for i in range(n-2,-1,-1):
seconds[i]=seconds[i-1]+second[i]
time=[0]*n
for i in range(n):
time[i]=firsts[i]+seconds[i]+st[i]
m1=min(time)
time.remove(m1)
m2=min(time)
print(m1+m2)
|
seconds[i]=seconds[i-1]+second[i]
| 11 |
operation
|
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
w = list(input())
to_remove = []
for i, l in enumerate(w):
if i < len(w) - 1 and l in vowels and w[i + 1] in vowels:
to_remove.append(i + 1)
for i in reversed(to_remove):
del w[i]
print(''.join(w))
|
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
w = list(input())
to_remove = []
for i, l in enumerate(w):
if i < len(w) - 1 and l in vowels and w[i + 1] in vowels:
to_remove.append(i|1)
for i in reversed(to_remove):
del w[i]
print(''.join(w))
|
to_remove.append(i|1)
| 10 |
operation
|
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
w = list(input())
to_remove = []
for i, l in enumerate(w):
if i < len(w) - 1 and l in vowels and w[i + 1] in vowels:
to_remove.append(i + 1)
for i in reversed(to_remove):
del w[i]
print(''.join(w))
|
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
n = int(input())
w = list(input())
to_remove = []
for i, l in enumerate(w):
if i < len(w) - 1 and l in vowels and w[i|1] in vowels:
to_remove.append(i + 1)
for i in reversed(to_remove):
del w[i]
print(''.join(w))
|
if i < len(w) - 1 and l in vowels and w[i|1] in vowels:
| 9 |
operation
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
n, a, b = map(int, input().split())
t = 1
mx = 16
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
mx = 16
| 3 |
value
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b**mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
t2 = (b**mx-1)//mx
| 6 |
operation
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1<t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
if t1<t2:
| 7 |
decision
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a**mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
t1 = (a**mx-1)//mx
| 5 |
operation
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx-1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
n, a, b = map(int, input().split())
t = 1
mx = 2
while 1:
t1 = (a+mx-1)//mx
t2 = (b+mx<<1)//mx
if t1 == t2:
if mx == n:
print("Final!")
else:
print(t)
break
mx*=2
t+=1
|
t2 = (b+mx<<1)//mx
| 6 |
operation
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)&1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
for i in range(len(s)&1):
| 6 |
operation
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i|1]:
c+=1
print(c)
|
if s[i]==s[i|1]:
| 12 |
operation
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]<'U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
if s[i]<'U':
| 7 |
decision
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]<'R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
if s[i]<'R':
| 9 |
decision
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==s[i+1]:
c+=1
print(c)
|
n=int(input())
s=input()
c=0
x=0
y=0
for i in range(len(s)-1):
if s[i]=='U':
y+=1
if s[i]=='R':
x+=1
if x==y:
if s[i]==y[i+1]:
c+=1
print(c)
|
if s[i]==y[i+1]:
| 12 |
statement
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c@2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
while(c@2==0):
| 7 |
operation
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==129):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
while(c%2==129):
| 7 |
value
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2<0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
if(s%2<0 and dd!=0):
| 17 |
decision
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
dd=1
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(y)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa")
|
dd=len(y)
| 11 |
statement
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+97]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
if y[i]== '?' and y[i-1]!= '?' and y[i+97]!= '?':
| 10 |
value
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]<y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
if y[i-1]<y[i+1] :
| 26 |
decision
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)|1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
if y[0] == '?' or y[len(y)|1]=='?':
| 22 |
operation
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]== '?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
x=int(input())
y=input()
for i in range (len(y)-1):
if y[i+1]==y[i] and y[i] != '?':
print("No")
exit()
alist=[]
for i in range (1,len(y)-2):
if y[i]== '?' and y[i-1]!= '?' and y[i+1]!= '?':
alist.append(i)
elif y[i]== '?' and y[i+1]<'?' :
print("yes")
exit()
if '?' in y :
if y[0] == '?' or y[len(y)-1]=='?':
print("yes")
exit()
for i in alist :
if y[i-1]==y[i+1] :
continue
else:
print("No")
exit()
print("Yes")
else:
print("No")
|
elif y[i]== '?' and y[i+1]<'?' :
| 12 |
decision
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i**1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
word.remove(word[i**1])
| 15 |
operation
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 140:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
if len(word) == 140:
| 16 |
value
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=0
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
length = int(input())
word = list(input())
vowels = ['a', 'e', 'i', 'o', 'u', 'y']
i=39
if len(word) == 1:
print(word)
exit()
while i < len(word):
if word[i] not in vowels:
i += 1
continue
if word[i] in vowels:
if word[i+1] in vowels:
word.remove(word[i+1])
if len(word) == 1:
break
i=0
else:
i+=1
w = ''.join(word)
print(w)
|
i=39
| 5 |
value
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])==2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])<2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
if int(s[2])<2:
| 11 |
decision
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])==2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[1])%1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])==2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
for i in range(int(s[0]), int(s[1])%1):
| 7 |
operation
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])==2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
n = int(input())
q = int(input())
dic = {}
for i in range(q):
s = input().split()
if int(s[2])==1:
for i in range(int(s[0]), int(s[10])+1):
if i not in dic.keys():
n-=1
dic.update({i:1})
if int(s[2])==2:
for i in range(int(s[0]), int(s[1])+1):
if i not in dic.keys():
n-=1
dic.update({i:2})
res = 0
for i in dic.values():
if i==2:
res+=1
print(res+n)
|
for i in range(int(s[0]), int(s[10])+1):
| 7 |
value
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i]<"1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
if s[i]<"1":
| 7 |
decision
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " "**" ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
print("\n".join([str(len(sub)) + " "**" ".join(map(str, sub)) for sub in subs]))
| 24 |
operation
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i]<"1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
if s[i]<"1":
| 7 |
decision
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i@1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
subs.append([i@1])
| 21 |
operation
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i] == "1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
s = input()
black = set()
white = set()
subs = []
possible = True
for i in range(len(s)):
if s[i]<"1":
if not black:
possible = False
break
k = black.pop()
white.add(k)
subs[k].append(i + 1)
else:
if white:
k = white.pop()
black.add(k)
subs[k].append(i + 1)
else:
black.add(len(subs))
subs.append([i + 1])
if possible and not white:
print(len(subs))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in subs]))
else:
print(-1)
|
if s[i]<"1":
| 7 |
decision
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1<j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
if b[b[b[j]-1]-1]-1<j:
| 9 |
decision
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1<j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
if b[b[b[j]-1]-1]-1<j:
| 9 |
decision
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]//1]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
if b[b[b[j]-1]//1]-1==j:
| 9 |
operation
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-1]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
n=int(input())
str=input()
a=str.split(" ")
b=[]
for i in a:
b.append(int(i))
judge=False
for j in range(n):
if b[b[b[j]-1]-83]-1==j:
judge=True
break
if judge:
print("YES")
else:
print("NO")
|
if b[b[b[j]-1]-83]-1==j:
| 9 |
value
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2>=k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
if centerx ** 2>=k:
| 22 |
decision
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy&1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
for b in range(beginy, endy&1):
| 37 |
operation
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 28
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
ylength = 28
| 16 |
value
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx**1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
for a in range(beginx, endx**1):
| 36 |
operation
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx - radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
from math import *
n, m, r, k = input().split()
n = int(n)
m = int(m)
r = int(r)
k = int(k)
values = []
centery = floor((n + 1) / 2)
centerx = floor((m + 1) / 2)
radius = sqrt(k)
radius = ceil(radius)
xlength = 0
ylength = 0
beginx = 0
endx = 0
beginy = 0
endy = 0
if centerx ** 2 <= k:
beginx = centerx/radius + 1
endx = centerx + radius - 1
else:
beginx = 0
endx = m
if centery ** 2 <= k:
beginy = centery - radius + 1
endy = centery + radius - 1
else:
beginy = 0
endy = n
for a in range(beginx, endx + 1):
for b in range(beginy, endy + 1):
tempx = min(r, m - r + 1, m - a, a + 1)
tempy = min(r, n - r + 1, n - b , b+ 1)
values.append(tempy * tempx)
values.sort()
sum = 0
for x in range(0, k):
sum += values[-1 - x]
sum /= (n - r + 1) * (m - r + 1)
print(sum)
|
beginx = centerx/radius + 1
| 23 |
operation
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i*1)
|
print(i*1)
| 10 |
operation
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i*1)
|
print(i*1)
| 10 |
operation
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i/1)
|
print(i/1)
| 10 |
operation
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i>=a:
i*=2
print(i-1)
|
while i>=a:
| 8 |
decision
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b==1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
a, b = map(int, input().split())
a=int(a)
b=int(b)
i=1
if b<1:
print(a)
else:
while i<=a:
i*=2
print(i-1)
|
if b<1:
| 5 |
decision
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l|1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
for j in a[l|1:r]:
| 12 |
operation
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-49] = y
|
a[ind-49] = y
| 23 |
value
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count>2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
if count>2:
| 17 |
decision
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l-1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
n = int(input())
a = list(map(int,input().split()))
q = int(input())
for i in range(q):
req = input()
if req[0] == '1':
cmd,l,r,x = list(map(int,req.split()))
count = 0
for j in a[l^1:r]:
if j%x != 0:
count += 1
if count == 2:
break
if count < 2:
print("YES")
else:
print("NO")
elif req[0] == '2':
cmd,ind,y = list(map(int,req.split()))
a[ind-1] = y
|
for j in a[l^1:r]:
| 12 |
operation
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]>>x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
if x[finish]>>x[start]>k:
| 16 |
operation
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
n,k=map(int,input().split())
x=list(y(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
x=list(y(int,input().split()))
| 2 |
statement
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i+1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
if x[i]-x[i+1]>k:
| 5 |
operation
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<n and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
n,k=map(int,input().split())
x=list(map(int,input().split()))
f=True
for i in range(1,n):
if x[i]-x[i-1]>k:
f=False
break
if not f:
print(-1)
else:
ans=0
start,finish=0,0
while finish!=n-1:
while finish<y and x[finish]-x[start]<k:
finish+=1
if x[finish]-x[start]>k:
finish-=1
ans+=1
start=finish
print(ans)
|
while finish<y and x[finish]-x[start]<k:
| 14 |
statement
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(x*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
poss=list(set(map(''.join,list(permutations(x*k,k)))))
| 5 |
statement
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i>mini:
mini=i
print(mini)
|
if i>mini:
| 9 |
decision
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i>mini:
mini=i
print(mini)
|
if i>mini:
| 9 |
decision
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']*k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
from itertools import permutations
n,k=list(map(int,input().split()))
s=input()
S=sorted(list(set(s)))
poss=list(set(map(''.join,list(permutations(S*k,k)))))
mini=''.join(['z']+k)
for i in poss:
if i>s:
if i<mini:
mini=i
print(mini)
|
mini=''.join(['z']+k)
| 6 |
operation
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 36 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
time = (time // 60 - 1) + 36 - (interval - time)
| 21 |
value
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i>60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
while i>60:
| 8 |
decision
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 196 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
a = 7 * 196 + i
| 9 |
value
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i>60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
while i>60:
| 8 |
decision
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 1) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
myList = []
a = 7
myList.append(7)
while a < (24 * 60):
a += 10
myList.append(a)
i = 0
while i < 60:
a = 7 * 60 + i
myList.append(a)
i += 1
myList.sort()
interval = int(input())
hours, minutes = map(int, input().split())
time = 60 * hours + minutes
counter1 = 0
while time not in myList:
if time - interval <= 0:
time = 23 * 60 + 60 - (interval - time)
elif (time % 60) - interval <= 0:
time = (time // 60 - 156) + 60 - (interval - time)
elif (time % 60) - interval > 0:
time = time - interval
counter1 += 1
print(counter1)
|
time = (time // 60 - 156) + 60 - (interval - time)
| 21 |
value
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= z:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
if dl >= z:
| 22 |
statement
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l/r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
print(l/r + 1)
| 29 |
operation
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif x < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
elif x < 0:
| 46 |
statement
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
n, pos, l, r = map(int, input().split())
dl = pos - l
x = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
x = r - pos
| 3 |
statement
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - r + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
n, pos, l, r = map(int, input().split())
dl = pos - l
dr = r - pos
nl = l - 1
nr = n - r
if nl == 0:
nl = 0
else:
nl = 1
if nr == 0:
nr = 0
else:
nr = 1
'''
print(dl,dr)
print(nl,nr)
'''
if nl == 1 and nr == 1:
if dl > 0 and dr > 0:
if dl >= dr:
print(2 * dr + dl + 2)
else:
print(dr + 2 * dl + 2)
elif dl < 0 or dl < 0:
print(l - r + 2)
elif dl == 0 or dl == 0:
print(l - z + 1)
elif nl == 1 and nr == 0:
if dl > 0:
print(dl + 1)
elif dl == 0:
print(1)
elif dl < 0:
print(2)
elif nl == 0 and nr == 1:
if dr > 0:
print(dl + 1)
elif dr == 0:
print(1)
elif dr < 0:
print(2)
elif nl == 0 and nr == 0:
print(0)
|
print(l - z + 1)
| 29 |
statement
|
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
print(' '.join([str(x) for x in b]))
|
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b)==1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
print(' '.join([str(x) for x in b]))
|
while (len(b)==1 and b[-1] == b[-2]):
| 8 |
decision
|
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b) > 1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
print(' '.join([str(x) for x in b]))
|
n = int(input())
a = input().split()
a = [int(x) for x in a]
b = []
for u in a:
b.append(u)
if len(b) > 0 or b[-1] != u:
while (len(b)==1 and b[-1] == b[-2]):
b[-2] += 1
b.pop()
print(len(b))
print(' '.join([str(x) for x in b]))
|
while (len(b)==1 and b[-1] == b[-2]):
| 8 |
decision
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+78
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
t=j[0]+78
| 23 |
value
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t**1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
t=t**1
| 28 |
operation
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t//1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
t=t//1
| 28 |
operation
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t>=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
if t>=j[0]:
| 22 |
decision
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]+1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
a=int(input())
x=[]
for i in range(a):
n=int(input())
z=[]
y=[]
for j in range(n):
l,k=map(int,input().split())
y=[l,k]
z.append(y)
x.append(z)
v=[]
for i in range(a):
t=0
b=x[i]
w=[]
for j in b:
if t<=j[0]:
t=j[0]^1
w.append(j[0])
elif j[0]<t<=j[1]:
w.append(t)
t=t+1
else:
w.append(0)
v.append(w)
for i in v:
for j in i:
print(j,end="")
print("\n")
|
t=j[0]^1
| 23 |
operation
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i%1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
for j in range(len(lst) - 1, i%1, -1):
| 6 |
operation
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x))>=b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
if int(''.join(x))>=b and int(''.join(x)) > c:
| 8 |
decision
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 44, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
for j in range(len(lst) - 1, i - 44, -1):
| 6 |
value
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x))>=b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
if int(''.join(x))>=b and int(''.join(x)) > c:
| 8 |
decision
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x)) <= b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
a = input()
b = int(input())
lst = sorted(a)
c = 0
for i in range(len(lst)):
for j in range(len(lst) - 1, i - 1, -1):
x = lst[:i] + [lst[j]] + lst[i:j] + lst[j + 1:]
if int(''.join(x))>=b and int(''.join(x)) > c:
c = int(''.join(x))
lst = x
print(int(''.join(lst)))
|
if int(''.join(x))>=b and int(''.join(x)) > c:
| 8 |
decision
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(124,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
for i in range(124,n+1):
| 12 |
value
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for y in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
for y in range(1,n+1):
| 12 |
statement
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n@1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
for i in range(1,n@1):
| 9 |
operation
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
import sys
n=int(input())
arr=[0 for i in range(n|1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
arr=[0 for i in range(n|1)]
| 3 |
operation
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]==0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
import sys
n=int(input())
arr=[0 for i in range(n+1)]
node=[0 for i in range(n+1)]
for i in range(n-1):
m=int(input())
arr[i+2]=m
node[m]=1
for i in range(1,n+1):
if node[i]<0:
node[arr[i]]+=1
for i in range(1,n+1):
if node[i]!=0 and node[i]<4:
print("No")
sys.exit(0)
print("Yes")
|
if node[i]<0:
| 10 |
decision
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos-1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
ans=(r-pos-1)
| 8 |
operation
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r&l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
ans=(r&l+1)+min(pos-l,r-pos)+1
| 4 |
operation
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==53:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
elif l==53:
| 7 |
value
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+37)
elif r==n:
ans=(l-pos+1)
print(ans)
|
ans=(pos-r+37)
| 15 |
value
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)+1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
n,pos,l,r=map(int,input().split())
if pos>=l and pos<=r:
if l>1 and r<n:
ans=(r-l+1)+min(pos-l,r-pos)<<1
elif l==1 and r==n:
ans=0
elif l==1:
ans=(r-pos+1)
elif r==n:
ans=(pos-l+1)
elif pos<l:
if l>1 and r<n:
ans=(r-pos+2)
elif l==1:
ans=(pos-r+1)
elif r==n:
ans=(l-pos+1)
print(ans)
|
ans=(r-l+1)+min(pos-l,r-pos)<<1
| 4 |
operation
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v**1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
a=[[] for i in range(v**1)]
| 9 |
operation
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]<x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
if al2[j]<x:
| 18 |
decision
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(162):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
for j in range(162):
| 17 |
value
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]<x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
if al2[j]<x:
| 18 |
decision
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v+1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
fin=open('input.txt','r')
fout=open('output.txt','w')
def dfs(v,num):
vis[v]=num
for elem in a[v]:
if vis[elem]==0:
dfs(elem,num)
v,r=map(int,fin.readline().split())
a=[[] for i in range(v<<1)]
n,m=map(int,input().split())
naz=str(input())
ans=''
al1=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
al2=['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z']
for i in range(m):
x,y=map(str,input().split())
for j in range(26):
if al2[j]==x:
al2[j]=y
elif al2[j]==y:
al2[j]=x
for i in range(n):
ans+=al2[al1.index(naz[i])]
print(ans)
|
a=[[] for i in range(v<<1)]
| 9 |
operation
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.