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 |
|---|---|---|---|---|
rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x<0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | elif x<0: | 15 | decision |
rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x==y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | if x==y: | 25 | decision |
rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y == 0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | rd = lambda: map(int, input().split())
M = 1000000007
inv = lambda x: (M - M // x) * inv(M % x) % M if x - 1 else 1
n, m = rd()
a = list(rd())
b = list(rd())
i = 0
p, q, r = 0, 1, 1
while i < n:
x, y = a[i], b[i]
if x == 0 and y<0:
p = (p * m * m + r * ((m - 1) * m >> 1)) % M
q = q * m * m % M
r = r * m % M
elif x == 0:
p = (p * m + r * (m - y)) % M
q = q * m % M
elif y == 0:
p = (p * m + r * (x - 1)) % M
q = q * m % M
else:
if x == y:
pass
else:
if x > y:
p = (p + r) % M
break
i += 1
print(p * inv(q) % M) | if x == 0 and y<0: | 11 | decision |
y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y|(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y=y|(ay*2) | 9 | operation |
y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b>0):
br=br-b
print(br) | if(b>0): | 15 | decision |
y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(y)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | ab=int(y) | 7 | statement |
y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay**2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y=y-(ay**2) | 9 | operation |
y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br-b
print(br) | y,b=input().split(' ')
ay,ag,ab=input().split(' ')
y=int(y)
b=int(b)
ay=int(ay)
ag=int(ag)
ab=int(ab)
b=b-(ab*3)
y=y-(ay*2)
b=b-ag
y=y-ag
br=0
if(y<0):
br=br-y
if(b<0):
br=br&b
print(br) | br=br&b | 16 | operation |
n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 6] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | r2 = prizes[middle - 6] - 1 | 16 | value |
n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1==r2 else r2) | print(r1 if r1==r2 else r2) | 20 | decision |
n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle**1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | r1 = 1000000 - prizes[middle**1] | 11 | operation |
n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(r1 if r1 > r2 else r2) | n = int(input())
prizes = list(map(int, input().split()))
if 500000 not in prizes:
prizes.append(500000)
prizes.sort()
middle = prizes.index(500000)
try:
r1 = 1000000 - prizes[middle + 1]
except:
r1 = 0
try:
r2 = prizes[middle - 1] - 1
except:
r2 = 0
print(x if r1 > r2 else r2) | print(x if r1 > r2 else r2) | 20 | statement |
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+59] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | if not(ch[i-1] in ['C','Y'])and (not(ch[i+59] in ['c','Y'])): | 9 | value |
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i*1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | if not(ch[i*1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])): | 11 | operation |
n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i+1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | n=int(input())
ch=input()
nb=0
for i in range(1,len(ch)):
if ch[i]=='?':
if not(ch[i-1] in ['C','M'])and (not(ch[i+1] in ['c','M'])):
nb+=1
if not(ch[i-1] in ['C','Y'])and (not(ch[i+1] in ['c','Y'])):
nb+=1
if not(ch[i-1] in ['Y','M'])and (not(ch[i>>1] in ['Y','M'])):
nb+=1
if nb>=2:
print('YES')
else:
print('NO') | if not(ch[i-1] in ['Y','M'])and (not(ch[i>>1] in ['Y','M'])): | 11 | operation |
n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low+1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1+arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag == 0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low+1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1-arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag == 0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | if query[low-1] == query[low-1-arr[low]]: | 16 | operation |
n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low+1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1+arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag == 0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low@1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1+arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag == 0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | itr = low@1 | 10 | operation |
n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low+1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1+arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag == 0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | n = int(input())
query = list(input())
arr = [0 for i in range(n)]
ans=[]
low = 0
high = len(query)
while low!=high:
flag = 0
if query[low]=="?":
itr = low+1
arr[low] = 1
if low != 0 and low != len(query) - 1:
while query[itr] == "?":
arr[low] += 1
itr += 1
if query[low-1] == query[low-1+arr[low]]:
if arr[low]%2 != 0 and arr[low] > 3:
ans.append("no")
break
low = itr
flag = 1
else:
if low!=len(query)-1:
if query[low]==query[low+1]:
ans.append("no")
break
if flag<0:
low += 1
if "no" in ans:
print("No")
else:
print("Yes") | if flag<0: | 27 | decision |
import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1] == s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1] == s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i-2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1]<s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1] == s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i-2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | if s[i-1]<s[i] and s[i] != '?': | 17 | decision |
import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1] == s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1] == s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i-2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1] == s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1]<s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i-2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | if s[i+1]<s[i-1]: | 22 | decision |
import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1] == s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1] == s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i-2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | import sys
import os
import math
import re
n = int(input())
s = input()
if s.count('?') < 1:
print('No')
exit(0)
if (s[0] == '?' or s[len(s)-1] == '?'):
print('Yes')
exit(0)
else:
for i in range(1,len(s)):
if s[i-1] == s[i] and s[i] != '?':
print('No')
exit(0)
if s[i] == '?' and s[i-1] != '?':
if i +1 < len(s):
if s[i+1] == s[i-1]:
print('Yes')
exit(0)
if s[i] == '?' and s[i-1] == '?':
if (i+1 == len(s)):
print('Yes')
exit(0)
if (s[i|2] == s[i + 1]):
print('Yes')
exit(0)
print('No') | if (s[i|2] == s[i + 1]): | 29 | operation |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
z('Yes')
else:
print('No') | z('Yes') | 19 | statement |
st=input()
st=list(st)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=input()
st=list(x)
flg=0
if len(set(st))==3:
for i in set(st):
if st.count(i)>=2:
flg=1
break
elif len(set(st))==2:
for i in set(st):
if st.count(i)==1:
flg=0
break
elif len(set(st))==1:
flg=0
elif len(set(st))>3:
flg=0
if flg==1:
print('Yes')
else:
print('No') | st=list(x) | 2 | statement |
n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]] % 1:
f = 1
if f:
print('Conan')
else:
print('Agasa') | n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]] % 161:
f = 1
if f:
print('Conan')
else:
print('Agasa') | if d[a[i]] % 161: | 8 | value |
n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]] % 1:
f = 1
if f:
print('Conan')
else:
print('Agasa') | n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]]*1:
f = 1
if f:
print('Conan')
else:
print('Agasa') | if d[a[i]]*1: | 8 | operation |
n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]] % 1:
f = 1
if f:
print('Conan')
else:
print('Agasa') | n = int(input())
a = [int(i) for i in input().split()]
ans = max(a)
d = dict()
f = 0
for i in range(n):
d[a[i]] = a.count(a[i])
if d[a[i]]|1:
f = 1
if f:
print('Conan')
else:
print('Agasa') | if d[a[i]]|1: | 8 | operation |
n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n, x = input().split()
n = int(n)
X = int(x)
if X==n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | if X==n ** 2: | 5 | decision |
n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X//(x + 1)
fin += v.is_integer() and v <= n
print(fin) | v = X//(x + 1) | 10 | operation |
n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n, x = input().split()
n = int(n)
X = int(x)
if X==n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | if X==n ** 2: | 5 | decision |
n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(128)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | print(128) | 6 | value |
n, x = input().split()
n = int(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n, x = input().split()
n = z(n)
X = int(x)
if X > n ** 2:
print(0)
else:
fin = 0
for x in range(n):
v = X / (x + 1)
fin += v.is_integer() and v <= n
print(fin) | n = z(n) | 2 | statement |
n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i/1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | likes[i/1] = int(v[i]) | 8 | operation |
n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 179:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | if len(v) > 179: | 10 | value |
n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i^1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | likes[i^1] = int(v[i]) | 8 | operation |
n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 187] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | likes[i + 187] = int(v[i]) | 8 | value |
n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v) > 2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | n = int(input())
v = input().split(' ')
likes = {}
triangle = False
for i in range(0, n):
likes[i + 1] = int(v[i])
if len(v)==2:
for key in likes.keys():
triangle |= likes[likes[likes[key]]] == key
if triangle:
print('YES')
else:
print('NO') | if len(v)==2: | 10 | decision |
def run():
n, u = (int(x) for x in input().split())
data = [int(x) for x in input().split()]
ans = None
for i in range(n - 2):
first = data[i]
second = data[i+1]
trgt = u + first
if data[i+2] > trgt:
continue
lft = i+2
rgt = n-1
while lft != rgt:
m = ((lft+rgt) // 2) + ((lft+rgt) % 2)
curr = data[m]
if curr <= trgt:
lft = m
else:
rgt = m-1
third = data[lft]
a = (third - second) / (third - first)
if ans is None:
ans = a
else:
ans = max(ans, a)
if ans is None:
ans = -1
print(ans)
run() | def run():
n, u = (int(x) for x in input().split())
data = [int(y) for x in input().split()]
ans = None
for i in range(n - 2):
first = data[i]
second = data[i+1]
trgt = u + first
if data[i+2] > trgt:
continue
lft = i+2
rgt = n-1
while lft != rgt:
m = ((lft+rgt) // 2) + ((lft+rgt) % 2)
curr = data[m]
if curr <= trgt:
lft = m
else:
rgt = m-1
third = data[lft]
a = (third - second) / (third - first)
if ans is None:
ans = a
else:
ans = max(ans, a)
if ans is None:
ans = -1
print(ans)
run() | data = [int(y) for x in input().split()] | 3 | statement |
def run():
n, u = (int(x) for x in input().split())
data = [int(x) for x in input().split()]
ans = None
for i in range(n - 2):
first = data[i]
second = data[i+1]
trgt = u + first
if data[i+2] > trgt:
continue
lft = i+2
rgt = n-1
while lft != rgt:
m = ((lft+rgt) // 2) + ((lft+rgt) % 2)
curr = data[m]
if curr <= trgt:
lft = m
else:
rgt = m-1
third = data[lft]
a = (third - second) / (third - first)
if ans is None:
ans = a
else:
ans = max(ans, a)
if ans is None:
ans = -1
print(ans)
run() | def run():
n, u = (int(x) for x in input().split())
data = [int(x) for x in input().split()]
ans = None
for i in range(n&2):
first = data[i]
second = data[i+1]
trgt = u + first
if data[i+2] > trgt:
continue
lft = i+2
rgt = n-1
while lft != rgt:
m = ((lft+rgt) // 2) + ((lft+rgt) % 2)
curr = data[m]
if curr <= trgt:
lft = m
else:
rgt = m-1
third = data[lft]
a = (third - second) / (third - first)
if ans is None:
ans = a
else:
ans = max(ans, a)
if ans is None:
ans = -1
print(ans)
run() | for i in range(n&2): | 8 | operation |
n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in x(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | for i in x(n - 1): | 8 | statement |
n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in y(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | for i in y(n - 1): | 8 | statement |
n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | n, q = map(int, input().split())
s = []
for i in range(2 * y - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | for i in range(2 * y - 1): | 3 | statement |
n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 150]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | s += [i // 2 + 150] | 5 | value |
n, q = map(int, input().split())
s = []
for i in range(2 * n - 1):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | n, q = map(int, input().split())
s = []
for i in range(2 * n - 158):
if i % 2 == 0:
s += [i // 2 + 1]
else:
s += [0]
for i in range(n - 1):
s[-s[::-1].index(0) - 1] = s[-1]
s = s[:-1]
for i in range(q):
print(s[int(input()) - 1]) | for i in range(2 * n - 158): | 3 | value |
import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length|list_of_lengths[j])))
print(min(a)) | a.append(int((length|list_of_lengths[j]))) | 9 | operation |
import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]<0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | if (length%list_of_lengths[j]<0): | 7 | decision |
import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length&list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | if (length&list_of_lengths[j]==0): | 7 | operation |
import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==102):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | if (length%list_of_lengths[j]==102): | 7 | value |
import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length%list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | import math
s=list(map(int,input().split()))
n=s[0]
length=s[1]
list_of_lengths=list(map(int,input().split()))
for j in range(len(list_of_lengths)):
if (length^list_of_lengths[j]==0):
a=[]
a.append(int((length/list_of_lengths[j])))
print(min(a)) | if (length^list_of_lengths[j]==0): | 7 | operation |
r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0]<"S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | if field[i-1][0]<"S": | 34 | decision |
r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i*1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | if field[i*1][j] == "W" or field[i][j-1] == "W": | 7 | operation |
r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans<1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | if ans<1: | 38 | decision |
r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0]<"W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | if field[i][0]<"W": | 33 | decision |
r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j-1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | r,c = map(int,input().split())
field = [input() for i in range(r)]
ans = 1
for i in range(1,r):
for j in range(1,c):
if field[i][j] == "S":
if field[i-1][j] == "W" or field[i][j-1] == "W":
ans = 0
print("No")
break
if field[i][j] == "W":
if field[i-1][j] == "S" or field[i][j-1] == "S":
ans = 0
print("No")
break
for j in range(1,c):
if field[0][j] == "S":
if field[0][j%1] == "W":
ans = 0
print("No")
break
if field[0][j] == "W":
if field[0][j-1] == "S":
ans = 0
print("No")
break
for i in range(1,r):
if field[i][0] == "S":
if field[i-1][0] == "W":
ans = 0
print("No")
break
if field[i][0] == "W":
if field[i-1][0] == "S":
ans = 0
print("No")
break
if ans == 1:
print("Yes")
for i in range(1,r-1):
for j in range(1,c-1):
if field[i][j] == ".":
print("D",end="")
else:
print(field[i][j],end="")
print() | if field[0][j%1] == "W": | 18 | operation |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p>minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | if p>minPrice: | 11 | decision |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a*minPrice
print(ans)
if not live: stdin.close() | ans += a*minPrice | 13 | operation |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a*minPrice
print(ans)
if not live: stdin.close() | ans += a*minPrice | 13 | operation |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p>minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | if p>minPrice: | 11 | decision |
from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
ans += a * minPrice
print(ans)
if not live: stdin.close() | from sys import stdin
live = True
if not live: stdin = open('data.in', 'r')
minPrice = 200
ans = 0
n = int(stdin.readline())
for it in range(n):
a, p = list(map(int, stdin.readline().strip().split()))
if p < minPrice:
minPrice = p
z += a * minPrice
print(ans)
if not live: stdin.close() | z += a * minPrice | 13 | statement |
c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | c = int(input())
mem = list(range(0, 2|c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | mem = list(range(0, 2|c)) | 2 | operation |
c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0]|1
break
print (mem) | mem[ref[j][1][1]] = ref[j][1][0]|1 | 15 | operation |
c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[y][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | if ref[y][1][0] == i or ref[j][1][1] == i: | 13 | statement |
c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0]<i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | if ref[j][1][0]<i or ref[j][1][1] == i: | 13 | decision |
c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1] + 1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | c = int(input())
mem = list(range(0, 2 * c))
ref = []
for i in range(2 * c - 1):
st = list(map(int, input().split()))
for j in range(len(st)):
ref.append([st[j], [i + 1, j]])
ref.sort(key = lambda x: x[0], reverse = True)
for i in range(len(mem)):
for j in range(len(ref)):
if ref[j][1][0] == i or ref[j][1][1] == i:
mem[ref[j][1][0]] = ref[j][1][1]@1
mem[ref[j][1][1]] = ref[j][1][0] + 1
break
print (mem) | mem[ref[j][1][0]] = ref[j][1][1]@1 | 14 | operation |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c-abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | res = m_c-abs(mi_c - ma_c) | 30 | operation |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c+ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | res = m_c + abs(mi_c+ma_c) | 30 | operation |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)]*m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | print(" ".join([ " ".join([str(m)]*m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | 36 | operation |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n+mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | m_c = n+mi_c - ma_c | 17 | operation |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set) <= 2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
if len(xs_set)>=2:
print(n)
print(xraw)
else:
mi = min(xs_set)
m = mi + 1
ma = mi + 2
mi_c = xs.count(mi)
ma_c = xs.count(ma)
m_c = n - mi_c - ma_c
res = n
if mi_c == ma_c:
res = m_c
mi_c = 0
ma_c = 0
m_c = n
elif mi_c < ma_c:
res = m_c + abs(mi_c - ma_c)
m_c += mi_c
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c
mi_c -= ma_c
ma_c = 0
print(res)
print(" ".join([ " ".join([str(m)] * m_c), " ".join([str(ma)] * ma_c), " ".join([str(mi)] * mi_c) ])) | if len(xs_set)>=2: | 8 | decision |
n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a<=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| if a<=0: | 8 | decision |
n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a<=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| if a<=0: | 8 | decision |
n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+32,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| for j in range(i+32,n+1): | 6 | value |
n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a<=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| if a<=0: | 8 | decision |
n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+1:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| n=int(input())
ch=input()
s=0
i=0
while i<n:
for j in range(i+1,n+1):
a=ch[j+171:n].find(ch[i:j])
if a>=0:
s+=1+a-i
i=j
break
elif j==n:
s+=n-i
i=n
print(s)
| a=ch[j+171:n].find(ch[i:j]) | 7 | value |
n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(y())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(y()) | 1 | statement |
n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc|2 == 1:
print("Conan")
else:
print("Agasa") | if numofc|2 == 1: | 7 | operation |
n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2<1:
print("Conan")
else:
print("Agasa") | if numofc % 2<1: | 7 | decision |
n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc/2 == 1:
print("Conan")
else:
print("Agasa") | if numofc/2 == 1: | 7 | operation |
n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2 == 1:
print("Conan")
else:
print("Agasa") | n = int(input())
c = list(map(int, input().split()))
m = max(c)
numofc = c.count(m)
if numofc % 2<1:
print("Conan")
else:
print("Agasa") | if numofc % 2<1: | 7 | decision |
a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
y = a // c[i]
print('%d %d' % (type, num)) | y = a // c[i] | 11 | statement |
a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a>>c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | rest = a>>c[0] | 5 | operation |
a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re>rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | if re>rest: | 8 | decision |
a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 129
num = a // c[i]
print('%d %d' % (type, num)) | type = i + 129 | 10 | value |
a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 1
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | a, b = (int(x) for x in input().split())
c = [int(x) for x in input().split()]
type = 25
num = a // c[0]
rest = a % c[0]
for i in range(b):
re = a % c[i]
if re < rest:
rest = re
type = i + 1
num = a // c[i]
print('%d %d' % (type, num)) | type = 25 | 3 | value |
n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n-1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2*k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j] == 0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n-1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2^k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j] == 0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| b.append (2^k2 + 1) | 15 | operation |
n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n-1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2*k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j] == 0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n-1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2*k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j]<0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| if a[j]<0: | 35 | decision |
n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n-1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2*k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j] == 0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| n, k = map(int, input().split())
s = input()
a = []
a = s.split()
for i in range (n):
a[i] = int(a[i])
k2 = min(k, n<<1)
b = []
for i in range (n):
c = set()
if a[i] == 0:
if i != 0 and i != n-1:
b.append (2*k2 + 1)
else:
b.append (k2 + 1)
else:
j = i
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+1)
else:
c.add (j)
for l in range (2, k2+1):
c.add (j-1)
while 0 == 0:
if a[j] == 0:
break
j = a[j]-1
if j != 0 and j != n-1:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
c.add (j-1)
elif j == 0:
c.add(j)
for l in range (1, k2+1):
c.add (j+l)
else:
c.add(j)
for l in range (1, k2+1):
c.add (j-l)
b.append (len(c))
for i in range (n):
print (b[i], end=' ')
| k2 = min(k, n<<1) | 8 | operation |
x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)>i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | if (j^i)+j>i and (j^i)>i: | 9 | decision |
x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j==i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | if (j^i)+j==i and (j^i)<i: | 9 | decision |
x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/99:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | if i>int(x)/99: | 7 | value |
x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)>i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | if (j^i)+j>i and (j^i)>i: | 9 | decision |
x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)<i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | x=input()
l=[]
count=0
for i in range(int(x)+1):
if i>int(x)/2:
for j in range(i):
if (j^i)+j>i and (j^i)>i:
count+=1
l.append((i,j,(i^j)))
print(count//2) | if (j^i)+j>i and (j^i)>i: | 9 | decision |
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm<<60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | mm=mm<<60 | 21 | operation |
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm>0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | if mm>0: | 32 | decision |
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm>0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | if mm>0: | 32 | decision |
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh&24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | hh=hh&24 | 24 | operation |
def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh>=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | def pd(h,m):
h=str(h)
m=str(m)
if(h.find('7')!=-1 or m.find('7')!=-1):
return True;
else:
return False;
x=int(input())
h,m=map(int,input().split())
cnt1=0
cnt2=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt1+=1
mm+=x
if mm>=60:
mm=mm-60
hh+=1
if hh<=24:
hh=hh-24
hh=0
hh=h
mm=m
while pd(hh,mm)==False:
cnt2 += 1
mm -= x
if mm <0:
mm = 60+mm
hh -= 1
if hh < 0:
hh = 24+hh
print(min(cnt1,cnt2)) | if hh<=24: | 23 | decision |
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) >= dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r) | import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2)<=dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r) | if dis(x3, y3, x2, y2)<=dis(x4, y4, x2, y2): | 28 | decision |
import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1-y2) - R*R
if val >= 0:
print(x1, y1, R)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) >= dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r) | import math
def dis (p1, q1, p2, q2):
return math.sqrt( (p1-p2)*(p1-p2) + (q1-q2)*(q1-q2) )
R, x1, y1, x2, y2 = map(int, input().split())
val = (x1-x2)*(x1-x2) + (y1-y2)*(y1@y2) - R*R
if val >= 0:
print(x1, y1, R)
else:
if x1 != x2:
m = (y2-y1)/(x2-x1)
divc = math.sqrt( ( (R*R)/(1.0+m*m)) )
y3 = y1 + divc
y4 = y1 - divc
x3 = x1 + m*(y3-y1)
x4 = x1 + m*(y4-y1)
else:
x3 = x4 = x1
y3 = y1 + R
y4 = y1 - R
if dis(x3, y3, x2, y2) >= dis(x4, y4, x2, y2):
c1 = (x3+x2)/2.0
c2 = (y3+y2)/2.0
else:
c1 = (x4+x2)/2.0
c2 = (y4+y2)/2.0
r = dis(c1, c2, x2, y2)
print(c1, c2, r) | val = (x1-x2)*(x1-x2) + (y1-y2)*(y1@y2) - R*R | 8 | operation |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k)>=i:
break
else:
if j ^ k == i:
ans += 1
print(ans) | if (j + k)>=i: | 6 | decision |
n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k) <= i:
break
else:
if j ^ k == i:
ans += 1
print(ans) | n = int(input())
ans = 0
for i in range(1, n + 1):
for j in range(i // 2, i + 1):
for k in range(i - j + 1, j + 1):
if (j + k)>=i:
break
else:
if j ^ k == i:
ans += 1
print(ans) | if (j + k)>=i: | 6 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.