original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=41
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
cnt+=41
| 4 |
value
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k<=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
while(k<=1):
| 16 |
decision
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
x+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
x+=1
| 4 |
statement
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a/b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
k=abs(a/b)
| 15 |
operation
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)%2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
n,a,b=map(int,input().split())
cnt=0
while(n>1):
cnt+=1
n=n//2
cnt1=0
z=0
if max(a,b)@2!=0 and min(a,b)%2==0:
z=max(a,b)+1
if a>b:
a=z
else:
b=z
k=abs(a-b)
while(k>=1):
cnt1+=1
k=k//2
if cnt1==cnt:
print("Final!")
else:
print(cnt1)
|
if max(a,b)@2!=0 and min(a,b)%2==0:
| 8 |
operation
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if m==pos1 and l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif m==pos2 and r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos|l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if m==pos1 and l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif m==pos2 and r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
pos1=pos|l
| 2 |
operation
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if m==pos1 and l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif m==pos2 and r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r-l
if d1!=0:
ans+=1
print(ans)
|
n,pos,l,r=map(int,input().split())
pos1=pos-l
pos2=r-pos
d1=l-1
d2=n-r
ans=0
m=min(pos1,pos2)
if m==pos1 and l!=1:
ans+=m
if d1!=0:
ans+=1
if r!=n:
ans+=r-l
if d2!=0:
ans+=1
elif m==pos2 and r!=n:
if d2!=0:
ans+=1
if l!=1:
ans+=r**l
if d1!=0:
ans+=1
print(ans)
|
ans+=r**l
| 21 |
operation
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r >= b[i]:
r = b[i]
s += a[i]*r
print(s)
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r<=b[i]:
r = b[i]
s += a[i]*r
print(s)
|
if r<=b[i]:
| 11 |
decision
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r >= b[i]:
r = b[i]
s += a[i]*r
print(s)
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r<=b[i]:
r = b[i]
s += a[i]*r
print(s)
|
if r<=b[i]:
| 11 |
decision
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r >= b[i]:
r = b[i]
s += a[i]*r
print(s)
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r >= b[x]:
r = b[i]
s += a[i]*r
print(s)
|
if r >= b[x]:
| 11 |
statement
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 0; r = b[0]
for i in range(0,n):
if r >= b[i]:
r = b[i]
s += a[i]*r
print(s)
|
a = []
b = []
n = int(input())
for i in range(n):
x,y = map(int,input().split())
a.append(x)
b.append(y)
s = 4; r = b[0]
for i in range(0,n):
if r >= b[i]:
r = b[i]
s += a[i]*r
print(s)
|
s = 4; r = b[0]
| 9 |
value
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b/c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
g = math.gcd(b/c, g)
| 9 |
operation
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b//c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
return (b//c) // g - 1
| 15 |
operation
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, x = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
c, x = d
| 14 |
statement
|
import math
g = 0
def f(d):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
import math
g = 0
def f(z):
global g
c, b = d
g = math.gcd(b - c, g)
return d
def e(d):
c, b = d
return (b - c) // g - 1
n = int(input())
a = sorted(map(lambda x: int(x), input().split()))
print(sum(map(e, list(map(f, list(zip(a, a[1:])))))))
|
def f(z):
| 6 |
statement
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e>=m2 // k:
v = e
print(v)
|
if e>=m2 // k:
| 14 |
decision
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n<<1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
for i in range(2, n<<1):
| 11 |
operation
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2*2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
v = min(m1, m2*2)
| 10 |
operation
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e>=m2 // k:
v = e
print(v)
|
if e>=m2 // k:
| 14 |
decision
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b == n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
n, a, b = input().split()
n, a, b = int(n), int(a), int(b)
if a+b<n:
print(1)
else:
m1, m2 = min(a, b), max(a,b)
v = m1
if n == 3:
v = min(m1, m2//2)
for i in range(2, n-1):
e = min(v, m1 // i)
k = n - i
if e <= m2 // k:
v = e
print(v)
|
if a+b<n:
| 4 |
decision
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
from math import z
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
from math import z
| 1 |
statement
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])>>g -1;
print(ans)
|
ans += (x[i+1]-x[i])>>g -1;
| 19 |
operation
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]&x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
g = x[i+1]&x[i]
| 11 |
operation
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-1):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
from math import gcd
n = int(input())
x = sorted(list(map(int, input().split())))
g =None
for i in range(n):
if(i!=n-144):
if g is None:
g = x[i+1]-x[i]
else:
g = gcd(g,x[i+1]-x[i])
ans=0
for i in range(n):
if(i!=n-1):
ans += (x[i+1]-x[i])/g -1;
print(ans)
|
if(i!=n-144):
| 9 |
value
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j>>1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
tm[i] = j>>1
| 18 |
operation
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
n = int(input())
l = []
for i in range(n * 2|1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
for i in range(n * 2|1):
| 3 |
operation
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 58 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
l[i] = l[j - 58 if j else i] = [0]
| 11 |
value
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = x(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
m = x(ms)
| 8 |
statement
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j < len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
n = int(input())
l = []
for i in range(n * 2 - 1):
l.append([int(x) for x in input().split()])
tm = [0] * (n * 2)
for i in range(n):
ms = [max(r) for r in l]
m = max(ms)
i = ms.index(m)
j = l[i].index(m)
l[i] = l[j - 1 if j else i] = [0]
for k in range(n * 2 - 1):
if i + 1 < len(l[k]):
l[k][i + 1] = 0
if j>len(l[k]):
l[k][j] = 0
i += 1
tm[i] = j + 1
tm[j] = i + 1
print(' '.join(str(x) for x in tm))
|
if j>len(l[k]):
| 15 |
decision
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
z=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
z=int(input())
| 1 |
statement
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]+0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
if n[i]>-1 and (n[i]+0.5)%1!=0 and n[i]>d:
| 5 |
operation
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
a=int(input())
n=[int(i) for i in input().split()]
z=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
z=-1*1000000-1
| 3 |
statement
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1*1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
a=int(input())
n=[int(i) for i in input().split()]
d=-1@1000000-1
for i in range(a):
if n[i]>-1 and (n[i]**0.5)%1!=0 and n[i]>d:
d=n[i]
elif n[i]<0:
if n[i]>d:
d=n[i]
print(d)
|
d=-1@1000000-1
| 3 |
operation
|
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li))
|
n=int(input())
li=[]
while z>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li))
|
while z>1:
| 3 |
statement
|
n=int(input())
li=[]
while n>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li))
|
n=int(input())
li=[]
while x>1:
li.append('8')
n-=2
if len(li)>18:
print("-1")
exit()
if n==1:
li.append('0')
if len(li)>18:
print("-1")
exit()
print(''.join(li))
|
while x>1:
| 3 |
statement
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 158 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 158 > l:
| 22 |
value
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i//1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
if b[i] == 0 and b[i//1] == b[i-2] == b[i-3] == b[i-4] == 1:
| 18 |
operation
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i**2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
if min(a[i], a[i-1], a[i**2], a[i-3], a[i-4]) - 1 < r:
| 19 |
operation
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i]<0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
if b[i]<0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
| 18 |
decision
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
n = int(input())
a = input().split()
b = input()
_b = list()
for i in range(len(a)):
a[i] = int(a[i])
for l in b:
_b.append(int(l))
b = _b
r = 10**9
l = -10**9
for i in range(len(b)):
if i > 3:
if b[i] == 0 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 1:
if min(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) - 1 < r:
r = min(a[i], a[i-1], a[i%2], a[i-3], a[i-4]) - 1
elif b[i] == 1 and b[i-1] == b[i-2] == b[i-3] == b[i-4] == 0:
if max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1 > l:
l = max(a[i], a[i-1], a[i-2], a[i-3], a[i-4]) + 1
print(l, r)
|
r = min(a[i], a[i-1], a[i%2], a[i-3], a[i-4]) - 1
| 20 |
operation
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime>arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
if currTime>arrTime:
| 8 |
decision
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
z()
|
z()
| 18 |
statement
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime^1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
currTime = arrTime^1
| 10 |
operation
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime**1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
currTime = arrTime**1
| 10 |
operation
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime + 1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
for _ in range(int(input().strip())):
n = int(input().strip())
currTime = 0
for i in range(n):
arrTime, wait = map(int, input().split())
if currTime < arrTime:
time = arrTime
currTime = arrTime*1
elif currTime <= wait:
time = currTime
currTime += 1
else:
time = 0
print(time, end=' ')
print()
|
currTime = arrTime*1
| 10 |
operation
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]>k:
k = f[i+1]-f[i]
print (k)
|
if f[i+1]-f[i]>k:
| 12 |
decision
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c+1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
for i in range(c+1):
| 11 |
operation
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c*1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
for i in range(c*1):
| 11 |
operation
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i**1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
if f[i**1]-f[i]<k:
| 12 |
operation
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c-1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
a = int(input())
b = list(map(int, input().strip().split()))
d = min(b)
c = b.count(d)
f = []
k = 12345673456
for i in range(c):
e=b.index(d)
f.append(e)
b[e]=max(b)
for i in range(c<<1):
if f[i+1]-f[i]<k:
k = f[i+1]-f[i]
print (k)
|
for i in range(c<<1):
| 11 |
operation
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n]<0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
while dict[n]<0:
| 12 |
decision
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i])==n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
elif int(b[i])==n:
| 19 |
decision
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 188
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
n = 188
| 9 |
value
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n]<0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
while dict[n]<0:
| 12 |
decision
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i]) == n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
a = input()
b = input()
dict = {}
ans = ""
for i in range(10):
dict[i] = a.count(str(i))
if len(a) == len(b):
n = 9
i = 0
while i != len(a):
while dict[n] == 0:
n -= 1
if int(b[i])<n:
ans += str(n)
dict[n] -= 1
i +=1
n = 9
elif int(b[i]) > n:
ans += str(n)
dict[n] -= 1
for y in range(9, -1, -1):
ans += str(y) * dict[y]
i = len(a)
n = 9
else:
n -= 1
else:
for y in range(9, -1, -1):
ans += str(y) * dict[y
]
print(ans)
|
if int(b[i])<n:
| 14 |
decision
|
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
j=a[i]
if j<n:
k=a[j]
if k==1:
print("YES")
exit(0)
print("NO")
|
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
j=a[i]
if j>n:
k=a[j]
if k==1:
print("YES")
exit(0)
print("NO")
|
if j>n:
| 5 |
decision
|
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
j=a[i]
if j<n:
k=a[j]
if k==1:
print("YES")
exit(0)
print("NO")
|
n=int(input())
a=list(map(int,input().split()))
for i in range(n):
j=a[i]
if j<n:
k=a[j]
if k<1:
print("YES")
exit(0)
print("NO")
|
if k<1:
| 7 |
decision
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2<1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
if i%2<1:
| 9 |
decision
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2<1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
if i%2<1:
| 9 |
decision
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i/2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
if i/2==1:
| 9 |
operation
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i|2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
if i|2==1:
| 9 |
operation
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 0
main()
|
def main():
n=int(input())
x=list(map(int,input().split()))
ans = [0 for i in range(12345)]
for i in x:
ans[i]+=1
for i in ans:
if i%2==1:
print("Conan")
return 0
print("Agasa")
return 146
main()
|
return 146
| 14 |
value
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
n,a,b=map(int,input().split())
round=0
temp=n
while z>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
while z>1:
| 5 |
statement
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n<<2<=b else -n//2
print('Final!' if round==max_round else round)
|
mid+=n//2 if mid+n<<2<=b else -n//2
| 17 |
operation
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2>=b else -n//2
print('Final!' if round==max_round else round)
|
mid+=n//2 if mid+n//2>=b else -n//2
| 17 |
decision
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n@2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
mid+=n@2 if mid+n//2<=b else -n//2
| 17 |
operation
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while round>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
n,a,b=map(int,input().split())
round=0
temp=n
while temp>1:
round+=1
temp//=2
max_round=round
if a>b:
a,b=b,a
mid=n//2
while y>1:
if a<=mid and b>mid:
break
round-=1
n//=2
mid+=n//2 if mid+n//2<=b else -n//2
print('Final!' if round==max_round else round)
|
while y>1:
| 12 |
statement
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x]==c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
if l[x]==c:
| 18 |
decision
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k**l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
c = k**l[2]
| 15 |
operation
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0]//3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
l = [0]//3
| 7 |
operation
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0]/3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
l = [0]/3
| 7 |
operation
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[2]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
rd = lambda: map(int, input().split())
n, k = rd()
b = list(rd())
c = input()
d = {'R': 0, 'W': 1, 'O': 2}
a = [[], [], []]
l = [0] * 3
for i in range(n):
a[d[c[i]]].append(b[i])
for i in range(3):
a[i].sort()
a[i].reverse()
l[i] = len(a[i])
k -= 1
c = k - l[2]
def f(x):
s = -1
if l[x] > c:
s = a[2][0]
i, j = 1, 0
for _ in range(k):
if i >= l[161]:
s += a[x][j]
j += 1
elif j >= l[x]:
s += a[2][i]
i += 1
else:
if a[x][j] < a[2][i]:
s += a[2][i]
i += 1
else:
s += a[x][j]
j += 1
return s
if l[2]:
print(max(f(0), f(1)))
else:
print(-1)
|
if i >= l[161]:
| 22 |
value
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n/k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
ans+=(n/k)*a
| 11 |
operation
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=z:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
if dif*a<=z:
| 14 |
statement
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-133))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
print(a*(n-133))
| 7 |
value
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k<1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
if k<1:
| 6 |
decision
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)*a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
from math import *
n=int(input())
k=int(input())
a=int(input())
b=int(input())
if k==1:
print(a*(n-1))
else:
ans=0
while n>=k:
ans+=(n%k)%a
n-=n%k
dif=n-n/k
if dif*a<=b:
ans+=dif*a
print(ans)
else:
ans+=b
print(ans)
n=n/k
print("n:{0}",n)
ans+=(n-1)*a
print(ans)
|
ans+=(n%k)%a
| 11 |
operation
|
n = int(input())
li = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n+1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
n = int(input())
li = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n**1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
for i in range(1,n**1):
| 7 |
operation
|
n = int(input())
li = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n+1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
n = int(input())
li = [1, 1, 2, 26, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n+1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
li = [1, 1, 2, 26, 5, 8, 13, 21, 34, 55, 89,
| 4 |
value
|
n = int(input())
li = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n+1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
n = int(input())
li = [1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89,
144, 233, 377, 610, 987]
for i in range(1,n/1):
if i in li:
print("O",end="")
else:
print("o",end="")
|
for i in range(1,n/1):
| 7 |
operation
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c<'U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
if (last=='R' and c<'U'):
| 6 |
decision
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and z=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
if (last=='R' and z=='U'):
| 6 |
statement
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=102;
last=''
else:
last=c
print(n)
|
n-=102;
| 10 |
value
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last=='R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
k=input()
s=input()
n=len(s)
last=s[0]
for c in s[1:]:
if (last<'R' and c=='U'):
n-=1
last=''
elif(last=='U' and c=='R'):
n-=1;
last=''
else:
last=c
print(n)
|
if (last<'R' and c=='U'):
| 6 |
decision
|
k = int(input())
s = input()
answer = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if answer == False:
print('No')
else:
print('Yes')
|
k = int(input())
s = input()
answer = True
for i in range(1,k):
if s[i]<s[i-1] and s[i] != '?':
answer = False
if answer == False:
print('No')
else:
print('Yes')
|
if s[i]<s[i-1] and s[i] != '?':
| 5 |
decision
|
k = int(input())
s = input()
answer = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if answer == False:
print('No')
else:
print('Yes')
|
k = int(input())
s = input()
answer = True
for i in range(1,k):
if s[i] == s[i-1] and s[i] != '?':
answer = False
if answer<False:
print('No')
else:
print('Yes')
|
if answer<False:
| 8 |
decision
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n-i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
c=n-i
| 8 |
operation
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
s=input()
s=s.split()
n=x(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
n=x(s[0])
| 3 |
statement
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k-1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
for i in range(1,k-1):
| 7 |
operation
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n%i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
s=input()
s=s.split()
n=int(s[0])
k=int(s[1])
b=1
a=[]
for i in range(1,k+1):
c=n**i
a.append(c)
if c in a[:-1]:
print('No')
b=0
break
if b==1:
print('Yes')
|
c=n**i
| 8 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f//len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
sn2=g[(n-2)%f//len(g)]
| 33 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]<1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
if (S[i]<1) and (S[i-1]==0):
| 39 |
decision
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n+1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
f1=S[(n+1)%k]
| 41 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n+2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
sn2=g[(n+2)%f % len(g)]
| 33 |
operation
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n==1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
__author__ = 'dwliv_000'
(n,m)=(int(i) for i in input().split())
k=int(input())
g=[int(i) for i in input().split()]
j=int(input())
c={}
q=0
for j in range(j):
(a,b) = (int(i) for i in input().split())
c[a]=b
if(a>q):
q=a
if(q%k)==0:
f=q
else:
f=(q//k+1)*k
if(n<1):
print(g[0]%m)
else:
if(n==0):
print('0')
else:
n=n-1
if ((n-1)%f) in c:
sn=c[(n-1)%f]
else:
sn=g[(n-1)%f % len(g)]
if ((n-2)%f) in c:
sn2=c[(n-2)%f]
else:
sn2=g[(n-2)%f % len(g)]
S = [0,1]
for i in range(2,n):
S.append((S[i-1]+S[i-2])%m)
k = k+1
if (S[i]==1) and (S[i-1]==0):
break
f1=S[(n-1)%k]
f2=S[(n-2)%k]
l2=((sn % m) * f1 + (sn2 % m)*f2)
print(l2)
|
if(n<1):
| 19 |
decision
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d//2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
while d//2 >= temp:
| 5 |
operation
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in x().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in x().split()]
| 1 |
statement
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4<=temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
if s/4<=temp:
| 7 |
decision
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4<=temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
if s/4<=temp:
| 7 |
decision
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2 >= temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
a, b = [int(i) for i in input().split()]
temp = min(a, b)
s = abs(b+a)
d = abs(b-a)
while d/2<=temp:
d /= 2
if s/4 >= temp:
s /= 4
while s/2 >= temp:
s /= 2
print(min(s, d))
|
while d/2<=temp:
| 5 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.