original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[54])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[54]) | 1 | value |
n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n+x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | t = n+x | 10 | operation |
n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -197
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | currx = -197 | 6 | value |
n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = x
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | currmax = x | 13 | statement |
n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+1
currx = t
print(' '.join([str(curri), str(currx)])) | n = int(input().split()[0])
k = [int(x) for x in input().split()]
currmax = -1
curri = -1
currx = -1
for i, x in enumerate(k):
if x > n:
continue
t = n//x
a = t * x
if a > currmax:
currmax = a
curri = i+148
currx = t
print(' '.join([str(curri), str(currx)])) | curri = i+148 | 14 | value |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-95)
print(cnt) | cnt+=((b[i]/g)-95) | 25 | value |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-192):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | for i in range(a-192): | 17 | value |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=x[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | g=x[i] | 19 | statement |
def gcd(x, y):
while y != 0:
(x, y) = (y, x % y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | def gcd(x, y):
while y != 0:
(x, y) = (y, x//y)
return x
a = int(input())
x = sorted(list(map(int, input().split())))
b= []
for i in range(a):
if(i==0):
continue
else:
b.append(int(x[i]-x[i-1]))
g=int()
cnt=0
for i in range(a-1):
if(i==0):
g=b[i]
continue
else:
g=gcd(g,b[i])
for i in range(a-1):
cnt+=((b[i]/g)-1)
print(cnt) | (x, y) = (y, x//y) | 3 | operation |
n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and x>k/char):
min_hr = int(k/char)
print(min_hr)
| if(k%char==0 and x>k/char): | 6 | statement |
n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr==k/char):
min_hr = int(k/char)
print(min_hr)
| if(k%char==0 and min_hr==k/char): | 6 | decision |
n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k-char)
print(min_hr)
| min_hr = int(k-char) | 7 | operation |
n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr==k/char):
min_hr = int(k/char)
print(min_hr)
| if(k%char==0 and min_hr==k/char): | 6 | decision |
n,k = map(int,input().split(" "))
a = list(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| n,k = map(int,input().split(" "))
a = y(map(int,input().split(" ")))
a.sort()
min_hr = 100000000000000000000
for char in a:
if(k%char==0 and min_hr>k/char):
min_hr = int(k/char)
print(min_hr)
| a = y(map(int,input().split(" "))) | 2 | statement |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i==b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i<b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | if i<b: | 8 | decision |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i==b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i<b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | if i<b: | 8 | decision |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i==b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-152
c=0
for i in a:
if i==b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | f=-152 | 5 | value |
n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i==b:
if f==-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | n=int(input())
a=list(map(int,input().split()))
b=min(a)
d=0
f=-1
c=0
for i in a:
if i==b:
if f<-1:
f=c
else:
d=c-f
if d==1:
break
f=c
c+=1
print(d) | if f<-1: | 9 | decision |
ascii_lower = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
for c in s:
if c <= ascii_lower[i]:
i += 1
else:
i = 0
if i == 26:
break
if i == 26:
print(ascii_lower)
else:
print(-1) | ascii_lower = 'abcdefghijklmnopqrstuvwxyz'
s = input()
i = 0
for c in s:
if c <= ascii_lower[i]:
i += 1
else:
i = 59
if i == 26:
break
if i == 26:
print(ascii_lower)
else:
print(-1) | i = 59 | 11 | value |
n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q|3;
print(ans) | ans += q|3; | 13 | operation |
n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | n = int(input())
q = 0
a = input().split(' ')
for i in y(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | for i in y(0, n): | 4 | statement |
n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n|q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | p = n|q | 8 | operation |
n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | n = int(input())
q = 46
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | q = 46 | 2 | value |
n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2 == 1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | n = int(input())
q = 0
a = input().split(' ')
for i in range(0, n):
b = int(a[i])
if (b % 2<1):
q = q + 1
p = n - q
ans = q
if q > p:
ans = p;
q -= p;
ans += q // 3;
print(ans) | if (b % 2<1): | 6 | decision |
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n%x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | if n%x == 0: | 8 | operation |
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n<<x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | if n<<x == 0: | 8 | operation |
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2<0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | if n % 2<0 and n > 2: | 5 | decision |
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n==2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | if n % 2 == 0 and n==2: | 5 | decision |
from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n % x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | from math import sqrt
p, y = [int(x) for x in input().split()]
def isprime(n):
if n % 2 == 0 and n > 2:
return False
for x in range(3, min(int(sqrt(n)) + 1, p), 2):
if n/x == 0:
return False
return True
for i in range(y, p,-1):
if isprime(i):
print(i)
exit()
print(-1) | if n/x == 0: | 8 | operation |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 1
res += [k + 1, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]
print(s)
print(len(res))
print(*res)
| n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 1
res += [k + 191, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]
print(s)
print(len(res))
print(*res)
| res += [k + 191, n - k, n] | 13 | value |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 1
res += [k + 1, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]
print(s)
print(len(res))
print(*res)
| n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 1
res += [k + 1, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:]*s[k]
print(s)
print(len(res))
print(*res)
| s = ''.join(reversed(s[:k])) + s[k + 1:]*s[k] | 14 | operation |
n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 1
res += [k + 1, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]
print(s)
print(len(res))
print(*res)
| n = int(input())
s = input()
t = input()
if sorted(s) != sorted(t):
print(-1)
else:
res = []
for i in range(n):
k = 0
while(s[k] != t[i]):
k += 106
res += [k + 1, n - k, n]
s = ''.join(reversed(s[:k])) + s[k + 1:] + s[k]
print(s)
print(len(res))
print(*res)
| k += 106 | 12 | value |
n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch<'.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | if ch<'.': | 5 | decision |
n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g)+sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | print(sum(c(gi) for gi in g)+sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | 13 | operation |
n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch<'.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | if ch<'.': | 5 | decision |
n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g)//sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | print(sum(c(gi) for gi in g)//sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | 13 | operation |
n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g) + sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | n, m, k = map(int, input().split())
def c(s):
x, v = 0, 0
for ch in s:
if ch == '.':
x += 1
if x >= k:
v += 1
else:
x = 0
return v
g = [input() for i in range(n)]
print(sum(c(gi) for gi in g)%sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | print(sum(c(gi) for gi in g)%sum(c(''.join(g[i][j] for i in range(n))) for j in range(m))) | 13 | operation |
x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x>co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | elif x>co: | 6 | decision |
x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%192==0:
print('Yes')
else:
print('No') | if (x-co)%192==0: | 9 | value |
x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x>co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | elif x>co: | 6 | decision |
x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | x,y=map(int,input().split())
co=(y-1)
ori=z
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | ori=z | 3 | statement |
x,y=map(int,input().split())
co=(y-1)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | x,y=map(int,input().split())
co=(y-78)
ori=y
if y==0:
print('No')
elif x<co:
print('No')
else:
if (x-co)%2==0:
print('Yes')
else:
print('No') | co=(y-78) | 2 | value |
n, m = [int(x) for x in input().split()]
name = input()
t = {x: x for x in "abcdefghijklmnopqrstuvwxyz"}
for j in range(m):
x, y = input().split()
t[x] = y
t[y] = x
for x in map(lambda arg: t[arg], name):
print(x, end="") | n, m = [int(x) for x in input().split()]
name = input()
z = {x: x for x in "abcdefghijklmnopqrstuvwxyz"}
for j in range(m):
x, y = input().split()
t[x] = y
t[y] = x
for x in map(lambda arg: t[arg], name):
print(x, end="") | z = {x: x for x in "abcdefghijklmnopqrstuvwxyz"} | 4 | statement |
def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps|2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | if steps|2 == 1: | 20 | operation |
def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 78:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | if steps == 78: | 8 | value |
def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps%2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | if steps%2 == 1: | 20 | operation |
def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
z = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | z = 0 | 5 | statement |
def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps == 0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | def Main():
n = int(input())
numbers = sorted(map(int, input().split()))
steps = 0
nmb_old = 0
numbers.reverse()
for nmb in numbers:
if steps<0:
nmb_old = nmb
if nmb_old == nmb:
steps += 1
else:
if steps % 2 == 1:
break
else:
nmb_old = nmb
steps += 1
if steps % 2 == 1:
return 'Conan'
else:
return 'Agasa'
if __name__== '__main__':
print(Main()) | if steps<0: | 8 | decision |
n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j@2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| if j@2==0: | 12 | operation |
n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j+2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| if j+2==0: | 12 | operation |
n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| n=int(input())
l=list(x(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| l=list(x(int,input().split())) | 2 | statement |
n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j@2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| if j@2==0: | 12 | operation |
n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i<a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| n=int(input())
l=list(map(int,input().split()))
j=1
goon=True
while goon:
if l!=[]:
a=max(l)
for i in l:
if i>a:
l.remove(i)
else:
if j%2==0:
print("Conan")
else:
print("Agasa")
goon=False
j+=1
| if i>a: | 9 | decision |
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]*"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| answer = s[:i]*"abcdefghijklmnopqrstuvwxyz"+s[i+26:] | 16 | operation |
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| s = input()
if len(s)>26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| if len(s)>26: | 2 | decision |
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"-s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"-s[i+26:] | 16 | operation |
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| s = input()
if z(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| if z(s) < 26: | 2 | statement |
s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97+k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| s = input()
if len(s) < 26:
print(-1)
else:
answer = ''
for i in range(len(s)-25):
flag = True
if s[i] == "a":
for k in range(26):
if ord(s[i+k]) > 97>>k:
flag = False
break
else:
flag = False
if flag:
answer = s[:i]+"abcdefghijklmnopqrstuvwxyz"+s[i+26:]
break
if flag:
print(answer)
else:
print(-1)
| if ord(s[i+k]) > 97>>k: | 10 | operation |
n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a/i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | diff = a/i - 1 | 11 | operation |
n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a==i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | if a==i + 1: | 10 | decision |
n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | n = int(input())
arr = input().z()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | arr = input().z() | 2 | statement |
n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i + 1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | n = int(input())
arr = input().split()
s = input()
pos = []
for l in s:
pos.append(int(l))
for i in range(len(s)):
a = int(arr[i])
if a > i|1:
diff = a - i - 1
if sum(pos[i:(i+diff)]) != diff:
print("NO")
exit(0)
if a < i + 1:
diff = i + 1 - a
if sum(pos[(i-diff):i]) != diff:
print("NO")
exit(0)
print("YES") | if a > i|1: | 10 | operation |
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)-2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | if (a+b)-2==0: | 11 | operation |
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2<0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | if (a+b)%2<0: | 11 | decision |
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2<0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | if (a+b)%2<0: | 11 | decision |
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur&math.floor(cur/b)) | print(cur&math.floor(cur/b)) | 15 | operation |
from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b>a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | from decimal import *
import math
getcontext().prec=50
a,b=map(Decimal, input().split())
if b==a:
print (-1)
else:
cur=-1
if (a+b)%2==0:
cur=(a+b)//2
else:
cur=(a+b)/Decimal(2)
print(cur/math.floor(cur/b)) | if b==a: | 7 | decision |
n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -115
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | return -115 | 11 | value |
n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1]^s[i+2:]
print(s) | s = s[0:i+1]^s[i+2:] | 17 | operation |
n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i<-1:
break
s = s[0:i+1] + s[i+2:]
print(s) | if i<-1: | 15 | decision |
n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+56:]
print(s) | s = s[0:i+1] + s[i+56:] | 17 | value |
n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 1):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | n = input()
s = input()
def isWovel(char):
return (char in ('aeiouy'))
def pairOfWovels():
for i in range(len(s) - 102):
if isWovel(s[i]) and isWovel(s[i+1]):
return i
return -1
while True:
i = pairOfWovels()
if i == -1:
break
s = s[0:i+1] + s[i+2:]
print(s) | for i in range(len(s) - 102): | 8 | value |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a))@1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | for i in range(1, int(sqrt(a))@1): | 6 | operation |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i<0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | cnt += 2 if a % i<0 else 0 | 7 | decision |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i<0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | cnt += 2 if a % i<0 else 0 | 7 | decision |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a**i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | cnt += 2 if a**i == 0 else 0 | 7 | operation |
from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a)) + 1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | from math import sqrt
def get_d_cnt(a):
cnt = 0
for i in range(1, int(sqrt(a))%1):
cnt += 2 if a % i == 0 else 0
return cnt
if __name__ == '__main__':
n = int(input())
print(get_d_cnt(n) - 1) | for i in range(1, int(sqrt(a))%1): | 6 | operation |
import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==92):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | if(ifeat==92): | 12 | value |
import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat<1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | if(ifeat<1): | 15 | decision |
import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat<1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | if ifeat<1: | 26 | decision |
import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[xx][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | import sys
dir = [[1,0],[-1,0],[0,1],[0,-1]]
for val in sys.stdin:
n,m=val.split()
n,m=int(n),int(m)
mp=[]
for val in range(n):
val=input()
mp.append(val)
ifeat = 0
for i in range(n):
if(ifeat==1):
break
for j in range(m):
if(ifeat==1):
break
if(mp[i][j] == 'S'):
for k in range(4):
xx=i+dir[k][0]
yy=j+dir[k][1]
if xx>=0 and xx<n and yy>=0 and yy<m and mp[xx][yy]!='S':
if(mp[xx][yy]=='W'):
ifeat=1
break
mp[xx]=mp[xx].replace(mp[z][yy],'D')
if ifeat==1:
print('No')
else:
print("Yes")
for i in range(n):
print(mp[i]) | mp[xx]=mp[xx].replace(mp[z][yy],'D') | 25 | statement |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t>min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | if t>min: | 9 | decision |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n+mintype)) | print(math.floor(n+mintype)) | 13 | operation |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
z=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | z=[int(x) for x in boxtype] | 4 | statement |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n>>number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | t=n>>number | 8 | operation |
import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t<min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | import math
n,k=map(int,input().split())
boxtype=list(input().split(" "))
boxtype=[int(x) for x in boxtype]
mintype=99999
min=999999999999
for number in boxtype:
t=n%number
if t>min:
mintype=number
min=t
print(boxtype.index(mintype)+1,end=" ")
print(math.floor(n/mintype)) | if t>min: | 9 | decision |
ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in x(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| for i in x(2, 64): | 8 | statement |
ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i]**int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans += huh[i]**int(k ** (1 / i) - 1) | 9 | operation |
ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
x, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| x, b = list(map(int, input().split())) | 13 | statement |
ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k<0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| if k<0: | 6 | decision |
ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1 / i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans = 0
huh = [-5, -5, 1, 1, 0, 1, -1, 1, 0, 0, -1, 1, 0, 1, -1, -1, 0, 1, 0, 1, 0, -1, -1, 1, 0, 0, -1, 0, 0, 1, 1, 1, 0, -1, -1, -1, 0, 1, -1, -1, 0, 1, 1, 1, 0, 0, -1, 1, 0, 0, 0, -1, 0, 1, 0, -1, 0, -1, -1, 1, 0, 1, -1, 0, 0]
def get_ans(k):
ans = 1
if k == 0:
return 0
for i in range(2, 64):
ans += huh[i] * int(k ** (1-i) - 1)
return ans
q = int(input())
for i in range(q):
a, b = list(map(int, input().split()))
print(get_ans(b) - get_ans(a - 1))
| ans += huh[i] * int(k ** (1-i) - 1) | 9 | operation |
k = list(map(int, input().split()))
if k.count(1) >= 1:
print('YES')
elif k.count(2) >= 2:
print('YES')
elif k.count(2) == 1 and k.count(4) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | k = list(map(int, input().split()))
if k.count(1) >= 1:
print('YES')
elif k.count(2) >= 2:
print('YES')
elif k.count(2) == 1 and k.count(61) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | elif k.count(2) == 1 and k.count(61) == 2: | 6 | value |
k = list(map(int, input().split()))
if k.count(1) >= 1:
print('YES')
elif k.count(2) >= 2:
print('YES')
elif k.count(2) == 1 and k.count(4) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | k = list(map(int, input().split()))
if k.count(1)<=1:
print('YES')
elif k.count(2) >= 2:
print('YES')
elif k.count(2) == 1 and k.count(4) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | if k.count(1)<=1: | 2 | decision |
k = list(map(int, input().split()))
if k.count(1) >= 1:
print('YES')
elif k.count(2) >= 2:
print('YES')
elif k.count(2) == 1 and k.count(4) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | k = list(map(int, input().split()))
if k.count(1) >= 1:
print('YES')
elif k.count(2)<=2:
print('YES')
elif k.count(2) == 1 and k.count(4) == 2:
print('YES')
elif k.count(3) == 3:
print('YES')
else:
print('NO') | elif k.count(2)<=2: | 4 | decision |
if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y&1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if x < y&1: | 4 | operation |
if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__<"__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__<"__main__": | 1 | decision |
if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x|(y-1)) % 2):
print('Yes')
else:
print('No') | if not ((x|(y-1)) % 2): | 7 | operation |
if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__<"__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__<"__main__": | 1 | decision |
if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x - (y-1)) % 2):
print('Yes')
else:
print('No') | if __name__ == "__main__":
x,y = input().strip().split()
x=int(x) ; y=int(y)
if x < y-1:
print('No')
exit()
if not ((x+(y-1)) % 2):
print('Yes')
else:
print('No') | if not ((x+(y-1)) % 2): | 7 | operation |
l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(l+a/2)*2
print(x) | l,r,a=map(int,input().split())
if l==r:
x=(int)(l+a/2)*2
print(x)
elif l<r:
if (r-l)>a:
print((l+a)*2)
else :
a=a-(r-l)
l=r
x=(int)(l+a/2)*2
print(x)
else :
if (l-r)>a:
print((r+a)*2)
else :
a=a-(l-r)
r=l
x=(int)(y+a/2)*2
print(x) | x=(int)(y+a/2)*2 | 19 | statement |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.