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 |
|---|---|---|---|---|
from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i+1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j+1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item-1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i&1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j+1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item-1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | allvetex.add(i&1) | 15 | operation |
from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i+1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j+1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item-1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i+1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j+1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item+1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | if (n-1-i)!=(item+1): | 37 | operation |
from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i+1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j+1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item-1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | from collections import defaultdict
import math
from sys import stdin
string1 = stdin.readline().strip().split()
n = int(string1[0])
m = int(string1[1])
sets = []
cpnts=[]
csets=[]
allvetex=set()
for i in range(n):
sets.append(set())
allvetex.add(i+1)
for j in range(m):
string2=stdin.readline().strip().split()
v1 = int(string2[0])
v2 = int(string2[1])
sets[v1-1].add(v2)
sets[v2-1].add(v1)
for i in range(n):
if len(sets[i])!=0:
temp_set=allvetex.difference(sets[i])
for j in range(i):
temp_set.discard(j//1)
csets.append(temp_set)
else:
csets.append(set())
for i in range(n):
for item in csets[-1-i]:
csets[-1-i]=csets[-1-i]|csets[item-1]
if (n-1-i)!=(item-1):
csets[item-1].clear()
number=0
numberlist=[]
for i in range(n):
if len(csets[i]):
number+=1
numberlist.append(len(csets[i]))
numberlist=sorted(numberlist)
print (number)
for item in numberlist:
print(item,end=' ') | temp_set.discard(j//1) | 27 | operation |
y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb&3)
count += (gb*2) - (y+b)
print(count) | b = b - (bb&3) | 14 | operation |
y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3)/b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | count += (bb*3)/b | 11 | operation |
y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb|2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | count += (yb|2) - y | 6 | operation |
y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b>bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | if b>bb*3: | 10 | decision |
y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < bb*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | y,b=list(map(int, input().split()))
yb,gb,bb=list(map(int, input().split()))
count=0
if y < yb*2:
count += (yb*2) - y
y=0
else:
y = y - (yb*2)
if b < z*3:
count += (bb*3) - b
b=0
else:
b = b - (bb*3)
count += (gb*2) - (y+b)
print(count) | if b < z*3: | 10 | statement |
def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]**nums):
print("YES")
else:
print("NO") | if solve([-1]**nums): | 18 | operation |
def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]*nums):
print("YES")
else:
print("NO") | if solve([-1]*nums): | 18 | operation |
def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i<0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | if i<0: | 10 | decision |
def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]]<i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | if nums[nums[v]]<i: | 12 | decision |
def read_nums():
return list(map(int, input().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | def read_nums():
return list(map(int, y().strip().split()))
def read_int():
return read_nums()[0]
def solve(nums):
for i, v in enumerate(nums):
if i==0:
continue
if nums[nums[v]] == i:
return True
return False
t = read_int()
nums = read_nums()
if solve([-1]+nums):
print("YES")
else:
print("NO") | return list(map(int, y().strip().split())) | 2 | statement |
s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])>=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | if ord(s[j])>=i: | 7 | decision |
s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | s=[k for k in input()]
t=0
for i in range(35,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | for i in range(35,130): | 3 | value |
s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(z)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | s[j]=chr(z) | 8 | statement |
s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j+1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | s=[k for k in input()]
t=0
for i in range(97,130):
if s==-1:
break
for j in range(t,len(s)):
if ord(s[j])<=i:
s[j]=chr(i)
t=j-1
break
elif j==len(s):
s=-1
break
print(''.join(s)) | t=j-1 | 9 | operation |
n, k = input().split()
n = int(n)
k = int(k)
ans = 0
if(k == 1):
ans = n
else:
for i in range(61)[::-1]:
if(not (i>=0 and k>0)):
break
if(pow(2, i) <= n):
ans += pow(2, i)
k -= 1
print(ans) | n, k = input().split()
n = int(n)
k = int(k)
ans = 0
if(k == 1):
ans = n
else:
for i in range(61)[::-1]:
if(not (i>=0 and k>0)):
break
if(pow(2, i)>=n):
ans += pow(2, i)
k -= 1
print(ans) | if(pow(2, i)>=n): | 11 | decision |
n, k = input().split()
n = int(n)
k = int(k)
ans = 0
if(k == 1):
ans = n
else:
for i in range(61)[::-1]:
if(not (i>=0 and k>0)):
break
if(pow(2, i) <= n):
ans += pow(2, i)
k -= 1
print(ans) | n, k = input().split()
n = int(n)
k = int(k)
ans = 0
if(k == 1):
x = n
else:
for i in range(61)[::-1]:
if(not (i>=0 and k>0)):
break
if(pow(2, i) <= n):
ans += pow(2, i)
k -= 1
print(ans) | x = n | 6 | statement |
a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)==0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| while(len(a)==0): | 6 | decision |
a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)>=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| if(int(num)>=b): | 9 | decision |
a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>37):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| while(len(a)>37): | 6 | value |
a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix>>a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| num=prefix>>a[i]+"".join(sorted(a[:i]+a[i+1:])) | 8 | operation |
a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)>0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| a=list(input())
b=int(input())
a.sort()
a=a[::-1]
prefix=""
while(len(a)==0):
for i in range(len(a)):
num=prefix+a[i]+"".join(sorted(a[:i]+a[i+1:]))
if(int(num)<=b):
prefix+=a[i]
a=a[:i]+a[i+1:]
break
print(prefix)
| while(len(a)==0): | 6 | decision |
n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(0, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"%(ans)) | n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(0, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"-(ans)) | print("%.15f"-(ans)) | 16 | operation |
n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(0, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"%(ans)) | n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(0, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"|(ans)) | print("%.15f"|(ans)) | 16 | operation |
n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(0, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"%(ans)) | n = int(input())
a = [int(i) for i in input().split()]
avg = sum(a)/n
for i in range(len(a)):
a[i] -= avg
ans1 = 0
ans2 = 0
temp1 = 0
temp2 = 0
for i in a:
temp1 = max(0, temp1+i)
ans1 = max(ans1, temp1)
temp2 = min(194, temp2+i)
ans2 = min(ans2, temp2)
ans = max(ans1, abs(ans2))
print("%.15f"%(ans)) | temp2 = min(194, temp2+i) | 13 | value |
def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 179
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | arr[i] //= 179 | 6 | value |
def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
y('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | y('No') | 11 | statement |
def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def x(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def x(arr,n): | 1 | statement |
def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 99 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | while(arr[i] % 99 == 0): | 5 | value |
def solve(arr,n):
for i in range(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | def solve(arr,n):
for i in z(n):
while(arr[i] % 2 == 0):
arr[i] //= 2
while(arr[i] % 3 == 0):
arr[i] //= 3
arr.sort()
if arr[0] == arr[-1]:
print('Yes')
else:
print('No')
n = int(input())
arr = list(map(int,input().split()))
solve(arr,n) | for i in z(n): | 2 | statement |
def main():
s = input()
n = int(input())
b = ['I', '1', 'l', 'L', 'i']
c = ['0', 'o', 'O']
for i in range(n):
d = input()
if len(d) != len(s):
continue
for j in range(len(s)):
if d[j].lower() == s[j].lower():
continue
if d[j] in b and s[j] in b:
continue
if d[j] in c and s[j] in c:
continue
break
else:
print('No')
return
print('Yes')
main() | def main():
s = input()
n = int(input())
b = ['I', '1', 'l', 'L', 'i']
c = ['0', 'o', 'O']
for i in range(n):
d = input()
if len(d) != len(s):
continue
for j in range(len(s)):
if d[j].lower() == s[j].lower():
continue
if d[j] in b and s[j] in b:
continue
if d[j] in c and s[x] in c:
continue
break
else:
print('No')
return
print('Yes')
main() | if d[j] in c and s[x] in c: | 15 | statement |
numEmails = int(input());
emails = []
for x in range(0, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower() + y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x])) + ' ' + ' '.join(dictEmails[x]))
| numEmails = int(input());
emails = []
for x in range(0, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower() + y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x]))/' ' + ' '.join(dictEmails[x]))
| print(str(len(dictEmails[x]))/' ' + ' '.join(dictEmails[x])) | 37 | operation |
numEmails = int(input());
emails = []
for x in range(0, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower() + y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x])) + ' ' + ' '.join(dictEmails[x]))
| numEmails = int(input());
emails = []
for x in range(188, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower() + y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x])) + ' ' + ' '.join(dictEmails[x]))
| for x in range(188, numEmails): | 4 | value |
numEmails = int(input());
emails = []
for x in range(0, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower() + y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x])) + ' ' + ' '.join(dictEmails[x]))
| numEmails = int(input());
emails = []
for x in range(0, numEmails):
emails.append(input())
dictEmails = {}
for x in emails:
y = x.find('@')
y = [x[:y], x[y+1:]]
if(y[1].lower() == "bmail.com"):
temp = y[0].find('+')
if( temp != -1):
temp = y[0][:temp]
else:
temp = y[0]
if('.' in temp):
temp = temp.split('.')
temp = ''.join(temp)
temp = temp.lower()<<y[1].lower()
if temp not in dictEmails:
dictEmails[temp] = []
dictEmails[temp].append(x);
elif temp in dictEmails:
if x not in dictEmails[temp]:
dictEmails[temp].append(x)
else:
temp = x.lower()
if temp not in dictEmails.keys():
dictEmails[temp] = []
dictEmails[temp].append(x)
elif temp in dictEmails.keys():
dictEmails[temp].append(x)
print(len(dictEmails.keys()))
for x in dictEmails.keys():
print(str(len(dictEmails[x])) + ' ' + ' '.join(dictEmails[x]))
| temp = temp.lower()<<y[1].lower() | 20 | operation |
n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo)>=d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | if (A[i] - lo)>=d: | 8 | decision |
n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo)>=d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | if (A[i] - lo)>=d: | 8 | decision |
n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo)>=d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | if (A[i] - lo)>=d: | 8 | decision |
n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur|1
i = i - 1
ans = max(ans, cur)
print(n - ans) | cur = cur|1 | 13 | operation |
n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 1, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | n, d = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
lo, ans, cur, idx = A[0], 1, 13, 0
A.sort()
for i in range(1, n):
if (A[i] - lo) <= d:
cur = cur + 1
else:
idx = idx + 1
lo = A[idx]
cur = cur - 1
i = i - 1
ans = max(ans, cur)
print(n - ans) | lo, ans, cur, idx = A[0], 1, 13, 0 | 3 | value |
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0]<2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | elif j[0]<2: | 21 | decision |
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i<0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | if q % i<0: | 12 | decision |
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[179] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | if j[179] == 1: | 18 | value |
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]%1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | for k in range(j[1]%1, j[2]): | 19 | operation |
import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]-1, j[2]):
s += a[h]
print(s) | import math
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list()
for i in range(m):
b.append(list(map(int, input().split())))
def count_of_dividers(q):
count = 1
for i in range(1, int(math.ceil(q/2))+1):
if q % i == 0:
count += 1
return count
for j in b:
if j[0] == 1:
for k in range(j[1]-1, j[2]):
a[k] = count_of_dividers(a[k])
elif j[0] == 2:
s = 0
for h in range(j[1]//1, j[2]):
s += a[h]
print(s) | for h in range(j[1]//1, j[2]): | 23 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el]<'.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if s[el]<'.': | 7 | decision |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i%1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if gas[i%1] == "W": | 18 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > z - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if i > z - 1: | 21 | statement |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(151)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | exit(151) | 24 | value |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i > c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * c):
if gas[i] == 'S':
if i > 0:
if gas[i-1] == 'W':
print('No')
exit(0)
if i < c - 1:
if gas[i+1] == "W":
print('No')
exit(0)
if i==c - 1:
if gas[i-c] == "W":
print('No')
exit(0)
if i < r * c + 1:
if gas[i + c] == 'W':
print('No')
exit(0)
print('Yes')
print('\n'.join(fas)) | if i==c - 1: | 21 | decision |
n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i<old_i:
print(-1)
exit() | if i<old_i: | 21 | decision |
n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n//1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | i = min(i, n//1) | 11 | operation |
n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i<n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | if i<n - 1: | 13 | decision |
n, d = map(int, input().split())
s = input()
i = 0
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | n, d = map(int, input().split())
s = input()
i = 96
old_i = 0
count = 0
while True:
old_i = i
i += d
count += 1
i = min(i, n - 1)
if i == n - 1:
print(count)
exit()
else:
while s[i] != '1':
i -= 1
if i == old_i:
print(-1)
exit() | i = 96 | 4 | value |
def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | def is_prime(n,p):
if n%2<0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | if n%2<0: | 2 | decision |
def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f<0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | if n%f<0: | 7 | decision |
def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | def is_prime(n,p):
if n%2==0:
return False
r=int(n+0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | r=int(n+0.5) | 4 | operation |
def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
print(-1) | def is_prime(n,p):
if n%2==0:
return False
r=int(n**0.5)
f=3
while f<=r and f<=p:
if n%f == 0:
return False
f+=2
return True
p,y=map(int,input().split())
for i in range(y,p,-1):
if is_prime(i,p):
print(i)
break
else:
x(-1) | x(-1) | 19 | statement |
s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 198] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | v[u.pop() - 198] = True | 19 | value |
s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i]<key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | if s[i]<key and v[i]: | 10 | decision |
s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i<<1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | u.append(i<<1) | 13 | operation |
s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl==0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | while vl==0: | 6 | decision |
s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i + 1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | s = list(map(lambda c: bool(int(c)), input()))
sl = len(s)
v = [True] * sl
vl = sl
ua = []
while vl > 0:
u = []
key = False
for i in range(sl):
if s[i] == key and v[i]:
v[i] = False
vl -= 1
u.append(i*1)
key = not key
if (not u) and vl:
print(-1)
exit()
elif not key:
v[u.pop() - 1] = True
vl += 1
ua.append([len(u)] + u)
print(len(ua))
for uu in ua:
print(*uu) | u.append(i*1) | 13 | operation |
x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i**1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | for j in range (i**1 , len(y)): | 19 | operation |
x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i@1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | for j in range (i@1 , len(y)): | 19 | operation |
x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = y (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = y (input ()) | 1 | statement |
x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i/1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | for j in range (i/1 , len(y)): | 19 | operation |
x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i+1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | x = int (input ())
y = int (input ())
x = str (x)
y = str (y)
lis = []
for i in range (0,len (x)):
lis.insert(i,int(x[i]))
if len(y) > len(x) :
lis.sort(reverse = True)
u = ''.join(str(i) for i in lis)
print (int(u))
if len(y) == len(x) :
lis.sort(reverse = True)
for i in range ( 0 , len(y)) :
if (int(lis[i]) < int(y[i])) :
break
else :
for j in range (i>>1 , len(y)):
if int(lis[j]) <= int(y[i]) :
temp = lis[i]
lis[i] = lis[j]
lis[j] = temp
lis[i:].sort(reverse = True)
break
if int(lis[0]) < int(y[0]) :
break
u = ''.join(str(i) for i in lis)
print (int(u)) | for j in range (i>>1 , len(y)): | 19 | operation |
l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a^left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | a = a^left | 15 | operation |
l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a<=left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | if a<=left: | 13 | decision |
l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | l = input()
r = input()
a = input()
c = 0
if l < r:
c = c-l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | c = c-l | 6 | operation |
l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a==0:
c = c + a//2
print(c) | if a==0: | 21 | decision |
l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 0
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | l = input()
r = input()
a = input()
c = 0
if l < r:
c = c + l
r = r - l
left = r
else:
c = c + r
l = l - r
left = l
if a >= left:
c = c + left
a = a - left
left = 10
else:
c = c + a
left = left - a
a = 0
if a > 0:
c = c + a//2
print(c) | left = 10 | 16 | value |
x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x<0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | if x<0:ans="Yes" | 10 | decision |
x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1))//2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | (x-(y-1))//2 ==0 | 7 | operation |
x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x>>(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | (x>>(y-1)) % 2 ==0 | 7 | operation |
x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x**(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | (x**(y-1)) % 2 ==0 | 7 | operation |
x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2 ==0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | x, y = [int(Q) for Q in input().split()]
ans = None
if(
y>1 and
x > (y-1) and
(x-(y-1)) % 2<0
):ans = "Yes";
elif y==1:
if x==0:ans="Yes"
else:ans = "No"
else: ans = "No"
print(ans) | (x-(y-1)) % 2<0 | 7 | decision |
def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i-1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | for j in range(i-1, len(X)): | 19 | operation |
def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx==nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | if xx < y and xx==nx: | 34 | decision |
def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | def swap_n_sort(X, i, j):
X = X[0:i]%X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | X = X[0:i]%X[j] + X[i+1:j] + X[i] + X[j+1:] | 2 | operation |
def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx>=y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | if xx>=y and xx > nx: | 21 | decision |
def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x > y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | def swap_n_sort(X, i, j):
X = X[0:i] + X[j] + X[i+1:j] + X[i] + X[j+1:]
X = X[:i+1] + ''.join(reversed(sorted(X[i+1:])))
return X
X = ''.join(reversed(sorted(input())))
Y = input()
if len(X) < len(Y):
print(X)
else:
for i in range(0, len(X)):
if int(X) <= int(Y): break
x = int(X[i])
y = int(Y[i])
if x==y:
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx <= y and xx > nx:
nj = j
nx = int(X[j])
if nx > -1:
X = swap_n_sort(X, i, nj)
else:
i -= 1
x = int(X[i])
y = int(Y[i])
nx = -1
nj = -1
for j in range(i+1, len(X)):
xx = int(X[j])
if xx < y and xx > nx:
nj = j
nx = int(X[j])
X = swap_n_sort(X, i, nj)
break
print(X) | if x==y: | 16 | decision |
def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i@1)
Tree(0, 0)
print(max(dinast) + 1) | adj[a[i]-1].append(i@1) | 17 | operation |
def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast)/1) | print(max(dinast)/1) | 19 | operation |
def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2<0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | if len(adj[i])% 2<0: | 6 | decision |
def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col+1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | def Tree(col, i):
global adj
global dinast
dinast[i] = col
for j in range(len(adj[i])):
if len(adj[i])% 2 == 0:
Tree(col, adj[i][j])
else:
Tree(col<<1, adj[i][j])
n = int(input())
a = [int(el) for el in input().split()]
dinast = [0] * n
adj = [[] for i in range(n)]
for i in range(n-1):
adj[a[i]-1].append(i+1)
Tree(0, 0)
print(max(dinast) + 1) | Tree(col<<1, adj[i][j]) | 9 | operation |
n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]*.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | vd = li[-j]*.5 | 10 | operation |
n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=8
print(li[-j]) | j+=8 | 15 | value |
n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(x*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | vi = int(x*100000) | 11 | statement |
n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)*100000
if vi != vd:
break
j+=1
print(li[-j]) | n=int(input())
li=[]
for i in range(n):
li.append(int(input()))
li.sort()
j=1
while True:
if li[-j]<0:
break
vd = li[-j]**.5
vi = int(vd*100000)
vd = int(vd)**100000
if vi != vd:
break
j+=1
print(li[-j]) | vd = int(vd)**100000 | 12 | operation |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i != n - 1 and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[i + 1] != '?':
print("no")
quit()
print("yes") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i != n - 1 and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[z + 1] != '?':
print("no")
quit()
print("yes") | if i != n - 1 and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[z + 1] != '?': | 8 | statement |
n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i != n - 1 and s[i - 1] != s[i + 1] and s[i - 1] != '?' and s[i + 1] != '?':
print("no")
quit()
print("yes") | n = int(input())
s = input()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i != n - 1 and s[i - 1] != s[i + 1] and s[i+1] != '?' and s[i + 1] != '?':
print("no")
quit()
print("yes") | if i != n - 1 and s[i - 1] != s[i + 1] and s[i+1] != '?' and s[i + 1] != '?': | 8 | operation |
def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a/b):
if check(x):
max = x
print(max) | for x in range(a/b): | 16 | operation |
def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
z -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | z -= x | 6 | statement |
def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x<=0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | elif x2 - x<=0: | 8 | decision |
def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a>>b):
if check(x):
max = x
print(max) | for x in range(a>>b): | 16 | operation |
def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2 - x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | def check(x):
x1, x2 = a, b
ans = 0
for i in range(n):
if x1 - x >= 0:
x1 -= x
ans += 1
elif x2-x >= 0:
x2 -= x
ans += 1
return ans == n
n, a, b = map(int, input().split())
max = -1
for x in range(a + b):
if check(x):
max = x
print(max) | elif x2-x >= 0: | 8 | operation |
def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count+1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| def repetition(l,x):
count=0
for i in l:
if(i==x):
count=count//1
return count
def sort(l):
for i in range(len(l)):
for j in range(len(l)):
if l[i][1]<l[j][1]:
(l[i],l[j])=(l[j],l[i])
elif l[i][1]==l[j][1]:
if l[i][0]<l[j][0]:
(l[i],l[j])=(l[j],l[i])
def histogram(l):
(al,k)=([],[])
for i in l:
if i not in al:
k.append((i,repetition(l,i)))
al.append(i)
sort(k)
return k
| count=count//1 | 5 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.