input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from decimal import *
a, b, c = list(map(int, input().split()))
if Decimal(a)**Decimal("0.5") + Decimal(b)**Decimal("0.5") < Decimal(
c)**Decimal("0.5"):
print("Yes")
else:
print("No")
| a, b, c = list(map(int, input().split()))
# a + 2√ab + b < c , 2√ab < c - a - b, 4ab < (c - a - b)^2
if c - a - b < 0:
print("No")
else:
print(("Yes" if 4 * a * b < (c - a - b)**2 else "No"))
| p02743 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from decimal import *
##### リストの ... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from decimal import *
##### リストの ... | p02743 |
import decimal
a,b,c=list(map(int,input().split()))
print((["No","Yes"][decimal.Decimal(a).sqrt()+decimal.Decimal(b).sqrt()<decimal.Decimal(c).sqrt()])) | a,b,c=list(map(int,input().split()))
print((["No","Yes"][4*a*b<(c-a-b)**2 and c-a-b>0])) | p02743 |
from decimal import Decimal
a, b, c = list(map(int,input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No")
| import math
a, b, c = list(map(int, input().split()))
ab = a * b
out = c - a - b
num = ((out))**2
if out < 0:
num = -num
if 4*ab < num:
print("Yes")
else:
print("No")
| p02743 |
from decimal import Decimal
def main():
a,b,c = list(map(int, input().split(" ")))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No')
main() | def main():
a,b,c = list(map(int, input().split(" ")))
if (4 * a * b) < (c - a - b) * (c - a - b) and (c - a - b) > 0:
print('Yes')
else:
print('No')
main() | p02743 |
from math import sqrt
from decimal import *
a, b, c = list(map(int, input().split()))
"""
print(sqrt(a), sqrt(b))
print(Decimal(sqrt(a)), sqrt(b))
"""
print(("Yes" if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt() else "No")) | from math import sqrt
a, b, c = list(map(int, input().split()))
print(("Yes" if 4 * a * b < (c - a - b) ** 2 and c - a - b > 0 else "No")) | p02743 |
from decimal import *
getcontext().prec = 40000
a, b, c = list(map(int, input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No") | from decimal import *
getcontext().prec = 30000
a, b, c = list(map(int, input().split()))
# if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
if a + b + 2 * Decimal(a * b).sqrt() < c:
print("Yes")
else:
print("No") | p02743 |
a, b, c = list(map(int, input().split()))
# print(a ** 0.5, b ** 0.5, c ** 0.5)
digit = 5000
right = (c - a - b) * (10 ** digit)
ab = a * b * (10 ** (digit * 2))
sqrt_ab = 0
ans = False
for i in range(10 ** 5):
# print(i, i * i * (10 ** (digit * 2)), ab, (i - 1) * (10 ** digit))
if i * i * (10 ** (digi... | a, b, c = list(map(int, input().split()))
if c - a - b > 0 and 4 * a * b < ((c - a - b) ** 2):
print("Yes")
else:
print("No") | p02743 |
a, b, c = list(map(int, input().rstrip().split()))
from decimal import *
getcontext().prec = 100000
if (Decimal(a).sqrt() + Decimal(b).sqrt()) < Decimal(c).sqrt():
print('Yes')
else:
print('No')
| a, b, c = list(map(int, input().rstrip().split()))
from decimal import *
getcontext().prec = 500
if (Decimal(a).sqrt() + Decimal(b).sqrt()) < Decimal(c).sqrt():
print('Yes')
else:
print('No')
| p02743 |
from decimal import *
getcontext().prec = 100000
a, b, c = list(map(int, input().split()))
#print(a **.5, b**.5,c**.5)
#print(a **.5+ b**.5,c**.5)
#print(Decimal(a).sqrt() , Decimal(b).sqrt() , Decimal(c).sqrt())
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
#if a **.5 + b**.5 < c**.5:
print... | from decimal import *
getcontext().prec = 40000
a, b, c = list(map(int, input().split()))
#print(a **.5, b**.5,c**.5)
#print(a **.5+ b**.5,c**.5)
#print(Decimal(a).sqrt() , Decimal(b).sqrt() , Decimal(c).sqrt())
if Decimal(a).sqrt() + Decimal(b).sqrt() >= Decimal(c).sqrt():
#if a **.5 + b**.5 < c**.5:
print... | p02743 |
from decimal import *
getcontext().prec = 40000
a, b, c = list(map(int, input().split()))
#print(a **.5, b**.5,c**.5)
#print(a **.5+ b**.5,c**.5)
#print(Decimal(a).sqrt() , Decimal(b).sqrt() , Decimal(c).sqrt())
if Decimal(a).sqrt() + Decimal(b).sqrt() >= Decimal(c).sqrt():
#if a **.5 + b**.5 < c**.5:
print... | from decimal import *
getcontext().prec = 30000
a, b, c = list(map(int, input().split()))
#print(a **.5, b**.5,c**.5)
#print(a **.5+ b**.5,c**.5)
#print(Decimal(a).sqrt() , Decimal(b).sqrt() , Decimal(c).sqrt())
#if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
if 2 * Decimal(a * b).sqrt() + Decimal... | p02743 |
def main():
from decimal import Decimal
a, b, c = list(map(int, input().split()))
x = Decimal(a).sqrt()
y = Decimal(b).sqrt()
z = Decimal(c).sqrt()
print(('Yes' if x + y < z else 'No'))
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
... | def main():
a, b, c = list(map(int, input().split()))
if c - a - b < 0:
print('No')
return
res = 'Yes' if 4 * a * b < (c - a - b) * (c - a - b) else 'No'
print(res)
if __name__ == '__main__':
main()
| p02743 |
import math
from decimal import *
# getcontext().prec = 300
a,b,c = list(map(int,input().split()))
if Decimal(a)**Decimal('0.5') + Decimal(b)**Decimal('0.5') < Decimal(c)**Decimal('0.5'):
print("Yes")
else:
print("No")
| import math
from decimal import *
# getcontext().prec = 300
a,b,c = list(map(int,input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No")
| p02743 |
from decimal import Decimal
a,b,c=list(map(int,input().split()))
ab_=Decimal(a).sqrt()+Decimal(b).sqrt()
c_=Decimal(c).sqrt()
if ab_<c_:
print('Yes')
else:
print('No')
| a,b,c=list(map(int,input().split()))
if c-a-b>0 and 4*a*b<(c-a-b)**2:
print('Yes')
else:
print('No') | p02743 |
from decimal import *
getcontext().prec = 20000
a, b, c = [Decimal(int(i)) for i in input().split()]
if a.sqrt() + b.sqrt()-c.sqrt() < Decimal("-0."+"0"*10000+"1"):
print("Yes")
else:
print("No")
| from decimal import *
a, b, c = [Decimal(int(i)) for i in input().split()]
if a.sqrt() + b.sqrt()-c.sqrt() < Decimal("-0."+"0"*20+"1"):
print("Yes")
else:
print("No")
| p02743 |
from decimal import Decimal
a,b,c=list(map(int,input().split()))
if Decimal(a)**Decimal('0.5')+Decimal(b)**Decimal('0.5')<Decimal(c)**Decimal('0.5'):
print('Yes')
else:
print('No')
| import decimal
a,b,c=list(map(int,input().split()))
if decimal.Decimal(a)**decimal.Decimal('0.5')+decimal.Decimal(b)**decimal.Decimal('0.5')<decimal.Decimal(c)**decimal.Decimal('0.5'):
print('Yes')
else:
print('No')
| p02743 |
# -*- coding: utf-8 -*-
import sys
from decimal import Decimal
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)]... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in ... | p02743 |
from decimal import Decimal
a,b,c=list(map(int,input().split()))
print(("Yes" if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt() else "No")) | a,b,c=list(map(int,input().split()))
print(("Yes" if c-a-b>0 and 4*a*b<(c-a-b)**2 else "No")) | p02743 |
from decimal import *
def resolve():
a, b, c = list(map(int, input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No")
resolve()
| def resolve():
a, b, c = list(map(int, input().split()))
if c-a-b>0 and (c-a-b)**2 > 4*a*b:
print("Yes")
else:
print("No")
resolve() | p02743 |
from decimal import Decimal
#decimal.Decimalってしなくて済むよ
a,b,c = list(map(int,input().split()))
a = a ** Decimal("0.5")
b = b ** Decimal("0.5")
c = c ** Decimal("0.5")
a_b = a + b
if c > a_b:
print("Yes")
else:
print("No") | from decimal import Decimal
#decimal.Decimalってしなくて済むよ
a,b,c = list(map(int,input().split()))
a = a ** Decimal(0.5)
b = b ** Decimal(0.5)
c = c ** Decimal(0.5)
a_b = a + b
if c > a_b:
print("Yes")
else:
print("No")
| p02743 |
from decimal import Decimal, getcontext
a,b,c = input().split()
getcontext().prec = 10000
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a+b+Decimal(1e-14)< c:
print("Yes")
else:
print("No") | from decimal import Decimal, getcontext
a,b,c = input().split()
getcontext().prec = 65
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a+b < c:
print("Yes")
else:
print("No")
| p02743 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
a,b,c = list(map(int, readline().split()))
if c > a + b:
if c**2 + a**2 + b**2 - 2*a*c - 2*b*c + 2*a*b > 4*a*b:
print("Yes")
else:
print("No")
els... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
a,b,c = list(map(int, readline().split()))
if c - a - b > 0 and (c - a - b)**2 > 4*a*b:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| p02743 |
a,b,c=list(map(int,input().split()))
print(("Yes"if(a-b-c)**2-4*b*c>0and c-a-b>0else"No")) | a,b,c=list(map(int,input().split()))
print((["No","Yes"][(a-b-c)**2-4*b*c>0and c-a-b>0])) | p02743 |
a,b,c=list(map(int,input().split()))
print((["No","Yes"][(a-b-c)**2-4*b*c>0and c-a-b>0])) | a,b,c=list(map(int,input().split()))
print((["No","Yes"][(a-b-c)**2>4*b*c and c-a>b])) | p02743 |
from decimal import *
a,b,c = list(map(int,input().split()))
getcontext().prec = 50
if Decimal(a)**Decimal(0.5) + Decimal(b)**Decimal(0.5) < Decimal(c)**Decimal(0.5):
ans = "Yes"
else:
ans = "No"
print(ans) | a,b,c = list(map(int,input().split()))
if c-a-b > 0 and (c-a-b)**2 > 4*a*b:
ans = "Yes"
else:
ans = "No"
print(ans) | p02743 |
from decimal import Decimal
a, b, c = list(map(int,input().split()))
if (Decimal(a).sqrt() + Decimal(b).sqrt()) >= Decimal(c).sqrt():
print('No')
else:
print('Yes') | a,b,c = list(map(int, input().split()))
if 4 * a * b < (c - a - b) ** 2 and c - a - b > 0:
print('Yes')
else:
print('No')
| p02743 |
from decimal import Decimal
import math
a,b,c=list(map(int,input().split()))
if c-a-b>0 and 4*a*b<(c-a-b)**2:
print("Yes")
else:
print("No")
| a,b,c=list(map(int,input().split()))
if 4*a*b < (c-a-b)**2 and (c-a-b)>0:
print("Yes")
else:
print("No") | p02743 |
from decimal import *
import math
#getcontext().prec=100
a,b,c=list(map(int,input().split()))
if a+b+2*Decimal(a*b).sqrt()<c:
print("Yes")
else:
print("No")
| a, b, c = list(map(int,input().split()))
from decimal import *
getcontext().prec = 100
if (a + b + 2*(Decimal(a).sqrt())*(Decimal(b).sqrt()) < c):
print('Yes')
else:
print('No')
| p02743 |
from decimal import *
import math
getcontext().prec=100000
a,b,c=list(map(int,input().split()))
if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt():
print("Yes")
else:
print("No")
| from decimal import *
import math
#getcontext().prec=10000
a,b,c=list(map(int,input().split()))
if Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt():
print("Yes")
else:
print("No")
| p02743 |
import math
square_list = [i**2 for i in range(1, 10**5)]
def integer_squareroot(x):
imin = 0
imax = x
while imin <= imax:
imid = (imin + imax) // 2
imid_squared = imid ** 2
if imid_squared <= x:
imin = imid + 1
else:
imax = imid - 1
... | from decimal import Decimal
a, b, c = map(Decimal, input().split())
cond = a.sqrt() + b.sqrt() < c.sqrt()
print("Yes") if cond else print("No")
| p02743 |
from decimal import *
getcontext().prec = 7000
#import numpy as np
a, b, c = list(map(float, input().split()))
##print(a**0.5, b**0.5, c**0.5)
if Decimal(a).sqrt()+ Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No') | a, b, c = list(map(int, input().split()))
if c < (a+b):
print('No')
elif 4*a*b < (c-a-b)**2:
print('Yes')
else:
print('No') | p02743 |
from decimal import Decimal, getcontext
getcontext().prec = 1000
a, b, c = list(map(Decimal, input().split()))
print(("Yes" if a+b+Decimal(2)*((a*b)**Decimal(0.5)) < c else "No"))
| a, b, c = list(map(int, input().split()))
if c-a-b < 0:
print("No")
else:
print(("Yes" if (c-a-b)**2-4*a*b > 0 else "No"))
| p02743 |
from decimal import *
getcontext().prec = 128
a, b, c = [int(i) for i in input().split()]
print(("Yes" if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt() else "No"))
| a, b, c = [int(i) for i in input().split()]
d = c - a - b
print(('Yes' if d > 0 and d**2 > 4*a*b else 'No')) | p02743 |
from decimal import *
getcontext().prec = 20 # デフォルト28桁のところを20桁にする
a, b, c = list(map(int, input().split()))
A = Decimal(a).sqrt()
B = Decimal(b).sqrt()
C = Decimal(c).sqrt()
if A+B < C:
print("Yes")
else:
print("No")
| a, b, c = list(map(int, input().split()))
if c - a - b >= 0 and 4*(a*b) < (c - a - b)**2:
print("Yes")
else:
print("No")
| p02743 |
import sys
input = lambda: sys.stdin.readline().rstrip()
from decimal import *
a,b,c = list(map(int, input().split()))
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a + b < c:
print("Yes")
else:
print("No") | import sys
input = lambda: sys.stdin.readline().rstrip()
a,b,c = list(map(int, input().split()))
if c - a - b < 0:
print("No")
elif 4 * a * b < (c - a - b) ** 2:
print('Yes')
else:
print('No') | p02743 |
from decimal import Decimal
a, b, c = list(map(int, input().split()))
a = Decimal(a).sqrt()
b = Decimal(b).sqrt()
c = Decimal(c).sqrt()
if a + b < c:
print("Yes")
else:
print("No") | a, b, c = list(map(int, input().split()))
print(("Yes" if ((c-a-b) > 0 and 4*a*b < (c-a-b)**2) else "No"))
| p02743 |
a, b, c = list(map(int, input().split()))
from decimal import Decimal
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No') | a,b,c = list(map(int, input().split()))
if 4*a*b < (c-a-b)**2 and c-a-b > 0:
print('Yes')
else:
print('No') | p02743 |
import sys
import re
import math
import collections
import decimal
import bisect
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.s... | import sys
import re
import math
import collections
import decimal
import bisect
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda: list(map(int, sys.s... | p02743 |
from decimal import Decimal
a,b,c=list(map(int,input().split()))
if(Decimal(a).sqrt()+Decimal(b).sqrt()<Decimal(c).sqrt()):
print("Yes")
else:
print("No") | a,b,c=list(map(int,input().split()))
print(("Yes" if 4*a*b<(c-a-b)**2 and c-a-b>0 else "No")) | p02743 |
from decimal import Decimal
a, b, c = [int(i) for i in input().strip().split()]
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No")
| import sys
input = sys.stdin.readline
def main():
a, b, c = list(map(int, input().split()))
y = (c - (a+b))**2 - 4*a*b
if c-(a+b) > 0 and y > 0:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| p02743 |
from decimal import *
getcontext().prec = 100000
a, b, c = list(map(int, input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No')
| from decimal import *
getcontext().prec = 50
a, b, c = list(map(int, input().split()))
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print('Yes')
else:
print('No')
| p02743 |
from decimal import *
getcontext().prec=3000
a,b,c=list(map(int,input().split()))
print(('Yes' if Decimal(a)**Decimal(0.5)+Decimal(b)**Decimal(0.5)<Decimal(c)**Decimal(0.5) else 'No')) | a,b,c=list(map(int,input().split()))
print(('Yes' if c-a-b>0 and 4*a*b<(c-a-b)**2 else 'No')) | p02743 |
a,b,c = list(map(int,input().split()))
if c-(a+b) < 0:
print('No')
else:
if 4*a*b < (c-(a+b))**2:
print('Yes')
else:
print('No') | a,b,c = list(map(int,input().split()))
if c-(a+b) < 0:
print('No')
elif 4*a*b < (c-(a+b))**2:
print('Yes')
else:
print('No') | p02743 |
a, b, c = list(map(int, input().split()))
ab = 4*a*b
cab = c - a - b
if cab <= 0:
print("No")
elif cab**2 - ab > 0:
print("Yes")
else:
print("No") | a, b, c = list(map(int, input().split()))
if c - a - b > 0:
if 4*a*b < c*c + (a + b)*(a + b - 2*c):
print("Yes")
exit()
print("No") | p02743 |
#!/usr/bin/env python3
from decimal import *
a, b, c = list(map(int, input().split()))
if a+b>c:
print('No')
exit()
X = (a+b-c)**2
Y = a*b*4
if (Y<X):
print('Yes')
else:
print('No')
| #!/usr/bin/env python3
a, b, c = list(map(int, input().split()))
if a+b>c:
print('No')
exit()
f1 = 4*a*b - 2*a*b + 2*c*a + 2*b*c
f2 = c**2 + b**2 + a**2
if f1 < f2:
print('Yes')
else:
print('No')
| p02743 |
import sys
import copy
from collections import deque
stdin = sys.stdin
mod = 10**9+7
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, k = na()
a = na()
def calc_lux(a):
res = [0 for _ in range(len(a))]... | import sys
import copy
from collections import deque
stdin = sys.stdin
mod = 10**9+7
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n, k = na()
a = na()
def calc_lux(a):
imosu = [0 for _ in range(len(a)... | p02647 |
N,K=list(map(int,input().split()))
T=list(map(int,input().split()))
if K==0:
print(T)
exit()
if N<=K:
L=[N]*N
print(L)
#S = [[0 for j in range(3)] for i in range(2)] 2行3列の場合
S = [[0 for j in range(N)] for i in range(K+1)]
for i in range(N):
S[0][i]=T[i]
#print(S)
for i in range(K)... | N,K=list(map(int,input().split()))
T=list(map(int,input().split()))
if K==0:
print(T)
exit()
if N<=K:
L=[N]*N
print(L)
if K>100:
K=100
#S = [[0 for j in range(3)] for i in range(2)] 2行3列の場合
S = [[0 for j in range(N)] for i in range(K+1)]
for i in range(N):
S[0][i]=T[i]
#pr... | p02647 |
from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(K):
if A == [N] * N:
break
B = [0] * (N+1)
for i, a in enumerate(A):
start = max(0, i - a)
end = min(N-1, i + a) + 1
B[start] += 1
... | from itertools import accumulate
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for _ in range(K):
if A == [N] * N:
break
B = [0] * (N+1)
for i, a in enumerate(A):
start = max(0, i - a)
end = min(N-1, i + a) + 1
B[start] += 1
... | p02647 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
# import numpy as np
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.st... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | p02647 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()... | p02647 |
N, K = list(map(int, input().split()))
A = [int(i) for i in input().split()]
DP = [[0 for _ in range(N)] for _ in range(K+1)]
for i in range(N):
DP[0][i] = A[i]
for i in range(1, K+1,1):
for j in range(N):
pl, mi = min(j + DP[i-1][j], N-1), max(j - DP[i-1][j], 0)
for k in range(mi, pl+... | import sys
N, K = list(map(int, input().split()))
if K > 42:
print((" ".join(map(str, [N] * N))))
sys.exit()
A = [int(i) for i in input().split()]
DP = [[0 for _ in range(N)] for _ in range(K+1)]
for i in range(N):
DP[0][i] = A[i]
for i in range(1, K+1,1):
B = [0] * N
for j in range(N):... | p02647 |
import copy
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
maxed={}
for m in range(0,k):
temp=[0]*n
if len(maxed)==n:
print((' '.join(map(str,a))))
for i in range(0,n):
d=a[i]
if d==n:
temp[i]=n
maxed[i]=1
elif d !=0... | import copy
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
maxed={}
for m in range(0,k):
temp=[0]*n
if len(maxed)==n:
print((' '.join(map(str,a))))
exit()
for i in range(0,n):
d=a[i]
if d==n:
temp[i]=n
maxed[i]=1
... | p02647 |
import sys
from collections import deque
import copy
import math
def main():
N, K = map(int, input().split())
a = [float(i) for i in input().split()]
A = [0] * (N + 1)
if K >= 41:
for i in range(1, N+1):
if i > 1:
print(' ', end='')
print(N, en... | import sys
from collections import deque
import copy
import math
def main():
N, K = map(int, input().split())
a = [int(i) for i in input().split()]
A = [0] * (N + 1)
if K >= 41:
for i in range(1, N+1):
if i > 1:
print(' ', end='')
print(N, end=... | p02647 |
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
for i in range(K):
a = [0] * N
for n, A_n in enumerate(A):
b_min = 0 if n-A_n < 0 else n-A_n
b_max = N-1 if n+A_n > N-1 else n+A_n
b = [0] * (b_min) + [1] * (b_max+1 - b_min) + [0] * (N - b_max - 1)
a = [ x ... | import math
N, K = list(map(int, input().split(" ")))
A = list(map(int, input().split(" ")))
for i in range(min(41, K)):
B = [0] * N
for n, A_n in enumerate(A):
B_min = max(0, n-A_n)
b_max = min(N-1, n+A_n)
B[B_min] += 1
if b_max+1 < N:
B[b_max+1] -= 1
sum = 0
for n in ... | p02647 |
#!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import functools
import heapq
import itertools
import logging
import math
import os
import random
import string
import sys
from argparse i... | #!/usr/bin/env python3
# vim: set fileencoding=utf-8
# pylint: disable=unused-import, invalid-name, missing-docstring, bad-continuation
"""Module docstring
"""
import functools
import heapq
import itertools
import logging
import math
import os
import random
import string
import sys
from argparse i... | p02647 |
# 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for _ in range(k):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)] -= 1
... | # 問題文の意味がわからんコンテスト
# 0の場合も自分自身を照らす、っての気づくところからやっと読解
# Kを5000兆回やったあとはすべての要素がNになっとる この収束はわりと早いらしい
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for _ in range(min(k, 100)):
b = [0] * (n + 1)
for i in range(n):
b[max(0, i - a[i])] += 1
b[min(n, i + a[i] + 1)... | p02647 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
import sys
import math
if K > 3.5962*math.log(N):
A = [N]*N
print((' '.join(map(str, A))))
sys.exit()
lenA = len(A)
for i in range(K):
B = [0 for _ in range(lenA)]
# print(B)
for j in range(lenA):
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
lenA = len(A)
for i in range(K):
B = [0 for _ in range(lenA)]
# print(B)
for j in range(lenA):
num = A[j]
# print(j, num)
if j - num >= 0:
B[max(0, j - num)] += 1
else:
... | p02647 |
n, k = list(map(int, input().split()))
a = list(map(int , input().split()))
for i in range(k):
tmp = [0] * n
for j in range(n):
for k in range(a[j]*2+1):
if (j - a[j] + k) >= 0 and (j - a[j] + k) < n:
tmp[(j - a[j] + k)] += 1
if min(a) == n:
print... | n, k = list(map(int, input().split()))
a = list(map(int , input().split()))
for i in range(k):
s = [0] * (n + 1)
for j in range(n):
l = max(0, j - a[j])
r = min(n, j + a[j]+1)
s[l] += 1
s[r] += -1
m = s[0]
for j in range(1,n+1):
s[j] += s[j-1]
... | p02647 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02647 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
n, k = geta(int)
a =... | import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
n, k = geta(int)
a =... | p02647 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
import heapq # heapqライブラリのimport
#heapq.heapify(a) # リストを優先度付きキューへ
#heapq.heappop(a) # 最小値の取り出し
#heapq.heappush(a, -2)
import copy
for unko in range(min(k,50)):
denkyu=[]
heapq.heapify(denkyu)
cnt=0
ans=[0]*n
... | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for _ in range(k):
imos=[0]*(n+1)
for i in range(n):
imos[max(0,i-a[i])]+=1
imos[min(n,1+i+a[i])]-=1
a[0]=imos[0]
if a[0]==n:
flag=0
else:
flag=1
for i in range(1,n):
... | p02647 |
import math
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for j in range(min(K,int(2*(math.log2(N)))+1)):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print((' '.joi... | import math
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
for j in range(min(K,int(2*(math.log2(N)))+10)):
B = [0]*N
for i in range(N):
l = max(0,i-A[i])
r = min(N-1,i+A[i])
B[l] += 1
if r < N-1:
B[r+1] -= 1
for i in range(1,N):
B[i] += B[i-1]
A = B
print((' '.jo... | p02647 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
K = min(K, 50)
for _ in range(K):
imos = [0] * (N + 1)
for i in rang... | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
K = min(K, 100)
for _ in range(K):
imos = [0] * (N + 1)
for i in ran... | p02647 |
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return ... | import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_()... | p02647 |
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.... | #import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.... | p02647 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for j in range(k):
b = [0]*n
for i in range(n):
l = max(0, i-a[i])
r = min(n, i+a[i]+1)
b[l] += 1
if r < n:
b[r] -= 1
for i in range(1, n):
b[i]+=b[i-1]
a = b
if a.count(n) == n:
break
prin... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for j in range(min(k, 41)):
b = [0]*n
for i in range(n):
l = max(0, i-a[i])
r = min(n, i+a[i]+1)
b[l] += 1
if r < n:
b[r] -= 1
for i in range(1, n):
b[i]+=b[i-1]
a = b
print((" ".join(list(map(st... | p02647 |
def examA():
S = SI()
ans = S[:3]
print(ans)
return
def examB():
A, V = LI()
B, W = LI()
T = I()
L = abs(A-B)
v = V-W
if v*T>=L:
ans = "YES"
else:
ans = "NO"
print(ans)
return
def examC():
# 区間加算、上書き、一点取得
class SegmentTre... | def examA():
S = SI()
ans = S[:3]
print(ans)
return
def examB():
A, V = LI()
B, W = LI()
T = I()
L = abs(A-B)
v = V-W
if v*T>=L:
ans = "YES"
else:
ans = "NO"
print(ans)
return
def examC():
N, K = LI()
A = LI()
for _ ... | p02647 |
#coding; utf-8
import copy
N, k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = [0] * N
A = [0] + A
#B = copy.copy(A)
for j in range(k):
#print(A)
n_light = [0] * (N+1)
for i in range(N):
d = A[i+1]
l = i+1-d
r = i+1+d
#print(l, r)
... | #coding; utf-8
import copy
N, k = list(map(int,input().split()))
A = list(map(int,input().split()))
B = [0] * N
A = [0] + A
#B = copy.copy(A)
#k = 10
for j in range(k):
#print(A)
n_light = [0] * (N+1)
for i in range(N):
d = A[i+1]
l = i+1-d
r = i+1+d
#print(l, ... | p02647 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k):
acc = [0 for j in range(n+1)]
for j in range(n):
acc[max(0, j - a[j])] += 1
acc[min(n-1, j + a[j]) + 1] -= 1
for j in range(n):
acc[j+1] += acc[j]
a = acc[:-1]
if sum(a) ==... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for i in range(k):
acc = [0 for j in range(n+1)]
for j in range(n):
acc[max(0, j - a[j])] += 1
acc[min(n-1, j + a[j]) + 1] -= 1
for j in range(n):
acc[j+1] += acc[j]
a = acc[:-1]
if sum(a) ==... | p02647 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.rea... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [-int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.rea... | p02647 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for _ in range(k):
add_a=[0]*(n+1)
for i in range(n):
a[i]
add_a[max(0,i-a[i])]+=1
add_a[min(n,i+a[i]+1)]-=1
tmp=0
for i in range(n):
tmp+=add_a[i]
a[i]=tmp
print((' '.join(map(str,a))))
| n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
for _ in range(min(k,int(n**0.5)+10)):
add_a=[0]*(n+1)
for i in range(n):
a[i]
add_a[max(0,i-a[i])]+=1
add_a[min(n,i+a[i]+1)]-=1
tmp=0
for i in range(n):
tmp+=add_a[i]
a[i]=tmp
print((' '.join(map(str,a))))
| p02647 |
def main():
n,k,*a=list(map(int,open(0).read().split()))
for _ in range(k):
b=[0]*n
m=10**18
for i,t in enumerate(a):
if t<m:m=t
b[max(0,i-t)]+=1
if i-~t<n:b[i-~t]-=1
if m>n:break
for i in range(n-1):b[i+1]+=b[i]
a=b
... | def main():
n,k,*a=list(map(int,open(0).read().split()))
for _ in range(k):
b=[0]*n
m=10**18
for i,t in enumerate(a):
if t<m:m=t
b[max(0,i-t)]+=1
if i-~t<n:b[i-~t]-=1
if m>=n:break
for i in range(n-1):b[i+1]+=b[i]
a=b... | p02647 |
def main():
from itertools import accumulate
n,k,*a=list(map(int,open(0).read().split()))
for _ in range(k):
b=[0]*n
for i,t in enumerate(a):
b[i-t if i>t else 0]+=1
if i-~t<n:b[i-~t]-=1
*a,=accumulate(b)
if min(a)==n:break
print((' '.joi... | def main():
from itertools import accumulate
n,k,*a=list(map(int,open(0).read().split()))
for _ in range(k):
b=[0]*n
for i,t in enumerate(a):
if(j:=i-t)<0:j=0
b[j]+=1
if(j:=i-~t)<n:b[j]-=1
*a,=accumulate(b)
if min(a)==n:break
... | p02647 |
import math
N,K=list(map(int,input().split()))
A=[0]*N
A=list(map(int,input().split()))
da=[0 for i in range(N)]
for k in range(K):
B=[0 for i in range(N)]
for i in range(N):
l=max(0,i-A[i])
r=min(N-1,i+A[i])
B[l]=B[l]+1
if(r+1<N):
B[r+1]=B[r+1]-1
f... | import math
N,K=list(map(int,input().split()))
A=[0]*N
A=list(map(int,input().split()))
da=[0 for i in range(N)]
for k in range(K):
B=[0 for i in range(N)]
for i in range(N):
l=max(0,i-A[i])
r=min(N-1,i+A[i])
B[l]=B[l]+1
if(r+1<N):
B[r+1]=B[r+1]-1
f... | p02647 |
def resolve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
bn1 = [0] * n
bn2 = [0] * n
s = 0
t = 0
chec=0
for _ in range(k):
for i in range(n):
b1 = max(i - a[i], 0)
b2 =... | def resolve():
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
bn1 = [0] * n
s = 0
t = 0
chec = 0
for _ in range(k):
for i in range(n):
b1 = max(i - a[i], 0)
b2 = min(i + a[i], n - 1)... | p02647 |
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import rand... | # coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import rand... | p02647 |
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import rand... | # coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict
from collections import deque
import collections
from fractions import Fraction
import bisect
from queue import PriorityQueue
import itertools
from itertools import accumulate
from copy import deepcopy
import rand... | p02647 |
n, k = list(map(int, input().split()))
As = list(map(int, input().split()))
def change(arr):
newAs = [0] * n
for i, a in enumerate(arr):
for t in range(max(i - a, 0), min(i + a + 1, n)):
newAs[t] += 1
return newAs
for temp in range(min(k, 40)):
As = change(As)
print((' '.join(map... | import math
from itertools import accumulate
n, k = list(map(int, input().split()))
As = list(map(int, input().split()))
for i in range(min(41, k)):
_As = [0]*(n+1)
for j in range(n):
l = max(0, j - As[j])
r = min(n - 1, j + As[j])
_As[l] += 1
_As[r+1] -= 1
As = list(accumulate(_As))[:-... | p02647 |
from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, factorial
from itertools import permutations, combinations, combinations_with_replacement
from operator import mul
from functools import reduce
import bisect
MOD = 10**9 + 7
INF = float('inf')
N, K = list(map(int,... | from copy import copy, deepcopy
from collections import Counter
from math import sqrt, floor, factorial, log
from itertools import permutations, combinations, combinations_with_replacement
from operator import mul
from functools import reduce
import bisect
MOD = 10**9 + 7
INF = float('inf')
N, K = list(map... | p02647 |
import math
from collections import Counter
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for _ in range(k):
l = []
b = [0]*n
for i in range(1, n+1):
x = math.ceil(i-a[i-1]-0.5)
y = math.floor(i+a[i-1]+0.5)
l += list(range(x, y+1))
c ... | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
for _ in range(k):
l = []
b = [0]*n
for i in range(1, n+1):
x = i-a[i-1]-0.5
y = i+a[i-1]+0.5
l.append([x, y])
for j in range(1, n+1):
for x, y in l:
if x <= j <= y:
... | p02647 |
N, W = list(map(int, input().split()))
dp = [0]*(W+1)
max_weight = 0
for i in range(N):
v, w, m = list(map(int, input().split()))
n = 1
while m > 0:
m -= n
_v, _w = v*n, w*n
max_weight = min(W, max_weight + _w)
for k in range(max_weight, _w-1, -1):
if d... | N, W = list(map(int, input().split()))
dp = [0]*(W+1)
max_w = 0
for i in range(N):
v, w, m = list(map(int, input().split()))
n = 1
while m > 0:
m -= n
_v, _w = v*n, w*n
max_w = W if max_w+_w > W else max_w+_w
for k in range(max_w, _w-1, -1):
if dp[k] < ... | p02320 |
n, w = list(map(int, input().split()))
value = []
weight = []
num = []
for _ in range(n):
vi, wi, ni = list(map(int, input().split()))
value.append(vi)
weight.append(wi)
num.append(ni)
def to_digit(x):
acc = 1
ret = [0]
while x >= acc:
ret.append(acc)
x -= acc
acc *= 2
... | def main():
n, w = list(map(int, input().split()))
value = []
weight = []
num = []
for _ in range(n):
vi, wi, ni = list(map(int, input().split()))
value.append(vi)
weight.append(wi)
num.append(ni)
def to_digit(x):
acc = 1
ret = [0]
while x >= acc:
... | p02320 |
n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
for _ in range(n):
value, weight, amount = list(map(int, input().split()))
for i in range(knapsack - weight, -1, -1):
if dp[i] < 0:
continue
for j in range(1, amount + 1):
new_in... | n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
for _ in range(n):
value, weight, amount = list(map(int, input().split()))
for i in range(knapsack - weight, -1, -1):
if dp[i] < 0:
continue
for j in range(1, amount + 1):
new_in... | p02320 |
n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
for _ in range(n):
value, weight, amount = list(map(int, input().split()))
for i in range(knapsack - weight, -1, -1):
if dp[i] < 0:
continue
for j in range(1, amount + 1):
new_in... | n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
items = [list(map(int, input().split())) for _ in range(n)]
for value, weight, amount in items:
k = 0
while amount:
take = min(amount, 1 << k)
amount -= take
gv, gw = value * take, weight * take... | p02320 |
n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
items = [list(map(int, input().split())) for _ in range(n)]
for value, weight, amount in items:
k = 0
while amount:
take = 1 << k
if take > amount:
take = amount
amount -= take
... | n, knapsack = list(map(int, input().split()))
dp = [-1] * (knapsack + 1)
dp[0] = 0
items = [list(map(int, input().split())) for _ in range(n)]
for value, weight, amount in items:
k = 0
while amount:
take = 1 << k
if take > amount:
take = amount
amount -= take
... | p02320 |
while 1:
n=int(eval(input()))
if not n:break
f=1
L={}
for a,b,c in [list(map(int,input().split())) for i in range(n)]:
a=str(a)
d=b*c
if a in L:
if L[a]>=1e6:continue
L[a]+=d
else:L[a]=d
if L[a] >= 1e6:
print(a)
f=0
if f:print('NA') | while 1:
n=int(eval(input()))
if not n:break
f=1
L={}
for a,b,c in [input().split() for i in range(n)]:
d=int(b)*int(c)
if a in L:
if L[a]>=1e6:continue
L[a]+=d
else:L[a]=d
if L[a]>=1e6:
print(a)
f=0
if f:print('NA') | p00100 |
# coding: utf-8
# Here your code !
employeeSalesList = []
def resetDataset():
del employeeSalesList[0 : len(employeeSalesList) + 1]
def readDataCount():
return int(eval(input()))
def searchEmployeeSales(employeeId):
for data in employeeSalesList:
if data[0] == employeeId:
... | # coding: utf-8
# Here your code !
employeeSalesList = []
def resetDataset():
del employeeSalesList[0 : len(employeeSalesList) + 1]
def readDataCount():
return int(eval(input()))
def searchEmployeeSales(employeeId):
for data in employeeSalesList:
if data[0] == employeeId:
... | p00100 |
n = int(eval(input()))
li = [int(x) for x in input().split()]
X = sum(li)
ans = 100000000000
lix = []
for i in range(n-1):
lix = li[:i+1]
ans =min(ans ,abs(X - sum(lix)*2))
print(ans) | from itertools import accumulate
n = int(eval(input()))
li = [int(x) for x in input().split()]
X = list(accumulate(li))
ans = float("inf")
for i in range(n-1):
ans =min(ans ,abs(X[-1] - X[i]*2))
print(ans) | p03659 |
n=int(eval(input()))
a=list(map(int,input().split()))
sa=sum(a)
hantei=2*(10**9)+1
sx=0
for i in range(len(a)-1):
sx+=a[i]
if abs(sa-2*sx)<hantei:
hantei=abs(sa-2*sx)
print(hantei) | n=int(eval(input()))
#a,b=map(int,input().split())
a=list(map(int,input().split()))
#n=int(input())
#s=input()
sa=sum(a)
ans=10**10+1
x=0
for i in range(0,n-1):
x+=a[i]
if abs(2*x-sa)<ans:
ans=abs(2*x-sa)
print(ans) | p03659 |
def main():
n = int(eval(input()))
a = [int(x) for x in input().split()]
for i in range(1, n):
a[i] += a[i - 1]
answer = float("inf")
for i in range(n - 1):
answer = min(answer, abs(a[-1] - 2 * a[i]))
print(answer)
if __name__ == '__main__':
main()
| def main():
n = int(eval(input()))
a = list(map(int, input().split()))
for i in range(1, n):
a[i] += a[i - 1]
ans = float("inf")
for i in range(n - 1):
ans = min(ans, abs(a[-1] - 2 * a[i]))
print(ans)
if __name__ == '__main__':
main()
| p03659 |
N = int(eval(input()))
A = list(map(int, input().split()))
ans = abs(A[0] - sum(A[1:]))
for i in range(1, N-1):
ans = min(abs(sum(A[:i]) - sum(A[i:])), ans)
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
X = sum(A)
xi = A[0]
ans = abs(X - 2 * A[N-1])
for i in range(1, N-1):
xi += A[i]
ans = min(abs(X - 2 * xi), ans)
print(ans) | p03659 |
n=int(eval(input()))
a=list(map(int,input().split()))
s=sum(a)
mi=10**15
for i in range(1,len(a)):
s1=sum(a[0:i])
s2=s-s1
#print(s1,s2)
mi=min([mi,abs(s1-s2)])
print(mi) | import sys
n=int(eval(input()))
a=list(map(int,input().split()))
s=sum(a)
if(n==2):
mi=abs(a[0]-a[1])
else:
mi=10**15
s1=a[0]
for i in range(1,len(a)-1):
s1+=a[i]
s2=s-s1
#print(s1,s2)
mi=min([mi,abs(s1-s2)])
print(mi)
| p03659 |
n = int(eval(input()))
a = list(map(int,input().split()))
ans = float("Inf")
for i in range(1,n):
ans = min(ans,abs(sum(a[:i])-sum(a[i:])))
print(ans) | n = int(eval(input()))
a = list(map(int,input().split()))
b = sum(a)
c = 0
ans = float("Inf")
for i in range(n-1):
c += a[i]
b -= a[i]
ans = min(ans,abs(b-c))
print(ans) | p03659 |
n = int(eval(input()))
a = list(map(int, input().split()))
total = sum(a)
ans = float("inf")
for i in range(n-1):
x = sum(a[:i+1])
y = total - x
if(abs(x-y) < ans):
ans = abs(x-y)
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
total = sum(a)
x = 0
ans = float("inf")
for i in range(n-1):
x += a[i]
y = total - x
if(abs(x-y) < ans):
ans = abs(x-y)
print(ans) | p03659 |
from itertools import accumulate
eval(input())
a = list(map(int, input().split()))
b = list(accumulate(a))
c = [abs(y * 2 - b[-1]) for y in b][:-1]
print((min([abs(y * 2 - b[-1]) for y in b][:-1]))) | from itertools import accumulate
eval(input())
a = list(map(int, input().split()))
b = list(accumulate(a))
print((min([abs(y * 2 - b[-1]) for y in b][:-1]))) | p03659 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = []
for i in range(1,N):
a = sum(A[:i])
b = sum(A[i:])
B.append(abs(a-b))
print((min(B)))
| N = int(eval(input()))
A = list(map(int,input().split()))
sum_A = sum(A)
ans = 10**20
X = 0
for a in A[:-1]:
X += a
ans = min(ans,abs(sum_A-2*X))
print(ans)
| p03659 |
n=int(eval(input()))
a=list(map(int,input().split()))
ans=[]
for i in range(1,n):
x=sum(a[0:i])
y=sum(a[i:])
ans.append(abs(x-y))
print((min(ans))) | n=int(eval(input()))
a=list(map(int,input().split()))
total=sum(a)
ans=[]
x=0
for i in range(n-1):
x+=a[i]
y=total-x
ans.append(abs(x-y))
print((min(ans))) | p03659 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
from itertools import accumulate
N = int(eval(input())) # len(A)
A = list(map(int, input().split()))
B = [0] + A
B = list(accumulate(B)) # 累積和を格納したリスト作成
# この問題は長さが1-Nの連続部分の和の最大値を出せというものなので以下の通り
ans=... | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
from itertools import accumulate
N = int(eval(input())) # len(A)
A = list(map(int, input().split()))
B = [0] + A
B = list(accumulate(B)) # 累積和を格納したリスト作成
ans=10**18
for i in range(1, N):
snu... | p03659 |
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
N = int(eval(input()))
a = [int(i) for i in input().split()]
sum_a = sum(a)
ans = 10**10
for i in range(1,N):
x = sum(a[:i])
ans = min(ans,abs(sum_a-2*x))
print(a... | # encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
N = int(eval(input()))
a = [int(i) for i in input().split()]
sum_a = sum(a)
ans = 10**10
x = 0
for i in range(N-1):
x += a[i]
ans = min(ans,abs(sum_a-2*x))
print... | p03659 |
N = int(eval(input()))
A = list(map(int, input().split()))
s = []
for i in range(1, N):
s.append(abs(sum(A[0:i]) - sum(A[i:])))
print((min(s))) | N = int(eval(input()))
A = list(map(int, input().split()))
ans = float('inf')
snu = 0
ara = sum(A)
for a in A[0:-1]:
snu += a
ara -= a
ans = min(ans, abs(snu - ara))
print(ans) | p03659 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.