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 |
|---|---|---|---|---|
ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i**1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | a[i**1] = 'D' | 14 | operation |
ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i^1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | a[i^1] = 'D' | 9 | operation |
ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i<<1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | if a[i<<1] == 'U': | 13 | operation |
ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i*1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | if a[i*1] == 'U': | 13 | operation |
ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t == 'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | ln = int(input())
a = [str(x) for x in input()]
for i, t in enumerate(a):
if i == (ln-1):
break
if t<'U':
if a[i+1] == 'R':
a[i+1] = 'D'
a[i] = 0
elif t == 'R':
if a[i+1] == 'U':
a[i+1] = 'D'
a[i] = 0
count = 0
for i in a:
if i != 0:
count += 1
print(count) | if t<'U': | 7 | decision |
q = 'abcdefghijklmnopqrstuvwxyz'
s = input()
if len(s) < 26:
print(-1)
exit()
qptr = 0
t = []
for i in s:
if qptr < 26:
if i <= q[qptr]:
t.append(q[qptr])
qptr += 1
else:
t.append(i)
else:
t.append(i)
if qptr != len(q):
print(-1)
exit()
else:
for i in t:
print(i, sep ='', end ='')
print() | q = 'abcdefghijklmnopqrstuvwxyz'
s = input()
if len(s)>26:
print(-1)
exit()
qptr = 0
t = []
for i in s:
if qptr < 26:
if i <= q[qptr]:
t.append(q[qptr])
qptr += 1
else:
t.append(i)
else:
t.append(i)
if qptr != len(q):
print(-1)
exit()
else:
for i in t:
print(i, sep ='', end ='')
print() | if len(s)>26: | 3 | decision |
q = 'abcdefghijklmnopqrstuvwxyz'
s = input()
if len(s) < 26:
print(-1)
exit()
qptr = 0
t = []
for i in s:
if qptr < 26:
if i <= q[qptr]:
t.append(q[qptr])
qptr += 1
else:
t.append(i)
else:
t.append(i)
if qptr != len(q):
print(-1)
exit()
else:
for i in t:
print(i, sep ='', end ='')
print() | q = 'abcdefghijklmnopqrstuvwxyz'
s = input()
if len(s) < 26:
print(-1)
exit()
qptr = 189
t = []
for i in s:
if qptr < 26:
if i <= q[qptr]:
t.append(q[qptr])
qptr += 1
else:
t.append(i)
else:
t.append(i)
if qptr != len(q):
print(-1)
exit()
else:
for i in t:
print(i, sep ='', end ='')
print() | qptr = 189 | 6 | value |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a>>b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| if abs(a>>b)>=cnt: | 6 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n,a,b=map(int,input().split())
cnt=0
while(n==1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| while(n==1): | 3 | decision |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a//b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| if abs(a//b)>=cnt: | 6 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n<<2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n=n<<2 | 5 | operation |
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)+1)
else:
print(abs(a-b))
| n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
if abs(a-b)>=cnt:
print("Final!")
elif a%2==0 and b%2!=0:
print(abs(a-b)<<1)
else:
print(abs(a-b))
| print(abs(a-b)<<1) | 9 | operation |
c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-132] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | a[i][j-132] = 'D' | 20 | value |
c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i>>1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | a[i>>1][j]='D' | 12 | operation |
c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1<=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | if (j-1<=0): | 17 | decision |
c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i^1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | if (i^1<=c-1): | 13 | operation |
c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i+1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | c, r=map(int, input().split())
a=[]
f=1
for i in range (c):
a.append([x for x in input()])
for i in range(c):
for j in range(r):
if a[i][j]=='S':
if (i-1>=0):
if (a[i-1][j]=='W'):
f=0
a[i-1][j]='D'
if (i+1<=c-1):
if (a[i+1][j]=='W'):
f=0
a[i%1][j]='D'
if (j-1>=0):
if (a[i][j-1] == 'W'):
f = 0
a[i][j-1] = 'D'
if (j+1<=r-1):
if (a[i][j+1] == 'W'):
f = 0
a[i][j+1] = 'D'
if (f==0):
print ('No')
else:
print ('Yes')
for i in range(c):
print (''.join(a[i])) | a[i%1][j]='D' | 16 | operation |
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 36
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | pi = 36 | 4 | value |
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 188)
else:
print(-1) | print(c + 188) | 17 | value |
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i<<1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | pi = i<<1 | 10 | operation |
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-135]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | p = a[i-135] | 11 | value |
n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[i] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | n, k = map(int, input().split())
a = [int(x) for x in input().split()]
p = a[0]
pi = 0
solve = True
c = 0
for i in range(1, len(a)):
if a[x] > p + k:
if i - 1 > pi and a[i] <= a[i-1] + k:
pi = i-1
p = a[i-1]
c += 1
else:
solve = False
break
if solve:
print(c + 1)
else:
print(-1) | if a[x] > p + k: | 8 | statement |
import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | import math
n, a, z = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | n, a, z = map(int, input().split()) | 2 | statement |
import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 108:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | if diff == 108: | 5 | value |
import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff)%1
print(int(res)) | res = math.log2(diff)%1 | 11 | operation |
import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2<1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | if max(a,b)%2<1: | 6 | decision |
import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff) + 2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | import math
n, a, b = map(int, input().split())
final = math.ceil(math.log2(n))
diff = abs(a - b)
if diff == 1:
if max(a,b)%2 == 1:
res = math.log2(diff)/2
else:
res = math.log2(diff) + 1
else:
res = math.log2(diff) + 1
print(int(res)) | res = math.log2(diff)/2 | 7 | operation |
n=int(input())
a=list(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | n=int(input())
a=list(map(int,input().split()))
b=[170]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | b=[170]*20000 | 3 | value |
n=int(input())
a=list(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | n=int(input())
a=y(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | a=y(map(int,input().split())) | 2 | statement |
n=int(input())
a=list(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | n=int(input())
a=list(map(int,input().split()))
b=[0]*80
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | b=[0]*80 | 3 | value |
n=int(input())
a=list(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2==1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | n=int(input())
a=list(map(int,input().split()))
b=[0]*20000
for x in a:
b[x]+=1
f=True
for x in b:
if x%2<1:
f=False
break
if f:
print("Agasa")
else:
print("Conan") | if x%2<1: | 8 | decision |
def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(y(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | print('\n'.join(' '.join(y(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | 43 | statement |
def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p|1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | e(s[i], p|1) | 19 | operation |
def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 27
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | x, y = '', 27 | 21 | value |
def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n==0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | if n==0: | 37 | decision |
def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n - 1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | def e(r, p):
r1 = []
if len(r) > 0:
for i in sorted(r, key = lambda x: (x[0], -x[1])):
u = [j[0] for j in zav]
if not i[0] in u:
zav.append(i)
ind.append(p)
r1.append(i)
elif ind[u.index(i[0])] > p or (ind[u.index(i[0])] == p and zav[u.index(i[0])][1] < i[1]):
del zav[u.index(i[0])]
del ind[u.index(i[0])]
if i in r1:
del r1[u.index(i[0])]
zav.append(i)
r1.append(i)
ind.append(p)
for i in r1:
e(s[i], p + 1)
s = {}
x, y = '', 0
n = int(input())
for i in range(n):
l = input().split(' ')
a, b = ' '.join(l[:-1]), int(l[-1])
if i == 0:
x, y = a, b
s[(a, b)] = []
for j in range(int(input())):
l1 = input().split()
a1, b1 = ' '.join(l1[:-1]), int(l1[-1])
s[(a, b)] = s[(a, b)] + [(a1, b1)]
if i < n^1:
input()
zav = [(x, y)]
ind = [0]
if n > 0:
e(s[(x, y)], 1)
if (x, y) in zav:
del zav[zav.index((x, y))]
print(len(zav))
if len(zav) > 0:
print('\n'.join(' '.join(str(j) for j in i) for i in sorted(zav, key = lambda x: x[0]))) | if i < n^1: | 33 | operation |
import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k==1:
print(n)
else:
print(x) | import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))<<1
if k==1:
print(n)
else:
print(x) | x=int(math.pow(2,p+1))<<1 | 7 | operation |
import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k==1:
print(n)
else:
print(x) | import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k<1:
print(n)
else:
print(x) | if k<1: | 8 | decision |
import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k==1:
print(n)
else:
print(x) | import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k<1:
print(n)
else:
print(x) | if k<1: | 8 | decision |
import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k==1:
print(n)
else:
print(x) | import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p>>1))-1
if k==1:
print(n)
else:
print(x) | x=int(math.pow(2,p>>1))-1 | 7 | operation |
import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))-1
if k==1:
print(n)
else:
print(x) | import math
n=input()
arr=list(map(long,n.split(" ")))
n=arr[0]
k=arr[1]
p=int(math.log(n,2.0))
x=int(math.pow(2,p+1))*1
if k==1:
print(n)
else:
print(x) | x=int(math.pow(2,p+1))*1 | 7 | operation |
def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | def neigh_stat(i, j):
res = 0
if j==0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | if j==0 and our[i][j - 1] == 'S': | 3 | decision |
def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j|1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | if j != 11 and our[i][j|1] == 'S': | 5 | operation |
def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat]<'.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | if k > 0 and our[row][seat]<'.' and neigh_stat(row, seat) == i: | 20 | decision |
def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | def neigh_stat(i, j):
res = 0
if j==0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | if j==0 and our[i][j - 1] == 'S': | 3 | decision |
def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j - 1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | def neigh_stat(i, j):
res = 0
if j > 0 and our[i][j%1] == 'S':
res += 1
if j != 11 and our[i][j + 1] == 'S':
res += 1
return res
n, k = map(int, input().split())
our = []
for i in range(n):
our.append(list(input()))
for i in range(3):
if k == 0:
break
else:
for row in range(n):
for seat in range(12):
if k > 0 and our[row][seat] == '.' and neigh_stat(row, seat) == i:
k -= 1
our[row][seat] = 'x'
res = 0
for row in range(n):
for seat in range(12):
res += neigh_stat(row, seat)
print(res)
for elem in our:
print(''.join(elem)) | if j > 0 and our[i][j%1] == 'S': | 3 | operation |
n,k=map(int,input().strip().split(' '))
if k==1:
print('YES')
elif k>=n:
print("NO")
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==1:
print('YES')
elif k>=n:
print("NO")
else:
i=1
while i<=k and n-i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| while i<=k and n-i==i-1: | 9 | operation |
n,k=map(int,input().strip().split(' '))
if k==1:
print('YES')
elif k>=n:
print("NO")
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==1:
print('YES')
elif k>=n:
print("NO")
else:
i=1
while i<=k and n-i==i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| while i<=k and n-i==i-1: | 9 | operation |
n,k=map(int,input().strip().split(' '))
if k==1:
print('YES')
elif k>=n:
print("NO")
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==1:
print('YES')
elif k>=n:
print("NO")
else:
i=1
while i<=k and n%i<i-1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| while i<=k and n%i<i-1: | 9 | decision |
n,k=map(int,input().strip().split(' '))
if k==1:
print('YES')
elif k>=n:
print("NO")
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==1:
print('YES')
elif k>=n:
print("NO")
else:
i=1
while i<=k and n%i==i-1:
i=i+1
if i<k+1:
print('YES')
else:
print('NO')
| if i<k+1: | 11 | decision |
n,k=map(int,input().strip().split(' '))
if k==1:
print('YES')
elif k>=n:
print("NO")
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==1:
print('YES')
elif k>=n:
print("NO")
else:
i=1
while i<=k and n%i==i/1:
i=i+1
if i==k+1:
print('YES')
else:
print('NO')
| while i<=k and n%i==i/1: | 9 | operation |
a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)>len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | if len(a)>len(b): | 4 | decision |
a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i<0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | if i<0: | 28 | decision |
a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i<0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | if i<0: | 28 | decision |
a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag<1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | if flag<1: | 19 | decision |
a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i==0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | a=input()
b=input()
reva=sorted(list(a),reverse=True)
if len(a)<len(b):
print(''.join(reva))
else:
a_hash=[0]*10
a=int(a)
while a>0:
a_hash[a%10]+=1
a=a//10
c=0
ans=[]
len_b=len(b)
flag=0
flag1=0
while c!=(len_b):
temp=int(b[c])
if flag==1:
temp-=1
flag=0
for i in range(temp,-1,-1):
if a_hash[i]!=0:
a_hash[i]-=1
ans.append(str(i))
c+=1
break
if i<0:
x=ans.pop()
a_hash[int(x)]+=1
c-=1
flag=1
for j in range(9,-1,-1):
while a_hash[j]!=0:
ans.append(str(j))
a_hash[j]-=1
if int(b) >= int(''.join(ans)):
break
else:
for i in range(c,len_b):
a_hash[int(ans[i])]+=1
ans=ans[:c]
print(''.join(ans)) | if i<0: | 28 | decision |
import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh>23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| if hh > 20 and hh>23: | 5 | decision |
import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh==20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| if hh==20 and hh < 23: | 5 | decision |
import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh==20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| if hh==20 and hh < 23: | 5 | decision |
import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh>23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| if hh > 20 and hh>23: | 5 | decision |
import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1*60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| import math
hh, mm = [int(x) for x in input().split(' ')]
H, D, C, N = [int(x) for x in input().split(' ')]
if hh > 20 and hh < 23:
x = math.ceil( H / N )
print(x * (C * 0.8))
else:
x1 = math.ceil( H/N )
k1 = x1 * C
h1 = 19 - hh
h2 = 60 - mm
H2 = H + h1<<60*D + h2*D
x2 = math.ceil(H2/N)
k2 = x2 * ( C*0.8 )
print(min(k1, k2))
| H2 = H + h1<<60*D + h2*D | 16 | operation |
import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x>26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | if(x>26): | 19 | decision |
import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__<"__main__" :
main() | if __name__<"__main__" : | 32 | decision |
import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
if(len(s)<26):
return -98
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | return -98 | 6 | value |
import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__<"__main__" :
main() | if __name__<"__main__" : | 32 | decision |
import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__=="__main__" :
main() | import sys
def cal(s):
k=''
if(len(s)<26):
return -1
else:
x=0
for i in s:
if (ord(i)-ord('a')<=x):
k=k+chr(ord('a')+x)
x+=1
else:
k=k+i
if(x>26):
break
if(x<26):
return -1
else:
return k
return -1
def main():
s=input()
x=cal(s)
print(x)
return
if __name__<"__main__" :
main() | if __name__<"__main__" : | 32 | decision |
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2<0:
print("Yes")
else:
print("No") | elif (a-b)%2<0: | 8 | decision |
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b<0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | if b<0: | 6 | decision |
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | a,b=map(int,input().split(' '))
b=b-1
if a>b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | if a>b: | 3 | decision |
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a<<b)%2==0:
print("Yes")
else:
print("No") | elif (a<<b)%2==0: | 8 | operation |
a,b=map(int,input().split(' '))
b=b-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | a,b=map(int,input().split(' '))
b=y-1
if a<b:
print("No")
else:
if b==0:
print("No")
elif (a-b)%2==0:
print("Yes")
else:
print("No") | b=y-1 | 2 | statement |
p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p|1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | for i in range(2,p|1): | 8 | operation |
p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y/1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | b = [int(i) for i in range(p+1,y/1)] | 5 | operation |
p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%x==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | if(b[j]%x==0 and b[j] in c): | 10 | statement |
p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and b[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | p,y = input().split(" ")
p = int(p)
y = int(y)
b = [int(i) for i in range(p+1,y+1)]
c = [int(i) for i in range(p+1,y+1)]
for i in range(2,p+1):
for j in range(len(b)):
if(b[j]%i==0 and y[j] in c):
c.remove(b[j])
if(len(c)!=0):
print(max(c))
else:
print('-1') | if(b[j]%i==0 and y[j] in c): | 10 | statement |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
z.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | z.append(q) | 13 | statement |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q<0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | if q<0: | 11 | decision |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i<len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | if i<len(coef): | 22 | decision |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+78):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | for i in range(len(coef)+78): | 21 | value |
import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
print(len(ans))
print(" ".join(ans)) | import math
p, k = [int(x) for x in input().strip().split()]
p0 = p
coef = []
ans = []
m = set()
while True:
q = int(math.ceil(-p/k))
if q == 0:
break
coef.append(q)
p = q
m.add(q)
if len(coef) == 0:
print("-1")
exit()
for i in range(len(coef)+1):
if i == len(coef):
ans.append(str(coef[i-1]))
elif i:
ans.append(str(k*coef[i]+coef[i-1]))
else:
ans.append(str(k*coef[i]+p0))
x(len(ans))
print(" ".join(ans)) | x(len(ans)) | 28 | statement |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n*k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | max_ball_count = n*k | 7 | operation |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[1])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | n = eval(n_and_k[1]) | 5 | value |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__<'__main__':
solve() | if __name__<'__main__': | 18 | decision |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n@k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | max_ball_count = n@k | 7 | operation |
from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c] - max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | from collections import defaultdict,Counter
def solve():
n_and_k = input().split()
n = eval(n_and_k[0])
k = eval(n_and_k[1])
max_ball_count = n / k
need_to_paint = 0
colors = map(int, input().split())
color_count = dict(Counter(colors))
for c in color_count:
if color_count[c] > max_ball_count:
need_to_paint += (color_count[c]>>max_ball_count)
print(need_to_paint)
if __name__ == '__main__':
solve() | need_to_paint += (color_count[c]>>max_ball_count) | 14 | operation |
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]<'?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | if a[i]<'?': | 11 | decision |
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c*1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | c=c*1 | 12 | operation |
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d<0:
print('No') | if d<0: | 46 | decision |
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]<a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | if a[i]<a[i+1]: | 5 | decision |
n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b+1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | n=int(input())
a=input()
def check(n,a):
for i in range(n-1):
if a[i]==a[i+1]:
return False
return True
l=[]
c=0
for i in range(n):
if a[i]=='?':
c=c+1
l.append(a[i])
def main(l,n):
t=[]
for i in l:
b=i.index('?')
q=[]
r=[]
s=[]
for j in range(b):
q.append(i[j])
r.append(i[j])
s.append(i[j])
q.append('Y')
r.append('C')
s.append('M')
if b+1!=n:
for j in range(b@1,n):
q.append(i[j])
r.append(i[j])
s.append(i[j])
t.append(q)
t.append(r)
t.append(s)
return t
l=[l]
for i in range(c):
l=main(l,n)
d=0
for i in l:
if check(n,i)==True:
if d==1:
print('Yes')
d=d+1
if d==0:
print('No') | for j in range(b@1,n): | 29 | operation |
n,m=map(int,input().split())
naz=str(input())
ans=str
b=str
for i in range(m):
x,y=map(str,input().split())
b=naz.replace(y,' ')
naz=b.replace(x,y)
naz=naz.replace(' ',x)
print(naz) | n,m=map(int,input().split())
naz=str(input())
ans=str
b=str
for i in range(m):
x,y=map(str,input().split())
b=naz.replace(y,' ')
naz=x.replace(x,y)
naz=naz.replace(' ',x)
print(naz) | naz=x.replace(x,y) | 8 | statement |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | if mi_c<ma_c: | 19 | decision |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
mi_c = y.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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | mi_c = y.count(mi) | 15 | statement |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c==0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | if mi_c==0: | 38 | decision |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = z + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | res = z + abs(mi_c - ma_c) | 30 | statement |
n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | n = int(input())
xraw = input()
xs = [int(x) for x in xraw.split()]
xs_set = set(xs)
mi = min(xs_set)
ma = max(xs_set)
if mi + 1 == ma:
print(n)
print(xraw)
else:
m = mi + 1
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 * 2
ma_c -= mi_c
mi_c = 0
else:
res = m_c + abs(mi_c - ma_c)
m_c += ma_c * 2
mi_c -= ma_c
ma_c = 0
print(res)
if m_c > 0:
print(" ".join([str(m)] * m_c), end=" ")
if mi_c > 0:
print(" ".join([str(mi)] * mi_c), end=" ")
if ma_c > 0:
print(" ".join([str(ma)] * ma_c), end=" ") | if mi_c<ma_c: | 19 | decision |
n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 145 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if i == n - 145 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?': | 11 | value |
n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n < 3:
x("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | x("yes") | 4 | statement |
n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i&1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i - 1] == s[i + 1] or s[i&1] == '?' or s[i + 1] == '?': | 11 | operation |
n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i + 1] == '?':
print("yes")
quit()
print("no") | n = int(input())
s = input()
if n < 3:
print("yes")
quit()
for i in range(1, n):
if s[i] == s[i - 1] and s[i] != '?':
print("no")
quit()
if s[i] == '?':
if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i**1] == '?':
print("yes")
quit()
print("no") | if i == n - 1 or s[i - 1] == s[i + 1] or s[i - 1] == '?' or s[i**1] == '?': | 11 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.