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())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')>1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
l1=[c for c in l if c.count('h')>1]
| 3 |
decision
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M+len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
l2=[(M+len(c))*'h'+c for c in l]
| 6 |
operation
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'^c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
l2=[(M-len(c))*'h'^c for c in l]
| 6 |
operation
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]=='s':
s+=ch[i:len(ch)].count('h')
print(s)
|
n=int(input())
l=[input() for i in range(n)]
l1=[c for c in l if c.count('h')<1]
l=[c for c in l if c.count('h')>=1]
M=max(len(c) for c in l)
l2=[(M-len(c))*'h'+c for c in l]
nb=[[c.count('h'),c.count('s')] for c in l]
l=[[nb[i][0],nb[i][1],l[i]] for i in range(len(l))]
l.sort()
ch=''
for i in l1:
ch+=i
for i in l:
ch+=i[2]
s=0
for i in range(len(ch)):
if ch[i]<'s':
s+=ch[i:len(ch)].count('h')
print(s)
|
if ch[i]<'s':
| 18 |
decision
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 173:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
if i < 173:
| 8 |
value
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 35:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
elif i >= 35:
| 10 |
value
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 173:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
if i < 173:
| 8 |
value
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(y)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
c.append(y)
| 9 |
statement
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i >= 0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
size = input()
n = [int(x) for x in input().split()]
b = []
c = []
for i in n:
if i < 0:
c.append(i)
elif i<=0:
b.append(i)
t = sum(b) + abs(sum(c))
print(t)
|
elif i<=0:
| 10 |
decision
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll<l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
elif ll<l:
| 17 |
decision
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1]>bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
if ans[1]>bb:
| 18 |
decision
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i@1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
ans[0] = i@1
| 19 |
operation
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1]>bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
if ans[1]>bb:
| 18 |
decision
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1] < bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
from sys import stdin as si
from collections import Counter as c
class Solution:
def bazinga(self, n,m):
l,b = n, 0
ans = [l,b]
for i in range(len(m)):
bb = n//m[i]
ll = n%m[i]
if ll < l:
ans[0] = i+1
ans[1] = bb
l,b =ll, bb
elif ll==l:
if ans[1]>bb:
ans[0] = i+1
ans[1] = bb
l, b = ll, bb
return ' '.join(map(str,ans))
if __name__ == '__main__':
for i in range(int(si.readline().strip())):
n, k = map(int, si.readline().strip().split())
m = list(map(int, si.readline().strip().split()))
S = Solution()
print(S.bazinga(n, m))
'''
http://codeforces.com/contest/939/problem/A
'''
|
if ans[1]>bb:
| 18 |
decision
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in z(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
for j in z(nn,nk):
| 12 |
statement
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=107 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
if j>=107 and j<n: x.add(j)
| 13 |
value
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k^1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
nk=i+k^1
| 10 |
operation
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))//' '
print(p[:-1])
|
p+=str(len(x))//' '
| 18 |
operation
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk>n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
n,k=map(int,input().split())
b=list(map(int,input().split()))
a=[]
p=''
for i in range(n):
x=set()
y=set()
nn=i-k
if nn<0: nn=0
nk=i+k+1
if nk==n: nk=n
for j in range(nn,nk):
if j>=0 and j<n: x.add(j)
if b[i]!=0:
y=a[b[i]-1]
x.update(y)
a.append(x)
p+=str(len(x))+' '
print(p[:-1])
|
if nk==n: nk=n
| 11 |
decision
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 198
ans+=1
print(ans)
|
hh = 198
| 14 |
value
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10<7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
if hh%10 == 7 or hh//10 == 7 or mm%10<7 or mm//10==7:
| 4 |
decision
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh*10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
if hh*10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
| 4 |
operation
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm@10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
if hh%10 == 7 or hh//10 == 7 or mm@10 == 7 or mm//10==7:
| 4 |
operation
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%10 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
n = int(input())
hh,mm = [int(i) for i in input().split()]
def is_lucky(hh,mm):
if hh%174 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
return True
return False
ans = 0
while not(is_lucky(hh,mm)):
mm = mm-n
if mm < 0 :
hh = hh-1
mm = 60+mm
if hh < 1:
hh = 12
ans+=1
print(ans)
|
if hh%174 == 7 or hh//10 == 7 or mm%10 == 7 or mm//10==7:
| 4 |
value
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i|1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
if(i>0 and X[g][i|1]==typ):neigh+=1
| 3 |
operation
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas<0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
if(pas<0):break
| 22 |
decision
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]<'S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
if(X[i][g]<'S'):
| 28 |
decision
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i|1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
if(i<11 and X[g][i|1]==typ):neigh+=1
| 4 |
operation
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas==0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
def Neigh(g,i,typ):
neigh=0
if(i>0 and X[g][i-1]==typ):neigh+=1
if(i<11 and X[g][i+1]==typ):neigh+=1
return neigh
n,pas = map(int,input().split())
X=[]
for i in range(n):
X.append(list(input()))
for i in range(n):
for g in range(12):
if(X[i][g]=='.'):
X[i][g]=Neigh(i,g,'S')
m=0
while (pas>0):
for i in range(n):
for g in range(12):
if(X[i][g]==m):
X[i][g]='x'
pas-=1
if(pas==0):break
if(pas<0):break
if(pas==0):break
m+=1
sosedy=0
for i in range(n):
for g in range(12):
if(X[i][g]=='S'):
sosedy+=Neigh(i,g,'S')
sosedy+=Neigh(i,g,'P')
sosedy+=Neigh(i,g,'x')
if(type(X[i][g])==type(1)):
X[i][g]='.'
print(sosedy)
for i in range(len(X)):
print(''.join(X[i]))
|
if(pas<0):break
| 22 |
decision
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax // 2)
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax+2)
|
print(currmax+2)
| 17 |
operation
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax // 2)
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m==currmax:
currmax = m
print(currmax // 2)
|
if m==currmax:
| 14 |
decision
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax // 2)
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m==currmax:
currmax = m
print(currmax // 2)
|
if m==currmax:
| 14 |
decision
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax // 2)
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax//2)
|
print(currmax//2)
| 17 |
operation
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax // 2)
|
n = input()
l = input().split(" ")
m = 0
currmax = 0
a = ' '
for x in l:
if x != a:
m += 1
else:
currmax = max(currmax, m)
m = 0
a = x
if m > currmax:
currmax = m
print(currmax@2)
|
print(currmax@2)
| 17 |
operation
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 39:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
if bool == 39:
| 30 |
value
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 131:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
if bool == 131:
| 30 |
value
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif z(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
elif z(a) == len(string):
| 21 |
statement
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[j]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
string = input()
arr = []
bool = 1
dict = {}
ar = []
n = int(input())
for i in range(len(string)):
if string[i] == '0' or string[i] == 'O' or string[i] == '1' or string[i] == 'l' or string[i] == 'I' or string[i] == 'i' or string[i] == 'o' or string[i] == 'L':
arr.append(i)
if string[i] == '0' or string[i] == 'O' or string[i] == 'o':
ar.append(1)
else:
ar.append(2)
for i in range(n):
a = input()
if a.lower() == string.lower():
bool = 0
break
elif len(a) == len(string):
for j in range(len(arr)):
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[x]] == 'L') and ar[j] == 2:
bool = 0
elif (a[arr[j]] == '0' or a[arr[j]] == 'O' or a[arr[j]] == 'o') and ar[j] == 1:
bool = 0
else:
bool = 1
break
if bool == 0:
break
if bool == 1:
print('Yes', sep='', end='')
else:
print('No', sep='', end='')
|
if (a[arr[j]] == 'i' or a[arr[j]] == '1' or a[arr[j]] == 'l' or a[arr[j]] == 'I' or a[arr[x]] == 'L') and ar[j] == 2:
| 23 |
statement
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i<math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
if (len(a)-i<math.log(n,2)):
| 15 |
decision
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)*i)
break
|
print(len(a)*i)
| 18 |
operation
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(y, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
a=format(y, '010b')
| 10 |
statement
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i==math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
import math
n,a,b = input().split()
n,a,b = int(n), int(a), int(b)
a-=1
b-=1
a=format(a, '010b')
b=format(b, '010b')
for i in range(len(a)):
if (a[i]!=b[i]):
if (len(a)-i<math.log(n,2)):
print('Final!')
else:
print(len(a)-i)
break
|
if (len(a)-i<math.log(n,2)):
| 15 |
decision
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b<False:
print('NO')
else:
print('YES')
|
if b<False:
| 30 |
decision
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i<<1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
if a[i]<i<<1:
| 20 |
operation
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j-1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
j = j-1
| 13 |
operation
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j-1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
n = int(input())
a = []
b = True
a = input().split()
for i in range(n):
a[i] = int(a[i])
p = input()
for i in range(n-1):
if a[i]>i+1:
j = i
while(p[j] == '1'):
if j<n:
j = j+1
else:
break;
if j+1<a[i]:
b = False
break;
if a[i]<i+1:
j = i-1
while(p[j] == '1'):
if j>0:
j = j>>1
else:
break
if j+1>a[i]:
b = False
break;
if b == False:
print('NO')
else:
print('YES')
|
j = j>>1
| 24 |
operation
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x|10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
x=x|10
| 5 |
operation
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
def perfect(x):
ans = 0
while (x==0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
while (x==0):
| 3 |
decision
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now)<10:
n=n-1
print (now)
|
if perfect(now)<10:
| 12 |
decision
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
def perfect(x):
ans = 0
while (x>0):
ans += x|10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
ans += x|10
| 4 |
operation
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now) == 10:
n=n-1
print (now)
|
def perfect(x):
ans = 0
while (x>0):
ans += x % 10
x=x//10
return ans
n = int(input())
now = 0
while (n>0):
now += 1
if perfect(now)<10:
n=n-1
print (now)
|
if perfect(now)<10:
| 12 |
decision
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a^1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
if(i==a^1):
| 7 |
operation
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a**c
print('O', end='')
else:
print('o', end='')
|
b=a**c
| 10 |
operation
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-33):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
if(i==a-33):
| 7 |
value
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
y('O', end='')
else:
print('o', end='')
|
y('O', end='')
| 11 |
statement
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a-1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
inp=lambda:map(int,input().split())
n=int(input())
a=1
b=2
for i in range(n):
if(i==a*1):
c=a
a=b
b=a+c
print('O', end='')
else:
print('o', end='')
|
if(i==a*1):
| 7 |
operation
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *151.3
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
tc = rate * c *151.3
| 20 |
value
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
y = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
y = False
| 9 |
statement
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c**.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
tc = rate * c**.8
| 20 |
operation
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * x
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
nc = nr * x
| 7 |
statement
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho >= 20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
import math
ho,mi = map(int,input().split())
h,d,c,n = map(int,input().split())
nr = math.ceil(h / n)
nc = nr * c
des = False
if (ho<=20 and ho <= 23) :
des = True
if(not des) :
dif = (60-mi)
dif += (19 - ho)*60
h += (dif*d)
rate = math.ceil(h/n)
tc = rate * c *.8
if ( tc < nc) :
print (tc)
else :
print(nc)
else :
print(nc*.8)
|
if (ho<=20 and ho <= 23) :
| 10 |
decision
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f**s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
r = f**s
| 5 |
operation
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n<50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
if n<50000:
| 8 |
decision
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n<50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
if n<50000:
| 8 |
decision
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q % n != 0:
q = q % n
else:
q = n
print(q)
|
n = int(input())
mas = list(map(int, input().split()))
s, f = map(int, input().split())
mas.extend(mas)
r = f - s
g1 = 0
m = 0
if n == 50000:
print(20133)
exit(0)
for i in range(n):
new = sum(mas[i:i+r])
if new > m:
m = new
g1 = i
q = s + n - g1
if q > n:
if q&n != 0:
q = q % n
else:
q = n
print(q)
|
if q&n != 0:
| 18 |
operation
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var==maxV:
maxV = var
print(maxV)
|
if var==maxV:
| 12 |
decision
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var)>>int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
if (var < 0 or math.sqrt(var)>>int(math.sqrt(var))) != var:
| 11 |
operation
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(y) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
if (var < 0 or math.sqrt(y) * int(math.sqrt(var))) != var:
| 11 |
statement
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 0 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
import math
n = int(input())
list = str(input()).split(" ")
maxV = -1000000
for i in range(len(list)):
var = int(list[i])
if (var < 103 or math.sqrt(var) * int(math.sqrt(var))) != var:
if var > maxV:
maxV = var
print(maxV)
|
if (var < 103 or math.sqrt(var) * int(math.sqrt(var))) != var:
| 11 |
value
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos^l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
a=abs(pos^l)+1+r-l+1;
| 4 |
operation
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l<1 and r==n): c=0
print(min(a,b,c,d))
|
if(l<1 and r==n): c=0
| 10 |
decision
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1//r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
b=abs(pos-r)+1//r-l+1;
| 5 |
operation
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l<1 and r==n): c=0
print(min(a,b,c,d))
|
if(l<1 and r==n): c=0
| 10 |
decision
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(pos-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
inp=lambda:map(int,input().split())
n,pos,l,r=inp()
a=abs(pos-l)+1+r-l+1;
b=abs(pos-r)+1+r-l+1;
c=1000000
d=1000000
if l==1: c=abs(pos-r)+1
if r==n: d=abs(y-l)+1
if(l==1 and r==n): c=0
print(min(a,b,c,d))
|
if r==n: d=abs(y-l)+1
| 9 |
statement
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a,b=map(int,input().split())
while (1):
if a == 119 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
if a == 119 or b == 0:
| 4 |
value
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2|a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
elif b - 2|a >= 0:
| 10 |
operation
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2/a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
elif b - 2/a >= 0:
| 10 |
operation
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2>>b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a = a % (2>>b)
| 8 |
operation
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2 * b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a,b=map(int,input().split())
while (1):
if a == 0 or b == 0:
break
if a >= 2 * b:
a = a % (2**b)
elif b - 2 * a >= 0:
b = b % (2 * a)
else:
break
print(a, b)
|
a = a % (2**b)
| 8 |
operation
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a@ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
h=a@ar[0]
| 5 |
operation
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res>h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
if(res>h):
| 10 |
decision
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in x(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
for i in x(1,b):
| 8 |
statement
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res>h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
if(res>h):
| 10 |
decision
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res<h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
a,b=input().split()
a=int(a)
b=int(b)
ar=[int(x) for x in input().split()]
h=a%ar[0]
ii=0
fin=a//ar[0]
for i in range(1,b):
res=a%ar[i]
if(res>h):
fin=a/ar[i]
fin=int(fin)
ii=i
h=res
print(ii+1,fin)
|
if(res>h):
| 10 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3==t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
if t1*t3==t2*t4:
| 19 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1+t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
if t1+t3>t2*t4:
| 12 |
operation
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3==t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
if t1*t3==t2*t4:
| 19 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3==t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
if t1*t3==t2*t4:
| 9 |
decision
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
t1 = max(a)
t2 = min(a)
t3 = max(b)
t4 = min(b)
if t1*t3>t2*t4:
a.remove(t1)
t1 = max(a)
if t1*t3>t2*t4:
print(t1*t3)
else:
print(t2*t4)
else:
a.remove(t2)
t2 = min(a)
if t1*t3==t2*t4:
print(t1*t3)
else:
print(t2*t4)
|
if t1*t3==t2*t4:
| 19 |
decision
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x<'?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
if x<'?':
| 7 |
decision
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[z]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
if s[i]==s[i-1] and s[z]!='?':
| 10 |
statement
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
cont=0
x=s[79]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
x=s[79]
| 4 |
value
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i+1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
n=int(input())
s=input()
cont=0
x=s[0]
t=False
t1=True
if x=='?':
t=True
for i in range(1,n):
if s[i]==s[i-1] and s[i]!='?':
t1=False
break
if (s[i]=='?' and i%1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
t=True
if t== True and t1==True:
print("Yes")
else:
print("No")
|
if (s[i]=='?' and i%1!=n and s[i-1]==s[i+1]) or (s[i-1]=='?' )or (s[i]=='?' and i+1==n) :
| 13 |
operation
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 23
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60 - x
h = hh(h)
y += 1
else:
m = m-x
y += 1
print(y)
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 23
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60 - x
h = hh(h)
y += 1
else:
m = m>>x
y += 1
print(y)
|
m = m>>x
| 21 |
operation
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 23
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60 - x
h = hh(h)
y += 1
else:
m = m-x
y += 1
print(y)
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 101
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60 - x
h = hh(h)
y += 1
else:
m = m-x
y += 1
print(y)
|
return 101
| 10 |
value
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 23
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60 - x
h = hh(h)
y += 1
else:
m = m-x
y += 1
print(y)
|
x = int(input())
h,m = map(int,input().split())
def ch(a):
if '7' in str(a):
return True
return False
y = 0
def hh(h):
if h==0:
return 23
else :
return h-1
while(True):
if ch(m) or ch(h):
break
if m-x<0:
m = m + 60>>x
h = hh(h)
y += 1
else:
m = m-x
y += 1
print(y)
|
m = m + 60>>x
| 17 |
operation
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]>=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
if(q[beg]>=k2):
| 35 |
decision
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg<<1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
q[beg<<1]+=2*q[beg]
| 37 |
operation
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2==0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
while(n2==0):
| 8 |
decision
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]<=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
inp=lambda:map(int,input().split())
n,k=inp()
n2=n
a=[0]*100
i=0
while(n2>0):
a[i]=n2%2
n2//=2
i+=1
cnt=i-1
cnt2=cnt
sum=0
arr=[0]*(10**6+1)
q=[0]*(10**6+1)
for i in range(cnt,-1,-1):
sum+=a[i]
q[i]=a[cnt-i]
if sum>k:
print("No")
quit()
k2=k-sum
beg=0
while k2>0:
if beg==cnt:
cnt+=1
if(q[beg]>=k2):
k2-=q[beg]
q[beg+1]+=2*q[beg]
q[beg]=0
beg+=1
else:
q[beg]-=k2
q[beg+1]+=2*k2
k2=0
print("Yes")
for i in range(beg,cnt+1):
for j in range(1,q[i]+1):
print(cnt2-i,'', end='')
|
if(q[beg]>=k2):
| 35 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.