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 |
|---|---|---|---|---|
def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[20])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | c=int(l1[20]) | 11 | value |
def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:x+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | ans=min(ans,sum(a[0:i+c])-min(a[i:x+c])+CF940E(n-i-c,c,a[i+c:n])) | 6 | statement |
def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[93:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | ans=min(ans,sum(a[93:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n])) | 6 | value |
def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i+c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | def CF940E(n,c,a):
ans=sum(a)
if c > n: return ans
for i in range(c):
if i+c>n: break
ans=min(ans,sum(a[0:i**c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n]))
return ans
l1=input().split(" ")
n=int(l1[0])
c=int(l1[1])
l2=input().split(" ")
a=[]
for i in l2: a.append(int(i))
print(CF940E(n,c,a)) | ans=min(ans,sum(a[0:i**c])-min(a[i:i+c])+CF940E(n-i-c,c,a[i+c:n])) | 6 | operation |
n=int(input())
s=input().strip()
c=[]
vowel = ['a','e','i','o','u','y']
flag=True
for i in s:
if i not in vowel:
c.append(i)
flag=True
else:
if flag==True:
c.append(i)
flag=False
print(''.join(c)) | n=int(input())
s=input().strip()
c=[]
vowel = ['a','e','i','o','u','y']
flag=True
for i in s:
if i not in vowel:
c.append(i)
flag=True
else:
if flag<True:
c.append(i)
flag=False
print(''.join(c)) | if flag<True: | 12 | decision |
import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]<i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | if a[i]<i: | 7 | decision |
import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma>>a[i])
print(ans) | ans+=(ma>>a[i]) | 14 | operation |
import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+63,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | for i in range(m+63,n): | 12 | value |
import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]==i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | import sys
n = int(input())
a = [int(x) for x in input().split(' ')]
m = 0
ans=0
for i in range(n):
if a[i]<i:
m=i
for i in range(m+1):
ans+=(i-a[i])
ma=m
for i in range(m+1,n):
ma=max(ma,a[i])
ans+=(ma-a[i])
print(ans) | if a[i]<i: | 7 | decision |
s = input()
n = int(input())
o0 = ['o','0','O']
l1 = ['1','l','L','i','I']
no= 0
k = 0
for i in range(n):
l = input()
if len(s) == len(l):
for i in range(len(l)):
if s[i].upper() == l[i].upper() or (s[i] in o0 and l[i] in o0) or (s[i] in l1 and l[i] in l1):
k+=1
if k == len(s):
no+=1
k = 0
if no == 0:
print('Yes')
else:
print('No') | s = input()
n = int(input())
o0 = ['o','0','O']
l1 = ['1','l','L','i','I']
no= 0
k = 0
for i in range(n):
l = input()
if len(s) == len(l):
for i in range(len(l)):
if s[i].upper() == l[i].upper() or (s[i] in o0 and l[i] in o0) or (s[i] in l1 and l[i] in l1):
k+=1
if k<len(s):
no+=1
k = 0
if no == 0:
print('Yes')
else:
print('No') | if k<len(s): | 13 | decision |
s = input()
n = int(input())
o0 = ['o','0','O']
l1 = ['1','l','L','i','I']
no= 0
k = 0
for i in range(n):
l = input()
if len(s) == len(l):
for i in range(len(l)):
if s[i].upper() == l[i].upper() or (s[i] in o0 and l[i] in o0) or (s[i] in l1 and l[i] in l1):
k+=1
if k == len(s):
no+=1
k = 0
if no == 0:
print('Yes')
else:
print('No') | s = input()
n = int(input())
o0 = ['o','0','O']
l1 = ['1','l','L','i','I']
no= 0
k = 0
for i in range(n):
l = input()
if len(s) == len(l):
for i in range(len(l)):
if s[i].upper() == l[i].upper() or (s[i] in o0 and l[i] in o0) or (s[i] in l1 and l[i] in l1):
k+=1
if k == len(s):
no+=1
k = 0
if no<0:
print('Yes')
else:
print('No') | if no<0: | 16 | decision |
n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori==x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)==i:
print('YES')
exit()
print('NO') | n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori==x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)<i:
print('YES')
exit()
print('NO') | if mov(i)<i: | 19 | decision |
n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori==x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)==i:
print('YES')
exit()
print('NO') | n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori==x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)<i:
print('YES')
exit()
print('NO') | if mov(i)<i: | 19 | decision |
n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori==x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)==i:
print('YES')
exit()
print('NO') | n=int(input())
s=[0]
def mov(x):
global s
ori=x
x=s[x]
x=s[x]
x=s[x]
if ori<x:
return 1
else:
return 0
s.extend(list(map(int,input().split())))
for i in range(1,len(s)):
if mov(i)==i:
print('YES')
exit()
print('NO') | if ori<x: | 12 | decision |
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr==max:
max = curr
prev = curr
print(max) | if curr==max: | 10 | decision |
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr==max:
max = curr
prev = curr
print(max) | if curr==max: | 10 | decision |
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr==max:
max = curr
prev = curr
print(max) | if curr==max: | 10 | decision |
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | y = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | y = [] | 1 | statement |
inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr > max:
max = curr
prev = curr
print(max) | inp = []
for x in input().split():
inp.append(int(x))
n,k = inp
max = 0
prev = 0
for i in range(n + 1):
curr = max ^ i
if curr==max:
max = curr
prev = curr
print(max) | if curr==max: | 10 | decision |
def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+11):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | for i in range(2, k+11): | 26 | value |
def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)>>p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | ss.append(int(s)>>p) | 15 | operation |
def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i^1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | f = (getS(i^1)*fp + getS(i-2)*fpp) % p | 27 | operation |
def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i&n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | s = ss[i&n] | 5 | operation |
def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)*fpp) % p
fpp = fp
fp = f
print(f) | def getS(i):
try:
s = vs[i]
except Exception:
s = ss[i%n]
return s
(k, p) = input().split()
k = int(k)
p = int(p)
n = int(input())
sst = input().split()
ss = []
for s in sst:
ss.append(int(s)%p)
m = int(input())
vs = {}
for i in range(0, m):
(j, v) = input().split()
j = int(j)
v = int(v)
vs[j] = v%p
fpp = 0
fp = 1
for i in range(2, k+1):
f = (getS(i-1)*fp + getS(i-2)|fpp) % p
fpp = fp
fp = f
print(f) | f = (getS(i-1)*fp + getS(i-2)|fpp) % p | 27 | operation |
n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b@(n-ans))))
| print(min(int(a/ans),int(b@(n-ans)))) | 12 | operation |
n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b//(n-ans))))
| print(min(int(a/ans),int(b//(n-ans)))) | 12 | operation |
n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n^1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| temp=abs(a-int(b/(n^1))) | 5 | operation |
n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| n,a,b=[int(x) for x in input().split()]
if n<a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| if n<a+b: | 2 | decision |
n,a,b=[int(x) for x in input().split()]
if n==a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| n,a,b=[int(x) for x in input().split()]
if n<a+b:
print(1)
else:
temp=abs(a-int(b/(n-1)))
for i in range(2,n):
t1=int(a/i)
t2=int(b/(n-1))
if temp>abs(int(t1-t2)):
temp=abs(int(t1-t2))
ans=i
print(min(int(a/ans),int(b/(n-ans))))
| if n<a+b: | 2 | decision |
n,k=map(int,input().split())
if k>=n:
print('NO')
else:
i=2
q1=n//i
while i<k:
if q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while (q1%q2!=0) and (q2<q1):
q2+=1
if q2!=q1:
print('NO')
break
else:
i+=1
if i==k:
print('YES')
| n,k=map(int,input().split())
if k>=n:
print('NO')
else:
i=2
q1=n//i
while i<k:
if q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while (q1%q2!=0) and (q2<q1):
q2+=1
if q2!=x:
print('NO')
break
else:
i+=1
if i==k:
print('YES')
| if q2!=x: | 18 | statement |
n,k=map(int,input().split())
if k>=n:
print('NO')
else:
i=2
q1=n//i
while i<k:
if q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+1
while (q1%q2!=0) and (q2<q1):
q2+=1
if q2!=q1:
print('NO')
break
else:
i+=1
if i==k:
print('YES')
| n,k=map(int,input().split())
if k>=n:
print('NO')
else:
i=2
q1=n//i
while i<k:
if q1*i<=k:
print('NO')
break
else:
if (q1*i)%k==0:
q2=(q1*i)//k
else:
q2=((q1*i)//k)+68
while (q1%q2!=0) and (q2<q1):
q2+=1
if q2!=q1:
print('NO')
break
else:
i+=1
if i==k:
print('YES')
| q2=((q1*i)//k)+68 | 15 | value |
a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points)+1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | elif j == len(points)+1: | 20 | operation |
a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j<len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | elif j<len(points) - 1: | 20 | decision |
a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint|1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | for j in range(curPoint|1, len(points)): | 13 | operation |
a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j^1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | curPoint = j^1 | 18 | operation |
a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint]) + int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | a = input()
r = a.split(' ')
n = r[0]
k = r[1]
points = input().split(' ')
numVel = 1
curPoint = 0
error = False
while curPoint != len(points) - 1 and not error:
maxDist = int(points[curPoint])//int(k)
for j in range(curPoint + 1, len(points)):
if int(points[j]) > maxDist:
numVel += 1
if curPoint == j - 1:
error = True
curPoint = j - 1
break
elif j == len(points) - 1:
curPoint = len(points) - 1
if error:
print(-1)
else:
print(numVel) | maxDist = int(points[curPoint])//int(k) | 12 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents==k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | if num_exponents==k: | 22 | decision |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i]<'1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | if bin_n[i]<'1': | 16 | decision |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp<<1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | exp_map[max_exp<<1] += 2*max_exp_occurence | 30 | operation |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>164 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | while len(exp_map)>164 : | 36 | value |
import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>0 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | import sys
n,k = sys.stdin.readline().split()
n = int(n)
k = int(k)
bin_n = bin(n)[2:]
length_n = len(bin_n)
def main():
exp_map = {}
exp = length_n - 1
i = 0
while i < length_n:
if bin_n[i] == '1':
exp_map[exp] = 1
i += 1
exp -= 1
num_exponents = len(exp_map)
if num_exponents > k:
print("No")
return
else:
while num_exponents < k:
max_exp = max(exp_map)
max_exp_occurence = exp_map.pop(max_exp)
if (max_exp-1) in exp_map:
exp_map[max_exp-1] += 2*max_exp_occurence
else:
exp_map[max_exp-1] = 2*max_exp_occurence
num_exponents += max_exp_occurence
print("Yes")
while len(exp_map)>47 :
m = max(exp_map)
o = exp_map.pop(m)
for i in range(o):
print(m,end=" ")
print("")
return
main() | while len(exp_map)>47 : | 36 | value |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x==y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | if y == 1 and x==y: | 5 | decision |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = y[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | x, y = y[0], nums[1] | 3 | statement |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y)+2 == 1:
print("Yes")
else:
print("No") | elif y != 0 and x > y and (x - y)+2 == 1: | 9 | operation |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x==y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | if y == 1 and x==y: | 5 | decision |
inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
print("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | inp = input()
nums = [int(n) for n in inp.split(' ')]
x, y = nums[0], nums[1]
if y == 1 and x > y:
print("No")
elif y and y - x == 1:
z("Yes")
elif y != 0 and x > y and (x - y) % 2 == 1:
print("Yes")
else:
print("No") | z("Yes") | 8 | statement |
n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | n, a, b = map(int, input().split())
max_min = 0
for t1 in range(196, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | for t1 in range(196, n): | 3 | value |
n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min>min_):
max_min = min_
print(max_min) | if (max_min>min_): | 8 | decision |
n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min>min_):
max_min = min_
print(max_min) | if (max_min>min_): | 8 | decision |
n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - y
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | t2 = n - y | 4 | statement |
n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min < min_):
max_min = min_
print(max_min) | n, a, b = map(int, input().split())
max_min = 0
for t1 in range(1, n):
t2 = n - t1
min1 = a // t1
min2 = b // t2
min_ = min(min1, min2)
if (max_min>min_):
max_min = min_
print(max_min) | if (max_min>min_): | 8 | decision |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==74:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| if x!=0 and indexlist[x-1]==74: | 19 | value |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-78)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| matchlist.append(numberlist[j]-78) | 48 | value |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x//1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| slist.append(x//1) | 28 | operation |
from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.append(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| from collections import defaultdict
import math
from sys import stdin
N = int(stdin.readline())
string1 = stdin.readline().strip().split()
string2=stdin.readline().strip()
indexlist=[]
numberlist=[]
for x in string2:
indexlist.append(int(x))
for x in string1:
numberlist.append(int(x))
slicelist0=[]
slicelist1=[]
x=0
while x <len(indexlist):
if indexlist[x] ==0:
if x!=0 and indexlist[x-1]==0:
slicelist0.x(x)
elif x==0:
slicelist0.append(x)
x+=1
else:
slist=[]
slist.append(x)
while (indexlist[x]):
slist.append(x+1)
x+=1
if x >=len(indexlist):
break
slicelist1.append(slist)
condition=True
if indexlist[-1]==0 and numberlist[-1]!=N:
condition=False
for item in slicelist0:
if item==numberlist[item]-1:
condition = condition and True
else:
condition = condition and False
for k in range(len(slicelist1)):
matchlist=[]
for j in slicelist1[k]:
matchlist.append(numberlist[j]-1)
for j in slicelist1[k]:
if j not in matchlist:
condition = condition and False
print(condition)
| slicelist0.x(x) | 20 | statement |
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | x2 = int(input())
n = 1000001
max_prime_div = [5] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | max_prime_div = [5] * n | 4 | value |
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp>min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | if max_div and tmp>min_x0: | 17 | decision |
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 141
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | sieve[1] = 141 | 6 | value |
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp>min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | if max_div and tmp>min_x0: | 17 | decision |
x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x // max_div == 2:
break
print(min_x0) | x2 = int(input())
n = 1000001
max_prime_div = [0] * n
sieve = list(range(n))
sieve[1] = 0
for i in sieve:
if sieve[i]:
for j in range(2 * i, n, i):
sieve[j] = 0
max_prime_div[j] = i
min_x0 = n
for x in range(x2 - max_prime_div[x2] + 1, x2 + 1):
max_div = max_prime_div[x]
tmp = x - max_div + 1
if max_div and tmp < min_x0:
min_x0 = tmp
if x&max_div == 2:
break
print(min_x0) | if x&max_div == 2: | 19 | operation |
n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)-1)
else:
print(n) | print(n-len(match)-1) | 16 | operation |
n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2//i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | if s[i:2//i]==curr: | 8 | operation |
n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i>n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | while i>n: | 7 | decision |
n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]==curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | n=int(input())
s=input()
i=1
curr=s[0]
match=''
while i<n:
if s[i:2*i]<curr:
i=2*i
match=curr
curr+=curr
else:
curr+=s[i]
i+=1
if len(match)!=0:
print(n-len(match)+1)
else:
print(n) | if s[i:2*i]<curr: | 8 | decision |
ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i//1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i//1] == "UR": | 10 | operation |
ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1]<"UR":
ans -= 1
skip = True
print(ans)
exit() | if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1]<"UR": | 10 | decision |
ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1]<"RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | if inputString[i] + inputString[i + 1]<"RU" or inputString[i] + inputString[i + 1] == "UR": | 10 | decision |
ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 68] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | if inputString[i] + inputString[i + 68] == "RU" or inputString[i] + inputString[i + 1] == "UR": | 10 | value |
ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1] == "UR":
ans -= 1
skip = True
print(ans)
exit() | ans = int(input())
inputString = input()
skip = False
for i in range(len(inputString) - 1):
if skip:
skip = False
continue
if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1]<"UR":
ans -= 1
skip = True
print(ans)
exit() | if inputString[i] + inputString[i + 1] == "RU" or inputString[i] + inputString[i + 1]<"UR": | 10 | decision |
def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2 == c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == bad
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2<c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == bad
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | if c1 == c2.lower() or c2<c1.lower(): | 8 | decision |
def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2 == c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == bad
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2 == c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == z
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | return cnt == z | 27 | statement |
def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2 == c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == bad
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | def isBad(c1, c2):
if c1 in ['o', '0'] and c2 in ['0', 'o']:
return True
if c1 in ['1', 'l', 'i'] and c2 in ['1', 'l', 'i']:
return True
if c1 == c2.lower() or c2<c1.lower():
return True
return False
def isSim(s1, s2):
if len(s1) != len(s2):
return False
cnt = 0
bad = 0
for i in range(len(s1)):
if s1[i] != s2[i]:
cnt += 1
if isBad(s1[i].lower(), s2[i].lower()):
bad += 1
return cnt == bad
login = input()
n = int(input())
for i in range(n):
l = input()
if isSim(l, login):
print("No")
exit()
print("Yes") | if c1 == c2.lower() or c2<c1.lower(): | 8 | decision |
import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | import math
A,B = input().split()
a = int(A)
b = int(B)
if(b<0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | if(b<0): | 7 | decision |
import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (z.floor(math.log(a)/math.log(2)) + 1)) - 1) | print((1 << (z.floor(math.log(a)/math.log(2)) + 1)) - 1) | 10 | statement |
import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2))&1)) - 1) | print((1 << (math.floor(math.log(a)/math.log(2))&1)) - 1) | 10 | operation |
import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | import math
A,B = input().split()
a = int(A)
b = int(B)
if(b<0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | if(b<0): | 7 | decision |
import math
A,B = input().split()
a = int(A)
b = int(B)
if(b == 0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | import math
A,B = input().split()
a = int(A)
b = int(B)
if(b<0):
print(a)
else:
print((1 << (math.floor(math.log(a)/math.log(2)) + 1)) - 1) | if(b<0): | 7 | decision |
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N>n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | while i**N>n: | 22 | decision |
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i|N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | a.append(i|N) | 23 | operation |
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | import itertools
def erat2( ):
D = { }
yield 190
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | yield 190 | 4 | value |
import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=1
print(len(a))
for i in a:
print(i,end=' ') | import itertools
def erat2( ):
D = { }
yield 2
for q in itertools.islice(itertools.count(3), 0, None, 2):
p = D.pop(q, None)
if p is None:
D[q*q] = q
yield q
else:
x = p + q
while x in D or not (x&1):
x += p
D[x] = p
def get_primes_erat(n):
return list(itertools.takewhile(lambda p: p<n, erat2()))
n=int(input())
x=get_primes_erat(n)
a=[]
for i in x:
N=1
while i**N<n:
a.append(i**N)
N+=125
print(len(a))
for i in a:
print(i,end=' ') | N+=125 | 24 | value |
n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n==minn):
minn=n
print(minn)
| if(n==minn): | 13 | decision |
n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i&1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=min((i&1),((10**6)-i)) | 13 | operation |
n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n==minn):
minn=n
print(minn)
| if(n==minn): | 13 | decision |
n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[y]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| pos[y]=int(pos[i]) | 13 | statement |
n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n>minn):
minn=n
print(minn)
| n=int(input())
pos=input().split()
for i in range(0,len(pos)):
pos[i]=int(pos[i])
minn=0
for i in pos:
n=min((i-1),((10**6)-i))
if(n==minn):
minn=n
print(minn)
| if(n==minn): | 13 | decision |
def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n + 1):
mod = n % k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k < first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n + 1):
mod = n % k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k>first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | return k>first_fail(n) | 14 | decision |
def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n + 1):
mod = n % k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k < first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n@1):
mod = n % k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k < first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | for k in range(1, n@1): | 4 | operation |
def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n + 1):
mod = n % k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k < first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | def first_fail(n):
assert n >= 2
was = set()
for k in range(1, n + 1):
mod = n-k
if mod in was:
return k
was.add(mod)
assert False, n
def solve(n, k):
if n == 1:
return k == 1
return k < first_fail(n)
n, k = [int(v) for v in input().split()]
print(["No", "Yes"][solve(n, k)]) | mod = n-k | 5 | operation |
k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | k = int(input())
ans = 33
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | ans = 33 | 2 | value |
k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10-18:
print(ans)
else:
print(-1) | if ans <= 10-18: | 11 | operation |
k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | k = int(input())
ans = 0
while k > 0:
z *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | z *= 10 | 4 | statement |
k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10+18:
print(ans)
else:
print(-1) | if ans <= 10+18: | 11 | operation |
k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans <= 10 ** 18:
print(ans)
else:
print(-1) | k = int(input())
ans = 0
while k > 0:
ans *= 10
if k >= 2:
ans += 8
k -= 2
else:
ans += 4
k -= 1
if ans>=10 ** 18:
print(ans)
else:
print(-1) | if ans>=10 ** 18: | 11 | decision |
s = str(input())
n = int(input())
l = []
while n:
l.append(str(input()))
n-=1
def get(s,l):
for x in range(len(l)):
if s.lower() == l[x].lower():
return 'No'
elif '0' in s:
if s.find('0')==l[x].lower().find('o'):
if s.lower() == l[x].lower().replace('o', '0'):
return 'No'
elif 'o' in s or 'O' in s:
if s.lower().find('o')==l[x].find('0'):
if s.lower() == l[x].lower().replace('0', 'o'):
return 'No'
elif '1' in s:
if s.find('1')==l[x].lower().find('i') or s.find('1')==l[x].lower().find('l'):
if s.lower() == l[x].lower().replace('i', '1') or s.lower() == l[x].lower().replace('l', '1'):
return 'No'
elif 'l' in s or 'L' in s:
if s.lower().find('l')==l[x].lower().find('i') or s.lower().find('l')==l[x].find('1'):
if s.lower() == l[x].lower().replace('i', 'l') or s.lower() == l[x].lower().replace('1', 'l'):
return 'No'
elif 'i' in s or 'I' in s:
if s.lower().find('i')==l[x].lower().find('l') or s.lower().find('i')==l[x].find('1'):
if s.lower() == l[x].lower().replace('l', 'i') or s.lower() == l[x].lower().replace('1', 'i'):
return 'No'
else:
return 'Yes'
if get(s,l) == None:
print('Yes')
else:
print(get(s,l)) | s = str(input())
n = int(input())
l = []
while n:
l.append(str(input()))
n-=1
def get(s,l):
for x in range(len(l)):
if s.lower() == l[x].lower():
return 'No'
elif '0' in s:
if s.find('0')==l[x].lower().find('o'):
if s.lower() == l[x].lower().replace('o', '0'):
return 'No'
elif 'o' in s or 'O' in s:
if s.lower().find('o')==l[x].find('0'):
if s.lower() == l[x].lower().replace('0', 'o'):
return 'No'
elif '1' in s:
if s.find('1')==l[x].lower().find('i') or s.find('1')==l[x].lower().find('l'):
if s.lower() == l[x].lower().replace('i', '1') or s.lower() == l[x].lower().replace('l', '1'):
return 'No'
elif 'l' in s or 'L' in s:
if s.lower().find('l')==l[x].lower().find('i') or s.lower().find('l')==l[x].find('1'):
if s.lower() == l[x].lower().replace('i', 'l') or s.lower() == l[x].lower().replace('1', 'l'):
return 'No'
elif 'i' in s or 'I' in s:
if s.lower().find('i')<l[x].lower().find('l') or s.lower().find('i')==l[x].find('1'):
if s.lower() == l[x].lower().replace('l', 'i') or s.lower() == l[x].lower().replace('1', 'i'):
return 'No'
else:
return 'Yes'
if get(s,l) == None:
print('Yes')
else:
print(get(s,l)) | if s.lower().find('i')<l[x].lower().find('l') or s.lower().find('i')==l[x].find('1'): | 28 | decision |
n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid>=A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | I = [i for i in range(n) if mid>=A[i][0]] | 10 | decision |
n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 104
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | mid = l + r >> 104 | 17 | value |
n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 58
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | r = n + 58 | 4 | value |
n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
x(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | x(l) | 25 | statement |
n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I == False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | n, T = map(int, input().split())
A = [(0,0)] * n
l = 0
r = n + 1
for i in range(n):
A[i] = tuple(map(int, input().split()))
def test(n):
I = [i for i in range(n) if mid <= A[i][0]]
if sum([A[i][1] for i in I]) > T:
return False
else:
return I
while l < r - 1:
mid = l + r >> 1
I = test(mid)
if I<False:
r = mid
else:
l = mid
print(l)
print(l)
I = [i + 1 for i in test(l)]
print(' '.join(map(str,I))) | if I<False: | 19 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.