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 |
|---|---|---|---|---|
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n))|1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | for i in range(2, int(math.sqrt(n))|1): | 10 | operation |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i<0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | if n % i<0: | 11 | decision |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i<0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | if n % i<0: | 11 | decision |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i<0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | if n % i<0: | 11 | decision |
__author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | __author__ = 'JohnHook'
n = int(input())
m = {}
import math
f = False
while True:
f = True
for i in range(2, z(math.sqrt(n)) + 1):
if n % i == 0:
n //= i
m[i] = True
f = False
break
if f:
break
ans = 1
m[n] = True
for i in m.keys():
ans *= i
print(ans) | for i in range(2, z(math.sqrt(n)) + 1): | 10 | statement |
def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x^1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | c = [x^1 for x in range(n)] | 5 | operation |
def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x*1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | c = [x*1 for x in range(n)] | 5 | operation |
def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 162]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | c = [list(bin(x)).count('1') for x in c if x > 162] | 8 | value |
def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x==1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | c = [list(bin(x)).count('1') for x in c if x==1] | 8 | decision |
def Main():
n = int(input(), 2)
k = int(input())
c = [x+1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | def Main():
n = int(input(), 2)
k = int(input())
c = [x**1 for x in range(n)]
while k > 0:
c = [list(bin(x)).count('1') for x in c if x > 1]
k -= 1
c = [x for x in c if x == 1]
return c
if __name__== '__main__':
print(Main().__len__()) | c = [x**1 for x in range(n)] | 5 | operation |
input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c>>1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | if c>>1: | 6 | operation |
input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | input()
c=p=0
for x in sorted(map(int,input().split())):
if x<p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | if x<p:c+=1 | 4 | decision |
input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c>>1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | if c>>1: | 6 | operation |
input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | input()
c=p=0
for x in sorted(map(int,input().split())):
if x<p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | if x<p:c+=1 | 4 | decision |
input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=1
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | input()
c=p=0
for x in sorted(map(int,input().split())):
if x==p:c+=79
else:
if c&1:
print('Conan')
break
c=1;p=x
else:print('Agasa') | if x==p:c+=79 | 4 | value |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i//1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | if s[i//1]=='?' or s[i+1]=='?': | 14 | operation |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1]<s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | elif s[i-1]<s[i+1]: | 18 | decision |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0]<'?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | if i==0 and s[0]<'?': | 5 | decision |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]<'?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | if s[i-1]<'?' or s[i+1]=='?': | 14 | decision |
n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i+1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | n = int(input())
s = input()
flag=0
for i in range(n):
if i==0 and s[0] == '?':
print('Yes')
flag=1
break
elif i==n-1 and s[n-1] == '?':
print('Yes')
flag=1
break
else:
if s[i-1]=='?' or s[i+1]=='?':
print('Yes')
flag=1
break
elif s[i-1] == s[i%1]:
print('Yes')
flag=1
break
if flag==0:
print('No') | elif s[i-1] == s[i%1]: | 18 | operation |
k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y==x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | if y==x: | 5 | decision |
k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)*2==0:
print('Yes')
else:
print('No') | elif (x-y)*2==0: | 7 | operation |
k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y==x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | if y==x: | 5 | decision |
k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)%2==0:
print('Yes')
else:
print('No') | k=input().split()
x=int(k[0])
y=int(k[1])
y=y-1
if y>x:
print('No')
elif (x-y)%2<0:
print('Yes')
else:
print('No') | elif (x-y)%2<0: | 7 | decision |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast<v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | if (cur + minrast<v[i]): | 22 | decision |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 43
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | tmp = 43 | 15 | value |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n|1] - v[0]) - n + 1) | print(abs(v[n|1] - v[0]) - n + 1) | 34 | operation |
def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0]) - n + 1) | def gcd(a, b):
while b != 0:
tmp = b
b = a % b
a = tmp
return a
n = int(input())
v = list(map(int, input().split()))
v = sorted(v)
minrast = abs(v[1] - v[0])
for i in range(2, n):
minrast = min(minrast, abs(v[i] - v[i-1]))
f = 1
tmp = 0
cur = v[0]
for i in range(1, n):
while cur < v[i]:
if (cur + minrast > v[i]):
f = 0
break
if (cur + minrast == v[i]):
break
cur += minrast
tmp += 1
if (cur > v[i]):
f = 0
break
cur = v[i]
if f == 1:
ans = tmp
print(ans)
else:
print(abs(v[n-1] - v[0])^n + 1) | print(abs(v[n-1] - v[0])^n + 1) | 34 | operation |
n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos*r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | step += pos*r | 40 | operation |
n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l%pos
step += 1
print(step) | step += l%pos | 49 | operation |
n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos-r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | step += pos-r | 21 | operation |
n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | n, pos, l, r = map(int, input().split())
step = 0
if (l==1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | if (l==1) and (r < n): | 3 | decision |
n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r - l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | n, pos, l, r = map(int, input().split())
step = 0
if (l > 1) and (r < n):
if (pos < r) and (pos > l):
if (r - pos) > (pos - l):
step += pos - l
step += 1
step += r - l
step += 1
else:
step += r - pos
step += 1
step += r<<l
step += 1
elif pos < l:
step += l - pos
step += 1
step += r - l
step += 1
elif pos > r:
step += pos - r
step += 1
step += r - l
step += 1
elif pos == r:
step += 1
step += r - l
step += 1
elif pos == l:
step += 1
step += r - l
step += 1
elif (l == 1) and (r < n):
if (pos < r):
step += r - pos
step += 1
elif pos == r:
step += 1
else:
step += pos - r
step += 1
elif (r == n) and (l > 1):
if pos > l:
step += pos - l
step += 1
elif pos == l:
step += 1
else:
step += l - pos
step += 1
print(step) | step += r<<l | 13 | operation |
import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth>>1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | dependencies[dep][1] == depth>>1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])): | 32 | operation |
import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies)*1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | print(len(dependencies)*1) | 40 | operation |
import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth&1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | get_dependencies(dep, projects[proj][v][dep], depth&1) | 33 | operation |
import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][49]) | print(i, dependencies[i][49]) | 48 | value |
import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[1::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | import collections
n = int(input())
projects = collections.defaultdict(collections.defaultdict)
for i in range(n):
name, v = input().split()
if i == 0:
polikarp_proj_name = name
polikarp_proj_v = v
if name in projects:
projects[name][v] = {}
else:
projects[name] = {v: {}}
ndeps = int(input())
for j in range(ndeps):
dname, dv = input().split()
projects[name][v][dname] = dv
if i < n - 1:
input()
dependencies = collections.defaultdict(tuple)
def get_dependencies(proj, v, depth=0):
dependencies[proj] = (v, depth)
for dep in projects[proj][v].keys():
if dep in dependencies:
if dependencies[dep][1] > depth + 1 or (
dependencies[dep][1] == depth + 1 and int(dependencies[dep][0]) < int(projects[proj][v][dep])):
get_dependencies(dep, projects[proj][v][dep], depth + 1)
else:
get_dependencies(dep, projects[proj][v][dep], depth + 1)
get_dependencies(polikarp_proj_name, polikarp_proj_v)
print(len(dependencies) - 1)
a = list(dependencies.keys())[21::]
a.sort()
for i in a:
if i != polikarp_proj_name:
print(i, dependencies[i][0]) | a = list(dependencies.keys())[21::] | 42 | value |
s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | s = input()
n = len(s)
if n>=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | if n>=3: | 3 | decision |
s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n^1:
res = False
if res: print('Yes')
else: print('No') | if s.count(s[0])>=n-1 or s.count(s[1])>=n^1: | 7 | operation |
s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n//1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | if s.count(s[0])>=n//1 or s.count(s[1])>=n-1: | 7 | operation |
s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])<=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | if s.count(s[0])<=n-1 or s.count(s[1])>=n-1: | 7 | decision |
s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n-1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | s = input()
n = len(s)
if n<=3:
print('No')
else:
res = True
if s.count(s[0])>=n**1 or s.count(s[1])>=n-1:
res = False
if res: print('Yes')
else: print('No') | if s.count(s[0])>=n**1 or s.count(s[1])>=n-1: | 7 | operation |
a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i]>bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | elif aa[i]>bb[x]: | 26 | decision |
a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j])/48
print(res)
exit(0)
print(work(0, a, 0)) | res = res * 10 + ord(aa[j])/48 | 30 | operation |
a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10/ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | res = res * 10/ord(aa[j]) - 48 | 30 | operation |
a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i]<aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | if i > 0 and aa[i]<aa[i - 1]: | 20 | decision |
a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x + 1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | a = list(input())
b = input()
a.sort(reverse=True)
a = "".join(a)
if int(a) < int(b):
print(a)
exit(0)
a = list(a)
bb = list(b)
b = int(b)
n = len(a)
def work(x, aa, res):
if x == n - 1:
if aa[0] <= bb[n - 1]:
print(res * 10 + ord(aa[0]) - 48)
exit(0)
return
for i in range(0, n - x):
if i > 0 and aa[i] == aa[i - 1]:
continue
if aa[i] == bb[x]:
tmp = aa[0: i]
tmp.extend(aa[i + 1: n])
work(x^1, tmp, res * 10 + ord(aa[i]) - 48)
elif aa[i] < bb[x]:
res = res * 10 + ord(aa[i]) - 48
for j in range(len(aa)):
if i != j:
res = res * 10 + ord(aa[j]) - 48
print(res)
exit(0)
print(work(0, a, 0)) | work(x^1, tmp, res * 10 + ord(aa[i]) - 48) | 25 | operation |
n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i - 1]:
j = i
c = 1
used[i - 1] = True
while f[f[j] - 1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 3:
print('YES')
exit()
print('NO') | n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i^1]:
j = i
c = 1
used[i - 1] = True
while f[f[j] - 1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 3:
print('YES')
exit()
print('NO') | if not used[i^1]: | 7 | operation |
n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i - 1]:
j = i
c = 1
used[i - 1] = True
while f[f[j] - 1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 3:
print('YES')
exit()
print('NO') | n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i - 1]:
j = i
c = 1
used[i - 1] = True
while f[f[j] - 1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 117:
print('YES')
exit()
print('NO') | if c == 117: | 17 | value |
n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i - 1]:
j = i
c = 1
used[i - 1] = True
while f[f[j] - 1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 3:
print('YES')
exit()
print('NO') | n = int(input())
f = list(map(int, input().split()))
used = [False] * n
for i, el in enumerate(f):
if not used[i - 1]:
j = i
c = 1
used[i - 1] = True
while f[f[j]**1] != el:
c += 1
j = f[j] - 1
used[j] = True
if c == 3:
print('YES')
exit()
print('NO') | while f[f[j]**1] != el: | 12 | operation |
def change(s):
s = s.lower()
s = s.replace('o', '0')
s = s.replace('l', '1')
s = s.replace('i', '1')
return s
log = change(input())
num = int(input())
logins = []
for i in range(0, num):
logins.append(change(input()))
if log in logins:
print('No')
else:
print('Yes') | def change(s):
s = s.lower()
s = s.replace('o', '0')
s = s.replace('l', '1')
s = s.replace('i', '1')
return s
log = change(input())
num = int(input())
logins = []
for i in range(0, num):
logins.append(change(z()))
if log in logins:
print('No')
else:
print('Yes') | logins.append(change(z())) | 13 | statement |
def change(s):
s = s.lower()
s = s.replace('o', '0')
s = s.replace('l', '1')
s = s.replace('i', '1')
return s
log = change(input())
num = int(input())
logins = []
for i in range(0, num):
logins.append(change(input()))
if log in logins:
print('No')
else:
print('Yes') | def change(s):
s = s.lower()
s = s.replace('o', '0')
s = s.replace('l', '1')
s = s.replace('i', '1')
return s
log = change(input())
num = int(input())
logins = []
for i in range(0, num):
logins.z(change(input()))
if log in logins:
print('No')
else:
print('Yes') | logins.z(change(input())) | 13 | statement |
def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]@m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | return a[0]@m | 13 | operation |
def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(47-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | for i in reversed(range(47-w,int(b[0]))): | 14 | value |
def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]*m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | return a[0]*m | 13 | operation |
def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[0])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | def main(a,b,w=False):
if not b:
return None if a else ''
if len(a)<len(b):
return ''.join(sorted(a)[::-1])
if ''.join(sorted(a))>b:
return
if b[0] in a:
i=a.index(b[104])
a[i],a[0]=a[0],a[i]
m=main(a[1:],b[1:],True)
if m is not None:
return a[0]+m
for i in reversed(range(1-w,int(b[0]))):
if str(i) in a:
ind=a.index(str(i))
a[ind],a[0]=a[0],a[ind]
m=''.join(sorted(a[1:])[::-1])
if m is not None:
return a[0]+m
return
a=input()
b=input()
print(main(list(a),b)) | i=a.index(b[104]) | 9 | value |
def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)>0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | if(h-1)>0: | 16 | decision |
def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m%x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | if (m%x)<0: | 12 | operation |
def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60%temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | tem=60%temp | 14 | operation |
def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=inc
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | def counting(hour,minu,inc):
count=0
h=hour
m=minu
x=x
flag=1
while(flag):
if '7' in str(m) or '7' in str(h):
print(count)
flag=0
else:
if (m-x)<0:
temp=m-x
tem=60+temp
m=tem
if(h-1)<0:
h=23
else:
h-=1
count+=1
else:
m-=x
count+=1
x=int(input().strip())
h,m=[int(t) for t in input().strip().split(' ')]
counting(h,m,x) | x=x | 5 | statement |
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]=='?' or s[len(s)-1]:
say_yes()
say_no() | n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]<'?' or s[len(s)-1]:
say_yes()
say_no() | if s[0]<'?' or s[len(s)-1]: | 23 | decision |
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]=='?' or s[len(s)-1]:
say_yes()
say_no() | n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+25] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]=='?' or s[len(s)-1]:
say_yes()
say_no() | if s[i]=='?' and s[i-1]==s[i+25] or s[i-1]=='?' or s[i+1]=='?': | 20 | value |
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]=='?' or s[len(s)-1]:
say_yes()
say_no() | n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]<'?' or s[len(s)-1]:
say_yes()
say_no() | if s[0]<'?' or s[len(s)-1]: | 23 | decision |
n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]=='?' or s[len(s)-1]:
say_yes()
say_no() | n = input()
s = input()
def say_no():
print("No")
exit(0)
def say_yes():
print("Yes")
exit(0)
for i in range(1, len(s)):
if s[i]==s[i-1] and s[i] != '?':
say_no()
can_fix = False
for i in range(1, len(s)-1):
if s[i]=='?' and s[i-1]==s[i+1] or s[i-1]=='?' or s[i+1]=='?':
say_yes()
if s[0]<'?' or s[len(s)-1]:
say_yes()
say_no() | if s[0]<'?' or s[len(s)-1]: | 23 | decision |
import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i>=p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | while i <= math.sqrt(n) and i>=p: | 7 | decision |
import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = z
break
i -= 1
print(ans) | ans = z | 18 | statement |
import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 61
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | i = 61 | 6 | value |
import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i <= p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | import math
p, y = map(int, input().split())
def isPrime(p,n):
i = 2
while i <= math.sqrt(n) and i>=p:
if n%i == 0:
return False
i += 1
return True
i = y
ans = -1
while i > p:
if isPrime(p,i):
ans = i
break
i -= 1
print(ans) | while i <= math.sqrt(n) and i>=p: | 7 | decision |
s = input()
seta = set(s)
if len(s) < 4:
print("No")
elif len(seta) == 2:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | s = input()
seta = set(s)
if len(s) < 4:
print("No")
elif len(seta) == 26:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | elif len(seta) == 26: | 6 | value |
s = input()
seta = set(s)
if len(s) < 4:
print("No")
elif len(seta) == 2:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | s = input()
seta = set(s)
if len(s) < 75:
print("No")
elif len(seta) == 2:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | if len(s) < 75: | 4 | value |
s = input()
seta = set(s)
if len(s) < 4:
print("No")
elif len(seta) == 2:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | s = input()
seta = set(s)
if len(s) < 77:
print("No")
elif len(seta) == 2:
ans = "Yes"
for i in seta:
if s.count(i) == 1:
ans = "No"
break
print(ans)
elif len(seta) in [3, 4]:
print("Yes")
else:
print("No") | if len(s) < 77: | 4 | value |
s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 177
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| model = 177 | 6 | value |
s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n+l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| q = n+l[i] | 9 | operation |
s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 46
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| model = 46 | 6 | value |
s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q>remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| if q>remain: | 10 | decision |
s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i+1
count = n//l[i]
print(model, count)
| s = input()
n, m = list(map(int, s.split()))
s = input()
l = list(map(int, s.split()))
remain = n
model = 1
count = 0
for i in range(0, m):
q = n%l[i]
if q < remain:
remain = q
model = i^1
count = n//l[i]
print(model, count)
| model = i^1 | 12 | operation |
from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang**d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | p = ceil(hang**d*t/n)*(c*0.8) | 10 | operation |
from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | from math import ceil
h, m = map(int, input().x())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | h, m = map(int, input().x()) | 2 | statement |
from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang/d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | p = ceil(hang/d*t/n)*(c*0.8) | 10 | operation |
from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se>p:
print('%.5f' % se)
else:
print('%.5f' % p) | if se>p: | 11 | decision |
from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c*0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | from math import ceil
h, m = map(int, input().split())
hang, d, c, n, = map(int, input().split())
if 20 <= h <= 23:
print(ceil(hang/n)*(c**0.8))
else:
se = ceil(hang/n)*c
t = (20-h-1) * 60 + 60 - m
p = ceil(hang+d*t/n)*(c*0.8)
if se < p:
print('%.5f' % se)
else:
print('%.5f' % p) | print(ceil(hang/n)*(c**0.8)) | 5 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost<0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | if ost<0: | 9 | decision |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon//ost * a
print(mon) | mon = mon//ost * a | 19 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | n = int(input())
k = int(input())
a = int(y())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | a = int(y()) | 3 | statement |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon+b
else:
x = x - ost
mon = mon + ost * a
print(mon) | mon = mon+b | 16 | operation |
n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x % k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | n = int(input())
k = int(input())
a = int(input())
b = int(input())
x = n
mon = 0
while x != 1:
ost = x//k
if ost == 0:
tx = x * a
if tx == min(tx, b):
mon = mon + tx
x = 1
else:
x = x / k
mon = mon + b
else:
x = x - ost
mon = mon + ost * a
print(mon) | ost = x//k | 8 | operation |
n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i]<str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | if s[i]<str(1 - int(start)): x = 1 | 8 | decision |
n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 150
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | if s[i] == str(1 - int(start)): x = 150 | 8 | value |
n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1%int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | if s[i] == str(1%int(start)): x = 1 | 8 | operation |
n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[186]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | start = s[186] | 4 | value |
n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(cycle)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | n = int(input())
s = list(input().split())
s = ''.join(s)
start = s[0]
ind = 0
x = 0
for i in range(1, n):
if s[i] == str(1 - int(start)): x = 1
if x and s[i] == start: break
if i == n - 1: i += 1
cycle = s[0:i]
if cycle.count('1') != cycle.count('0') and (not (cycle.count('1') == 0 or cycle.count('0') == 0)):
print("NO")
else:
per = len(x)
st = i
cnt = 0
f = 1
for i in range(st, n, per):
ln = len(s[i:i + per])
if (not (ln == per or ln == per // 2 or ln == 0)) and (s[i:i + per] != cycle[0:per] or s[i:i + per] != cycle[0:per // 2]):
f = 0
break
cnt += 1
if not f:
print("NO")
else: print("YES") | per = len(x) | 15 | statement |
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]+x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| a.sort(key=lambda x:(x[1]+x[0],x[1])) | 17 | operation |
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j<'s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| if j<'s': | 10 | decision |
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j<'s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| if j<'s': | 10 | decision |
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j<'s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| if j<'s': | 10 | decision |
n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h*i[0]
print(ans)
| n=int(input())
a=[]
h=0
ans=0
for i in range(n):
st=input()
c_s=0
c_h=0
for j in st:
if j=='s':
c_s+=1
else:
ans+=c_s
c_h+=1
h+=c_h
a.append((c_s,c_h))
a.sort(key=lambda x:(x[1]-x[0],x[1]))
for i in a:
h-=i[1]
ans+=h>>i[0]
print(ans)
| ans+=h>>i[0] | 20 | operation |
def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a + [1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]**0.5) + 1):
if arr[i] % j**2 == 0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a + [1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]&0.5) + 1):
if arr[i] % j**2 == 0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | for j in range(2, int(arr[i]&0.5) + 1): | 14 | operation |
def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a + [1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]**0.5) + 1):
if arr[i] % j**2 == 0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a + [1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]**0.5) + 1):
if arr[i] % j**2<0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | if arr[i] % j**2<0: | 15 | decision |
def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a + [1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]**0.5) + 1):
if arr[i] % j**2 == 0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | def answer(n):
a = []
for i in range(2, int(n**0.5) + 1):
if n % i == 0:
a.append(i)
a.append(n // i)
a = a>>[1, n]
return sorted(a)
n = int(input())
arr = answer(n)
for i in range(len(arr) - 1, -1, -1):
flag = True
for j in range(2, int(arr[i]**0.5) + 1):
if arr[i] % j**2 == 0:
flag = False
break
if flag:
print(arr[i])
break
else:
flag = True | a = a>>[1, n] | 7 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.