Source stringclasses 1
value | Date int64 2.01k 2.02k | Text stringlengths 22 783k | Token_count int64 20 394k |
|---|---|---|---|
Project_CodeNet | 2,020 | #!/usr/bin/env python3
n, k = map(int, input().split())
"""
bを固定して、aの数を数える
(b-k) * (N//b) + min(0,n%b - k +1)
注意するのは、k >= b なら0
"""
ans = 0
# b を動かす
for b in range(k + 1, n + 1):
ans += (b - k) * (n // b) + max(0, n % b - k + 1)
# print(ans, b)
if k == 0:
print(n ** 2)
else:
print(ans)
| 149 |
Project_CodeNet | 2,020 | N,K=map(int, input().split())
ans=0
for b in range(K+1,N+1):
ans += (b-K)*(N//b)
ans += max(0, N%b + (1 - K if K!=0 else 0))
print(ans) | 62 |
Project_CodeNet | 2,019 | import sys
stdin = sys.stdin
ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))
rs = lambda: stdin.readline().rstrip() # ignore trailing spaces
N, K = rl()
answer = 0
if K == 0:
print(N**2)
exit()
for b in range(K+1, N+1):
x = N // b
answer += x * (b-K) + max(0, (N-(x*b))-... | 123 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
ans = 0
for b in range(K + 1, N + 1):
p, q = divmod(N, b)
ans += p * (b - K)
if K:
ans += max(0, q - K + 1)
else:
ans += q
print(ans) | 80 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ans = 0
for i in range(1,n+1):
#divmod: 割り算の商と余りを同時に取得
p,r = divmod(n, i)
# print(f"i {i}, p {p}, r {r}")
# print("1", p*max(0,i-k))
# print("2", max(0,r-k+1))
ans += p*max(0,i-k)+max(0,r-k+1)
print(ans if k != 0 else ans - n)
| 132 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
ans = 0
for b in range(K+1, N+1):
ans += N//b*(b-K)
ans += max(N-N//b*b-max(K-1, 0), 0)
print(ans) | 61 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
for i in range(k+1,n+1):
ans_i=(i-k)*(-(-(n+1)//i))
# print(i,ans_i,end=" ")
if(n%i<k):
ans_i-=(i-k)
else:
ans_i-=(i-1)-(n%i)
# print(ans_i)
ans+=ans_i
if(k==0):
ans-=n
print(ans) | 103 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
for b in range(k+1,n+1):
m=(n//b)
mm=n%b
ans+=m*(b-k)
ans+=max(0,mm-k+1)
print(ans-(n if k==0 else 0)) | 69 |
Project_CodeNet | 2,019 | import sys
import math
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, input().split()))
ns = lambda: input()
N,K = na()
result=0
for b in range(1,N+1):
p = N//b
r = N%b
result+=p*max(0,b-K)
result+=max(0,r+1-K)
if(K==0):
result-=1
print(result) | 105 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
a = 0
for b in range(1, n + 1):
p, q = divmod(n, b)
a += max(0, b - k) * p + max(0, q - k + 1)
print(a if k else n*n) | 72 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
ans = 0
if K == 0:
print(N ** 2)
else:
# b を固定？
for b in range(1, N + 1):
if b - 1 < K: continue
ans += (b - K) * (N // b)
ans += max(N % b - K + 1, 0)
# print(b, ans)
print(ans) | 104 |
Project_CodeNet | 2,020 | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
n, k = map(int, input().split())
ans = 0
for b in range(k+1, n+1):
ans += (b-k) * (n//b) + max(n%b - (max(k-1, 0)), 0)
print(ans)
if __name__=='__main__':
main()
| 94 |
Project_CodeNet | 2,019 | import sys
input = sys.stdin.readline
def main():
N,K = map(int,input().split())
count = 0
for i in range(K+1,N+1):
p = N//i
r = N%i
count += p*max(0,i-K)+max(0,r-K+1)
print(count) if K != 0 else print(count-N)
if __name__ == "__main__":
main() | 97 |
Project_CodeNet | 2,020 | from collections import *
from heapq import *
from itertools import *
from fractions import gcd
import sys
from decimal import *
import copy
from bisect import *
input=lambda :sys.stdin.readline().rstrip()
N,K=map(int,input().split())
if K==0:
print(N**2)
exit()
count=0
for b in range(K+1,N+1):
count+=(N//b... | 106 |
Project_CodeNet | 2,019 | n,k=map(int,input().split())
sum=0
for i in range(k+1,n+1):
x=n//i
y=n%i
sum+=x*(i-k)+max(y-k+1,0)
if k>0:
print(sum)
else:
print(sum-n) | 67 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
ans=0
for b in range(K+1,N+1):
ans+=(N//b*(b-K))+max(N%b+1-K,0)-(K<1)
print(ans) | 51 |
Project_CodeNet | 2,020 | import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns... | 243 |
Project_CodeNet | 2,019 | import sys
N,K=map(int,input().split())
if K==0:
print(N**2)
sys.exit()
ans=0
for b in range(1,N+1):
v=N//b
r=N-b*v
ans+=(v*(max(0,b-K))+max(0,r-K+1))
print(ans) | 75 |
Project_CodeNet | 2,018 | if __name__ == '__main__':
N, K = list(map(int, input().split(' ')))
if K != 0:
counter = 0
for b in range(K+1, N+1):
counter += (b - K) * ((N+1) // b)
if N - ((N+1) // b) * b + 1>= K:
counter += N - ((N+1) // b) * b - K + 1
print(counter)
el... | 120 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
cnt=0
for i in range(1,n+1):
temp=(n//i)*(i-k)+max((n-(i*(n//i)+k-1)),0) if i-1>=k else 0
cnt+=min(temp,n)
#print(temp,i)
print(cnt) | 75 |
Project_CodeNet | 2,018 | n,k = list(map(int,input().split()))
ans = 0
for i in range(k+1,n+1):
ans += (n//i)*(i-k)+max(n%i-k+1,0)
if k==0: ans-=n
print(ans)
| 58 |
Project_CodeNet | 2,018 | n,k=map(int,input().split())
s=0
for i in range(k+1,n+1):
s+=(n//i)*(i-k)
s+=max(0,min(n%i,n%i-k+1))
print(s) | 52 |
Project_CodeNet | 2,020 | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *
class Scanner():
@staticmethod
... | 700 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
for i in range(1, n + 1):
ans += max((n//i)*(i - k), 0) + max((n%i - k + 1), 0)
if k == 0:
ans = n**2
print(ans) | 74 |
Project_CodeNet | 2,020 |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N, K = read_ints()
answer = 0
if K == 0:
return N*N
for b in range(K+1, N+1):
answer += (N//b)*(b-K)+max(0, N%b-(K)+1)
return answer
if __name__ ... | 114 |
Project_CodeNet | 2,019 | # 2019/10/02
n,k=map(int,input().split())
cnt=0
if k==0:
print(n**2)
exit()
for b in range(k+1,n+1):
r=(n+1)%b
p=(n+1)//b
cnt+=p*(b-k)
cnt+=max(r-k,0)
print(cnt) | 85 |
Project_CodeNet | 2,018 | num = map(int,raw_input().split())
n = num[0]
k = num[1]
tot = 0
for i in range(n - k):
s = n / (k + i + 1)
t = n % (k + i + 1) - k + 1
if t < 0:
t = 0
tot += s * (i + 1) + t
if k == 0:
tot -= n
print tot | 107 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
if K == 0:
print(N * N)
exit()
ans = 0
for i in range(N):
if i < K:
continue
ans += (N // (i + 1)) * (i - K + 1) + max(N % (i + 1) - K + 1, 0)
print(ans)
| 89 |
Project_CodeNet | 2,018 | N, K = list(map(int,input().split()))
ans = 0
for i in range(K+1,N+1):
ans += (i- K) * (N // i) + max( N % i,K -1) - max((K - 1),0)
#print(ans)
print(ans) | 70 |
Project_CodeNet | 2,020 | N, K = map(int,input().split())
ans = 0
for a in range(1,N+1):
ans += max(0,a-K)*(N//a)+max(0,N%a-K+1)
if K == 0:
ans -= N
print(ans)
| 62 |
Project_CodeNet | 2,020 | N,K=map(int, input().split())
#aをbで割った余りがK以上
#b>a bがK+1以上 bーK
#a=b K=0 Nこ
#a>b bがK+1以上 bをずらしてく a: N-bこ （N-b）//b*(b-K)+
ans=0
if K==0:
ans+=N
for b in range(K+1,N+1):
if b<=N-1:
ans+=( (N-b)//b )*(b-K)
if (N-b)%b!=0:
if K==0:
X=1
else:
X=K
... | 210 |
Project_CodeNet | 2,018 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF()... | 256 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
c=0
for i in range(k+1,n+1):
c+=n//i*(i-k)+max(0,n%i-k+int(k!=0))
print(c)
| 50 |
Project_CodeNet | 2,018 | #!/usr/bin/env python3
n, k = map(int, input().split())
cnt = 0
for b in range(k + 1, n + 1):
cnt += n // b * (b - k)
cnt += max(0, min(n % b, n % b - k + 1))
print(cnt)
| 73 |
Project_CodeNet | 2,020 | N,K = map(int,input().split())
sum = 0
for b in range(1,N+1):
q = N % b
p = (N - q) // b
sum += p * max(0,b-K)
sum += max(0,q-K+1)
if(K == 0):
sum -= N
print(sum) | 79 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ans = 0
for i in range(1,n+1):
p,r = divmod(n, i)
ans += p*max(0,i-k)+max(0,r-k+1)
print(ans if k != 0 else ans - n) | 65 |
Project_CodeNet | 2,018 | N,K = map(int,input().split())
ans = 0
for b in range(K+1, N+1):
# a=K, K+b, K+2b, ...
n = N // b
r = N % b
c = b - K
ans += n * c
if r >= K:
if K > 0:
ans += r - K + 1
else:
ans += r - K
print(ans) | 100 |
Project_CodeNet | 2,018 | def solve(N, K):
if K==0:
return N*N
ans = 0
for b in range(K+1, N+1):
ans += (N//b) * (b-K) + max(0, (N%b) - (K-1))
return ans
N, K = map(int, input().split())
print(solve(N, K)) | 87 |
Project_CodeNet | 2,020 | import sys
n,k=map(int,input().split())
if k==0:
print(n*n)
sys.exit()
s=0
for b in range(k+1,n+1):
sb=0
sb+=(n//b)*(b-k)
c=n%b
if c>=k:
sb+=c-k+1
s+=sb
print(s)
| 84 |
Project_CodeNet | 2,020 | n,k = map(int, input().split())
ans=0
if k==0:
print(n*n)
exit()
for i in range(1, n+1):
p = n//i
ans+=(p*max(0, i-k))
ans+=(max(0, n%i-k+1))
print(int(ans))
| 74 |
Project_CodeNet | 2,018 | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect
def read():
return int(input())
def reads():
return [int(x) for x in input().split()]
(N, K) = reads()
ans = 0
for b in range(K+1, N+1):
ans += (... | 131 |
Project_CodeNet | 2,018 | l = input().split(" ")
N = int(l[0])
K = int(l[1])
ts = 0
for b in range(K + 1, N + 1):
ts += (N // b) * (b - K) \
+ max(0, N % b - K + 1)
if K == 0:
ts -= 1
print(ts)
| 86 |
Project_CodeNet | 2,018 | N,K = map(int, input().split())
ans = 0
for b in range(K+1, N+1):
a = ((N+1) // b) * (b - K) + max(0 , (N+1)%b - K)
ans += a
print(ans if K != 0 else N ** 2 ) | 76 |
Project_CodeNet | 2,020 | import sys
import math # noqa
import bisect # noqa
import queue # noqa
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = map(int, input().split())
res = 0
for b in range(K + 1, N + 1):
p = N // b
q = N - b * p
res += max(0, q - K + 1)
res += p *... | 146 |
Project_CodeNet | 2,020 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | 519 |
Project_CodeNet | 2,018 | import numpy as np
n, k = map(int, input().split())
ans = 0
for m in range(k, n):
nm = n - m
sb = m + 1
s = nm // sb
p = s + 1 if m else s
ps = sb
for d in range(s, 0, -1):
ds = nm // d + 1
co = ds - ps
ans += co * p
ps = ds
p -= 1
ans += n + 1 - ps
... | 246 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
if K == 0:
print(N**2)
exit()
ans = 0
for b in range(1, N+1):
if b <= K:
continue
ans += (N // b) * (b - K)
ans += max(0, N % b - K + 1)
print(ans) | 84 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
i = 0
if k == 0:
ans = n ** 2
else:
while i <= n:
if i >= k:
ans += n // (i + 1) * (i - k + 1)
if k <= n % (i + 1) < n:
ans += n % (i + 1) - (k - 1)
i += 1
print(ans)
| 111 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ret = 0
for b in range(1, n+1):
if b<k+1:
continue
else:
m = n//b
l = n%b
ret += (b-k)*m
if k!=0 and l>=k:
ret += l-k+1
elif k==0:
ret += l
print(ret) | 93 |
Project_CodeNet | 2,019 | from sys import exit, stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
ans = 0
if K == 0:
print(N*N)
exit()
for b in range(K + 1, N + 1):
ans += N // b * (b - K) + max(0, (N % b) - K + 1)
print(ans) | 88 |
Project_CodeNet | 2,019 | N, K = map(int, input().split())
if K == 0:
ans = N * N
else:
ans = 0
for b in range(K + 1, N + 1):
ans += (b - K) * (N // b) + max(0, N % b - K + 1)
print(ans) | 78 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
N, K = map(int, input().split())
cnt = 0
if K == 0:
print(N ** 2)
else:
for b in range(K + 1, N + 1):
p, mod = divmod((N + 1), b)
cnt += p * (b - ... | 142 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
if k == 0:
ans = n**2
print(ans)
exit()
ans = 0
for b in range(1, n+1):
if b <= k:
continue
q, r = divmod(n, b)
if r < k:
ans += ((b-1)-k+1)*q
else:
ans += ((b-1)-k+1)*q + r-k+1
print(ans)
| 112 |
Project_CodeNet | 2,019 | N,K=map(int,input().split())
if K==0: print(N**2);exit(0)
ans=(N-K)*(N-K+1)//2
for b in range(K+1, N):
n=(N-b+1)//b
ans+=(n)*(b-K)
if n*b+b-1!=N:
if N%b>=K:
ans+=N%b-K+1
print(ans)
| 94 |
Project_CodeNet | 2,020 | import sys
sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7
def main():
N,K=MI()
ans=0
for b in range(K+1,N+1):
ans+=((N+1)//b)*(b-K)
ans+=max((N+1)%b-K,0)
#print(b,((N+1)//b)*(b-K... | 144 |
Project_CodeNet | 2,020 | N, K = [int(x) for x in input().split()]
count = 0
if K == 0:
print(N**2)
exit()
for i in range(K+1, N+1):
count += (i - K) * (N // i)
count += max(0, N - ((N // i) * i) - K + 1)
print(count)
| 87 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
# 問題:aをbで割った余りがK以上
# bを固定(これにより、可能性のある余りの値は0,1,...b-1に限られる)して、aの数を数える
# N=pb+rとする
# 余りは、0,1,2,...,b-1のループを(p=0,1,...,p-1)とp回繰り返し、0,1,2,...rで終わる
# p = N//b, r = N%b
# ループ部分はp * max(0,b-K)個、最後の部分はmax(0,r-K+1)個が条件を満たす
# K >= b (ex. 3で割った余りが5以上ですとか言われた時)に0を返すためにmaxを使っている
ans = 0
# bを固定
# ... | 431 |
Project_CodeNet | 2,018 | import sys
n, k = map(int, raw_input().split())
c = 0
if k == 0:
print n**2
sys.exit()
for x in xrange(k+1, n+1):
c += len(xrange(k, x))
c += ((n-x)/x)*(x-k)
if (n-x)%x-k+1 > 0:
c += (n-x)%x-k+1
print c
| 99 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
ans = 0
c = 0
for i in range(K+1,N+1) :
c += 1
d = min(N,N-(K-1))
while d > 0 :
ans += min(d,c)
d -= c
d -= K
print(ans)
| 76 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
ans = 0
if K != 0:
for b in range(1,N+1):
p = N//b
ans += max(0,(b-K)*p)+max((N%b)-K+1,0)
else:
ans = N**2
print(ans) | 74 |
Project_CodeNet | 2,020 | import math
N, K = map(int, input().split())
if K == 0:
ans = N*N
else:
ans = 0
j = 1
for i in range(K+1, N+1):
mod = N % i
x = N//i
ans += x*j
if mod>=K:
ans+=mod-K+1
j += 1
print(ans)
| 96 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
for b in range(1, n + 1):
ans += max(b - k, 0) * (n // b)
ans += max(0, n % b - k + 1)
if k == 0:
ans -= n
print(ans) | 75 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
if K==0:
print(N**2)
exit(0)
ans=0
for i in range(K+1,N+1):
base=i-(K-1)-1
ans+=(N//i)*base
rest=N%i
ans+=max(rest-(K-1),0)
print(ans) | 79 |
Project_CodeNet | 2,018 | # -*- coding: utf-8 -*-
def inpl(): return map(int, input().split())
N, K = inpl()
if K == 0:
print(N*N)
exit()
ans = 0
for b in range(K+1, N+1):
d, m = divmod(N, b)
ans += d*(b-K)
ans += max(0, m+1-K)
print(ans) | 92 |
Project_CodeNet | 2,019 | import sys
input=sys.stdin.readline
def main():
N,K = map(int, input().split())
if K == 0:
print(N**2)
return
ans = 0
for b in range(K+1,N+1):
ans += ((b-1) - (K-1)) * (N//b) + max(0, N%b - (K-1))
print(ans)
if __name__ == '__main__':
main()
| 105 |
Project_CodeNet | 2,020 | import sys
n,k = map(int,input().split())
if k == 0:
print(n**2)
sys.exit()
count = 0
for i in range(1,n+1):
tmp_count = max(0,i - k)
#print(i,n // i,tmp_count,(n // i)* tmp_count + max(0,(n % k)-k+1),max(0,(n % i)-k+1),n % i)
count += (n // i)* tmp_count + max(0,(n % i)-k+1)
if k == 0:
print(n... | 140 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
if k == 0:
ans = -n
else:
ans = 0
for i in range(1,n+1):
ans += max(0, (i-k) * (n // i)) + max(0, (n-(n//i)*i)-k+1)
print(ans) | 79 |
Project_CodeNet | 2,020 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = map(int, input().split())
if k == 0:
print(n ** 2)
exit()
res = 0
for b in range(1, n + 1):
q, r = divmod(n, b)
res += max(0, (b - 1 - (k - 1))) * q + max(0,... | 144 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
ans = 0
for b in reversed(range(1, n+1)):
if b == k:
break
y_cnt = b-k
p, q = divmod(n, b)
ans += y_cnt*p
if k <= q:
ans += q-max(k-1, 0)
print(ans) | 83 |
Project_CodeNet | 2,019 | #設定
import sys
input = sys.stdin.buffer.readline
#ライブラリインポート
from collections import defaultdict
#入力受け取り
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
N, K = getlist()
ans = 0
for i in range(K + 1, N + 1):
ans += (N // i) * (i - K)
if N % i >= K and N % i != 0:
ans += N % i - K +... | 157 |
Project_CodeNet | 2,018 | import sys
import random
def rd():
return sys.stdin.readline().rstrip()
def rdi():
return [ int(x) for x in rd().split() ]
N, K = rdi()
#N, K = 5, 2
#N, K = 10, 0
#N, K = 31415, 9265
s = 0
for b in range(K+1, N+1):
an = 0
j = N / b
an = j * (b - K)
#print b, an
... | 222 |
Project_CodeNet | 2,019 | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().... | 213 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
for i in range(k+1,n+1):
ans+=n//i*(i-k)
if n//i*i+k<=n:ans+=n+1-(n//i*i+k)
print([ans,n**2][k==0]) | 67 |
Project_CodeNet | 2,018 | N, K = map(int,input().split())
if K == 0:
print(N**2)
exit()
ans = 0
for b in range(1,N+1):
p = N//b
r = N%b
ans += p*max(0,b-K) + max(0,r-K+1)
print(ans)
| 77 |
Project_CodeNet | 2,019 | n,k=map(int,input().split())
c=0
for i in range(n,k,-1):
p=n//i
c+=(i-k)*p+(max(0,n-p*i-k+1) if k!=0 else n-p*i-k)
print(c) | 59 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
ans = 0
for b in range(1, N+1):
p = N // b
r = N % b
ans += max(0, b - K) * p + max(0, r - K + 1)
if K == 0:
ans -= 1
print(ans)
| 82 |
Project_CodeNet | 2,020 | n,k=map(int,input().split())
ans=0
if k==0:
print(n*n)
exit()
for i in range(k+1,n+1):
ans+=(i-k)*(n//i)
if n-i*(n//i)-k+1>0:
ans+=n-i*(n//i)-k+1
# print(ans,i)
print(ans) | 85 |
Project_CodeNet | 2,020 | def main():
N, K = map(int, input().split())
if K == 0:
print(N ** 2)
return
ans = 0
for b in range(K + 1, N + 1):
q, r = divmod(N, b)
ans += q * (b - K) + max(0, r - (K - 1))
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit... | 150 |
Project_CodeNet | 2,020 | n, k = map(int, input().split())
if k == 0:
ans = n ** 2
else:
ans = 0
for x in range(k + 1, n + 1):
w = x - k
u = n // x
ans += w * u
ans += max(n - (u * x + k - 1), 0)
print(ans)
| 91 |
Project_CodeNet | 2,019 | def main():
n, k = map(int, input().split(' '))
result = [n//i*max(0,i-k) + max(0, n%i-k+1) for i in range(1, n+1)]
if k != 0:
print(sum(result))
else:
print(sum(result)-n)
main() | 77 |
Project_CodeNet | 2,018 | def main():
n, k = map(int, input().split())
cnt = 0
for b in range(k+1, n+1):
p = n // b + 1
cnt += p * (b-k)
if p * b > n + 1:
cnt -= p * b - max((p-1)*b+k, n+1)
if k == 0:
cnt -= 1
print(cnt)
if __name__ == '__main__':
main()
| 112 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
point = 0
for b in range(1,n+1):
kaisu = n//b
kosuu = max(0,b-k)
point += kaisu*kosuu
point += max(0,n%b+1-k)
if k == 0:
point -= n
print(point) | 80 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
if(k==0):
print(n*n)
exit()
ans = 0
for i in range(k+1,n+1):
ans += (n//i) * (i-k)
ans += max(0, n%i-k+1)
print(ans) | 67 |
Project_CodeNet | 2,018 |
N,K = list(map(int,input().split()))
ans = 0
for i in range(N):
b=i+1
p=int(N/b)
ans+=max(0,b-K)*p+max(0,N-p*b-K+1)
if K==0:
ans-=1
print(ans) | 70 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
ans = 0
for b in range(K + 1, N + 1):
ans += N // b * (b - K) + max(0, (N % b) - K + 1)
if K == 0:
ans = N ** 2
print(ans) | 75 |
Project_CodeNet | 2,020 | N,K=map(int,input().split())
if K==0:
print(N**2)
exit()
ans=0
for i in range(K+1,N+1):
ans+=N//i*(i-K)+max(0,N%i-(K-1))
print(ans) | 61 |
Project_CodeNet | 2,018 | import math, string, fractions, heapq, re, array, bisect, sys, random, time, copy
import itertools as it
import collections as cl
import functools as ft
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x i... | 207 |
Project_CodeNet | 2,019 | N, K = [int(_) for _ in input().split()]
ans = 0
for mod in range(K + 1, N + 1):
ans += (mod - K) * (N // mod) + max(N % mod - max(K - 1, 0), 0)
print(ans)
| 68 |
Project_CodeNet | 2,019 | n,k = map(int, input().split())
if k == 0:
print(n*n)
exit()
ans = 0
for b in range(k+1,n+1):
ans += (b-k) * (n//b)
if b*(n//b)+k<=n:
ans += n-(b*(n//b)+k-1)
print(ans)
| 83 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
if K == 0:
print(N ** 2)
exit()
count = 0
for bi in range(K+1, N+1):
count += (bi - K) * (N // bi) + max(0, N % bi - K + 1)
print(count) | 75 |
Project_CodeNet | 2,019 | N,K = map(int,input().split())
ans = 0
if K == 0:
print(N**2)
exit()
for b in range(K+1,N+1):
p = N // b
r = N % b
ans += p*(b-K)+max(0,r-K+1)
print(ans) | 73 |
Project_CodeNet | 2,020 | n,k = map(int,input().split())
ans = 0
for b in range(1,n+1):
p = n//b
q = n%b
ans += max(b-k,0)*p
ans +=max(0,q-k+1)
if k==0:ans-=1
print(ans)
| 74 |
Project_CodeNet | 2,019 | n,k=map(int,input().split())
ans=0
for i in range(1,n+1):
ans+=(n//i)*max(0,i-k)
if k==0:
ans+=n%i
else:
ans+=max(0,n%i-(k-1))
print(ans) | 67 |
Project_CodeNet | 2,020 | N, K = map(int, input().split())
if K == 0:
print(N * N)
else:
S = 0
for i in range(K+1, N+1):
m = N // i
S += m * (i - K)
S += max(0, N % i - K + 1)
print(S) | 81 |
Project_CodeNet | 2,020 | N, K = map(int, input().split(' '))
ans = (N-K)*(N-K+1)//2
if K==0:
print(N**2)
exit()
for n, i in enumerate(list(range(K+1,N+1))):
ans += (n+1)*((N-i+1)//i)+max(0,(N-i+1)%i-K)
print(ans) | 85 |
Project_CodeNet | 2,018 | N, K = map(int, input().split())
ans = 0
for b in range(K+1, N+1):
k = N // b
ans += k * (b-K) + max((N % b) - K + 1, 0)
if K == 0:
ans -= 1
print(ans) | 76 |
Project_CodeNet | 2,018 | n, k = map(int, input().split())
ans = 0
if k == 0:
ans = n * n
else:
for i in range(1, n + 1):
ans += n // i * max(i - k, 0)
if i >= k and n % i != 0:
ans += max(0, (n % i + 1) - k)
print(ans)
| 93 |
Project_CodeNet | 2,020 | N, K = map(int,input().split())
ans = 0
for b in range(1,N+1):
ans += (N//b)*max(0,b-K) + max(0,N%b-K+1)
if K == 0:
ans -= N
print(ans)
| 64 |
Project_CodeNet | 2,019 | n,k=map(int,input().split())
ans=0
for i in range(k+1,n+1):
ans+=(n//i)*(i-k)+max(n%i-k+1,0)
if k==0:
ans=n**2
print(ans)
| 57 |
Project_CodeNet | 2,020 | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
sys.setrecursionlimit(10 ** 7)
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y:... | 273 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.