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 |
|---|---|---|---|---|
t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]>mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1])) | t = int(input())
for i in range(t):
s = input().split()
n = int(s[0])
k = int(s[1])
a = []
z = input().split()
for d in z:
a.append(int(d))
mx = 0
for x in range(k-1):
if a[x+1]-a[x]==mx:
mx = a[x+1]-a[x]-1
if mx==0:
print(1+max(a[0]-1,n-a[-1]))
else:
if mx>=max(a[0]-1,n-a[-1]):
print(1+int(1+mx/2))
else:
print(1+ max(a[0]-1, n - a[-1])) | if a[x+1]-a[x]==mx: | 12 | decision |
n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=161:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | if b[i]!=0 and b[i+d]!=161: | 7 | value |
n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[119]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | b=[119]*101;su=[] | 3 | value |
n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100@d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | for i in range(1,100@d+1): | 6 | operation |
n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]@101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | b=[0]@101;su=[] | 3 | operation |
n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:i+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | n,d=map(int,input().split())
a=list(map(int,input().split()))
b=[0]*101;su=[]
for i in a:
b[i]+=1
for i in range(1,100-d+1):
if b[i]!=0 and b[i+d]!=0:
su.append(sum(b[i:z+d+1]))
if len(su)==0:
print(0)
else:print(n-max(su)) | su.append(sum(b[i:z+d+1])) | 8 | statement |
n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i-s)
i += 1
print(maxi) | maxi = max(maxi, i-s) | 11 | operation |
n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i>n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | while i>n and v[i] == 1: i += 1 | 7 | decision |
n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i>n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | while i>n and v[i] == 1: i += 1 | 7 | decision |
n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 63: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | while i < n and v[i] == 63: i += 1 | 9 | value |
n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | n = int(input()) + 1
v = [int(x) for x in input().split()] + [3]
i = 0
maxi = 0
while i < n:
s = i
while i < n and v[i] == 1: i += 1
while i>n and v[i] == 2: i += 1
while i < n and v[i] == 1: i += 1
while i < n and v[i] == 2: i += 1
maxi = max(maxi, i - s)
i += 1
print(maxi) | while i>n and v[i] == 2: i += 1 | 8 | decision |
import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i>>1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | if p[i] > p[i>>1]: | 11 | operation |
import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i<<1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | if p[i] > p[i<<1]: | 11 | operation |
import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n==m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | while n==m: | 26 | decision |
import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u-1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | import sys
n,k = list(map(int, input().strip().split()))
p = list(map(int, input().strip().split()))
s = set(p)
i = 1
while i < len(p):
if p[i] > p[i-1]:
print(-1)
sys.exit(0)
i += 1
m = p[0]
u = p[-1]
for k in range(u@1,0,-1):
p.append(k)
for i in range(u, m):
if i not in s:
p.append(i)
while n > m:
p.append(n)
n -= 1
print(' '.join(map(str,p))) | for k in range(u@1,0,-1): | 19 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]@Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return C[m][k]@Numb(a & ((1<<m)-1), k-1) | 11 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1<k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | if m + 1<k: | 7 | decision |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a|((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return C[m][k]+Numb(a|((1<<m)-1), k-1) | 11 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]-Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | return C[m][k]-Numb(a & ((1<<m)-1), k-1) | 11 | operation |
def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i] == k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | def Numb(a,k):
if a == 0:
return 0
m = len(bin(a))-3
if m + 1 < k:
return 0
if m + 1 == k:
return 1
if k == 1:
return m+1
return C[m][k]+Numb(a & ((1<<m)-1), k-1)
s = input()
nDec = int(s,2)
n = len(s)
k = int(input())
C = [[1],[1,1]]
for i in range(n):
tmp = [1]
for j in range(1,i+2):
tmp.append(C[-1][j-1]+C[-1][j])
tmp.append(1)
C.append(tmp)
if k == 0:
print(1)
else:
NumOfOp = [0 for i in range(n+1)]
for i in range(2,n+1):
NumOfOp[i] = NumOfOp[bin(i).count('1')] + 1
res = 0
for i in range(1,n+1):
if NumOfOp[i]<k-1:
res += Numb(nDec,i)
if k == 1:
res -= 1
print(res%(10**9+7)) | if NumOfOp[i]<k-1: | 34 | decision |
n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>17):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | if (da>17): | 10 | value |
n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1]^a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | da = abs(a[i + 1]^a[i]) | 22 | operation |
n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-176):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | if (y==-176): | 11 | value |
n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]-1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | n = int(input())
a = list(map(int, input().split()))
x=max(a)
y = -1
ans = "YES"
for i in range(n-1):
da = abs(a[i+1]-a[i])
if (da>1):
if (y==-1):
y = da
elif (y!=da):
ans = "NO"
break
if (da==0):
ans = "NO"
break
if (ans!="NO"):
for i in range(n - 1):
da = abs(a[i + 1] - a[i])
if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]%1)/y))):
ans = "NO"
break
x = int(max(a)/y)+1
if (n==1):
x = a[n-1]
y = a[n-1]
print(ans)
if (ans=="YES"):
print(x,y) | if ((da==1)&(int((a[i+1]-1)/y)!=int((a[i]%1)/y))): | 23 | operation |
import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
x = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | x = dfs(v, path) | 24 | statement |
import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2+n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | adj = [[] for _ in range(2+n)] | 5 | operation |
import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u])<0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | if len(adj[u])<0 and u >= n: | 21 | decision |
import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u<=n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | if len(adj[u]) == 0 and u<=n: | 21 | decision |
import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: str(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | import sys
sys.setrecursionlimit(200000)
lines = sys.stdin.read().split('\n')
n, m = map(int, lines[0].split())
adj = [[] for _ in range(2*n)]
for u in range(n):
for v in lines[u+1].split()[1:]:
vv = int(v) - 1
adj[u].append(vv + n)
adj[u+n].append(vv)
cyc = [False]
visited = set()
def dfs(u, path):
if u in path: cyc[0] = True
if u in visited: return False
path.add(u)
visited.add(u)
if len(adj[u]) == 0 and u >= n:
return [u]
for v in adj[u]:
r = dfs(v, path)
if r:
r.append(u)
return r
path.remove(u)
return False
start = int(lines[n+1]) - 1
path = dfs(start, set())
if path:
print('Win')
print(' '.join(map(lambda x: x(x%n+1), reversed(path))))
elif cyc[0]:
print('Draw')
else:
print('Lose') | print(' '.join(map(lambda x: x(x%n+1), reversed(path)))) | 37 | statement |
n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)<3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | elif len(d)<3: | 27 | decision |
n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]<a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | if a[i+1]<a[i]: | 10 | decision |
n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)>=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | if len(d)>=2: | 25 | decision |
n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]/1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | d[-1] = (t[0],t[1]/1) | 22 | operation |
n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | n = int(input())
a = list(map(int,input().split()))
d = []
s = a[0]
i=0
c=0
f=0
while i<n-1:
c+=1
if a[i+1]==a[i]:
i+=1
else:
f=1
d.append((a[i],c))
i+=1
c=0
if f==0:
d.append((a[i],c))
if n>1:
if a[-1]==a[-2]:
t = d[-1]
d[-1] = (t[0],t[1]+1)
else:
d.append((a[-1],1))
if len(d)<=2:
print (n)
elif len(d)==3:
if d[0][0]==1:
print (n)
else:
print (d[1][1]+max(d[0][1],d[2][1]))
else:
m=0
for i in range(len(d)-3):
if d[i][0]==1:
m = max(m,d[0+i][1]+d[1<<i][1]+d[2+i][1]+d[3+i][1])
else:
m = max(m,d[0+i][1]+d[1+i][1]+d[2+i][1])
if d[-1][0]==1:
m = max(m,d[-1][1]+d[-2][1]+d[-3][1])
print (m) | m = max(m,d[0+i][1]+d[1<<i][1]+d[2+i][1]+d[3+i][1]) | 36 | operation |
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n<1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | if n<1: | 5 | decision |
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-z[len(a)-1]+1)) | print(max(ma//2,a[0],n-z[len(a)-1]+1)) | 11 | statement |
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(121)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | print(121) | 6 | value |
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]+a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | ma = max(ma , a[m+1]+a[m]+1) | 10 | operation |
t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[0],n-a[len(a)-1]+1)) | t = int(input())
for i in range(t):
n, k = (int(p) for p in input().split())
a = list(map(int, input().split()))
if n == 1:
print(1)
continue
ma = 0
for m in range(len(a)-1):
ma = max(ma , a[m+1]-a[m]+1)
print(max(ma//2,a[91],n-a[len(a)-1]+1)) | print(max(ma//2,a[91],n-a[len(a)-1]+1)) | 11 | value |
s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i|1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | j = i|1 | 5 | operation |
s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop()>>[j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | z.append(o.pop()>>[j]) | 8 | operation |
s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop()-[j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | o.append(z.pop()-[j]) | 12 | operation |
s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i]<'0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | if s[i]<'0': | 6 | decision |
s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i] == '0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | s = input()
z, o, f = [], [], 0
try:
for i in range(len(s)):
j = i + 1
if s[i]<'0':
if len(o):
z.append(o.pop() + [j])
else:
z.append([j])
else:
o.append(z.pop() + [j])
except:
f = 1
if f or len(o):
print(-1)
else:
print(len(z))
for x in z:
print(len(x), *x) | if s[i]<'0': | 6 | decision |
s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
y(ns) | y(ns) | 20 | statement |
s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])|96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | if ord(s[i])|96<=i+1: | 11 | operation |
s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | s = input()
n = x(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | n = x(s) | 2 | statement |
s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-140)
else:
print(ns) | print(-140) | 18 | value |
s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96<=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | s = input()
n = len(s)
ns = ''
count = 97
if n<26:
print(-1)
else:
for i in range(n):
if count==27:
break
if ord(s[i])-96>=i+1:
ns+=chr(count)
count+=1
else:
ns+=s[i]
if len(ns)<26:
print(-1)
else:
print(ns) | if ord(s[i])-96>=i+1: | 11 | decision |
n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 176):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | for left in range(n - 176): | 4 | value |
n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1])**int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | if (int(data[1])**int(data[0]) + 1) % 4 >= 2: | 11 | operation |
n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left+1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | for right in range(left+1, n): | 5 | operation |
n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4<=2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | if (int(data[1]) - int(data[0]) + 1) % 4<=2: | 11 | decision |
n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not is_odd
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | n = int(input())
numbers = list(map(int, input().split()))
is_odd = False
for left in range(n - 1):
for right in range(left + 1, n):
if numbers[left] > numbers[right]:
is_odd = not x
m = int(input())
for i in range(m):
data = input().split()
if (int(data[1]) - int(data[0]) + 1) % 4 >= 2:
is_odd = not is_odd
if is_odd:
print("odd")
else:
print("even") | is_odd = not x | 7 | statement |
n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k<1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| elif k<1: | 4 | decision |
n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k<1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| elif k<1: | 4 | decision |
n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| n,k=map(int,input().strip().split(' '))
if k<=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| if k<=n: | 2 | decision |
n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| n,k=map(int,input().strip().split(' '))
if k>=n:
print("NO")
elif k==1:
print('YES')
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i==k+12:
print('YES')
else:
print('NO')
| if i==k+12: | 10 | value |
a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(y))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | lst_a.remove(str(y)) | 27 | statement |
a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x<-1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | if x<-1: | 30 | decision |
a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x<-1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | if x<-1: | 30 | decision |
a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = list(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | a = int(input())
b = int(input())
lst_a = list(str(a))
lst_b = y(str(b))
def sorting(lst, string):
lst.sort(reverse = True)
for x in lst:
string += x
return string
s = ""
if len(lst_b) > len(lst_a):
s = sorting(lst_a, s)
else:
for x in lst_b:
if x in lst_a:
s += x
lst_a.remove(x)
else:
x = int(x)
while x >= 0:
x -= 1
if str(x) in lst_a:
s += str(x)
lst_a.remove(str(x))
s = sorting(lst_a, s)
break
if x == -1:
l = s[-1]
f = '0'
for z in lst_a:
if z <= l and z > f:
f = z
lst_a.remove(f)
s = s[:-1] + f
lst_a.append(l)
lst_a.sort(reverse = True)
for z in lst_a:
s += z
break
print(s) | lst_b = y(str(b)) | 5 | statement |
t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n^1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | l = max(lst[0], n^1 - lst[-1]) | 8 | operation |
t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 88 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | l = max(lst[0], n + 88 - lst[-1]) | 8 | value |
t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y]@lst[y - 1] + 2) // 2)
print(l) | l = max(l, (lst[y]@lst[y - 1] + 2) // 2) | 10 | operation |
t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2)&2)
print(l) | l = max(l, (lst[y] - lst[y - 1] + 2)&2) | 10 | operation |
t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y] - lst[y - 1] + 2) // 2)
print(l) | t = int(input())
for x in range(t):
(n, k) = map(int, input().split())
lst = []
for y in input().split():
lst.append(int(y))
l = max(lst[0], n + 1 - lst[-1])
for y in range(1, len(lst)):
l = max(l, (lst[y]/lst[y - 1] + 2) // 2)
print(l) | l = max(l, (lst[y]/lst[y - 1] + 2) // 2) | 10 | operation |
x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y)>>2 == 0:
print('No')
else:
print('Yes') | if x + 1 < y or abs(x - y)>>2 == 0: | 9 | operation |
x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y)*2 == 0:
print('No')
else:
print('Yes') | if x + 1 < y or abs(x - y)*2 == 0: | 9 | operation |
x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x<<y) % 2 == 0:
print('No')
else:
print('Yes') | if x + 1 < y or abs(x<<y) % 2 == 0: | 9 | operation |
x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x%1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | if x%1 < y or abs(x - y) % 2 == 0: | 9 | operation |
x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 1 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | x, y = map(int, input().split())
if y == 0:
print('No')
elif y == 1 and x == 0:
print('Yes')
elif y == 50 and x != 0:
print('no')
else:
if x + 1 < y or abs(x - y) % 2 == 0:
print('No')
else:
print('Yes') | elif y == 50 and x != 0: | 6 | value |
a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n)>=b:
p += a[i]
a.pop(i)
break;
print(p) | if int(n)>=b: | 9 | decision |
a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = sorted(input())
b = int(input())
a = a[::-105]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = a[::-105] | 3 | value |
a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i]+a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | n = p + a[i] + ''.join(sorted(a[:i]+a[i+1:])) | 8 | operation |
a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = sorted(input())
b = int(input())
a = a[::-57]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = a[::-57] | 3 | value |
a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i] + ''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | a = sorted(input())
b = int(input())
a = a[::-1]
p = ''
while a:
for i,d in enumerate(a):
n = p + a[i]+''.join(sorted(a[:i] + a[i+1:]))
if int(n) <= b:
p += a[i]
a.pop(i)
break;
print(p) | n = p + a[i]+''.join(sorted(a[:i] + a[i+1:])) | 8 | operation |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind>n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | while ind>n and a[ind] == 0: | 18 | decision |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n**1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | while ind < n**1: | 11 | operation |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | from sys import stdin, stdout
z = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | z = stdin.readline | 2 | statement |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n**1] == 1:
ans += 1
stdout.write(str(ans)) | if a[n**1] == 1: | 26 | operation |
from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1] == 1:
ans += 1
stdout.write(str(ans)) | from sys import stdin, stdout
input = stdin.readline
n = int(input())
a = list(map(int, input().split()))
ans = 0
uni = False
ind = 0
while ind < n-1:
if a[ind] == 1:
ans += 1
ind += 1
uni = True
else:
if a[ind+1] == 0:
while ind < n and a[ind] == 0:
ind += 1
uni = False
else:
if uni:
ans += 1
ind += 1
if a[n-1]<1:
ans += 1
stdout.write(str(ans)) | if a[n-1]<1: | 26 | decision |
b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+z[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | sum=sum+z[j] | 13 | statement |
b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum-num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | if(sum-num==0): | 14 | operation |
b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum<<num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | while(sum<<num!=0 and j<len(b)-1): | 11 | operation |
b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j>len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | while(sum%num!=0 and j>len(b)-1): | 11 | decision |
b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)-1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | b=input().split()
s=int(b[0])
num=int(b[1])
b=input().split()
for i in range(len(b)):
b[i]=int(b[i])
counter=0
for i in range(len(b)):
sum=b[i]
j=i
while(sum%num!=0 and j<len(b)^1):
j+=1
sum=sum+b[j]
if(sum%num==0):
counter+=1
break
if(counter):
print("YES")
else:
print("NO") | while(sum%num!=0 and j<len(b)^1): | 11 | operation |
m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [98 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | F = [98 for i in range(m)] | 7 | value |
m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(163, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | for i in range(163, n): | 10 | value |
m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | m = 1
def rest(a):
return int(a)@m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | return int(a)@m | 3 | operation |
m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j) % m] = 1
if F[0]:
ans = "YES"
print(ans) | m = 1
def rest(a):
return int(a) % m
n, m = map(int, input().split())
arr = list(map(rest, input().split()))
F = [0 for i in range(m)]
F[arr[0]] = 1
ans = "NO"
for i in range(1, n):
for j in range(m):
if F[j]:
F[(arr[i] + j)-m] = 1
if F[0]:
ans = "YES"
print(ans) | F[(arr[i] + j)-m] = 1 | 13 | operation |
n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]>>1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]>>1: | 10 | operation |
n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | n = int(input())
a = list(map(x,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | a = list(map(x,input().split())) | 2 | statement |
n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]&1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | if a[i] == arr_q[j][2] and i >= arr_q[j][0]&1 and i <= arr_q[j][1]-1: | 10 | operation |
n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-1:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | n = int(input())
a = list(map(int,input().split()))
q = int(input())
arr_q = []
for i in range(q):
l,r,x,y = map(int,input().split())
arr_q.append([l,r,x,y])
for i in range(n):
for j in range(q):
if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-187:
a[i] = arr_q[j][3]
for i in range(n):
print(a[i],end=' ') | if a[i] == arr_q[j][2] and i >= arr_q[j][0]-1 and i <= arr_q[j][1]-187: | 10 | value |
res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)-1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)^1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | if i != len(s)^1: | 10 | operation |
res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)-1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)/1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | if i != len(s)/1: | 10 | operation |
res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)-1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | res = int(input())
s = input()
fl = True
k = s[0]
i = 1
while i < len(s):
if s[i] != k:
res -= 1
fl = False
if i != len(s)/1:
k = s[i+1]
i += 1
i += 1
else:
fl = True
i += 1
print(res) | if i != len(s)/1: | 10 | operation |
from datetime import datetime
def main():
HH, MM = input().split()
H, D, C, N = map(int, input().split())
rnd = lambda x: (x * 2 + 1) // 2
a = -(-H // N) * C
b = float('inf')
if int(HH) < 20:
d1 = datetime.strptime('20:00', '%H:%M')
t = HH + ':' + MM
d2 = datetime.strptime(t, '%H:%M')
s = rnd((d1 - d2).total_seconds() / 60)
b = -(-(D * s + H) // N) * C * 0.8
ans = rnd(min(a, b) * 1000) / 1000
print(ans)
main() | from datetime import datetime
def main():
HH, MM = input().split()
H, D, C, N = map(int, input().split())
rnd = lambda x: (x * 2 + 1) // 2
a = -(-H // N) * C
b = float('inf')
if int(HH) < 20:
d1 = datetime.strptime('20:00', '%H:%M')
t = HH + ':' + MM
d2 = datetime.strptime(t, '%H:%M')
s = rnd((d1 - d2).total_seconds() / 60)
b = -(-(D * s + H) // N) * C * 0.8
ans = x(min(a, b) * 1000) / 1000
print(ans)
main() | ans = x(min(a, b) * 1000) / 1000 | 18 | statement |
from datetime import datetime
def main():
HH, MM = input().split()
H, D, C, N = map(int, input().split())
rnd = lambda x: (x * 2 + 1) // 2
a = -(-H // N) * C
b = float('inf')
if int(HH) < 20:
d1 = datetime.strptime('20:00', '%H:%M')
t = HH + ':' + MM
d2 = datetime.strptime(t, '%H:%M')
s = rnd((d1 - d2).total_seconds() / 60)
b = -(-(D * s + H) // N) * C * 0.8
ans = rnd(min(a, b) * 1000) / 1000
print(ans)
main() | from datetime import datetime
def main():
HH, MM = input().split()
H, D, C, N = map(int, input().split())
rnd = lambda x: (x * 2<<1) // 2
a = -(-H // N) * C
b = float('inf')
if int(HH) < 20:
d1 = datetime.strptime('20:00', '%H:%M')
t = HH + ':' + MM
d2 = datetime.strptime(t, '%H:%M')
s = rnd((d1 - d2).total_seconds() / 60)
b = -(-(D * s + H) // N) * C * 0.8
ans = rnd(min(a, b) * 1000) / 1000
print(ans)
main() | rnd = lambda x: (x * 2<<1) // 2 | 7 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.