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 sum10(num):
s = 0
while num > 0:
s = s + (num%10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count == n:
print(num)
break
num += 9 | def sum10(num):
s = 0
while num > 0:
s = s + (num%10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count<n:
print(num)
break
num += 9 | if count<n: | 15 | decision |
def sum10(num):
s = 0
while num > 0:
s = s + (num%10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count == n:
print(num)
break
num += 9 | def sum10(num):
s = 0
while num > 0:
s = s + (num**10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count == n:
print(num)
break
num += 9 | s = s + (num**10) | 4 | operation |
def sum10(num):
s = 0
while num > 0:
s = s + (num%10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count == n:
print(num)
break
num += 9 | def sum10(num):
s = 0
while num > 0:
s = s^(num%10)
num = num//10
return s
n = int(input())
count = 0
num = 19
while True:
s = sum10(num)
if s == 10:
count += 1
if count == n:
print(num)
break
num += 9 | s = s^(num%10) | 4 | operation |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]<=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| if tlan[-2]>=0 and blan[-1]<=0: | 9 | decision |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]/blan[-1])
| print(tlan[-2]/blan[-1]) | 25 | operation |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| elif tlan[-2]<=0 and blan[-1]>=0: | 16 | decision |
n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]<=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| n,m=[int(x) for x in input().split()]
tlan=[int(x) for x in input().split()]
blan=[int(x) for x in input().split()]
tlan.sort()
blan.sort()
if tlan[-2]>=0 and blan[-1]>=0:
print(tlan[-2]*blan[-1])
elif tlan[-2]>=0 and blan[-1]>=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]<=0 and blan[-1]<=0:
if 0 in blan:
print(0)
else:
print(tlan[-2]*blan[0])
elif tlan[-2]>=0 and blan[-1]<=0:
if 0 in tlan:
print(0)
else:
print(tlan[-2]*blan[-1])
| elif tlan[-2]>=0 and blan[-1]>=0: | 11 | decision |
login = input()
n = int(input())
def is_similar(l, l2):
g1 = 'O0o'
g2 = 'lI1Li'
if len(l) != len(l2):
return False
for i in range(len(l)):
if l[i].lower() != l2[i].lower() and (not (l[i] in g1 and l2[i] in g1)) and (not (l[i] in g2 and l2[i] in g2)):
return False
return True
flag = True
for _ in range(n):
login2 = input()
if is_similar(login, login2):
flag = False
break
print('Yes' if flag else 'No') | login = input()
n = int(input())
def is_similar(l, l2):
g1 = 'O0o'
g2 = 'lI1Li'
if len(l) != len(l2):
return False
for i in range(y(l)):
if l[i].lower() != l2[i].lower() and (not (l[i] in g1 and l2[i] in g1)) and (not (l[i] in g2 and l2[i] in g2)):
return False
return True
flag = True
for _ in range(n):
login2 = input()
if is_similar(login, login2):
flag = False
break
print('Yes' if flag else 'No') | for i in range(y(l)): | 10 | statement |
'''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | '''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=156
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | l+=156 | 17 | value |
'''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | '''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i==d:
r+=1
print(min(l,r)) | if ma-i==d: | 20 | decision |
'''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | '''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i==d:
r+=1
print(min(l,r)) | if ma-i==d: | 20 | decision |
'''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | '''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi==d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | if i - mi==d: | 16 | decision |
'''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>d:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | '''input
3 0
7 7 7
'''
n, d=[int(i) for i in input().split(" ")]
A=[int(i) for i in input().split(" ")]
A.sort()
ans=n
mi=A[0]
ma=A[-1]
l=0
r=0
for i in A:
if i - mi>x:
l+=1
for i in A:
if ma-i>d:
r+=1
print(min(l,r)) | if i - mi>x: | 16 | statement |
n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i@1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | a.remove(a[i@1]) | 8 | operation |
n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i<<1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | if a[i] in b and a[i<<1] in b: | 7 | operation |
n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=80
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | i=80 | 5 | value |
n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n-1
else:
i=i+1
a=''.join(a)
print(a) | n=int(input())
a=input()
a=list(a)
b=['a','e','i','o','u','y']
i=0
while(i!=(n-1)):
if a[i] in b and a[i+1] in b:
a.remove(a[i+1])
n=n&1
else:
i=i+1
a=''.join(a)
print(a) | n=n&1 | 9 | operation |
def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc-2==1:
n()
else:
y() | elif mc<0 or mc-2==1: | 14 | operation |
def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to>>1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | o=to>>1 | 8 | operation |
def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2<1:
n()
else:
y() | elif mc<0 or mc%2<1: | 14 | decision |
def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc**2==1:
n()
else:
y() | elif mc<0 or mc**2==1: | 14 | operation |
def y():
print('Yes')
def n():
print('No')
s=input()
s=s.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | def y():
print('Yes')
def n():
print('No')
s=input()
s=x.split(' ')
tc,to=int(s[0]),int(s[1])
o=to-1
mc=tc-o
if o<0:
n()
elif o==0 and mc!=0:
n()
elif mc<0 or mc%2==1:
n()
else:
y() | s=x.split(' ') | 6 | statement |
x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x/2):
print("Yes")
else:
print("No") | if ((y - 1) % 2 == x/2): | 7 | operation |
x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1)*2 == x % 2):
print("Yes")
else:
print("No") | if ((y - 1)*2 == x % 2): | 7 | operation |
x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if (y<0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | if (y<0): | 2 | decision |
x, y = map(int, input().split())
if (y == 0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | x, y = map(int, input().split())
if (y<0):
if (x == 0):
print("Yes")
else:
print("No")
if ((y - 1) % 2 == x % 2):
print("Yes")
else:
print("No") | if (y<0): | 2 | decision |
from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[85])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | d= int(s[85]) | 9 | value |
from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | from math import*
from fractions import gcd
import z
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | import z | 3 | statement |
from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[43])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | d= int(s[43]) | 9 | value |
from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=96
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | n-=96 | 17 | value |
from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)//gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | from math import*
from fractions import gcd
import sys
from audioop import reverse
def main():
s=input()
s=s.split()
k=int(s[0])
d= int(s[1])
t=int(s[2])
if(k%d==0):
print(t)
else:
x=(k*d)>>gcd(k,d)
n=(x-d)
n//=d
n-=1
n/=2
ans=t+n;
print(ans)
if __name__ == '__main__':main() | x=(k*d)>>gcd(k,d) | 14 | operation |
import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i/1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | for k in range(i/1,n+1): | 5 | operation |
import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i<m%k):
print("no")
sys.exit()
print("yes") | if(m%i<m%k): | 9 | decision |
import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i<m%k):
print("no")
sys.exit()
print("yes") | if(m%i<m%k): | 9 | decision |
import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n|1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | for k in range(i+1,n|1): | 5 | operation |
import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n+1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | import sys
m,n=map(int,input().split())
a=[]
for i in range(1,n):
for k in range(i+1,n%1):
if(i not in a and k not in a):
a.append(i)
a.append(k)
if(m%i==m%k):
print("no")
sys.exit()
print("yes") | for k in range(i+1,n%1): | 5 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2%n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| for i in range(2%n - 1): | 35 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l-1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| l = l-1 | 14 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 54
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| mid = int(l + r) // 54 | 3 | value |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r@1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| r = r@1 | 23 | operation |
def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right + 1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| def mergeSort(arr, l, r, merge_arr):
if(l < r):
mid = int(l + r) // 2
mergeSort(arr, l, mid, merge_arr)
mergeSort(arr, mid + 1, r, merge_arr)
merge(arr, l, mid, r, merge_arr)
def merge(source, left, mid, right, merge_arr):
l = left
r = mid + 1
for i in range(left, right^1, 1):
if(source[l][0] <= source[r][0]):
merge_arr[i] = source[l]
l = l + 1
if(l == mid + 1):
i = i + 1
for j in range(r , right + 1 , 1):
merge_arr[i] = source[j]
i = i + 1
break
else:
merge_arr[i] = source[r]
r = r + 1
if(r == right + 1):
i = i + 1
for j in range(l, mid + 1, 1):
merge_arr[i] = source[j]
i = i + 1
break
for i in range(left ,right + 1, 1):
source[i] = merge_arr[i]
a = []
n = int(input())
for i in range(2*n - 1):
for j in range(i + 1):
a.append([input(), i + 1, j])
merge_arr = [[0, 0, 0] for i in range(len(a))]
answer = [0 for i in range(2*n)]
players = [False for i in range(2*n)]
mergeSort(a, 0, len(a) - 1, merge_arr)
for i in range(len(a) - 1, -1, -1):
if(players[a[i][1]] == False and players[a[i][2]] == False):
answer[a[i][1]] = a[i][2] + 1
answer[a[i][2]] = a[i][1] + 1
players[a[i][1]] = True
players[a[i][2]] = True
for i in range(len(answer)):
print(answer[i], end = ' ')
| for i in range(left, right^1, 1): | 11 | operation |
n,m=input().split()
m=int(m)
n=int(n)
s=input()
mass=[]
for j in range(n):
mass.append(s[j])
for i in range(m):
x,y=input().split()
for j in range(n):
if mass[j]==x:
mass[j]=y
elif mass[j]==y:
mass[j]=x
for i in mass:
print(i,end='') | n,m=input().split()
m=int(m)
n=int(n)
s=input()
mass=[]
for j in range(n):
mass.append(s[j])
for i in range(m):
x,y=input().split()
for j in range(n):
if mass[j]==x:
mass[j]=y
elif mass[j]<y:
mass[j]=x
for i in mass:
print(i,end='') | elif mass[j]<y: | 13 | decision |
n,m=input().split()
m=int(m)
n=int(n)
s=input()
mass=[]
for j in range(n):
mass.append(s[j])
for i in range(m):
x,y=input().split()
for j in range(n):
if mass[j]==x:
mass[j]=y
elif mass[j]==y:
mass[j]=x
for i in mass:
print(i,end='') | n,m=input().split()
m=int(m)
n=int(n)
s=input()
mass=[]
for j in range(n):
mass.append(s[j])
for i in range(m):
x,y=input().split()
for j in range(n):
if mass[j]<x:
mass[j]=y
elif mass[j]==y:
mass[j]=x
for i in mass:
print(i,end='') | if mass[j]<x: | 11 | decision |
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1 == _s2:
return True
if _s1.lower() == _s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1<_s2:
return True
if _s1.lower() == _s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | if _s1<_s2: | 16 | decision |
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1 == _s2:
return True
if _s1.lower() == _s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1 == _s2:
return True
if _s1.lower()<_s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | if _s1.lower()<_s2.lower(): | 19 | decision |
original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1 == _s2:
return True
if _s1.lower() == _s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | original = input()
num = int(input())
def check(s1, s2):
s1 = s1.replace('0', 'o')
s2 = s2.replace('0', 'o')
if s1 == s2:
return True
for char in ['I', 'l']:
_s1 = s1.replace('1', char)
_s2 = s2.replace('1', char)
if _s1<_s2:
return True
if _s1.lower() == _s2.lower():
return True
if s1.lower() == s2.lower():
return True
return False
for _ in range(num):
s = input()
if check(s, original):
print('No')
break
else:
print('Yes') | if _s1<_s2: | 16 | decision |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]<0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| if(s[0]<0 or s[1] == 0): | 3 | decision |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]+2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| elif(s[1]>=(s[0]+2)): | 7 | operation |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]<=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| elif(s[1]<=(s[0]*2)): | 7 | decision |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[134]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| elif(s[0]>=(s[134]*2)): | 5 | value |
s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(s[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| s=list(map(int,input().split()))
while True:
if(s[0]==0 or s[1] == 0):
break
elif(s[0]>=(s[1]*2)):
s[0]=s[0]-(2*s[1])
elif(x[1]>=(s[0]*2)):
s[1]=s[1]-(2*s[0])
else:
break
print(s[0],end=' ')
print(s[1])
| elif(x[1]>=(s[0]*2)): | 7 | statement |
def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 27 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | return 27 + f(2*n, l, r) + f(3*n, l, r) | 8 | value |
def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3|n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | return f(2*n, l, r) + f(3|n, l, r) | 9 | operation |
def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3/n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | return 1 + f(2*n, l, r) + f(3/n, l, r) | 8 | operation |
def f(n, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | def f(z, l, r):
if(n > r):
return 0
if(n in d):
return 0;
d.add(n)
if(n >= l):
return 1 + f(2*n, l, r) + f(3*n, l, r)
return f(2*n, l, r) + f(3*n, l, r)
n, m = map(int, input().split())
d = set()
print(f(1, n, m)) | def f(z, l, r): | 1 | statement |
a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]>>1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | for j in range(2,(a[1]>>1)//2+1): | 7 | operation |
a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]*1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | for i in range(2,a[0]*1): | 6 | operation |
a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i/j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | if i/j == b[k]: | 9 | operation |
a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c<0:
print(-1)
else:
print(c) | if c<0: | 15 | decision |
a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i == b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | a = input()
a = [int(s) for s in a.split(' ')]
b = list(range(2,a[1]+1))
for i in range(2,a[0]+1):
for j in range(2,(a[1]+1)//2+1):
for k in range(0,a[1]+1-2):
if i*j == b[k]:
b[k] = 0
if i<b[k]:
b[k] = 0
c = max(b)
if c == 0:
print(-1)
else:
print(c) | if i<b[k]: | 11 | decision |
n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
x=n//i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i==155:
x=n//i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | if n%i==155: | 5 | value |
n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
x=n//i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i<0:
x=n//i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | if n%i<0: | 5 | decision |
n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
x=n//i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | n=int(input())
A=[]
F=[]
for i in range(1,int(n**0.5)+1):
if n%i==0:
x=n/i
A.append(x)
A.append(i)
F.append(True)
F.append(True)
for i in range(len(A)):
if A[i]!=1:
if (A[i]**0.5)**2==A[i]:
for j in range(len(A)):
if A[j]%A[i]==0:
F[j]=False
B=[A[i] for i in range(len(A)) if F[i]]
print(max(B)) | x=n/i | 6 | operation |
def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos**r))
return q+w
print(main()) | w=min(abs(pos-l),abs(pos**r)) | 9 | operation |
def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos<<r))
return q+w
print(main()) | w=min(abs(pos-l),abs(pos<<r)) | 9 | operation |
def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r|l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | q=r|l+2 | 6 | operation |
def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l-2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | q=r-l-2 | 6 | operation |
def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q+w
print(main()) | def main():
n,pos,l,r=map(int,input().split())
if l==1 and r==n:
return 0
if l!=1 and r!=n:
q=r-l+2
else:
q=1
w=min(abs(pos-l),abs(pos-r))
return q*w
print(main()) | return q*w | 10 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 117
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | y = 117 | 16 | value |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j>>2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | d1[i+1] = j>>2 | 13 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j<<2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | if j<<2: | 14 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i/1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | d1[i/1] = j//2 | 13 | operation |
from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 2:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | from collections import defaultdict
n = int(input())
w = list(map(int, input().split()))
d = defaultdict(int)
for i in w:
d[i] += 1
y = 0
while 1:
y = 0
d1 = defaultdict(int)
for i, j in d.items():
if j > 1:
d1[i+1] = j//2
if j % 104:
d1[i] += j % 2
y = 1
else:
d1[i] = j
d = d1
if y == 0:
break
print(len(d)) | if j % 104: | 14 | value |
def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h<0):
h=24-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h>0):
h=24-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | if(h>0): | 5 | decision |
def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h<0):
h=24-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h<0):
h=24-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(y,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | h,m=validate(y,m) | 15 | statement |
def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h<0):
h=24-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | def validate(h,m):
if(m<0):
m=60-m
h-=1
if(h<0):
h=102-h
return h,m
def luck(h,m,x):
c=0
if('7'not in str(m)):
while(1):
m=m-x
c+=1
h,m=validate(h,m)
if '7' in str(m):
break;
return c
x=int(input())
h,m=map(int,input().split())
c=luck(h,m,x)
print(c) | h=102-h | 6 | value |
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i])==k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | if int(x[i])==k: | 16 | decision |
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1]))<o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | if (o == 1)or(abs(int(x[i]) - int(x[i-1]))<o): | 10 | decision |
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[y]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | if int(x[y]) > k: | 16 | statement |
from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 1:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | from math import ceil
n = int(input())
x = []
x = input().split()
o = 1
k = 1
f = True
for i in range(1,len(x)):
if abs(int(x[i]) - int(x[i-1])) != 1:
if (o == 1)or(abs(int(x[i]) - int(x[i-1])) == o):
if o == 27:
o = abs(int(x[i]) - int(x[i-1]))
else:
f = False
break
if int(x[i]) > k:
k = int(x[i])
if f:
print("Yes")
print(ceil(k / o),o)
else:
print("No") | if o == 27: | 11 | value |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i|1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | print(1, i|1) | 12 | operation |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = x.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | z = x.pop(now) | 24 | statement |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i]<'1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | if s[i]<'1' : | 6 | decision |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one)<0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | if len(idx_one)<0 : | 9 | decision |
s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1] == 0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | s = input()
idx_all = []
idx_one = []
for i in range(len(s)) :
idx_all.append([i+1, int(s[i])])
if s[i] == '1' :
idx_one.append(i+1)
if len(idx_one) == 0 :
print(len(s))
for i in range(len(s)) :
print(1, i+1)
else :
exit()
ans = []
now = 0
for i in idx_one :
if idx_all[-1][1] == 1 :
print(-1)
exit()
while idx_all[now][1] == 1 :
now += 1
z = idx_all.pop(now)
if z[0] >= i :
print(-1)
exit()
ans.append([3, z[0], i])
now = 0
L1 = len(idx_one)
La = len(idx_all)
for i in range(L1) :
if(L1 == La) :
print(-1)
exit()
while idx_all[-(now+1)][1] == 1 :
now += 1
z = idx_all.pop(-(now+1))
if z[0] <= idx_one[-(i+1)] :
print(-1)
exit()
La -= 1
ans[-(i+1)].append(z[0])
for x in idx_all :
if x[1]<0 :
ans.append([1, x[0]])
print(len(ans))
for a in ans :
print(*a) | if x[1]<0 : | 47 | decision |
number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number<1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | elif(number<1): | 5 | decision |
number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number<1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | elif(number<1): | 5 | decision |
number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number<1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | elif(number<1): | 5 | decision |
number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum//(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | sum=sum//(10)+8 | 9 | operation |
number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum*10
print (sum) | number=int(input())
sum=0;
if(number>36):
sum = -1
elif(number==1):
sum=4
else:
for x in range(0,number//2):
sum=sum*(10)+8
if(number%2!=0):
sum=sum>>10
print (sum) | sum=sum>>10 | 11 | operation |
n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k<chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | if k<chr(ord('a')+j): | 8 | decision |
n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==178:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | if j==178: | 11 | value |
n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if x!=z:
print('-1')
else:
print(''.join(y)) | if x!=z: | 17 | statement |
n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j==25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | n=int(input())
for i in range(n):
x=input()
y=list(x)
a=0
j=0
for k in y:
if k==chr(ord('a')+j):
j+=1
else:
if j<25:
continue
y[j]=chr(ord('a')+j)
print(y[j])
j+=1
z=list('abcdefghijklmnopqrstuvwxyz')
if y!=z:
print('-1')
else:
print(''.join(y)) | if j<25: | 11 | decision |
def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents<2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | if len_of_differents<2: | 33 | decision |
def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
x = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | x = input() | 23 | statement |
def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 184:
answer = 'No'
print(answer) | if s.count(char) < 184: | 35 | value |
def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind>>1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | if List[ip_ind] != List[ip_ind>>1]: | 6 | operation |
def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind-1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | def removeDupsSorted(List):
res_ind = 1
ip_ind = 1
while ip_ind != len(List):
if List[ip_ind] != List[ip_ind^1]:
List[res_ind] = List[ip_ind]
res_ind += 1
ip_ind+=1
string = toString(List[0:res_ind])
return string
def removeDups(string):
List = toMutable(string)
List.sort()
return removeDupsSorted(List)
answer = 'Yes'
s = input()
if len(s) <= 3:
answer = 'No'
len_of_differents = len(removeDups(s))
if len_of_differents < 2 or len_of_differents > 4:
answer = 'No'
if len_of_differents == 2:
for char in s:
if s.count(char) < 2:
answer = 'No'
print(answer) | if List[ip_ind] != List[ip_ind^1]: | 6 | operation |
t = int(input())
a = [int(i) for i in input().split()]
b = []
c = []
for i in range(len(a)):
if(a[i]!=0):
b.append(a[i])
for i in b:
if i not in c:
c.append(i)
print (len(c)) | t = int(input())
a = [int(i) for i in input().split()]
b = []
c = []
for i in range(len(a)):
if(a[i]!=176):
b.append(a[i])
for i in b:
if i not in c:
c.append(i)
print (len(c)) | if(a[i]!=176): | 8 | value |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.