input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import itertools
N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
B = list(itertools.combinations(P, K))
ans = []
if N == 1:
print((P[0]))
exit(0)
for b in B:
ans.append(sum(b))
print((min(ans))) | N, K = list(map(int, input().split()))
P = list(map(int, input().split()))
P.sort()
print((sum(P[0:K]))) | p02628 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
p.sort()
ans = 0
for i in range(k):
ans += p.pop(0)
print(ans) | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
p.sort()
ans = sum(p[:k])
print(ans) | p02628 |
import itertools
import sys
from typing import Callable, NoReturn, Tuple
def main() -> NoReturn:
readline: Callable[[], str] = sys.stdin.readline
n, k = list(map(int, readline().rstrip().split())) # type: int,...
p: Tuple[int] = tuple(int(_) for _ in readline().rstrip().split())
if k < n // 2:
answer: int = 10 ** 6
for combinations in itertools.combinations(p, k):
sum_of_comb: int = sum(combinations)
if sum_of_comb < answer:
answer = sum_of_comb
else:
not_chosen: int = 0
for combinations in itertools.combinations(p, n - k):
sum_of_comb: int = sum(combinations)
if sum_of_comb > not_chosen:
not_chosen = sum_of_comb
answer: int = sum(p) - not_chosen
print(answer)
if __name__ == '__main__':
main()
| import itertools
import sys
from typing import Callable, List, NoReturn
def main() -> NoReturn:
readline: Callable[[], str] = sys.stdin.readline
n, k = list(map(int, readline().rstrip().split())) # type: int,...
p: List[int] = [int(_) for _ in readline().rstrip().split()]
p.sort()
print((sum(p[:k])))
if __name__ == '__main__':
main()
| p02628 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
p.sort()
ans = int(0)
for i in range(min(n,k)):
ans += p[i]
print(ans) | n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
print((sum(sorted(p)[0:k]))) | p02628 |
N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
p.sort()
count = 0
for i in range(K):
count += p[i]
print(count) | N, K = list(map(int, input().split()))
p = list(map(int, input().split()))
pin = p.sort()
print((sum(p[:K]))) | p02628 |
n, k = list(map(int, input().split()))
P = sorted(list(map(int, input().split())))
ans = 0
for p in P[:k]:
ans += p
print(ans) | n, k = list(map(int, input().split()))
P = sorted(list(map(int, input().split())))
ans = sum(P[:k])
print(ans) | p02628 |
n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
import itertools
comb = list(itertools.combinations(p, k))
ans = 100000000000
for i in range(len(comb)):
ans = min(ans, sum(comb[i]))
print(ans)
| n, k = list(map(int, input().split()))
p = list(map(int, input().split()))
import itertools
comb = list(itertools.combinations(p, k))
ans = 100000000
for i in range(len(comb)):
ans = min(ans, sum(comb[i]))
print(ans)
| p02628 |
N = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
flag = "Yes"
for i in range(N):
A_max = max(a)
B_max = max(b)
if A_max > B_max:
flag = "No"
else:
del a[a.index(A_max)]
del b[b.index(B_max)]
print(flag)
| N = int(eval(input()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = 0
for i in range(N):
if b[i] - a[i] > 0:
c += (b[i] - a[i])//2
elif b[i] - a[i] < 0:
c += b[i] - a[i]
if c >= 0:
print("Yes")
else:
print("No")
| p03438 |
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def ceil(x, y):
return -(-x // y)
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
sa = sum(B) - sum(A)
x = 0
y = 0
for i in range(N):
if A[i] == B[i]:
continue
elif A[i] > B[i]:
x += A[i] - B[i]
else:
y += ceil(B[i] - A[i], 2)
if x <= sa and y <= sa:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
| import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
acnt = 0
bcnt = 0
for i in range(N):
if A[i] == B[i]:
continue
elif A[i] > B[i]:
bcnt += A[i] - B[i]
else:
acnt += -(-(B[i] - A[i]) // 2)
bcnt += (B[i] - A[i]) % 2
if acnt < bcnt:
print("No")
else:
print("Yes")
if __name__ == '__main__':
main()
| p03438 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = sum(b) - sum(a)
s, t = 0, 0
for i in range(n):
if a[i] < b[i]:
if (b[i] - a[i]) % 2:
s += 1
t += 1
s += (b[i] - a[i]) // 2
else:
t += (a[i] - b[i])
if s < max(s, t):
print('No')
else:
print('Yes') | n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
t = sum(b)-sum(a)
res=0
for i in range(n):
if b[i]>a[i]:
res += (b[i]-a[i]+1)//2
if res > t:
print('No')
else:
print('Yes') | p03438 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = []
for i in range(n):
c.append(b[i]-a[i])
d = 0
for i in range(n):
if c[i]<0:
d+=-c[i]
c[i]=0
for i in range(n):
d-=c[i]//2
if d<=0:
print('Yes')
else:
print('No')
| n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
d = 0
for i in range(n):
c= b[i]-a[i]
if c<0:
d+=-c
else:
d-=c//2
print(('Yes' if d<1 else 'No'))
| p03438 |
n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if sum(A)>sum(B):
ans='No'
else:
l=sum(B)-sum(A)
cnt_a=l*2
cnt_b=l
for i in range(n):
if A[i]>B[i]:
cnt_b-=(A[i]-B[i])
else:
if (B[i]-A[i])%2==0:
cnt_a-=(B[i]-A[i])
else:
cnt_a-=(B[i]-A[i])+1
cnt_b-=1
if cnt_a==cnt_b and cnt_a>=0:
ans='Yes'
else:
ans='No'
print(ans) | n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
if sum(A)>sum(B):
ans='No'
else:
c=0
d=0
for a,b in zip(A,B):
if a<b:
d+=(b-a)//2+(b-a)%2
c+=(b-a)%2
else:
c+=a-b
if d>=c:
ans='Yes'
else:
ans='No'
print(ans) | p03438 |
# やっていることは単純だが、何故これで正しい答えが出るのかよくわからない
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
la = 0
lb = 0
for i in range(N):
if a[i] > b[i]:
la += a[i] - b[i]
elif b[i] > a[i]:
lb += (b[i] - a[i]) // 2
if lb >= la:
print("Yes")
else:
print("No")
| # a_i <= b_iなら同じidxを選ぶことで揃えられる
# 操作A : a_i > b_i で b_i +=1
# sum(a-b)回「行う必要がある」
# 操作B : a_j < b_j で (この条件を外れない範囲まで)a_j +=2
# sum((b-a)//2) 回「まで行える」
# ex. b-a==1 なら操作Bは行えない
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
la = 0
lb = 0
for i in range(N):
if a[i] > b[i]:
la += a[i] - b[i]
elif b[i] > a[i]:
lb += (b[i] - a[i]) // 2
if lb >= la:
print("Yes")
else:
print("No")
| p03438 |
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if sum(a) == sum(b):
if a == b:
print("Yes")
else:
print("No")
elif sum(a) > sum(b):
print("No")
else:
for i in range(sum(b)-sum(a)):
flg1 = 0
flg2 = 0
for j in range(N):
if flg1 == 1 and flg2 ==1:
break
if a[j] < b[j] and flg1 == 0:
a[j] += 2
flg1 = 1
if (abs(a[j]-b[j]))%2 == 1:
b[j] += 1
flg2 = 1
if flg2 == 0:
if b[j] < a[j]:
b[j] += 1
flg2 = 1
if flg2 == 0:
b[0] += 1
if a == b:
print("Yes")
else:
print("No") | N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
if a == b:
print("Yes")
elif sum(a) >= sum(b):
print("No")
else:
aa = 0
bb = 0
for i in range(N):
if a[i]-b[i] > 0:
bb += a[i]-b[i]
elif b[i]-a[i] > 0:
aa += (b[i]-a[i])//2
if aa >= bb:
print("Yes")
else:
print("No") | p03438 |
n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
cnt1=0
cnt2=0
ma=sum(b)-sum(a)
if ma<0:
print("No")
exit()
for i in range(n):
if b[i]<=a[i]:
cnt1+=a[i]-b[i]
else:
if (b[i]-a[i])%2==0:
cnt2+=(b[i]-a[i]+1)//2
else:
cnt2+=(b[i]-a[i]+1)//2
cnt1+=1
#print(cnt1,cnt2)
if cnt1>ma or cnt2>ma:
print("No")
else:
print(("Yes" if (ma-cnt2)*2==ma-cnt1 else "No"))
| n=int(eval(input()))
a=list(map(int,input().split()))
b=list(map(int,input().split()))
cnt=0
for i in range(n):
if a[i]<b[i]:
cnt+=(b[i]-a[i])//2
else:
cnt-=a[i]-b[i]
if cnt<0:
print("No")
else:
print("Yes")
| p03438 |
def main():
import sys
import time
input = sys.stdin.readline
N = int(eval(input()))
A = [int(x) for x in input().strip().split()]
B = [int(x) for x in input().strip().split()]
AB = [a - b for a, b in zip(A, B)]
if A == B:
print('Yes')
exit()
elif sum(AB) > 0:
print('No')
exit()
ai = 0
bi = 0
while ai < N and bi < N:
if ai != N-1 and A[ai] >= B[ai]:
ai = min(N-1, ai+1)
continue
if (A[bi] - B[bi]) % 2 == 1:
A[ai] += 2
B[bi] += 1
continue
if bi != N-1 and A[bi] <= B[bi]:
bi = min(N-1, bi+1)
continue
cnt = min(int((B[ai]-A[ai])/2 + .5), max(1, A[bi]-B[bi]))
A[ai] += cnt * 2
B[bi] += cnt
if ai == N-1 and bi == N-1:
if A[ai] - B[bi] == 1:
A[ai] += 2
B[bi] += 1
break
if A == B:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | def main():
import sys
import time
input = sys.stdin.readline
N = int(eval(input()))
A = [int(x) for x in input().strip().split()]
B = [int(x) for x in input().strip().split()]
cnt = 0
for a, b in zip(A, B):
a_b = a - b
if a_b > 0:
cnt += a_b
elif a_b < 0:
cnt -= -a_b // 2
if cnt <= 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | p03438 |
n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dif = sum(b) - sum(a)
numa, numb = 0, 0
for i in range(n):
if a[i] > b[i]:
numb += a[i] - b[i]
elif a[i] < b[i]:
numa += (b[i] - a[i] + 1) // 2
if numa <= dif and numb <= dif:
print('Yes')
else:
print('No')
| n = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
dif = sum(b) - sum(a)
numa, numb = 0, 0
for i in range(n):
if a[i] > b[i]:
numb += a[i] - b[i]
elif a[i] < b[i]:
numa += (b[i] - a[i] + 1) // 2
# if numa <= dif and numb <= dif:
if numa <= dif:
print('Yes')
else:
print('No')
| p03438 |
N = int(eval(input()))
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]
total = sum(B) - sum(A)
Aadd = 0
for i in range(N):
if A[i] < B[i]:
if (B[i] - A[i])%2==0:
Aadd += (B[i]-A[i])//2
else:
Aadd += (B[i]-A[i])//2+1
print(("Yes" if Aadd <= total else "No")) | import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
A = [int(a) for a in input().split()]
B = [int(b) for b in input().split()]
C = [A[i] - B[i] for i in range(N)]
sumA = sum(A)
sumB = sum(B)
addA, addB = 0, 0
for i, c in enumerate(C):
if c > 0: addB += c
else: addA += (-1 * c + 1) // 2
if addA > sumB - sumA or addB > sumB - sumA: print("No")
else: print("Yes")
return 0
if __name__ == "__main__":
solve() | p03438 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
#======================================================#
def main():
n = II()
aa = MII()
bb = MII()
dn = sum(bb) - sum(aa)
if dn < 0:
print('No')
return None
cnta = cntb = 0
for a,b in zip(aa,bb):
if a>b: cntb += a-b
else: cnta += (b-a+1)//2
if cnta <= dn and cntb <= dn:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
#======================================================#
def main():
n = II()
aa = MII()
bb = MII()
ra = rb = 0
for a,b in zip(aa,bb):
if a>b: ra += a-b
if b>a: rb += (b-a)//2
if rb >= ra: print('Yes')
else: print('No')
if __name__ == '__main__':
main() | p03438 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
x = 0
y = 0
for i in range(N):
if A[i]>B[i]:
x += A[i]-B[i]
else:
y += (B[i]-A[i])//2
if y>=x:
print("Yes")
else:
print("No") | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
sa = sum(A)
sb = sum(B)
if sa>sb:
print("No")
else:
d1 = 0
d2 = 0
for i in range(N):
if A[i]>B[i]:
d1 += A[i]-B[i]
elif B[i]>A[i]:
d2 += (B[i]-A[i])//2
if d2>=d1:
print("Yes")
else:
print("No") | p03438 |
N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
cp = 0
cm = 0
for i in range(N):
if A[i]>B[i]:
cm += A[i]-B[i]
elif B[i]>A[i]:
cp += (B[i]-A[i])//2
if cp>=cm:
print("Yes")
else:
print("No") | N = int(eval(input()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
cnt1 = 0
cnt2 = 0
for i in range(N):
if A[i]>B[i]:
cnt1 += A[i]-B[i]
elif A[i]<B[i]:
cnt2 += (B[i]-A[i])//2
if cnt1<=cnt2:
print("Yes")
else:
print("No") | p03438 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = list(map(int, readline().split()))
b = list(map(int, readline().split()))
cnt = 0
for i in range(n):
cnt += max(0, (b[i] - a[i] + 1) // 2)
if sum(b) - sum(a) >= cnt:
print('Yes')
else:
print('No')
| import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
n = int(readline())
a = list(map(int, readline().split()))
b = list(map(int, read().split()))
cnt = 0
for aa, bb in zip(a, b):
v = bb - aa
if bb > aa:
v //= 2
cnt += v
if cnt >= 0:
print('Yes')
else:
print('No')
| p03438 |
N=int(eval(input()))
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
total_do=sum(b)-sum(a)
must_do_a=0
must_do_b=0
for i in range(N):
dist=a[i]-b[i]
if dist<0:
dist=-dist
must_do_a+=int((dist+1)/2)
if dist%2!=0:
must_do_b+=1
elif dist>0:
must_do_b+=dist
left_a=total_do-must_do_a
left_b=total_do-must_do_b
if total_do>=0 and must_do_a>=must_do_b and left_a*2==left_b:
print("Yes")
else:
print("No")
| N=int(eval(input()))
a=[int(i) for i in input().split()]
b=[int(i) for i in input().split()]
can = sum(b)-sum(a)
actA,actB = 0,0
for i in range(N):
diff = b[i]-a[i]
if diff==0:continue
if diff>0:
actA+=(diff+1)//2
actB+=diff%2
else:
actB+=(-diff)
leftA = can-actA
leftB = can-actB
print(("Yes" if leftA>=0 and leftA*2==leftB else "No"))
| p03438 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
B = list(map(int, input().split()))
B.sort()
sum_a = sum(A)
sum_b = sum(B)
k = sum_b - sum_a
now = 0
while now < N and A[now] == B[now]:
now += 1
while k > 0 and now < N:
while now < N and A[now] == B[now]:
now += 1
if now < N:
A[now] += 2
B[now] += 1
k -= 1
if A[now] == B[now]:
now += 1
if now == N:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
need = 0
stock = 0
for a, b in zip(A, B):
if a > b: need += (a-b)
if b > a: stock += (b-a)//2
if stock >= need:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() | p03438 |
N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cnt = 0
for a, b in zip(A, B):
if a > b: # 特殊操作（他のaの力が）が必要な場合
cnt -= a-b
if a < b: # 他のaに力を貸せる場合
cnt += int((b-a)/2)
if cnt >= 0:
print('Yes')
else:
print('No')
| N = int(eval(input()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cnt = 0
for a, b in zip(A, B):
if a > b: # 特殊操作（他のaの力が）が必要な場合
cnt -= a-b
if a < b: # 他のbに力を貸せる場合
cnt += int((b-a)/2)
if cnt >= 0:
print('Yes')
else:
print('No')
| p03438 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
N = int(readline())
A = list(map(int,readline().split()))
B = list(map(int,readline().split()))
Ka = sum(B)-sum(A)
Kb = Ka
for a,b in zip(A,B):
if a > b:
Kb -= a-b
else:
if (b-a)%2:
Ka -= (b-a+1)//2
Kb -= 1
else:
Ka -= (b-a)//2
print(('Yes' if Ka >= 0 and Kb >= 0 else 'No'))
| import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
N = int(readline())
A = list(map(int,readline().split()))
B = list(map(int,readline().split()))
Ka = sum(B)-sum(A)
Kb = Ka
for a,b in zip(A,B):
if a < b:
Ka -= (b-a+1)//2
print(('Yes' if Ka >= 0 and Kb >= 0 else 'No'))
| p03438 |
import sys
def main():
input = sys.stdin.readline
N=int(eval(input()))
*A,=list(map(int, input().split()))
*B,=list(map(int, input().split()))
asum=sum(A)
bsum=sum(B)
asmall=0
bsmall=0
for a,b in zip(A,B):
asmall+=(max(0, b-a)+1)//2
bsmall+=max(0, a-b)
t=bsum-asum
print(('Yes' if t>=max(asmall,bsmall) else 'No'))
if __name__ == '__main__':
main() | import sys
def main():
input = sys.stdin.readline
N=int(eval(input()))
*A,=list(map(int, input().split()))
*B,=list(map(int, input().split()))
opa=opb=0
for a,b in zip(A,B):
if a>=b:
opb+=a-b
else:
if (b-a)&1==0:
opa+=(b-a)//2
else:
opa+=(b-a)//2 + 1
opb+=1
print(('Yes' if opa>=opb else 'No'))
if __name__ == '__main__':
main() | p03438 |
#!/usr/bin/env python3
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sub = sorted(b[i] - a[i] for i in range(N))
odd = len([x for x in sub if x > 0 and x % 2 == 1])
plus = sum(x for x in sub if x > 0)
minus = sum(x for x in sub if x < 0)
print((('No', 'Yes')[plus + minus * 2 >= odd]))
| #!/usr/bin/env python3
N = int(eval(input()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ds = [b[i] - a[i] for i in range(N)]
p = sum(x // 2 for x in ds if x > 0)
m = sum(-x for x in ds if x < 0)
print((('No', 'Yes')[m <= p]))
| p03438 |
n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
count=0
for a,b in zip(A,B):
if a>b:count -=a-b
elif b>a:count +=(b-a)//2
print(("Yes" if count>=0 else "No")) | n=int(eval(input()))
A=list(map(int,input().split()))
B=list(map(int,input().split()))
count=0
all=sum(B)-sum(A)
for a,b in zip(A,B):
if a>b:count -=a-b
elif b>a:count +=(b-a)//2
print(("Yes" if count>=0 else "No")) | p03438 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
n_2 = 0
n_1 = 0
for a, b in zip(A, B):
if a > b:
n_1 += (a - b)
elif a < b:
n_2 += (b - a + 1) // 2
diff = sum(B) - sum(A)
if diff < 0:
ans = "No"
elif n_1 <= diff and n_2 <= diff:
ans = "Yes"
else:
ans = "No"
print(ans)
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
n_2 = 0
n_1 = 0
for a, b in zip(A, B):
if a > b:
n_1 += (a - b)
elif a < b:
n_2 += (b - a + 1) // 2
diff = sum(B) - sum(A)
if n_1 <= diff and n_2 <= diff:
ans = "Yes"
else:
ans = "No"
print(ans)
if __name__ == "__main__":
main()
| p03438 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n=I()
l1=LI()
l2=LI()
sm1=sum(l1)
sm2=sum(l2)
nm=sm2-sm1
if nm<0:
return 'No'
nm1=0
for i in range(n):
a=l1[i]
b=l2[i]
if a<b:
_a=(b-a+1)//2
l1[i]+=_a*2
nm1+=_a
nm2=0
for i in range(n):
a=l1[i]
b=l2[i]
if a>b:
_a=a-b
nm2+=_a
# print(nm,nm2)
if nm<max(nm1,nm2):
return 'No'
return 'Yes'
# main()
print((main()))
| import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n=I()
a=LI()
b=LI()
sm1=sum(a)
sm2=sum(b)
cnt=sm2-sm1
need=0
for i in range(n):
need+=max(0,(b[i]-a[i]+1)//2)
if cnt<need:
return 'No'
return 'Yes'
# main()
print((main()))
| p03438 |
def judge(a, b):
if a+b <= 9:
return a+b
return a+b-9
n = int(eval(input()))
ans = 0
key = 0
for i in range(n):
a, b = list(map(int, input().split()))
if a == 0:
ans += b
continue
for j in range(b):
if key + a <= 9:
ans += 1
else:
ans += 2
key = judge(key, a)
print((ans-1)) | n = int(eval(input()))
d, c = 0, 0
for i in range(n):
p, q = list(map(int, input().split()))
d = d + q
c = c + p*q
print(((d-1)+(c-1)//9)) | p02856 |
def sum_lr(l, r, cnt):
cnt += 1
lr = l + r
if lr < 10:
l = lr
return l, cnt
else:
l = lr // 10
r = lr % 10
return sum_lr(l, r, cnt)
from collections import defaultdict
aaa = defaultdict(lambda:{})
for l in range(10):
for r in range(10):
aaa[l][r] = sum_lr(l,r,0)
def dc_compression(d, c, ret, cnt):
if c == 1:
ret.append((d, 1))
return ret, cnt
if c % 2 == 1:
ret.append((d, 1))
c -= 1
d, tmp_cnt = aaa[d][d]
c = c // 2
cnt += tmp_cnt * c
#print(d, c, ret, cnt)
return dc_compression(d, c, ret, cnt)
M = int(eval(input()))
nums = []
l = 0
cnt = 0
import sys
input = sys.stdin.readline
for _ in range(M):
d, c = list(map(int, input().split()))
tmp_nums, tmp_cnt= dc_compression(d,c,[], 0)
nums += tmp_nums
cnt += tmp_cnt
#print(nums)
for d, c in nums:
l, tmp_cnt = aaa[l][d]
cnt += tmp_cnt
print((cnt-1)) | def sum_lr(l, r, cnt):
cnt += 1
lr = l + r
if lr < 10:
l = lr
return l, cnt
else:
l = lr // 10
r = lr % 10
return sum_lr(l, r, cnt)
from collections import defaultdict
aaa = defaultdict(lambda:{})
for l in range(10):
for r in range(10):
aaa[l][r] = sum_lr(l,r,0)
def dc_compression(d, c, ret, cnt):
if c == 1:
ret.append((d, 1))
return ret, cnt
if c % 2 == 1:
ret.append((d, 1))
c -= 1
d, tmp_cnt = aaa[d][d]
c = c // 2
cnt += tmp_cnt * c
#print(d, c, ret, cnt)
return dc_compression(d, c, ret, cnt)
M = int(eval(input()))
nums = []
l = 0
cnt = 0
import sys
input = sys.stdin.readline
for _ in range(M):
d, c = list(map(int, input().split()))
tmp_nums, tmp_cnt= dc_compression(d,c,[], 0)
for t,_ in tmp_nums:
nums.append(t)
cnt += tmp_cnt
#print(nums)
for d in nums:
l, tmp_cnt = aaa[l][d]
cnt += tmp_cnt
print((cnt-1)) | p02856 |
import sys
input = sys.stdin.readline
def main():
M = int(eval(input()))
wa = 0
ans = 0
for _ in range(M):
d, c = [int(x) for x in input().split()]
for _ in range(c):
wa += d
ans += 1
if wa >= 10:
ans += 1
wa = wa % 10 + 1
print((ans - 1))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
def main():
M = int(eval(input()))
count = 0
wa = 0
for _ in range(M):
d, c = [int(x) for x in input().split()]
count += c
wa += d * c
print((count - 1 + ((wa - 1) // 9)))
if __name__ == '__main__':
main()
| p02856 |
M = int(eval(input()))
D = []
C = []
for i in range(M):
d,c = list(map(int,input().split()))
D.append(d)
C.append(c)
ans = 0
n = D[0]
C[0] -= 1
for i in range(M):
c = C[i]
d = D[i]
while c != 0:
if c%2==0:
ans += c//2*((2*d)//10+1)
d = (2*d)//10+(2*d)%10
c //= 2
else:
ans += c//2*((2*d)//10+1)
ans += (n+d)//10+1
n = (n+d)//10+(n+d)%10
d = (2*d)//10+(2*d)%10
c //= 2
print(ans) | M = int(eval(input()))
D = 0
S = 0
for i in range(M):
c,d = list(map(int,input().split()))
D += d
S += c*d
print((D-1+(S-1)//9)) | p02856 |
import sys
def input() -> str:
return sys.stdin.readline()
m = int(eval(input()))
n, s = 0, 0
for i in range(m):
d, c = [int(i) for i in input().split()]
n += c
s += d * c
while s >= 10:
s -= 9
n += 1
print((n - 1)) | import sys
def input() -> str:
return sys.stdin.readline()
m = int(eval(input()))
n, s = 0, 0
for i in range(m):
d, c = [int(i) for i in input().split()]
n += c
s += d * c
print((n + (s - 1) // 9 - 1)) | p02856 |
m=int(eval(input()))
d,c=[],[]
ans=-1
for i in range(m):
dd,cc=list(map(int,input().split()))
d.append(dd)
c.append(cc)
ans+=cc
a=0
ds=lambda n:sum(list(map(int,list(str(n)))))
for i in range(m):
if d[i]*c[i]+a<10:a+=d[i]*c[i]
else:
if c[i]*d[i]>9:
ci,di=c[i],d[i]
while ci*di>9:
cd=(0--10//di)
ci,di,cci,ddi=ci//cd,ds(cd*di),ci-(ci//cd*cd),di
ans+=ci
if ddi*cci+a>9:ans+=1
a=ds(ddi*cci+a)
if di*ci+a>9:ans+=1
a=ds(di*ci+a)
else:
ans+=1
a=ds(a+c[i]*d[i])
print(ans) | m=int(eval(input()))
d,c=[],[]
ans=-1
for i in range(m):
dd,cc=list(map(int,input().split()))
d.append(dd)
c.append(cc)
ans+=cc
a=0
for i in range(m):
a+=d[i]*c[i]
dd=(a-1)//9
ans+=dd
a-=dd*9
print(ans) | p02856 |
def main():
M = int(eval(input()))
ans = 0
dc = [[int(i) for i in input().split()] for _ in range(M)]
dc_sum = 0
for i in range(M):
d = dc[i][0]
c = dc[i][1]
dc_sum += d*c
ans += c
if dc_sum % 9 == 0:
print((ans - 1 + dc_sum//9 - 1))
else:
print((ans - 1 + dc_sum//9))
if __name__ == '__main__':
main()
| def main():
M = int(eval(input()))
ans = 0
dc_sum = 0
for i in range(M):
d, c = (int(i) for i in input().split())
dc_sum += d*c
ans += c
if dc_sum % 9 == 0:
print((ans - 1 + dc_sum//9 - 1))
else:
print((ans - 1 + dc_sum//9))
if __name__ == '__main__':
main()
| p02856 |
def main():
M = int(eval(input()))
ans = 0
dc_sum = 0
for i in range(M):
d, c = (int(i) for i in input().split())
dc_sum += d*c
ans += c
if dc_sum % 9 == 0:
print((ans - 1 + dc_sum//9 - 1))
else:
print((ans - 1 + dc_sum//9))
if __name__ == '__main__':
main()
| def main():
import sys
input = sys.stdin.buffer.readline
M = int(eval(input()))
ans = 0
dc_sum = 0
for i in range(M):
d, c = (int(i) for i in input().split())
dc_sum += d*c
ans += c
if dc_sum % 9 == 0:
print((ans - 1 + dc_sum//9 - 1))
else:
print((ans - 1 + dc_sum//9))
if __name__ == '__main__':
main()
| p02856 |
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 0
M = inp()
zan_all = deque()
for m in range(M):
d,c = inpl()
zan = []
while True:
if c == 1:
zan_all.appendleft(d)
break
elif c%2 == 0:
if d == 0:
ans += c
break
elif d <= 4:
ans += c//2
d *= 2
c //= 2
else:
ans += c
d = d*2 - 9
c //= 2
else:
zan_all.appendleft(d)
c -= 1
for i in range(1,len(zan_all)):
d = zan_all[i] + zan_all[i-1]
if d >= 10:
zan_all[i] = d - 10 + 1
ans += 2
else:
zan_all[i] = d
ans += 1
print(ans)
|
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
ans = 0
M = inp()
zan = []
for m in range(M):
d,c = inpl()
while True:
if c == 1:
zan.append(d)
break
elif c%2 == 0:
if d == 0:
ans += c
break
elif d <= 4:
ans += c//2
d *= 2
c //= 2
else:
ans += c
d = d*2 - 9
c //= 2
else:
zan.append(d)
c -= 1
zan.reverse()
bx = zan[0]
for x in zan[1:]:
d = x + bx
if d >= 10:
bx = d - 10 + 1
ans += 2
else:
bx = d
ans += 1
print(ans)
| p02856 |
import sys
input=sys.stdin.readline
cha=[0,2,4,6,8,1,3,5,7,9]
m=int(eval(input()))
ans=0
from collections import deque
l=deque()
for _ in range(m):
d,c=list(map(int,input().split()))
while c>1:
if c%2:
c-=1
l.append(d)
c//=2
ans+=c if d<5 else c*2
d=cha[d]
l.append(d)
k=len(l)
while k>1:
a=l.pop()
b=l.pop()
x=a+b
ans+=1
if x>9:
s=str(x)
l.append(int(s[0]))
l.append(int(s[1]))
else:
l.append(x)
k-=1
print(ans)
| import sys
input=sys.stdin.readline
cha=[0,2,4,6,8,1,3,5,7,9]
m=int(eval(input()))
ans=0
l=[]
for _ in range(m):
d,c=list(map(int,input().split()))
while c>1:
if c%2:
c-=1
l.append(d)
c//=2
ans+=c if d<5 else c*2
d=cha[d]
l.append(d)
k=len(l)
while k>1:
a=l.pop()
b=l.pop()
x=a+b
ans+=1
if x>9:
s=str(x)
l.append(int(s[0]))
l.append(int(s[1]))
else:
l.append(x)
k-=1
print(ans)
| p02856 |
import itertools
import os
import sys
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
M = int(sys.stdin.buffer.readline())
DC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]
def test(n):
round = {str(n)}
ret = 0
while round:
next_round = set()
for n in round:
for i in range(len(n) - 1):
s = n[:i] + str(int(n[i]) + int(n[i + 1])) + n[i + 2:]
if len(s) > 1:
next_round.add(s)
round = next_round
print(round)
ret += 1
print(('test:', ret))
print()
@lru_cache(maxsize=None)
def solve(n):
n = str(n)
if len(n) == 1:
return 0, int(n)
num = 0
ret = 0
for c in str(n):
ret += 1
num += int(c)
while num >= 10:
ret += 1
num = num % 10 + 1
return ret - 1, num
# ans = 0
# num = 0
# for d, c in DC:
# if d == 0:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 1:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 2:
# ans += c
# n1 = c // 5
#
# n
# n = num + d * c
# ans += c
# ans += n // 10
# num = n % 10
memo = [[None] * 10 for _ in range(10)]
for i, j in itertools.product(list(range(10)), list(range(10))):
memo[i][j] = solve(str(i) * j)
def kurikaesi(d, c):
if c < 10:
return memo[d][c]
cnt, n1 = solve(str(d) * 10)
ret = cnt * (c // 10)
c2, n2 = kurikaesi(n1, c // 10)
c3, n3 = solve(str(d) * (c % 10))
ret += c2
ret += c3
c4, n4 = solve(str(n2) + str(n3))
ret += c4
return ret, n4
#
# n = ''
# for d, c in DC:
# n += str(d) * c
# test(n)
# print(solve(n))
ans = 0
num = 0
for d, c in DC:
cnt, n = kurikaesi(d, c)
ans += cnt
c2, n2 = solve(str(num) + str(n))
ans += c2
num = n2
print((ans - 1))
| import itertools
import os
import sys
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
M = int(sys.stdin.buffer.readline())
DC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]
def test(n):
round = {str(n)}
ret = 0
while round:
next_round = set()
for n in round:
for i in range(len(n) - 1):
s = n[:i] + str(int(n[i]) + int(n[i + 1])) + n[i + 2:]
if len(s) > 1:
next_round.add(s)
round = next_round
print(round)
ret += 1
print(('test:', ret))
print()
@lru_cache(maxsize=None)
def solve(n):
n = str(n)
if len(n) == 1:
return 0, int(n)
num = 0
ret = 0
for c in str(n):
ret += 1
num += int(c)
while num >= 10:
ret += 1
num = num % 10 + 1
return ret - 1, num
# ans = 0
# num = 0
# for d, c in DC:
# if d == 0:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 1:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 2:
# ans += c
# n1 = c // 5
#
# n
# n = num + d * c
# ans += c
# ans += n // 10
# num = n % 10
memo = [[None] * 11 for _ in range(10)]
for i, j in itertools.product(list(range(10)), list(range(11))):
memo[i][j] = solve(str(i) * j)
def kurikaesi(d, c):
if c < 10:
return memo[d][c]
cnt, n1 = memo[d][10]
ret = cnt * (c // 10)
c2, n2 = kurikaesi(n1, c // 10)
c3, n3 = memo[d][c % 10]
ret += c2
ret += c3
c4, n4 = solve(str(n2) + str(n3))
ret += c4
return ret, n4
#
# n = ''
# for d, c in DC:
# n += str(d) * c
# test(n)
# print(solve(n))
ans = 0
num = 0
for d, c in DC:
cnt, n = kurikaesi(d, c)
ans += cnt
c2, n2 = solve(str(num) + str(n))
ans += c2
num = n2
print((ans - 1))
| p02856 |
import itertools
import os
import sys
from functools import lru_cache
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
M = int(sys.stdin.buffer.readline())
DC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]
def test(n):
round = {str(n)}
ret = 0
while round:
next_round = set()
for n in round:
for i in range(len(n) - 1):
s = n[:i] + str(int(n[i]) + int(n[i + 1])) + n[i + 2:]
if len(s) > 1:
next_round.add(s)
round = next_round
print(round)
ret += 1
print(('test:', ret))
print()
@lru_cache(maxsize=None)
def solve(n):
n = str(n)
if len(n) == 1:
return 0, int(n)
num = 0
ret = 0
for c in str(n):
ret += 1
num += int(c)
while num >= 10:
ret += 1
num = num % 10 + 1
return ret - 1, num
# ans = 0
# num = 0
# for d, c in DC:
# if d == 0:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 1:
# ans += c
# n = num + d * c
# ans += n // 10
# num = n % 10
# if d == 2:
# ans += c
# n1 = c // 5
#
# n
# n = num + d * c
# ans += c
# ans += n // 10
# num = n % 10
memo = [[None] * 11 for _ in range(10)]
for i, j in itertools.product(list(range(10)), list(range(11))):
memo[i][j] = solve(str(i) * j)
def kurikaesi(d, c):
if c < 10:
return memo[d][c]
cnt, n1 = memo[d][10]
ret = cnt * (c // 10)
c2, n2 = kurikaesi(n1, c // 10)
c3, n3 = memo[d][c % 10]
ret += c2
ret += c3
c4, n4 = solve(str(n2) + str(n3))
ret += c4
return ret, n4
#
# n = ''
# for d, c in DC:
# n += str(d) * c
# test(n)
# print(solve(n))
ans = 0
num = 0
for d, c in DC:
cnt, n = kurikaesi(d, c)
ans += cnt
c2, n2 = solve(str(num) + str(n))
ans += c2
num = n2
print((ans - 1))
| import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
# 桁数*9 + 総和が 9 ずつ減る
M = int(sys.stdin.buffer.readline())
DC = [list(map(int, sys.stdin.buffer.readline().split())) for _ in range(M)]
s = 0
l = 0
for d, c in DC:
l += c
s += d * c
ans = (l * 9 + s - 1) // 9 - 1
print(ans)
| p02856 |
M = int(eval(input()))
now = 0
ans = 0
for _ in range(M):
d, c = list(map(int, input().split()))
for _ in range(c):
now += d
ans += 1
if now >= 10:
now = now // 10 + now % 10
ans += 1
print((ans - 1)) | M = int(eval(input()))
DC = [tuple(map(int, input().split())) for _ in range(M)]
D = 0
C = 0
for d, c in DC:
D += d * c
C += c
ans = C - 1
ans += (D - 1) // 9
print(ans)
| p02856 |
import sys
input = sys.stdin.readline
from collections import deque
q = deque()
def calc(d, c):
if c&1:
q.append(d)
if c == 1:
return 0
d *= 2
if d >= 10:
return c//2 * 2 + calc(1+d%10, c//2)
return c//2 + calc(d, c//2)
def main():
M = int(eval(input()))
ans = 0
for i in range(M):
d, c = list(map(int, input().split()))
ans += calc(d, c)
num = q.popleft()
while len(q) > 0:
t = q.popleft()
num += t
if num >= 10:
num = 1 + num%10
ans += 1
ans += 1
print(ans)
if __name__ == "__main__":
main() | import sys
input = sys.stdin.readline
from collections import deque
q = deque()
def calc(d, c):
if c&1:
q.append(d)
if c == 1:
return 0
d *= 2
c>>=1
if d >= 10:
return c * 2 + calc(1+d%10, c)
return c + calc(d, c)
def main():
M = int(eval(input()))
ans = 0
for i in range(M):
d, c = list(map(int, input().split()))
ans += calc(d, c)
num = q.popleft()
while len(q) > 0:
t = q.popleft()
num += t
if num >= 10:
num = 1 + num%10
ans += 1
ans += 1
print(ans)
if __name__ == "__main__":
main() | p02856 |
M = int(eval(input()))
dc = [[int(i) for i in input().split()] for _ in range(M)]
digit = [0] * 10
for d, c in dc :
digit[d] += c
ret = digit[0]
digit[0] = 0
while sum(digit) != 1 :
for a in range(1, 10) :
for b in range(1, 10) :
if a + b >= 10 :
na = (a + b) // 10
nb = (a + b) % 10
if a == b :
x = digit[a] // 2
digit[na] += x
digit[nb] += x
digit[a] -= 2 * x
else :
x = min(digit[a], digit[b])
digit[na] += x
digit[nb] += x
digit[a] -= x
digit[b] -= x
ret += x
else :
if a == b :
x = digit[a] // 2
digit[a+b] += x
digit[a] -= 2 * x
else :
x = min(digit[a], digit[b])
digit[a+b] += x
digit[a] -= x
digit[b] -= x
for d, c in dc :
if d != 0 :
ret += c
print((ret - 1)) | M = int(eval(input()))
dc = [[int(i) for i in input().split()] for _ in range(M)]
ret = 0
s = 0
for d, c in dc :
s += d * c
t = s // 10
ret += t
s %= 10
s += t
while s >= 10 :
t = s // 10
ret += t
s %= 10
s += t
for d, c in dc :
ret += c
print((ret - 1)) | p02856 |
#順番考えなくていいかとりあえず試す
#配列をタプルに変更
m = int(eval(input()))
nm = []
for i in range(m):
di,ci = list(map(int, input().split( )))
nm.append((di,ci))
cnt = 0
tmp = 0
while nm:
ci,di = nm.pop()
while di:
cnt += 1
#print(di,cnt)
tmp += ci
di-=1
if tmp>=10:
tmp = str(tmp)
tmp2 = int(tmp[0])+int(tmp[1])
cnt += 1
#print(di,cnt)
tmp = tmp2
print((cnt-1))
| #繰り上がりごとに各桁の総和は9減る
#9*最初の桁数+最初の総和がそれで減る
#それは順番によらない
m = int(eval(input()))
sm= 0
d = []
c = []
for i in range(m):
di,ci = list(map(int, input().split( )))
d.append(di)
c.append(ci)
sm += di*ci
x = sum(c)*9 + sm
y = x%9
if y==0:
y = 9
print(((x-y)//9-1))
| p02856 |
#!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import collections
M, = list(map(int, sys.stdin.readline().rstrip().split(" ")))
def too_slow(d_pairs):
ds = []
for d, c in d_pairs:
for _ in range(c):
ds.append(d)
d, c = 0, 0
for next_d in ds:
c += 1
d += next_d
if d >= 10:
d = d % 10 + 1
c += 1
return c-1
def contract_list(ds):
d, c = 0, -1
for next_d, next_c in ds:
c += next_c
c += 1
d += next_d
if d >= 10:
d = d % 10 + 1
c += 1
# print(d, c)
return d, c
def contract_pair(d, orig_c):
c = 0
ds = [(d, c)]
for _ in range(int(math.log(orig_c, 2)) + 1):
d = d + d
c = c*2 +1
if d >= 10:
d = d % 10 + 1
c += 1
ds.append((d, c))
# print(ds)
ds_for_calc = []
for i, b in enumerate(reversed(bin(orig_c)[2:])):
# print(bin(orig_c), b)
if b == "1":
ds_for_calc.append(ds[i])
# print("for_cal", ds_for_calc)
return contract_list(ds_for_calc)
ds_for_calc = []
orig_ds = []
for _ in range(M):
d, c = list(map(int, sys.stdin.readline().rstrip().split(" ")))
orig_ds.append((d, c))
ds_for_calc.append(contract_pair(d, c))
# print(ds_for_calc[-1])
# print("last_list", ds_for_calc)
answer = contract_list(ds_for_calc)[1]
# print(too_slow(orig_ds), answer)
# assert too_slow(orig_ds) == answer
print(answer)
exit(0)
| #!/usr/bin/python
# -*- coding: utf-8 -*-
import sys
import math
import collections
M, = list(map(int, sys.stdin.readline().rstrip().split(" ")))
total_sum = 0
total_digits = 0
for _ in range(M):
d, c = list(map(int, sys.stdin.readline().rstrip().split(" ")))
total_digits += c
total_sum += d*c
answer = ((total_sum-1) // 9) + total_digits -1
print(answer)
exit(0)
| p02856 |
x=0;y=0
for _ in range(int(eval(input()))):
d,c=list(map(int,input().split()))
x+=d*c
y+=c
print((y-1+(x-1)//9)) | x=y=-1
for _ in range(int(eval(input()))):
d,c=list(map(int,input().split()))
x+=d*c
y+=c
print((y+x//9)) | p02856 |
import sys
from collections import deque
def q(d, c, dq):
if c == 1:
if d < 10:
dq.append(d)
return 0
else:
a = d //10 + d % 10
if a < 10:
dq.append(a)
return 1
else:
dq.append(a-9)
return 2
a = d * 2
if a < 10: count = q(a, c//2, dq)
else:
count = q(a - 9, c//2, dq)
count += c//2
count += c//2
if c % 2 == 1: dq.append(d)
return count
def solve():
input = sys.stdin.readline
M = int(eval(input()))
count = 0
dq = deque()
digit = 0
for _ in range(M):
d, c = list(map(int, input().split()))
add = q(d, c, dq)
count += add
digit = len(dq)
for _ in range(digit - 1):
#print(dq)
a = int(dq.pop())
a += int(dq.pop())
if a >= 10:
dq.append(str(a % 10 + a // 10))
count += 2
else:
dq.append(str(a))
count += 1
print(count)
return 0
if __name__ == "__main__":
solve() | import sys
from collections import deque
def q(d, c): #dは9以下、cは桁数
digsum = d * c
add = c - 1 + (digsum - 1) // 9
rem = digsum - 9 * ((digsum - 1) // 9)
return add, rem
def solve():
input = sys.stdin.readline
M = int(eval(input()))
count = -1
ans = 0
for _ in range(M):
d, c = list(map(int, input().split()))
add, rem = q(d, c)
count += add
ans += rem
count += 1
if ans > 9:
ans -= 9
count += 1
print(count)
return 0
if __name__ == "__main__":
solve() | p02856 |
INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
def main():
M = int(eval(input()))
digits = []
S = 0
for i in range(M):
d, c = list(map(int, input().split()))
if d == 0 and i == 0:
continue
for i in range(c):
digits.append(d)
S += d
print(((len(digits) - 1) + (S - 1) // 9))
if __name__ == '__main__':
main()
| INF = float("inf")
IINF = 10 ** 18
MOD = 998244353
def main():
M = int(eval(input()))
N = 0
S = 0
for i in range(M):
d, c = list(map(int, input().split()))
if d == 0 and i == 0:
continue
S += d * c
N += c
print(((N - 1) + (S - 1) // 9))
if __name__ == '__main__':
main()
| p02856 |
def g(i,j):
if i+j<10:
return 1,i+j
else:
a = i+j
b = a%10+a//10
return 2,b
def f(c,d):
if d==1:
return 0,c
if d==2:
return g(c,c)
if d%2==0:
a,b = f(c,d//2)
x,y = g(b,b)
return 2*a+x,y
else:
a,b = f(c,d-1)
x,y = g(c,b)
return a+x,y
M = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(M)]
cnt = 0
B = []
for i in range(M):
c,d = A[i][0],A[i][1]
a,b = f(c,d)
cnt += a
B.append(b)
b = B[0]
for i in range(1,M):
a,b = g(b,B[i])
cnt += a
print(cnt)
| def g(i,j):
if i+j<10:
return 1,i+j
else:
a = i+j
b = a%10+a//10
return 2,b
def f(c,d):
if d==1:
return 0,c
if d==2:
return g(c,c)
if d%2==0:
a,b = f(c,d//2)
x,y = g(b,b)
return 2*a+x,y
else:
a,b = f(c,(d-1)//2)
x1,y1 = g(b,b)
x2,y2 = g(c,y1)
return 2*a+x1+x2,y2
M = int(eval(input()))
A = [list(map(int,input().split())) for _ in range(M)]
cnt = 0
B = []
for i in range(M):
c,d = A[i][0],A[i][1]
a,b = f(c,d)
cnt += a
B.append(b)
b = B[0]
for i in range(1,M):
a,b = g(b,B[i])
cnt += a
print(cnt)
| p02856 |
import sys
sys.setrecursionlimit(10**6)
def read_tokens():
return input().strip().split(' ')
def read_ints():
return [int(token) for token in read_tokens()]
n, = read_ints()
c = [0] * n
d = [0] * n
# s = ''
for i in range(n):
# d[i] = (i + 1) % 10
# c[i] = 10**15 // n
d[i], c[i] = read_ints()
# s += str(d[i]) * c[i]
# print(f's={s}')
# cache = {}
# def f(s):
# global cache
# x = int(s)
# if x <= 9:
# return 0
# if s in cache:
# return cache[s]
# ans = 0
# best = ''
# for i in range(len(s) - 1):
# a = int(s[i])
# b = int(s[i+1])
# t = f(s[:i] + str(a+b) + s[i+2:])
# ans = max(ans, t + 1)
# if t + 1 == ans:
# best = s[:i] + str(a+b) + s[i+2:]
# for i in range(len(s) - 1):
# a = int(s[i])
# b = int(s[i+1])
# t = f(s[:i] + str(a+b) + s[i+2:])
# if t + 1 != ans:
# print(f'!!! {s} {i} {s[:i] + str(a+b) + s[i+2:]} {t + 1} {bedt} {ans}')
# cache[s] = ans
# return ans
# print(f(s))
# while True:
# s, = read_tokens()
# print(f(s))
def processBlock(n, c):
if not (c > 0):
while True:
pass
if c == 1:
return n, 0
if c % 2 == 0:
if 2 * n < 10:
rn, rc = processBlock(2 * n, c // 2)
return rn, rc + c // 2
else:
d = (2 * n) // 10 + (2 * n) % 10
rn, rc = processBlock(d, c // 2)
return rn, rc + c
rn, rc = processBlock(n, c - 1)
if n + rn < 10:
return n + rn, rc + 1
else:
d = (n + rn) // 10 + (n + rn) % 10
return d, rc + 2
def solve(D, C):
ret = 0
a = []
for d, c in zip(D, C):
n, cc = processBlock(d, c)
ret += cc
a.append(n)
while len(a) > 1:
d1 = a.pop()
d2 = a.pop()
ret += 1
if d1 + d2 < 10:
a.append(d1 + d2)
else:
a.append(1)
a.append((d1 + d2) % 10)
return ret
print((solve(d, c)))
# print(f(s)) | import sys
sys.setrecursionlimit(10**6)
def read_tokens():
return input().strip().split(' ')
def read_ints():
return [int(token) for token in read_tokens()]
n, = read_ints()
c = [0] * n
d = [0] * n
# s = ''
for i in range(n):
# d[i] = (i + 1) % 10
# c[i] = 10**15 // n
d[i], c[i] = read_ints()
if c[i] == 0:
c[i] = 1/c[i]
# s += str(d[i]) * c[i]
# print(f's={s}')
# cache = {}
# def f(s):
# global cache
# x = int(s)
# if x <= 9:
# return 0
# if s in cache:
# return cache[s]
# ans = 0
# best = ''
# for i in range(len(s) - 1):
# a = int(s[i])
# b = int(s[i+1])
# t = f(s[:i] + str(a+b) + s[i+2:])
# ans = max(ans, t + 1)
# if t + 1 == ans:
# best = s[:i] + str(a+b) + s[i+2:]
# for i in range(len(s) - 1):
# a = int(s[i])
# b = int(s[i+1])
# t = f(s[:i] + str(a+b) + s[i+2:])
# if t + 1 != ans:
# print(f'!!! {s} {i} {s[:i] + str(a+b) + s[i+2:]} {t + 1} {bedt} {ans}')
# cache[s] = ans
# return ans
# print(f(s))
# while True:
# s, = read_tokens()
# print(f(s))
def processBlock(n, c):
if not (c > 0):
while True:
pass
if c == 1:
return n, 0
if c % 2 == 0:
if 2 * n < 10:
rn, rc = processBlock(2 * n, c // 2)
return rn, rc + c // 2
else:
d = (2 * n) // 10 + (2 * n) % 10
rn, rc = processBlock(d, c // 2)
return rn, rc + c
# c % 2 == 1
# c != 1
rn, rc = processBlock(n, c - 1)
if n + rn < 10:
return n + rn, rc + 1
else:
d = (n + rn) // 10 + (n + rn) % 10
return d, rc + 2
def solve(D, C):
ret = 0
a = []
for d, c in zip(D, C):
n, cc = processBlock(d, c)
ret += cc
a.append(n)
while len(a) > 1:
d1 = a.pop()
d2 = a.pop()
ret += 1
if d1 + d2 < 10:
a.append(d1 + d2)
else:
a.append(1)
a.append((d1 + d2) % 10)
return ret
print((solve(d, c)))
# print(f(s)) | p02856 |
M = int(eval(input()))
ans = 0
c1 = []
for _ in range(M):
d, c = list(map(int, input().split()))
v1 = ((d*c)//9)-((d*c)%9==0 and d*c>0)
v2 = c-1
ans += v1+v2
c1.append(d*c-9*v1)
ans += M-1
s = sum(c1)
ans += (s//9)-(s%9==0 and s>0)
print(ans)
| M = int(eval(input()))
ans, s = 0, 0
for _ in range(M):
d, c = list(map(int, input().split()))
s += d*c
ans += c
ans += (s-1)//9 - 1
print(ans)
| p02856 |
M = int(eval(input()))
ans, s = 0, 0
for _ in range(M):
d, c = list(map(int, input().split()))
s += d*c
ans += c
ans += (s-1)//9 - 1
print(ans)
| import sys
input=sys.stdin.readline
def solve():
M = int(eval(input()))
ans, s = 0, 0
for _ in range(M):
d, c = list(map(int, input().split()))
s += d*c
ans += c
ans += (s-1)//9 - 1
print(ans)
solve()
| p02856 |
from collections import Counter
mod = 1000000007
def inverse(a):
return pow(a, mod - 2, mod)
def usearch(x, a):
lft = 0
rgt = len(a) + 1
while rgt - lft > 1:
mid = (rgt + lft) // 2
if a[mid] <= x:
lft = mid
else:
rgt = mid
return lft
memo = [
[0, 1, 1],
[1,10,9],
[2,11,9],
[3,4,3],
[4,13,9],
[5,14,9],
[6,5,3],
[7,16,9],
[8,17,9],
[9,2,1],
]
def main():
m = int(eval(input()))
dc = [[int(i) for i in input().split()] for _ in range(m)]
s = []
ans = 0
for i in range(m):
d = dc[i][0]
c = dc[i][1]
ans += c // memo[d][2] * memo[d][1]
if d == 9:
ans -= 2
s.append([d, 1])
else:
s.append([d, (c % memo[d][2])])
if not s:
print(ans)
return
t = s[0][0]
s[0][1] -= 1
for i in range(len(s)):
while s[i][1]:
s[i][1] -= 1
ans += 1
t += s[i][0]
if t > 9:
ans += 1
t = t % 10 + t // 10
print(ans)
main()
| from collections import Counter
mod = 1000000007
def inverse(a):
return pow(a, mod - 2, mod)
def usearch(x, a):
lft = 0
rgt = len(a) + 1
while rgt - lft > 1:
mid = (rgt + lft) // 2
if a[mid] <= x:
lft = mid
else:
rgt = mid
return lft
def main():
m = int(eval(input()))
ans = 0
a = 0
for i in range(m):
d, c = list(map(int, input().split()))
ans += c
a += d * c
print((ans + (a - 1) // 9 - 1))
main()
| p02856 |
from collections import deque
M = int(eval(input()))
deq = deque()
for _ in range(M):
d,c = list(map(int,input().split()))
for _ in range(c):
deq.append(d)
def is_handred():
if deq[0]==1 and deq[1]==0 and deq[2]==0:
return True
return False
times = 0
while len(deq) > 1:
if len(deq) == 3 and is_handred():
deq = deque([1,0])
else:
i,j = deq.popleft(), deq.popleft()
for x in list(str(i+j)):
deq.append(int(x))
times += 1
print(times) | M = int(eval(input()))
cur = 0
keta = 0
csum = 0
for _ in range(M):
d,c = list(map(int,input().split()))
s = 0
for i in str(d):
s += int(i)
csum += s * c
keta += c
# 9をカウントしたくないため
print((keta-1 + (csum-1)//9)) | p02856 |
m,*t=list(map(int,open(0).read().split()))
*z,=list(zip(*[iter(t)]*2))
a=0
flag=False
for d,c in z:
if flag:
m=[b]
else:
m=[]
flag=True
while c//2:
cd=c//2
a+=cd
if c%2:
m+=d,
d*=2
if d>9:
a+=cd
d=sum(map(int,str(d)))
c=cd
for t in m[::-1]:
d+=t
a+=1
if d>9:
d=sum(map(int,str(d)))
a+=1
b=d
print(a) | m,*t=list(map(int,open(0).read().split()))
a=b=0
for d,c in zip(*[iter(t)]*2):
m=[b]
while c//2:
cd=c//2
a+=cd
if c%2:
m+=d,
d*=2
if d>9:
a+=cd
d=d//10+d%10
c=cd
for t in m[::-1]:
d+=t
a+=1
if d>9:
d=d//10+d%10
a+=1
b=d
print((a-1)) | p02856 |
m,*t=list(map(int,open(0).read().split()))
a=b=0
for d,c in zip(*[iter(t)]*2):
m=[b]
while c//2:
cd=c//2
a+=cd
if c%2:
m+=d,
d*=2
if d>9:
a+=cd
d=d//10+d%10
c=cd
for t in m[::-1]:
d+=t
a+=1
if d>9:
d=d//10+d%10
a+=1
b=d
print((a-1)) | _,*t=open(0)
a=b=0
for t in t:d,c=list(map(int,t.split()));a+=d*c;b+=c
print((~-a//9+b-1)) | p02856 |
M = int(eval(input()))
DC = [tuple(map(int,input().split())) for i in range(M)]
sumd = sumc = 0
for d,c in DC:
sumd += d*c
sumc += c
ans = sumc-1 + (sumd-1)//9
print(ans) | M = int(eval(input()))
DC = [tuple(map(int,input().split())) for i in range(M)]
s = k = 0
for d,c in DC:
k += c
s += d*c
ans = k-1 + (s-1)//9
print(ans) | p02856 |
import sys
def answer():
input = sys.stdin.readline
M = int(eval(input()))
Ds = [0] * M
Cs = [0] * M
total = 0
for i in range(M):
c, d = list(map(int, input().split()))
Cs[i] = c
Ds[i] = d
total += d * c
digits = sum(Ds)
ans = (digits-1) + (total-1) // 9
print(ans)
if __name__ == '__main__':
answer()
| import sys
def answer():
input = sys.stdin.readline
M = int(eval(input()))
digits = 0
total = 0
for i in range(M):
c, d = list(map(int, input().split()))
digits += d
total += d * c
ans = (digits-1) + (total-1) // 9
print(ans)
if __name__ == '__main__':
answer()
| p02856 |
import sys
input=sys.stdin.readline
def main():
m=int(eval(input()))
DC=[list(map(int,input().split())) for _ in range(m)]
s=0
digit=0
for d,c in DC:
digit+=c
s+=d*c
ans=digit-1
m=s%9
if m==0:
m=9
ans+=(s-m)//9
print(ans)
if __name__=='__main__':
main() | import sys
input=sys.stdin.readline
def main():
m=int(eval(input()))
DC=[list(map(int,input().split())) for _ in range(m)]
s=0
digit=0
for d,c in DC:
digit+=c
s+=d*c
print((digit-1+(s-1)//9))
if __name__=='__main__':
main() | p02856 |
m = int(eval(input()))
d = [list(map(int, input().split())) for _ in range(m)]
print((sum([x[1] for x in d]) - 1 + (sum([x[0]*x[1] for x in d]) - 1) // 9))
| M=int(eval(input()))
#Get the number that needs to be handled
num=''
D,C=[],[]
for _ in range(M):
D1,C1=list(map(int, input().split()))
D.append(D1)
C.append(C1)
S = sum(d * c for d, c in zip(D, C))
print((sum(C)-1+(S-1)//9)) | p02856 |
m = int(eval(input()))
dc = [list(map(int, input().split())) for _ in range(m)]
def zero(n):
return n - 1, "0"
def one(n):
ret = 0
while n // 10:
q, r = divmod(n, 10)
n = q + r
ret += 10 * q
return ret, "1" * n
def two(n):
ret = 0
q, r = divmod(n, 5)
ret += 5 * q
one_cnt, ones = one(q)
ret += one_cnt
return ret, ones + "2" * r
def three(n):
ret = 0
while n // 4:
q, r = divmod(n, 4)
n = q + r
ret += 4 * q
return ret, "3" * n
def four(n):
ret = 0
q, r = divmod(n, 3)
ret += 3 * q
three_cnt, threes = three(q)
ret += three_cnt
return ret, threes + "4" * r
def five(n):
ret = 0
q, r = divmod(n, 2)
ret += 2 * q
one_cnt, ones = one(q)
ret += one_cnt
return ret, ones + "5" * r
def six(n):
ret = 0
q, r = divmod(n, 2)
ret += 2 * q
three_cnt, threes = three(q)
ret += three_cnt
return ret, threes + "6" * r
def seven(n):
ret = 0
q, r = divmod(n, 2)
ret += 2 * q
five_cnt, fives = five(q)
ret += five_cnt
return ret, fives + "7" * r
def eight(n):
ret = 0
q, r = divmod(n, 2)
ret += 2 * q
one_cnt, ones = seven(q)
ret += one_cnt
return ret, ones + "8" * r
def nine(n):
ret = 0
while n // 2:
q, r = divmod(n, 2)
n = q + r
ret += 2 * q
return ret, "9" * n
new_dc = []
fs = [zero, one, two, three, four, five, six, seven, eight, nine]
for d, c in dc:
cnt, s = fs[d](c)
new_dc.append([cnt, s])
s = ""
cnt = 0
for d, c in new_dc:
s += c
cnt += d
while len(s) > 1:
tmp = int(s[-1]) + int(s[-2])
s = s[:-2] + str(tmp)
cnt += 1
print(cnt)
| m = int(eval(input()))
dc = [list(map(int, input().split())) for _ in range(m)]
sm = 0
n = 0
for d, c in dc:
sm += d * c
n += c
ans = n - 1 + (sm - 1) // 9
print(ans)
| p02856 |
m = int(eval(input()))
c = []
d = []
for i in range(m):
D,C = list(map(int,input().split()))
c.append(C)
d.append(D)
ans = 0
for i in range(m):
ans += c[i]*d[i]
print(((ans-1)//9 + sum(c)-1)) | m = int(eval(input()))
C, D = [], []
for i in range(m):
d, c = list(map(int, input().split()))
C.append(c)
D.append(d)
x = sum([C[i] * D[i] for i in range(m)])
ans = sum(C) - 1 + (x - 1) // 9
print(ans) | p02856 |
from sys import stdin
input = stdin.readline
m, *t = list(map(int, open(0).read().split()))
from functools import lru_cache
@lru_cache()
def cal(d, c):
if c == 1:
return [0, d]
t = 1 + (d + d >= 10)
a = (d + d >= 10) + (d + d) % 10
ca = cal(a, c // 2)
if c % 2:
return [(c // 2) * t + ca[0] + 1 + (ca[1] + d >= 10), (ca[1] + d >= 10) + (ca[1] + d) % 10]
else:
return [(c // 2) * t + ca[0], ca[1]]
ans = 0
now = []
for d, c in zip(*[iter(t)] * 2):
ca = cal(d, c)
ans += ca[0]
now.append(ca[1])
pre = 0
for i in now:
pre = pre + i
ans += 1
if pre >= 10:
ans += 1
pre = pre % 10 + 1
print((ans - 1))
| from sys import stdin
input = stdin.readline
m = int(eval(input()))
dc = []
for _ in range(m):
d, c = list(map(int,input().split()))
dc.append((d, c))
def cal(d, c):
if c == 1:
return [0, d]
t = 1 + (d + d >= 10)
a = (d + d >= 10) + (d + d) % 10
ca = cal(a, c // 2)
if c % 2:
return [(c // 2) * t + ca[0] + 1 + (ca[1] + d >= 10), (ca[1] + d >= 10) + (ca[1] + d) % 10]
else:
return [(c // 2) * t + ca[0], ca[1]]
ans = 0
now = []
for d, c in dc:
ca = cal(d, c)
ans += ca[0]
now.append(ca[1])
pre = 0
for i in now:
pre = pre + i
ans += 1
if pre >= 10:
ans += 1
pre = pre % 10 + 1
print((ans - 1))
| p02856 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
M, *DC = list(map(int, read().split()))
D = DC[::2]
C = DC[1::2]
total = sum(d * c for d, c in zip(D, C))
q, r = divmod(total, 9)
ans = sum(C) - 1 + q - (r == 0)
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
M, *DC = list(map(int, read().split()))
D = DC[::2]
C = DC[1::2]
total = sum(d * c for d, c in zip(D, C))
ans = sum(C) - 1 + (total - 1) // 9
print(ans)
return
if __name__ == '__main__':
main()
| p02856 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
M, *DC = list(map(int, read().split()))
D = DC[::2]
C = DC[1::2]
total = sum(d * c for d, c in zip(D, C))
ans = sum(C) - 1 + (total - 1) // 9
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
M, *DC = list(map(int, read().split()))
total = digits = 0
for d, c in zip(DC[::2], DC[1::2]):
total += d * c
digits += c
ans = digits - 1 + (total - 1) // 9
print(ans)
return
if __name__ == '__main__':
main()
| p02856 |
m=int(eval(input()))
d=[0]*m
c=[0]*m
for i in range(m):
d[i],c[i]=list(map(int,input().split()))
a=0
for i in range(m):
a=a+d[i]*c[i]
print((sum(c)-1+(a-1)//9)) | m=int(eval(input()))
a=0
b=0
for i in range(m):
d,c=list(map(int,input().split()))
a=a+d*c
b=b+c
print(((a-1)//9+b-1)) | p02856 |
while 1:
n=eval(input())
if n==0:break
a=[0]*n
c=input()
b=0
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,sorted(a))),b) | while 1:
n=eval(input())
if n==0:break
a,b,c=[0]*n,0,input()
for i in range(100):
if c[i]=="M":
a[i%n]+=1
elif c[i]=="S":
b+=1+a[i%n]
a[i%n]=0
else:
a[i%n]+=1+b
b=0
print(" ".join(map(str,sorted(a))),b) | p00275 |
from math import sqrt
from bisect import bisect_left
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
d = xd**2 + yd**2
k = sqrt((4.0 - d) / d) / 2.0
xc = (x1 + x2) / 2.0
yc = (y1 + y2) / 2.0
return [[xc - k*yd, yc + k*xd], [xc + k*yd, yc - k*xd]]
while 1:
n = int(input())
if n==0: break
p = [list(map(float, input().split())) for i in range(n)]
p.sort()
prev = 0
ans = 1
for i in range(n):
bx, by = p[i]
while bx - p[prev][0] >= 2.0: prev += 1
for j in range(i+1, n):
cx, cy = p[j]
if cx - bx >= 2.0: break
if (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
for k in range(prev, n):
if k==i or k==j: continue
dx, dy = p[k]
if dx - bx >= 2.0: break
if (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | from math import sqrt
from bisect import bisect_left
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
d = xd**2 + yd**2
k = sqrt((4.0 - d) / d) / 2.0
xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0
xd *= k; yd *= k
return [[xc - yd, yc + xd], [xc + yd, yc - xd]]
while 1:
n = int(input())
if n==0: break
p = sorted(list(map(float, input().split())) for i in range(n))
prev = 0
ans = 1
for i in range(n):
bx, by = p[i]
while bx - p[prev][0] >= 2.0: prev += 1
for j in range(i+1, n):
cx, cy = p[j]
if cx - bx >= 2.0: break
if (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
for k in range(prev, n):
if k==i or k==j: continue
dx, dy = p[k]
if dx - ex >= 1.0: break
if (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | p00713 |
from math import sqrt
from bisect import bisect_left
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
d = xd**2 + yd**2
k = sqrt((4.0 - d) / d) / 2.0
xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0
xd *= k; yd *= k
return [[xc - yd, yc + xd], [xc + yd, yc - xd]]
while 1:
n = int(input())
if n==0: break
p = sorted(list(map(float, input().split())) for i in range(n))
px = [e[0] for e in p]; py = [e[1] for e in p]
prev = 0
ans = 1
for i in range(n):
bx = px[i]; by = py[i]
while bx - px[prev] >= 2.0: prev += 1
for j in range(i+1, n):
cx = px[j]; cy = py[j]
if cx - bx >= 2.0: break
if (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
for k in range(prev, n):
if k==i or k==j: continue
dx = px[k]; dy = py[k]
if dx - ex >= 1.0: break
if (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | from math import sqrt
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
d = xd**2 + yd**2
k = sqrt((4.0 - d) / d) / 2.0
xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0
xd *= k; yd *= k
return [[xc - yd, yc + xd], [xc + yd, yc - xd]]
while 1:
n = int(input())
if n==0: break
p = sorted(list(map(float, input().split())) for i in range(n))
prev = 0
ans = 1
for i in range(n):
bx, by = p[i]
while bx - p[prev][0] >= 2.0: prev += 1
for j in range(i+1, n):
cx, cy = p[j]
if cx - bx >= 2.0: break
if abs(by - cy) <= 2.0 and (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
for k in range(prev, n):
if k==i or k==j: continue
dx, dy = p[k]
if ex - dx >= 1.0: continue
if dx - ex >= 1.0: break
if abs(ey - dy) <= 1.0 and (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | p00713 |
from math import sqrt
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
d = xd**2 + yd**2
k = sqrt((4.0 - d) / d) / 2.0
xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0
xd *= k; yd *= k
return [[xc - yd, yc + xd], [xc + yd, yc - xd]]
while 1:
n = int(input())
if n==0: break
p = sorted(list(map(float, input().split())) for i in range(n))
prev = 0
ans = 1
for i in range(n):
bx, by = p[i]
while bx - p[prev][0] >= 2.0: prev += 1
for j in range(i+1, n):
cx, cy = p[j]
if cx - bx >= 2.0: break
if abs(by - cy) <= 2.0 and (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
for k in range(prev, n):
if k==i or k==j: continue
dx, dy = p[k]
if ex - dx >= 1.0: continue
if dx - ex >= 1.0: break
if abs(ey - dy) <= 1.0 and (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | from math import sqrt
def circle_center(x1, y1, x2, y2):
xd = x2 - x1; yd = y2 - y1
k = sqrt(1.0/(xd**2 + yd**2) - 0.25)
xc = (x1 + x2) / 2.0; yc = (y1 + y2) / 2.0
xd *= k; yd *= k
return [[xc - yd, yc + xd], [xc + yd, yc - xd]]
while 1:
n = int(input())
if n==0: break
p = sorted(list(map(float, input().split())) for i in range(n))
prev = 0; pvx = p[0][0]
ans = 1
for i in range(n):
bx, by = p[i]
bxm2 = bx - 2.0; bxp2 = bx + 2.0
bym2 = by - 2.0; byp2 = by + 2.0
while bxm2 >= pvx:
prev += 1; pvx = p[prev][0]
for j in range(i+1, n):
cx, cy = p[j]
if cx >= bxp2: break
if bym2 <= cy <= byp2 and (bx - cx)**2 + (by - cy)**2 <= 4.0:
for ex, ey in circle_center(bx, by, cx, cy):
count = 2
exm1 = ex - 1.0; exp1 = ex + 1.0
eym1 = ey - 1.0; eyp1 = ey + 1.0
q = prev
while exm1 >= p[q][0]: q += 1
for k in range(q, n):
if k==i or k==j: continue
dx, dy = p[k]
if dx >= exp1: break
if eym1 <= dy <= eyp1 and (ex - dx)**2 + (ey - dy)**2 <= 1.0:
count += 1
ans = max(ans, count)
print(ans) | p00713 |
# coding: utf-8
from itertools import accumulate as accum
import sys
input = sys.stdin.readline
def f(N, s):
MOD = int(1e9 + 7)
dp = [[0] * N for _ in range(N)]
for j in range(N):
dp[0][j] = 1
for i in range(1, N):
csum = list(accum(dp[i - 1], lambda x, y: (x + y) % MOD))
dpi = dp[i]
csum_ = csum[N - i]
i_ = i - 1
for j in range(N - i): # N-(i+1)+1 = N-i
dpi[j] = csum[j] if s[i_] == ">" else (csum_ - csum[j] + MOD) % MOD
return(dp[-1][0])
N = int(eval(input())) # 2 <= N <= 30000
s = input().rstrip() # len(s) = N - 1
print((f(N, s)))
| # coding: utf-8
import sys
input = sys.stdin.readline
def f2(N, s):
MOD = int(1e9 + 7)
dp = [1] * N
for i in range(1, N):
csum = list(dp)
for j in range(1, N - i + 1):
csum[j] += csum[j - 1]
csum_ = csum[N - i]
i_ = i - 1
for j in range(N - i): # N-(i+1)+1 = N-i
dp[j] = csum[j] if s[i_] == ">" else (csum_ - csum[j] + MOD) % MOD
return(dp[0])
N = int(eval(input())) # 2 <= N <= 30000
s = input().rstrip() # len(s) = N - 1
print((f2(N, s)))
| p03179 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
n = int(input())
s = input()
def main():
md=10**9+7
dp=[[0]*(n+1) for _ in range(n+1)]
dp[1][0]=1
dpx=dp[1]
for x in range(2,n+1):
dpx1=dpx
dpx=dp[x]
for i in range(x):
if s[n-x]=="<":
dpx[i]=sum(dpx1[i:x-1])%md
else:
dpx[i]=sum(dpx1[:i])%md
#p2D(dp)
print(sum(dp[n])%md)
main()
| import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
n = int(input())
s = input()
def main():
md=10**9+7
dp=[[0]*(n+1) for _ in range(n+1)]
dp[1][0]=1
dpx=dp[1]
for x in range(2,n+1):
dpx1=dpx
dpx=dp[x]
if s[n - x] == "<":
for i in range(x-2,-1,-1):
dpx[i]=(dpx[i+1]+dpx1[i])%md
else:
for i in range(1,x):
dpx[i]=(dpx[i-1]+dpx1[i-1])%md
#p2D(dp)
print(sum(dp[n])%md)
main()
| p03179 |
import math
b=list(map(int,input().split(" ")))
c=2*b[0]/b[1]
t=0
for i in range(1,int(c)+1):
for j in range(1,int(c)+1):
for k in range(1,int(c)+1):
if (i+j-k)/2*b[1]>=1 and (i+j-k)/2*b[1]<=b[0] and math.modf((i+j-k)/2*b[1])[0]==0:
if (k+j-i)/2*b[1]>=1 and (k+j-i)/2*b[1]<=b[0] and math.modf((k+j-i)/2*b[1])[0]==0:
if (i+k-j)/2*b[1]>=1 and (i+k-j)/2*b[1]<=b[0] and math.modf((i+k-j)/2*b[1])[0]==0:
t+=1
print (t) | n,k=list(map(int,input().split()))
c=int(n/k)
if(k%2==1):
print((c*c*c))
else:
ans=c*c*c
c=int((n+k/2)/int(k))
print((c*c*c+ans))
| p03268 |
n,k=list(map(int,input().split()))
l=[i for i in range(1,n+1) if (2*i)%k==0]
cnt=0
for x in range(len(l)):
for y in range(len(l)):
for z in range(len(l)):
if (l[x]+l[y])%k==0 and (l[y]+l[z])%k==0 and (l[z]+l[x])%k==0:
cnt+=1
print(cnt) | n,k=list(map(int,input().split()))
if k%2==1:
print(((n//k)**3))
else:
kk=k//2
print(((n//k)**3+((n+kk)//k)**3)) | p03268 |
N, K = list(map(int, input().split()))
k = 2*N // K
ans = 0
for a in range(1, N+1):
b = 0
if 2*a %K != 0:
continue
kmin = a//K +1
for i in range(kmin, k+1):
if i*K - a > N:
break
b += 1
ans += b*b
print(ans)
| N, K = list(map(int, input().split()))
if K % 2 == 1:
a = N // K
print((a**3))
else:
a = N//K
a2 = N//(K//2) -a
print((a**3 +a2**3)) | p03268 |
n,k=list(map(int,input().split()))
c=0
s = k if k%2==1 else k//2
for i in range(s,n+1,s):
for j in range(s,n+1,s):
for l in range(s,n+1,s):
if (i+j)%k==0 and (i+l)%k==0 and (j+l)%k==0:
c+=1
print(c)
| n,k=list(map(int,input().split()))
c=0
s = k if k%2==1 else k//2
for i in range(s,n+1,s):
s2 = k if i%k==0 else s
n2 = (n-s2)//k+1
c+=n2**2
print(c) | p03268 |
n, k = list(map(int, input().split()))
d = {}
q, r = divmod(n, k)
if r == 0:
for i in range(k):
d[i] = q
else:
for i in range(k):
if i == 0:
d[i] = q
elif 1 <= i <= r:
d[i] = q+1
else:
d[i] = q
#print(d)
ans = 0
if k%2 != 0:
ans = d[0]**3
else:
ans = d[0]**3+d[k//2]**3
print(ans)
| n, k = list(map(int, input().split()))
if k%2 == 0:
q1, r1 = divmod(n, k)
if r1 < k//2:
q2 = q1
else:
q2 = q1+1
ans = q2**3 + q1**3
else:
q1, r1 = divmod(n, k)
ans = q1**3
#print(q1, q2)
print(ans)
| p03268 |
n,k=list(map(int,input().split()))
ans=0
for a in range(1,n+1):
aa=a%k
b=c=(2*k-a-1)%k+1
if (b+c)%k:continue
ans+=((n-b)//k+1)**2
print(ans) | n,k=list(map(int,input().split()))
ans=0
for a in range(1,n+1):
b=c=(k-a-1)%k+1
if (b+c)%k:continue
ans+=((n-b)//k+1)**2
print(ans) | p03268 |
n,k=list(map(int,input().split()))
ans=0
for a in range(1,n+1):
b=c=(k-a-1)%k+1
if (b+c)%k:continue
ans+=((n-b)//k+1)**2
print(ans) | n,k=list(map(int,input().split()))
ans=0
for a in range(1,n+1):
m=(k-a-1)%k+1
if (m+m)%k!=0:continue
ans+=((n-m+k)//k)*((n-m+k)//k)
print(ans) | p03268 |
def main():
N, K = (int(i) for i in input().split())
c0 = 0
c1 = 0
for num in range(1, N+1):
if num % K == 0:
c0 += 1
elif K % 2 == 0 and num % K == K//2:
c1 += 1
print((pow(c0, 3) + pow(c1, 3)))
if __name__ == '__main__':
main()
| def main():
N, K = (int(i) for i in input().split())
c0 = 0
c1 = 0
for num in range(1, N+1):
if num % K == 0:
c0 += 1
elif K % 2 == 0 and num % K == K//2:
c1 += 1
print((c0*c0*c0 + c1*c1*c1))
if __name__ == '__main__':
main()
| p03268 |
N, K = list(map(int, input().split()))
if K == 1:
print((N**3))
exit()
ans = 0
for k in range(K):
if (k * 2) % K != 0:
continue
M = (N // K) - (1 if k == 0 else 0)
if N % K >= k:
M += 1
ans += M**3
print(ans)
| N, K = list(map(int, input().split()))
M = N // K
ans = M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
if K % 2 == 0:
if N % K >= K // 2:
M += 1
ans += M * (M - 1) * (M - 2) + M * (M - 1) * 3 + M
print(ans)
| p03268 |
n,k=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
c=0
if 2*i%k==0:
c+=1+(n+i)//k+(-1-i)//k
#python3 a.pyprint(c)
ans+=c**2
print(ans) | n,k=list(map(int,input().split()))
ans=0
for i in range(1,n+1):
if 2*i%k==0:
ans+=(1+(n+i)//k+(-1-i)//k)**2
print(ans) | p03268 |
N, K = list(map(int,input().split()))
ans = 0
for i in range(K, N+1, K):
for j in range(K, N+1, K):
for k in range(K, N+1, K):
ans += 1
if K % 2 == 0:
for i in range(K//2, N+1, K):
for j in range(K//2, N+1, K):
for k in range(K//2, N+1, K):
ans += 1
print(ans) | N, K = list(map(int,input().split()))
ans = 0
cnt = 0
for i in range(K, N+1, K):
cnt += 1
ans += pow(cnt, 3)
if K % 2 == 0:
cnt = 0
for i in range(K//2, N+1, K):
cnt += 1
ans += pow(cnt, 3)
print(ans) | p03268 |
n, k = [int(i) for i in input().split()]
cnt = 0
for i in range(1,2*n//k+1):
if i*k%2 ==1 and k%2 == 1:
for j in range((i-1)//2):
a = i*k//2 - (k+2*k*j-1)//2
if i * k - a <= n:
cnt += ((a+n)//k - a//k)*2
elif i*k%2 == 0:
if k%2 == 0:
for j in range(i-1):
a = i * k // 2 - (k + k * j) // 2
if i*k-a <= n:
cnt += ((a + n) // k - a // k) * 2
else:
for j in range(1,i // 2):
a = i * k // 2 - k * j
if i * k - a <= n:
cnt += ((a + n) // k - a // k) * 2
cnt += ((i*k//2 + n) // k - (i*k//2) // k)
print(cnt)
| N, K = [int(i) for i in input().split()]
cnt = 0
if K % 2 == 0:
for i in range(1, 2*N//K+1):
cnt += 1 + (2*N//K-i)//2 * 6 + (2*N//K-i)//2 * ((2*N//K-i)//2 - 1) * 3
else:
for i in range(1, N//K+1):
cnt += 1 + (N//K-i) * 6 + (N//K-i) * ((N//K-i) - 1) * 3
print(cnt) | p03268 |
N,K = list(map(int,input().split()))
if K%2==0:
k = K//2
o = (N+k)//K
e = N//K
ans = e**3+o**3
else:
ans = (N//K)**3
print(ans) | N,K = list(map(int,input().split()))
if K%2==1:
n = N//K
ans = n**3
else:
n1 = N//K
n2 = 1+(N-K//2)//K
ans = n1**3+n2**3
print(ans) | p03268 |
N,K = list(map(int,input().split()))
if K%2==1:
n = N//K
ans = n**3
else:
n1 = N//K
n2 = 1+(N-K//2)//K
ans = n1**3+n2**3
print(ans) | N,K = list(map(int,input().split()))
L = N//K
if K%2==1:
print((L**3))
else:
M = N//(K//2)
M -= L
print((L**3+M**3)) | p03268 |
n, k = list(map(int, input().split()))
ans = 0
for a in range(1, n + 1):
if (a % k == 0):
ans += (n // k) ** 2
else:
q = a % k
if (2 * q % k != 0):
continue
ans += ((n + q) // k) ** 2
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
for a in range(1, n + 1):
q = a % k
if (2 * q % k != 0):
continue
ans += ((n + q) // k) ** 2
print(ans)
| p03268 |
N, K = list(map(int, input().split()))
ans = 0
num = [0] * (K+1)
for i in range(1, N+1):
num[i % K] += 1
for a in range(K+1):
b = (K-a) % K
c = (K-a) % K
if ((b+c) % K) == 0:
ans += (num[a] * num[b] * num[c])
print(ans)
| N, K = list(map(int, input().split()))
# Kが偶数の場合, 全てKの倍数または全てK//2に倍数の両方考える必要あり
num = [0]*(K+1) # 1以上N以下の整数で余りが0~K-1の個数をカウントする
for i in range(1, N+1):
num[i % K] += 1 # i % K の取りうる値は0~K-1
ans = 0
for a in range(K+1): # aに関して全探索を行う
b = (K-a) % K
c = (K-a) % K
if (b + c) % K == 0:
ans += num[a] * num[b] * num[c]
print(ans)
| p03268 |
import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
while ini_n <= N:
cnt_n += 1
ini_n += K
ans = cnt_n ** 3
if K % 2 == 0:
ini_k = K // 2
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k ** 3
print(ans) | import sys
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for i in range(N)]
def dp2(ini, i, j): return [[ini]*i for i2 in range(j)]
def dp3(ini, i, j, k): return [[[ini]*i for i2 in range(j)] for i3 in range(k)]
#import bisect #bisect.bisect_left(B, a)
#from collections import defaultdict #d = defaultdict(int) d[key] += value
N, K = mi()
cnt_n = 0
ini_n = K
#while ini_n <= N:
#cnt_n += 1
#ini_n += K
cnt_n = N // K
ans = cnt_n ** 3
if K % 2 == 0:
ini_k = K // 2
'''
cnt_k = 0
while ini_k <= N:
cnt_k += 1
ini_k += K
ans += cnt_k ** 3
'''
if N >= ini_k:
ans += ((N - ini_k) // K + 1)**3
print(ans) | p03268 |
n, k = list(map(int, input().split()))
s = []
for a in range(1, n + 1):
if (2 * a) % k == 0:
s.append(a)
count = 0
for a in s:
for b in s:
for c in s:
if (a + b) % k == 0 and (b + c) % k == 0 and (c + a) % k == 0:
count += 1
print(count) | n, k = list(map(int, input().split()))
s = []
for a in range(1, n + 1):
if (2 * a) % k == 0:
s.append(a)
t = []
for a in range(1, n + 1):
if a % k == 0:
t.append(a)
print(((len(s) - len(t)) ** 3 + len(t) ** 3)) | p03268 |
def kumiawase(num):
return num + 3*num*(num-1) + num*(num-1)*(num-2)
n, k = list(map(int, input().split()))
if k%2 == 1:
ans = kumiawase(n//k)
else:
m = k//2
if m % k == 0:
ans = kumiawase(n//m)
else:
ans = kumiawase(n//k) + kumiawase(n//m - n//k)
print(ans) | def kumiawase(num):
return num + 3*num*(num-1) + num*(num-1)*(num-2)
n, k = list(map(int, input().split()))
if k%2 == 1:
ans = kumiawase(n//k)
else:
m = k//2
ans = kumiawase(n//k) + kumiawase(n//m - n//k)
print(ans) | p03268 |
import math
from itertools import product
b=list(map(int,input().split(" ")))
c=2*b[0]/b[1]
a=[i for i in range(1,int(c)+1)]
a=list(product(a,repeat=3))
t=0
for i in a:
if (i[0]+i[1]-i[2])*b[1]/2.0>=1 and (i[0]+i[1]-i[2])*b[1]/2.0<=b[0] and math.modf((i[0]+i[1]-i[2])*b[1]/2.0)[0]==0:
if (i[0]+i[2]-i[1])*b[1]/2.0>=1 and (i[0]+i[2]-i[1])*b[1]/2.0<=b[0] and math.modf((i[0]+i[2]-i[1])*b[1]/2.0)[0]==0:
if (i[2]+i[1]-i[0])*b[1]/2.0>=1 and (i[2]+i[1]-i[0])*b[1]/2.0<=b[0] and math.modf((i[2]+i[1]-i[0])*b[1]/2.0)[0]==0:
t+=1
print (t)
| N, K = list(map(int, input().split()))
ans = 0
for a in range(1, N+1):
if(2 * a % K == 0):
beg = K - a % K
end = N
cnt = (end - beg + K) // K
ans += cnt * cnt
print(ans) | p03268 |
import itertools
n, k = list(map(int, input().split()))
cnt = 0
if k % 2 == 0:
k_2 = k // 2
else:
k_2 = k
for a in range(k_2, n+1, k_2):
for b in itertools.product(list(range(k-(a%k), n+1, k)), repeat=2):
cnt += len(b) // 2
print(cnt)
| n, k = list(map(int, input().split()))
cnt = 0
if k % 2 == 0:
k_2 = k // 2
else:
k_2 = k
for a in range(k_2, n+1, k_2):
cnt += len(list(range(k-(a%k), n+1, k))) ** 2
print(cnt)
| p03268 |
N,K=list(map(int,input().split()))
c=0
if K%2==0:
d=K//2
else:
print(((N//K)**3))
exit()
for i in range(d,N+1,d):
for j in range(d,N+1,d):
for k in range(d,N+1,d):
if (i+j)%K==0 and (j+k)%K==0 and (k+i)%K==0:
c+=1
print(c) | N,K=list(map(int,input().split()))
if K%2==0:
print(((N//K)**3+((N//(K//2))-(N//K))**3))
else:
print(((N//K)**3)) | p03268 |
list = list()
for i in range(10):
list.append(eval(input()))
list.sort()
list.reverse()
for i in range(3):
print(list[i]) | import sys
l = sorted([int(s) for s in sys.stdin], reverse=True)[:3]
print('\n'.join([str(s) for s in l])) | p00001 |
s = []
for i in range(10):
s.append(int(input()))
s.sort()
s.reverse()
for i in range(3):
print(s[i]) | s = []
for i in range(10):
s.append(int(input()))
s.sort()
for i in range(3):
print(s[9-i]) | p00001 |
hills = []
for i in range(10):
hills.append(int(eval(input())))
hills.sort(reverse=True)
for i in range(3):
print((hills[i])) | [print(y) for y in sorted([int(input()) for x in range(10)], reverse=True)[:3]]
| p00001 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.