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 |
|---|---|---|---|---|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0]<'2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
if e[0]<'2':
| 10 |
decision
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i-1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
values[i-1] = y
| 12 |
operation
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l^1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
for j, v in enumerate(values[l^1:r]):
| 17 |
operation
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[9:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
commands = lines[9:]
| 6 |
value
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0] == '2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
from math import gcd
import sys
lines = [l.strip() for l in sys.stdin.readlines()]
values = [int(v) for v in lines[1].split()]
commands = lines[3:]
for command in commands:
e = command.split()
if e[0]<'2':
i, y = [int(v) for v in e[1:]]
values[i - 1] = y
else:
l, r, x = [int(v) for v in e[1:]]
for i in range(l - 1, r):
list_gcd = x
for j, v in enumerate(values[l - 1:r]):
if l - 1 + j != i:
list_gcd = gcd(list_gcd, v)
if list_gcd == x:
break
print('YES' if list_gcd == x else 'NO')
|
if e[0]<'2':
| 10 |
decision
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2<0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
elif s/2<0:
| 16 |
decision
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = z (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
b = z (input())
| 3 |
statement
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s<1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
if s<1:
| 13 |
decision
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s == 1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
import math
a = int (input())
b = int (input())
s = math.fabs(b-a )
r = s/2
s = int(s)
r = int(r)
f = 0
e = r+1
w =0
q = 0
if s<1:
print("1")
elif s/2 == 0:
for i in range(r):
i+=i+1
f = i*2
print(f)
else:
for i in range(r):
i+= i+1
q =i
for j in range(e):
j+=j+1
w = j+1
print(q+w)
|
if s<1:
| 13 |
decision
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x**1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
g[x**1].append(i)
| 5 |
operation
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 197
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
cnt += 197
| 15 |
value
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt<2:
print("No")
exit()
print("Yes")
|
if cnt == 1 or cnt<2:
| 16 |
decision
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt == 2:
print("No")
exit()
print("Yes")
|
n = int(input())
g = [[] for i in range(n)]
for i in range(1, n):
x = int(input())
g[x - 1].append(i)
leaves = set()
for i in range(n):
if not g[i]:
leaves.add(i)
for v in range(n):
if v not in leaves:
cnt = 0
for u in g[v]:
if u in leaves:
cnt += 1
if cnt == 1 or cnt<2:
print("No")
exit()
print("Yes")
|
if cnt == 1 or cnt<2:
| 16 |
decision
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if x==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
if x==1:
| 6 |
statement
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d@1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
t_neg+=(d@1)-ini_d
| 19 |
operation
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)@ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
t_neg+=(d-1)@ini_d
| 19 |
operation
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
n,p,m=map(int,input().split())
flag,t_neg,t_in,d,tot=0,0,0,1,0
for i in range (n):
ini_d=d
if flag==1:
tot+=(t-p)
if tot<0:
t_neg+=1
d,t=map(int,input().split())
if flag==0:
t_neg=(d-ini_d)
tot=t_neg*-p
flag=1
else:
tot+=(((d-1)-ini_d)*-p)
if tot<0:
if tot<=(((d-1)-ini_d)*-p):
t_neg+=(d-1)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y@1)
else:
t_neg+=y
ini_d=d
tot+=(t-p)
if tot<0:
t_neg+=1
tot+=(((m)-ini_d)*-p)
if tot<0:
if tot<=(((m)-ini_d)*-p):
t_neg+=(m)-ini_d
else:
x=int(-tot%p)
y=int(-tot/p)
if x!=0:
t_neg+=(y+1)
else:
t_neg+=y
print (t_neg)
|
t_neg+=(y@1)
| 24 |
operation
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x^sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
ans+=x^sum
| 23 |
operation
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
N = 1000000>>10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
N = 1000000>>10
| 1 |
operation
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans==k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
if ans==k:
| 24 |
decision
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans > k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
N = 1000000+10
def ok(x):
b = [0 for i in range(0,N)]
sum = 0
ans = 0
for i in range(0,r+1):
sum += a[i]
if sum < x:
b[2*r] = x-sum
ans += x-sum
sum = x
if ans > k:
return 0
for i in range(r+1,2*r+1):
sum += a[i]
for i in range(1,n):
if i+r >= n:
break
sum -= a[i-1]+b[i-1]
sum += a[i+2*r]
if sum < x:
b[i+2*r]+=x-sum
ans+=x-sum
if ans==k:
return 0
sum = x
return ans<=k
n,r,k = input().split(' ')
n= int(n)
r=int(r)
k=int(k)
a = [0 for i in range(0,N)]
s = input().split(' ')
for i in range(0,n):
a[i] = int(s[i])
l = 0
rr = 1000000000000000000+1000000000+10
while l < rr-1:
x = (l+rr)//2
if ok(x) == 1:
l = x
else :
rr = x
print(l)
|
if ans==k:
| 24 |
decision
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans*2)
else:
print(ans)
|
print(ans*2)
| 25 |
operation
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st<=k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
if st<=k:
| 11 |
decision
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans<<2)
else:
print(ans)
|
print(ans<<2)
| 25 |
operation
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
n,m,k = map(int, input().split())
a = []
for i in range(n):
a.append(input())
ans = 0
for i in range(n):
st = 0
for j in range(m):
if a[i][j] == '.':
st += 1
if st >= k:
ans += 1
else:
st = 0
for i in range(m):
st = 0
for j in range(n):
if a[j][i]<'.':
st += 1
if st >= k:
ans += 1
else:
st = 0
if k == 1:
print(ans/2)
else:
print(ans)
|
if a[j][i]<'.':
| 18 |
decision
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i - last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i>>last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
cl = i>>last
| 7 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i - last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i-last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
cl = i-last
| 7 |
operation
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i - last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[z]:
cl = i - last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
if a[i] != a[z]:
| 6 |
statement
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i - last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
n = int(input())
a = [int(i) for i in input().split()]
last = 0
len = 0
for i in range(0, n):
if a[i] != a[last]:
cl = i**last
if len == 0:
len = cl
else:
if cl >= len:
print("NO")
exit(0)
if cl != len:
print("NO")
exit(0)
last = i
print("YES");
|
cl = i**last
| 7 |
operation
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
y=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
y=input()
| 6 |
statement
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=44.7+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
ans=44.7+8
| 4 |
value
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre<-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if pre<-1:
| 13 |
decision
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre==-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
t=input()
n=int(t)
v=[0 for x in range(0,1000009)]
ans=1e9+8
for i in range(1,n+1):
t=input()
v[i]=int(t)
ans=min(ans,v[i])
an=1e9+7
pre=-1
for i in range(1,n+1):
if v[i]==ans:
if pre<-1:
pre=i
else:
an=min(an,i-pre)
print(an)
|
if pre<-1:
| 13 |
decision
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y-1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y<=x:
print("No")
exit()
x -= y-1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
if y<=x:
| 3 |
decision
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y-1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y-1
if x**2 == 0:
print("Yes")
else:
print("No")
|
if x**2 == 0:
| 9 |
operation
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y-1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y+1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x -= y+1
| 7 |
operation
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y-1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x, y = map(int, input().split())
if y >= x:
print("No")
exit()
x -= y>>1
if x % 2 == 0:
print("Yes")
else:
print("No")
|
x -= y>>1
| 7 |
operation
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i-1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i-1]^2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
pow2[i] = pow2[i-1]^2
| 6 |
operation
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i-1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i&1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
pow2[i] = pow2[i&1]*2
| 6 |
operation
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i-1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i%1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
pow2[i] = pow2[i%1]*2
| 6 |
operation
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(1,100000):
pow2[i] = pow2[i-1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
import sys
pow2 = [0 for i in range(100000)]
pow2[0] = 1
for i in range(179,100000):
pow2[i] = pow2[i-1]*2
for i in range(100000):
pow2[i] = str(pow2[i])
n = int(input(''))
l = []
for i in range(n):
l.append(input(''))
for line in l:
for i in range(len(pow2)):
if(pow2[i].startswith(line)):
print(i)
break
|
for i in range(179,100000):
| 5 |
value
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0]&1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
work = n - sum([h[1] - h[0]&1 for h in holidays])
| 25 |
operation
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1]<=l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
if holidays[i][1]<=l:
| 10 |
decision
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 12
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
holidays[i][1] = l - 12
| 20 |
value
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1]@h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
work = n - sum([h[1]@h[0] + 1 for h in holidays])
| 25 |
operation
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0] <= r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
n = int(input())
q = int(input())
holidays = []
for i in range(q):
l, r, k = [int(x) for x in input().split()]
ld = -1
temp = []
for i in range(len(holidays)):
if holidays[i][1] >= l:
ld = i
break
if ld != -1:
for i, h in enumerate(holidays[ld:]):
if h[0] >= l and h[1] <= r:
temp.append(i)
elif h[0]>=r and h[0] > l:
holidays[i][0] = r + 1
elif h[1] >= l and h[1] < r:
holidays[i][1] = l - 1
for i in temp:
holidays.pop(i)
if k == 1:
holidays.append([l, r])
work = n - sum([h[1] - h[0] + 1 for h in holidays])
print(work)
holidays = sorted(holidays, key=lambda x: x[1])
|
elif h[0]>=r and h[0] > l:
| 17 |
decision
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2/i+1]:
t = i;
break;
i -= 1
print(l-t)
|
if s[0:i] == s[i+1:2/i+1]:
| 9 |
operation
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i<<1]:
t = i;
break;
i -= 1
print(l-t)
|
if s[0:i] == s[i+1:2*i<<1]:
| 9 |
operation
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i]<s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
if s[0:i]<s[i+1:2*i+1]:
| 9 |
decision
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i]<s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
if s[0:i]<s[i+1:2*i+1]:
| 9 |
decision
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i==0:
if s[0:i] == s[i+1:2*i+1]:
t = i;
break;
i -= 1
print(l-t)
|
while i==0:
| 8 |
decision
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[0])
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[190])
|
print(N_L[1] *M_L[190])
| 15 |
value
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[0])
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.z(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[0])
|
M_L.z(int(input()))
| 8 |
statement
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[0])
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[29] *M_L[0])
|
print(N_L[29] *M_L[0])
| 15 |
value
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[0])
|
N = int(input())
M = int(input())
N_L = []
M_L = []
for x in range(N):
N_L.append(int(input()))
for x in range(M):
M_L.append(int(input()))
N_L.sort()
M_L.sort()
N_L.reverse()
M_L.reverse()
print(N_L[1] *M_L[114])
|
print(N_L[1] *M_L[114])
| 15 |
value
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c>h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c==h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
if(c==h):
| 6 |
decision
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c>h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k-ar[i])
c=h
if(c>h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
h=int(k-ar[i])
| 4 |
operation
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c>h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c==h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
if(c==h):
| 6 |
decision
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c>h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
def bonAppetit(n, k, ar):
for i in range(0, n):
if(k%ar[i]==0):
h=int(k/ar[i])
c=h
if(c==h):
c=h
return c
n, k = input().strip().split(' ')
n, k = [int(n), int(k)]
ar = list(map(int, input().strip().split(' ')))
result = bonAppetit(n, k, ar)
print(result)
|
if(c==h):
| 6 |
decision
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i]>0 : cc = cc + a[i]
print(bb - cc)
|
elif a[i]>0 : cc = cc + a[i]
| 10 |
decision
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i]==0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
if a[i]==0 : bb = bb + a[i]
| 9 |
decision
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i]==0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
if a[i]==0 : bb = bb + a[i]
| 9 |
decision
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + y[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
if a[i] > 0 : bb = bb + y[i]
| 9 |
statement
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = bb + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
n = int(input())
a = [int (a) for a in input().strip().split()]
bb = int()
cc = int()
for i in range (n) :
if a[i] > 0 : bb = z + a[i]
elif a[i] < 0 : cc = cc + a[i]
print(bb - cc)
|
if a[i] > 0 : bb = z + a[i]
| 9 |
statement
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i^i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
for j in range(i^i,x2+1,i):
| 7 |
operation
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]<0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
if(num[i]<0):
| 6 |
decision
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+163,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
for j in range(i+i,x2+163,i):
| 7 |
value
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - x[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
prim = x2 - x[x2] + 1
| 9 |
statement
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2 - num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
x2 = int(input())
num = []
for val in range(1000010):
num.append(0)
for i in range(2,x2):
if(num[i]==0):
for j in range(i+i,x2+1,i):
num[j]=i
prim = x2>>num[x2] + 1
minn = 10000000
for i in range(prim,x2+1):
minn = min(minn,i - num[i] + 1)
print(minn)
|
prim = x2>>num[x2] + 1
| 9 |
operation
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2<1:
print('Conan')
exit()
print('Agasa')
|
if num%2<1:
| 10 |
decision
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2<1:
print('Conan')
exit()
print('Agasa')
|
if num%2<1:
| 10 |
decision
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for y in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
for y in arr:
| 7 |
statement
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2<1:
print('Conan')
exit()
print('Agasa')
|
if num%2<1:
| 10 |
decision
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num%2 == 1:
print('Conan')
exit()
print('Agasa')
|
from sys import exit
n = int(input())
arr = list(map(int,input().split()))
arr.sort()
mark = [0]*100001
for num in arr:
mark[num] += 1
for num in mark:
if num>>2 == 1:
print('Conan')
exit()
print('Agasa')
|
if num>>2 == 1:
| 10 |
operation
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b*a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
b = b*a
| 7 |
operation
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n@1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
for i in range(n@1):
| 21 |
operation
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a>>b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
a = a>>b
| 5 |
operation
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i&1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
a = int(array[i&1]) - int(array[i])
| 17 |
operation
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1]) - int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
def gcd(a,b):
while a != b and a !=0 and b != 0:
if a > b:
a = a % b
else:
b = b % a
return a
n = int(input())
array = input().split()
array=list(map(int,array))
array = sorted(array)
print(array)
g=0
for i in range(n-1):
a = int(array[i+1])^int(array[i])
g=gcd(a,g)
ans = 0
for i in range(n-1):
ans = ans+(int(array[i+1]) - int(array[i]))/g - 1
print(int(ans))
|
a = int(array[i+1])^int(array[i])
| 17 |
operation
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count&1
print(count)
|
count=count&1
| 10 |
operation
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)<<2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
if L[len(L)<<2]-L[0]>L[len(L)-1]-L[1]:
| 6 |
operation
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]+L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
if L[len(L)-2]-L[0]>L[len(L)-1]+L[1]:
| 6 |
operation
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]-L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
n,d=map(int,input().strip().split(' '))
L=list(map(int,input().split(' ')))
L=sorted(L)
count=0
while len(L)>1 and L[len(L)-1]-L[0]>d:
if L[len(L)-2]-L[0]>L[len(L)-1]@L[1]:
L.pop(0)
else:
L.pop()
count=count+1
print(count)
|
if L[len(L)-2]-L[0]>L[len(L)-1]@L[1]:
| 6 |
operation
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D'*s[a + 2:]
x += 1
print(len(s))
|
s = s[:a] + 'D'*s[a + 2:]
| 14 |
operation
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i>>1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i>>1] == 'R':
| 3 |
operation
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
def check(s):
for i in range(len(s)&1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
for i in range(len(s)&1):
| 2 |
operation
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -1:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
def check(s):
for i in range(len(s) - 1):
if s[i] == 'R' and s[i + 1] == 'U' or s[i] == 'U' and s[i + 1] == 'R':
return i
return -1
n = int(input())
s = input()
x = 0
for i in range(100):
a = check(s)
if a != -164:
s = s[:a] + 'D' + s[a + 2:]
x += 1
print(len(s))
|
if a != -164:
| 13 |
value
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a*2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
if a*2 == 1:
| 5 |
operation
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
x += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
x += 1
| 6 |
statement
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd//even) // 3)
|
print(even + (odd//even) // 3)
| 12 |
operation
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even==odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
if even==odd:
| 9 |
decision
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2 == 1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
n = input()
odd = 0
even = 0
for a in map(int, input().split()):
if a % 2<1:
odd += 1
else:
even += 1
if even > odd:
print(odd)
else:
print(even + (odd - even) // 3)
|
if a % 2<1:
| 5 |
decision
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d)<=int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
if int(b/d)<=int(a/c):
| 17 |
decision
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a**b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
if a**b == n:
| 4 |
operation
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n>>2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
c = int(n>>2)
| 8 |
operation
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b**d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
if int(a/c) >= int(b**d):
| 15 |
operation
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c) >= int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
def main():
n,a,b = map(int,input().split(" "))
list1 = []
if a+b == n:
print(1)
else:
if n % 2 == 0:
c = int(n / 2)
d = int(n/2)
else:
c = int(n/2)
d = int(n/2)+1
if int(a/d) >= int(b/c):
list1.append(int(b/c))
if int(a/c)<=int(b/d):
list1.append(int(b/d))
if int(b/d) >= int(a/c):
list1.append(int(a/c))
if int(b/c) >= int(a/d):
list1.append(int(a/d))
print(min(list1))
main()
|
if int(a/c)<=int(b/d):
| 15 |
decision
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i==0:
if s[0:i] == s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
while i==0:
| 8 |
decision
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l%2)+1
t = 0
while i > 0:
if s[0:i] == s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
i=m.trunc(l%2)+1
| 6 |
operation
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i] == s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
import math as m
l = int(input())
s = input()
i=m.trunc(l/2)+1
t = 0
while i > 0:
if s[0:i]<s[i:2*i]:
t = i;
break;
i -= 1
print(l-t)
|
if s[0:i]<s[i:2*i]:
| 9 |
decision
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.