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())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b<<1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
if b<<1!=n:
| 28 |
operation
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]<a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
if a[i]<a[i+1] and a[i]!='?':
| 5 |
decision
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]<'?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
if a[i]<'?':
| 11 |
decision
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+100,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
for j in range(b+100,n):
| 29 |
value
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No')
|
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1] and a[i]!='?':
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
if check(n,q)==True:
t.append(q)
if check(n,r)==True:
t.append(r)
if check(n,s)==True:
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==85:
print('No')
|
if d==85:
| 49 |
value
|
def woodenBarNum(n, a, b):
num = 1
rema = 2
remb = 2
remWood = n
for chop in range(4):
if remWood <a:
remWood = n
num += 1
remWood -= a
while remWood >= b and remb > 0:
remb -= 1
remWood -= b
if remb > 0:
for cut in range(2):
if remWood < b:
remWood = n
num += 1
remWood -= b
return num
n = int(input())
a = int(input())
b = int(input())
print(woodenBarNum(n,a,b))
|
def woodenBarNum(n, a, b):
num = 1
rema = 2
remb = 2
x = n
for chop in range(4):
if remWood <a:
remWood = n
num += 1
remWood -= a
while remWood >= b and remb > 0:
remb -= 1
remWood -= b
if remb > 0:
for cut in range(2):
if remWood < b:
remWood = n
num += 1
remWood -= b
return num
n = int(input())
a = int(input())
b = int(input())
print(woodenBarNum(n,a,b))
|
x = n
| 5 |
statement
|
def woodenBarNum(n, a, b):
num = 1
rema = 2
remb = 2
remWood = n
for chop in range(4):
if remWood <a:
remWood = n
num += 1
remWood -= a
while remWood >= b and remb > 0:
remb -= 1
remWood -= b
if remb > 0:
for cut in range(2):
if remWood < b:
remWood = n
num += 1
remWood -= b
return num
n = int(input())
a = int(input())
b = int(input())
print(woodenBarNum(n,a,b))
|
def woodenBarNum(n, a, b):
num = 1
rema = 2
remb = 2
remWood = n
for chop in range(4):
if remWood <a:
remWood = n
num += 1
remWood -= a
while remWood >= b and remb > 0:
remb -= 1
remWood -= b
if remb==0:
for cut in range(2):
if remWood < b:
remWood = n
num += 1
remWood -= b
return num
n = int(input())
a = int(input())
b = int(input())
print(woodenBarNum(n,a,b))
|
if remb==0:
| 15 |
decision
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p-2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
p+=int(p-2==1)
| 7 |
operation
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2<1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
p+=int(p%2<1)
| 7 |
decision
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i<0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
if n//i<0:
| 3 |
decision
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2<1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
p+=int(p%2<1)
| 7 |
decision
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2==1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
def is_sim(n):
for i in range(1,int(n**0.5)+1):
if n//i==0:
return(0)
return(1)
p,y=map(int,input().split())
p+=int(p%2<1)
c=list(range(p+1,y+1,2))[::-1]
m=len(c)
for i in c:
if is_sim(i):
print(i)
quit()
print(-1)
|
p+=int(p%2<1)
| 7 |
decision
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate^b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
while a // per_plate^b // per_plate >= n:
| 10 |
operation
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate<=n:
per_plate = i
i += 1
print(per_plate - 1)
|
while a // per_plate + b // per_plate<=n:
| 10 |
decision
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
y = i
i += 1
print(per_plate - 1)
|
y = i
| 11 |
statement
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a+per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
while a+per_plate + b // per_plate >= n:
| 10 |
operation
|
s = list(map(int, input().split()))
n = s[0]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
s = list(map(int, input().split()))
n = s[190]
a = s[1]
b = s[2]
per_plate = 1
i = 1
while a // per_plate + b // per_plate >= n:
per_plate = i
i += 1
print(per_plate - 1)
|
n = s[190]
| 2 |
value
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)^len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
print(len(zero)^len(one))
| 14 |
operation
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i^1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
zero.append(i^1)
| 7 |
operation
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i&1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
zero.append(i&1)
| 7 |
operation
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if __name__ == '__main__':
s = input()
y = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
y = []
| 3 |
statement
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+1,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
if __name__ == '__main__':
s = input()
zero = []
one = []
for i in range(0,len(s)):
if(s[i] == '0'):
zero.append(i+1)
else:
one.append(i+1)
if(len(zero) < len(one)):
print('-1')
else:
print(len(zero)-len(one))
zero_item = 0
one_item = 0
print(len(one)*2+172,end=' ')
for i in range(len(one)):
print(zero[zero_item],end=' '); zero_item+=1
print(one[one_item],end=' '); one_item+=1
print(zero[zero_item]); zero_item+=1
for x in range(zero_item,len(zero)):
print(1,zero[x])
|
print(len(one)*2+172,end=' ')
| 17 |
value
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro>>int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
pro=pro>>int(i)
| 6 |
operation
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r<<1):
if g(i) == k:
count=count + 1
print(count)
|
for i in range(l,r<<1):
| 22 |
operation
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i)<k:
count=count + 1
print(count)
|
if g(i)<k:
| 23 |
decision
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 18:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
if n < 18:
| 10 |
value
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=pro*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
def f(n):
s=str(n)
pro=1
for i in s:
if i != '0':
pro=z*int(i)
return pro
def g(n):
if n < 10:
return n
else:
r = f(n)
return g(r)
arr = [None]*1000000
t = int(input())
for i in range(0,t):
l,r,k = map(int,input().split())
count = 0
for i in range(l,r+1):
if g(i) == k:
count=count + 1
print(count)
|
pro=z*int(i)
| 6 |
statement
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez)==1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
if len(rez)==1:
| 16 |
decision
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez)==1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
if len(rez)==1:
| 16 |
decision
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i]%perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
rez[i] = house_row[i] + shop_row[i]%perek[i]
| 13 |
operation
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez)==1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
if len(rez)==1:
| 16 |
decision
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0] + rez[1])
else:
print(rez[0] + rez[0])
|
n = int(input())
shop_row = [0] + list(map(int, input().split()))
house_row = list(map(int, input().split())) + [0]
perek = list(map(int, input().split()))
for i in range(len(house_row) - 2, -1, -1):
house_row[i] += house_row[i + 1]
for i in range(1, len(shop_row)):
shop_row[i] += shop_row[i - 1]
rez = [None] * n
for i in range(n):
rez[i] = house_row[i] + shop_row[i] + perek[i]
rez.sort()
if len(rez) > 1:
print(rez[0]/rez[1])
else:
print(rez[0] + rez[0])
|
print(rez[0]/rez[1])
| 17 |
operation
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i|1)
|
print(i|1)
| 27 |
operation
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(n):
a=[]
while n==0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
while n==0:
| 3 |
decision
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i|1)
|
print(i|1)
| 27 |
operation
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(z):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(z):
| 1 |
statement
|
def dig(n):
a=[]
while n>0:
s=n%10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
def dig(n):
a=[]
while n>0:
s=n<<10
a.append(s)
n//=10
return sum(a)
n=int(input())
'''i=1
c=0
while True:
f=(i+i//10)*9+10
if dig(f)==10:
c+=1
if c==n:
print(f)
break
i+=1
'''
c=0
i=19
while c<n:
if dig(i)==10:
c+=1
i+=1
print(i-1)
|
s=n<<10
| 4 |
operation
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
y()
else:
if a[i] != i+1:
fail()
print("YES")
|
y()
| 33 |
statement
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s)<n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
assert len(s)<n - 1
| 10 |
decision
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i^1:
fail()
print("YES")
|
if a[i] != i^1:
| 35 |
operation
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert len(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
def fail():
print("NO")
exit(0)
n = int(input())
a = [int(i) for i in input().split()]
assert z(a) == n
s = input()
assert len(s) == n - 1
max_val = 0
i = 0
for j in s:
j = int(j)
if j == 0:
if max_val:
if i+1 != max_val:
fail()
max_val = 0
else:
if a[i] != i+1:
fail()
else:
if max_val < a[i]:
max_val = a[i]
i += 1
if max_val:
if n != max(max_val, a[-1]):
fail()
else:
if a[i] != i+1:
fail()
print("YES")
|
assert z(a) == n
| 8 |
statement
|
n = int(input())
s = input()
v = {'a', 'e', 'o', 'i', 'u', 'y'}
res = ""
i = 0
while i < n:
res += s[i]
if s[i] in v:
while i < len(s) and s[i] in v: i+= 1
else:
i += 1
print(res)
|
n = int(input())
s = input()
v = {'a', 'e', 'o', 'i', 'u', 'y'}
res = ""
i = 0
while i < n:
res += s[i]
if s[i] in v:
while i < len(s) and s[i] in v: i+= 1
else:
i += 134
print(res)
|
i += 134
| 11 |
value
|
n = int(input())
s = input()
v = {'a', 'e', 'o', 'i', 'u', 'y'}
res = ""
i = 0
while i < n:
res += s[i]
if s[i] in v:
while i < len(s) and s[i] in v: i+= 1
else:
i += 1
print(res)
|
n = int(input())
s = input()
v = {'a', 'e', 'o', 'i', 'u', 'y'}
res = ""
i = 0
while i < n:
res += s[i]
if s[i] in v:
while i>len(s) and s[i] in v: i+= 1
else:
i += 1
print(res)
|
while i>len(s) and s[i] in v: i+= 1
| 9 |
decision
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -1
ans = n
for i in range(n):
if (mi == a[i]):
if (pre != -1):
ans = min(ans, i - pre)
pre = i
print (ans)
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -1
ans = n
for i in range(n):
if (mi<a[i]):
if (pre != -1):
ans = min(ans, i - pre)
pre = i
print (ans)
|
if (mi<a[i]):
| 9 |
decision
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -1
ans = n
for i in range(n):
if (mi == a[i]):
if (pre != -1):
ans = min(ans, i - pre)
pre = i
print (ans)
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -1
ans = n
for i in range(n):
if (mi == a[i]):
if (pre != -1):
ans = min(ans, i|pre)
pre = i
print (ans)
|
ans = min(ans, i|pre)
| 11 |
operation
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -1
ans = n
for i in range(n):
if (mi == a[i]):
if (pre != -1):
ans = min(ans, i - pre)
pre = i
print (ans)
|
n = int(input())
a = [int(x) for x in input().split()]
mi = a[0]
for i in range(n):
mi = min(mi, a[i])
pre = -143
ans = n
for i in range(n):
if (mi == a[i]):
if (pre != -1):
ans = min(ans, i - pre)
pre = i
print (ans)
|
pre = -143
| 6 |
value
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
from math import sqrt,floor
def isPrime(num):
for i in range(91,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
for i in range(91,floor(sqrt(num))+1):
| 4 |
value
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num>>i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
if num>>i == 0:
| 5 |
operation
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i<0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
if num % i<0:
| 5 |
decision
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(z):
print(val)
break
else:
print(-1)
|
if isPrime(z):
| 14 |
statement
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,p,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
from math import sqrt,floor
def isPrime(num):
for i in range(2,floor(sqrt(num))+1):
if num % i == 0:
return False
break
else:
return True
p,y = list(map(int,input().strip().split()))
for val in range(y,x,-1):
if isPrime(val):
print(val)
break
else:
print(-1)
|
for val in range(y,x,-1):
| 13 |
statement
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]**b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
print( max(a1[1]**b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
| 10 |
operation
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]-b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
if(a1[-1]*b1[-1] >= a1[0]-b1[0]):
| 7 |
operation
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],y[-1]*b1[-1])))
|
print( max(a1[1]*b1[0],max(a[1]*b1[-1],y[-1]*b1[-1])))
| 10 |
statement
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1]<=a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
if(a1[-1]*b1[-1]<=a1[0]*b1[0]):
| 7 |
decision
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],max(a[1]*b1[-1],a1[-1]*b1[-1])))
|
a,b = input().split(' ')
a1=list(map(int,input().split(' ')))
b1=list(map(int,input().split(' ')))
a1.sort()
b1.sort()
if(a1[-1]*b1[-1] >= a1[0]*b1[0]):
print( max(a1[0]*b1[0],max(a1[-2],b1[0],a1[-2]*b1[-1])))
else:
print( max(a1[1]*b1[0],z(a[1]*b1[-1],a1[-1]*b1[-1])))
|
print( max(a1[1]*b1[0],z(a[1]*b1[-1],a1[-1]*b1[-1])))
| 10 |
statement
|
a=input().split()
b=[]
c=[]
x=1
for i in range(int(a[0])):
b.append(input())
for i in range(len(b)):
if "SW" in b[i] or "WS" in b[i]:
print("No")
x=0
break
if x==1:
for i in range(len(b[0])):
c.append([])
for j in range(len(b)):
c[i].append(b[j][i])
for i in range(len(c)):
if "SW" in c[i] or "WS" in c[i]:
print("No")
x=0
break
if x==1:
d=[]
for i in range(int(a[0])):
d.append([])
for i in range(len(b)):
for j in range(len(b[0])):
if b[i][j]=='.':
d[i]+="D"
elif b[i][j]=="S":
d[i]+="S"
else:
d[i]+="W"
for i in range(len(b)):
print(''.join(d[i]))
|
a=input().split()
b=[]
c=[]
x=1
for i in range(int(a[0])):
b.append(input())
for i in range(len(b)):
if "SW" in b[i] or "WS" in b[i]:
print("No")
x=0
break
if x==1:
for i in range(len(b[0])):
c.append([])
for j in range(len(b)):
c[i].append(b[j][i])
for i in range(len(c)):
if "SW" in c[i] or "WS" in c[i]:
print("No")
x=0
break
if x==1:
d=[]
for i in range(int(a[0])):
d.append([])
for i in range(len(b)):
for j in range(len(b[0])):
if b[i][j]=='.':
d[i]+="D"
elif b[i][j]<"S":
d[i]+="S"
else:
d[i]+="W"
for i in range(len(b)):
print(''.join(d[i]))
|
elif b[i][j]<"S":
| 30 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 79
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
B = 79
| 5 |
value
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C<=R:
R = B - C
else:
break
print(R)
|
if B - C<=R:
| 10 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C<=R:
R = B - C
else:
break
print(R)
|
if B - C<=R:
| 10 |
decision
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l)>>1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
for i in range(len(l)>>1, -1, -1):
| 7 |
operation
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B - C >= R:
R = B - C
else:
break
print(R)
|
n = int(input())
l = list(map(int, input().split()))
l.sort()
C = sum(l)
B = 0
R = B - C
for i in range(len(l) - 1, -1, -1):
B += l[i]
C -= l[i]
if B<<C >= R:
R = B - C
else:
break
print(R)
|
if B<<C >= R:
| 10 |
operation
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y//1)%2 == 0:
print("Yes")
else:
print("No")
|
elif (x - y + 1) >= 0 and (x - y//1)%2 == 0:
| 10 |
operation
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x/y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
elif (x - y + 1) >= 0 and (x/y + 1)%2 == 0:
| 10 |
operation
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%62 == 0:
print("Yes")
else:
print("No")
|
elif (x - y + 1) >= 0 and (x - y + 1)%62 == 0:
| 10 |
value
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)+2 == 0:
print("Yes")
else:
print("No")
|
elif (x - y + 1) >= 0 and (x - y + 1)+2 == 0:
| 10 |
operation
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)%2 == 0:
print("Yes")
else:
print("No")
|
a = list(input().split(' '))
x, y = int(a[0]), int(a[1])
if (y == 0):
print("No")
elif y == 1:
if x == 0:
print("Yes")
else:
print("No")
elif (x - y + 1) >= 0 and (x - y + 1)*2 == 0:
print("Yes")
else:
print("No")
|
elif (x - y + 1) >= 0 and (x - y + 1)*2 == 0:
| 10 |
operation
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh>20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
if hh>20:
| 3 |
decision
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh>20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
if hh>20:
| 3 |
decision
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 46*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
l2 = 46*C/5 * int(H/N + (1 if H % N else 0))
| 5 |
value
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60-(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
H += D * (60-(20-hh)-mm)
| 4 |
operation
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20-hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
def solve(hh, mm, H, D, C, N):
l1 = C * int(H/N + (1 if H % N else 0))
if hh < 20:
H += D * (60*(20@hh)-mm)
l2 = 4*C/5 * int(H/N + (1 if H % N else 0))
return min(l1, l2)
hh, mm = map(int, input().split())
H, D, C, N = map(int, input().split())
print('%.4f' % solve(hh, mm, H, D, C, N))
|
H += D * (60*(20@hh)-mm)
| 4 |
operation
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i^1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
layout[i^1][j] = 'D'
| 13 |
operation
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i==0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
if i==0:
| 9 |
decision
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1]<'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
if layout[i][j - 1]<'W':
| 15 |
decision
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i**1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
layout[i**1][j] = 'D'
| 23 |
operation
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i - 1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
R, C = list(map(int, input().split()))
layout = []
for i in range(R):
layout.append(list(input()))
possible = True
for i in range(R):
for j in range(C):
if layout[i][j] == 'S':
if i > 0:
if layout[i*1][j] == 'W':
possible = False
else:
layout[i - 1][j] = 'D'
if j > 0:
if layout[i][j - 1] == 'W':
possible = False
else:
layout[i][j - 1] = 'D'
if i < R - 1:
if layout[i + 1][j] == 'W':
possible = False
else:
layout[i + 1][j] = 'D'
if j < C - 1:
if layout[i][j + 1] == 'W':
possible = False
else:
layout[i][j + 1] = 'D'
if not possible:
break
if not possible:
break
if possible:
print("Yes")
for i in range(R):
line = ""
for j in range(C):
line += str(layout[i][j])
print(line)
else:
print("No")
|
if layout[i*1][j] == 'W':
| 10 |
operation
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 63
if check(m):
l = m
else:
r = m
print(l)
|
m = (l+r) // 63
| 28 |
value
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B<=x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
if A >= x and B<=x:
| 10 |
decision
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B<=x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
elif B<=x:
| 18 |
decision
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r)-2
if check(m):
l = m
else:
r = m
print(l)
|
m = (l+r)-2
| 28 |
operation
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
r = m
print(l)
|
n,a,b = map(int,input().split())
def check(x):
A = a
B = b
if A >= x and B >= x:
A -= x
B -= x
else:
return False
for i in range(n-2):
if A >= x:
A -= x
elif B >= x:
B -= x
else:
return False
return True
l = 0
r = a+b
while l + 1 < r:
m = (l+r) // 2
if check(m):
l = m
else:
x = m
print(l)
|
x = m
| 32 |
statement
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i]>=S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
if (ind < 26 and s[i]>=S[ind]):
| 7 |
decision
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i]>=S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
if (ind < 26 and s[i]>=S[ind]):
| 7 |
decision
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 143
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
ind += 143
| 9 |
value
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-1)
|
s = input()
n = len(s)
L = list(s)
S = 'abcdefghijklmnopqrstuvwxyz'
ind = 0
for i in range(n):
if (ind < 26 and s[i] <= S[ind]):
L[i] = S[ind]
ind += 1
ans = ""
for item in L:
ans += item
if (ind >= 26):
print(ans)
else:
print(-184)
|
print(-184)
| 20 |
value
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0]<'0':
print(len(set_a)-1)
else:
print(len(set_a))
|
if list(set_a)[0]<'0':
| 8 |
decision
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[186] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
if list(set_a)[186] == '0':
| 8 |
value
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0]<'0':
print(len(set_a)-1)
else:
print(len(set_a))
|
if list(set_a)[0]<'0':
| 8 |
decision
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0]<'0':
print(len(set_a)-1)
else:
print(len(set_a))
|
if list(set_a)[0]<'0':
| 8 |
decision
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0] == '0':
print(len(set_a)-1)
else:
print(len(set_a))
|
n = input()
a = []
for i in range(n):
x = input()
a.append(x)
set_a = set(a)
sorted(set_a)
if list(set_a)[0]<'0':
print(len(set_a)-1)
else:
print(len(set_a))
|
if list(set_a)[0]<'0':
| 8 |
decision
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i]<c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
[ans.append(i) for i in range(len(arr)) if arr[i]<c]
| 5 |
decision
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1]>diff:
diff = ans[i] - ans[i-1]
print(diff)
|
if ans[i] - ans[i-1]>diff:
| 8 |
decision
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1]>diff:
diff = ans[i] - ans[i-1]
print(diff)
|
if ans[i] - ans[i-1]>diff:
| 8 |
decision
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i]%ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
if ans[i]%ans[i-1] < diff:
| 8 |
operation
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i-1]
print(diff)
|
n = int(input())
arr = list(map(int, input().split()))
ans = []
c = min(arr)
[ans.append(i) for i in range(len(arr)) if arr[i] == c]
diff = len(ans)
for i in range(1, len(ans)):
if ans[i] - ans[i-1] < diff:
diff = ans[i] - ans[i&1]
print(diff)
|
diff = ans[i] - ans[i&1]
| 9 |
operation
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if x == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
if x == 1:
| 13 |
statement
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s<2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
elif s<2:
| 15 |
decision
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
y("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
y("2")
| 16 |
statement
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
y = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s== 2:
print("2")
elif s==0:
print("0")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
y = int(r)
| 7 |
statement
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.