input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0 for _ in range(n-1)]
for i in range(n-1):
d[i] = a[i+1]-a[i]
ans = 1
flg = [False, False]
for i in range(n-1):
if d[i] > 0:
flg[0] = True
elif d[i] < 0:
flg[1] = True
if flg[0] =... | #!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
d = [0 for _ in range(n-1)]
for i in range(n-1):
d[i] = a[i+1]-a[i]
# print(d)
ans = 1
state = 'flat'
for i in range(n-1):
if i == 0:
if d[i] > 0:
state = 'up'
elif d[i] < 0:
... | p03745 |
MOD=(10**9)+7
n,k=list(map(int,input().split()))
ans=0
for i in range(k,n+2):
min_start=0
min_end=min_start+i-1
max_end=n
max_start=n-i+1
min_sum=(min_end-min_start+1)*(min_end+min_start)//2
max_sum=(max_end-max_start+1)*(max_end+max_start)//2
# print(i,min_start,min_end,min_sum,max... | n,k=list(map(int,input().split()))
MOD=(10**9)+7
ans=0
for i in range(k,n+2):
min_sum=i*(i-1)//2
max_sum=i*(n+(n-i+1))//2
# print(i,min_sum,max_sum,max_sum-min_sum+1)
ans=(ans+(max_sum-min_sum+1))%MOD
print(ans) | p02708 |
n, k = list(map(int, input().split()))
print((sum(i * (n - i + 1) + 1 for i in range(k, n + 2))%(10**9 + 7)))
| n, k = list(map(int, input().split()))
f = lambda i: (n + 1) * i * (i - 1) // 2 - i * (i - 1) * (2 * i - 1) // 6
print(((n - k + 2 + f(n + 2) - f(k)) % (10**9 + 7)))
| p02708 |
n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
l=[i for i in range(n+1)]
mi=sum(l[:k])
ma=sum(l[n+1-k:])
ans=(ans+(ma-mi+1))%(10**9+7)
for i in range(k+1,n+2):
mi+=l[i-1]
ma+=l[-i]
ans=(ans+(ma-mi+1))%(10**9+7)
print(ans) | n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
l=[i for i in range(n+1)]
mi=sum(l[:k])
ma=sum(l[n+1-k:])
ans=(ans+ma-mi+1)%mod
for i in range(k+1,n+2):
mi+=l[i-1]
ma+=l[-i]
ans=(ans+ma-mi+1)%mod
print(ans) | p02708 |
N, K = list(map(int, input().split()))
counter = 0
for i in range(K, N+2):
smallest = (i-1) * i // 2
largest = ((2 * N + 1) - i) * i // 2
counter += (largest - smallest + 1)
counter %= (10 ** 9 + 7)
print(counter) | N, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
counter = 0
for k in range(K, N+2):
counter += (N-k+1) * k + 1
counter %= MOD
print(counter) | p02708 |
MOD = 10 ** 9 + 7
n,k = list(map(int,input().split()))
ans = 0
for i in range(k,n+2):
i %= MOD
add = -i**2 + i*(n+1) + 1
add %= MOD
ans += add
ans %= MOD
print(ans)
| MOD = 10 ** 9 + 7
n,k = list(map(int,input().split()))
ans = 0
for i in range(k,n+2):
add = -i**2 + i*(n+1) + 1
add %= MOD
ans += add
ans %= MOD
print(ans)
| p02708 |
MOD=10**9+7
N,K=list(map(int,input().split()))
ans=0
for k in range(K,N+2):
ans+=(N-k+1)*k+1
ans%=MOD
print(ans) | MOD=10**9+7
N,K=list(map(int,input().split()))
ans=0
ans+=N-K+2
ans+=(N+1)*(N+1+K)*(N-K+2)//2
ans%=MOD
ans-=(N+1)*(N+2)*(2*N+3)//6
ans%=MOD
ans+=K*(K-1)*(2*K-1)//6
ans%=MOD
print(ans) | p02708 |
N, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
LOW, HIGH = 0, N
ans = 0
if 1 >= K:
ans += (HIGH - LOW + 1)
for i in range(2, N + 2):
LOW += i - 1
HIGH += N - i + 1
LOW %= MOD
HIGH %= MOD
if i >= K:
ans += (HIGH - LOW + 1)
ans %= MOD
print(ans)
| N, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
low, high = 0, 0
ans = 0
for i in range(1, N + 2):
low += i - 1
high += N - i + 1
if i >= K:
ans += (high - low + 1)
ans %= MOD
print(ans)
| p02708 |
n,k = [int(i) for i in input().split()]
mod = 10**9+7
chk = 0
ans = 0
for i in range(n+1):
chk += (n + i*n +1 -(i+1)*i)%mod
chk %= mod
for i in range(k-1):
ans += (n + i*n +1 -(i+1)*i)%mod
ans %= mod
print(((chk-ans)%mod)) | n,k=list(map(int,input().split()));mod=10**9+7;print(((n*(n+1)*(n+2)//6-k*(k-1)*(3*n-2*k+4)//6+n-k+2)%mod)) | p02708 |
# D - Sum of Large Numbers
from itertools import accumulate
def main():
N, K = list(map(int, input().split()))
cumsum_left = tuple(accumulate(list(range(N + 1))))
cumsum_right = tuple(accumulate(reversed(list(range(N + 1)))))
total = 0
MOD = 10 ** 9 + 7
for l, r in zip(cumsum_left[K ... | # D - Sum of Large Numbers
from itertools import accumulate
def main():
N, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
cumsum_left = tuple(accumulate(list(range(N + 1))))
cumsum_right = tuple(accumulate(reversed(list(range(N + 1)))))
total = sum(r - l + 1 for l, r in zip(cumsum_... | p02708 |
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii... | p02708 |
N,K=list(map(int,input().split()))
ans=0
for i in range(K,N+2):
mini=i*(i-1)//2
maxi=i*N-mini
ans=ans+(maxi-mini+1)
print((ans%(10**9+7)))
| N,K=list(map(int,input().split()))
M=N+1
A=-M*(M+1)*(2*M+1)//6+(N+1)*M*(M+1)//2+M
M=K-1
B=-M*(M+1)*(2*M+1)//6+(N+1)*M*(M+1)//2+M
print(((A-B)%(10**9+7))) | p02708 |
def LI():return list(map(int,input().split()))
n,k=LI()
mod=10**9+7
ans=0
for kk in range(k,n+1+1):
tmp=n*kk-(kk-1)*kk+1
ans+=(tmp%mod)
print((ans%mod)) | n,k=list(map(int,input().split()));print(((k-n-2)*(2*k*k-k*n-2*k-n*n-n-6)//6%(10**9+7))) | p02708 |
n,k=list(map(int,input().split()))
a=0
for i in range(k,n+2):
a=(a+i*(n-i+1)+1)%(10**9+7)
print(a) | n,k=list(map(int,input().split()));print((sum(1+i*(n-i+1)for i in range(k,n+2))%(10**9+7))) | p02708 |
a,b=list(map(int,input().split()))
wa=lambda a,b:(a+b)*(b-a+1)//2
print((sum([wa(a+2-i,a+1)-wa(0,i)+1for i in range(b,a+2)])%(10**9+7))) | from math import comb as c
a,b=list(map(int,input().split()))
print((((c(a+2,2)+1)*(a+2-b)-c(a+3-b,3)-c(a+3,3)+c(b+1,3))%(10**9+7))) | p02708 |
P = 10 ** 9 + 7
N, K = list(map(int, input().split()))
L = N + 1 # 数列の長さ
count = 0
table = [i for i in range(N + 1)] # 0 ~ Nまでの数列
cusum = [0] * (L + 1)
for i in range(L):
cusum[i + 1] = cusum[i] + table[i]
while K <= L:
# K個選んだときの最大値 - 最小値 + 1
count += (cusum[L] - cusum[L - K]) - cusum[K] +... | P = 10 ** 9 + 7
N, K = list(map(int, input().split()))
L = N + 1 # 数列の長さ
cusum = [0] * (L + 1)
for i in range(L):
cusum[i + 1] = cusum[i] + (i + 1)
total = 0
for k in range(K, L + 1):
total += (cusum[L] - cusum[L - k]) - cusum[k] + 1
print((total % P)) | p02708 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p02708 |
mod=10**9+7
n,k=list(map(int,input().split()))
ans=(n+1)*(n+k+1)*(n-k+2)//2-(n+1)*(n+2)*(2*n+3)//6+k*(k-1)*(2*k-1)//6+(n-k+2)
ans%=mod
print(ans) | mod=10**9+7
n,k=list(map(int,input().split()))
ans=(n+1)*( (n+k+1)*(n-k+2)/2 - (n+2)*(2*n+3)/6 )+k*(k-1)*(2*k-1)/6+(n-k+2)
ans=round(ans)%mod
print(ans) | p02708 |
#n=int(input())
n,k=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
mod=10**9+7
ans=0
for kval in range(k,n+2):
mx=kval*(2*n-kval+1)//2
mn=kval*(kval-1)//2
add=mx-mn+1
ans=(ans+add) % mod
print(ans)
| #l=int(input())
n,k=list(map(int,input().split()))
#pl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
mod=10**9+7
total=0
for m in range(k,n+2):
add=m*(n-m+1)+1
total=(total+add)%mod
print(total)
| p02708 |
n,k = list(map(int,input().split()))
mod = 10**9+7
ans = 0
for i in range(k,n+2):
ans += i*(n-i+1)+1
ans %= mod
print(ans) | n,k = list(map(int,input().split()))
mod = 10**9+7
print((((-(2*(n+1)**3+3*(n+1)**2+n+1)//6)+(n*(n+1)**2+n*(n+1))//2+((n+1)**2+n+1)//2-((k-1)*n+(k-1)**2*n)//2+n+(k+2*(k-1)**3+3*(k-1)**2-1)//6-(k+(k-1)**2-1)//2-k+2) % mod)) | p02708 |
import sys
n,k = list(map(int,sys.stdin.buffer.read().split()))
mod = 10**9+7
print((((n**3+3*n**2+8*n+2*(k-1)**3-8*(k-1)-3*(k-1)**2*n-3*(k-1)*n)//6+1) % mod)) | n,k = list(map(int,input().split()))
print((((-(2*(n+1)**3+3*(n+1)**2+n+1)//6)+(n*(n+1)**2+n*(n+1))//2+((n+1)**2+n+1)//2-((k-1)*n+(k-1)**2*n)//2+n+(k+2*(k-1)**3+3*(k-1)**2-1)//6-(k+(k-1)**2-1)//2-k+2)%(10**9+7)))
| p02708 |
n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
b=[0]+[i for i in range(n+1)]
for i in range(1,n+2):
b[i]+=b[i-1]
for i in range(k,n+2):
ans+=b[n+1]-b[n-i+1]-b[i]+1
ans%=mod
print(ans) | n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | p02708 |
n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(2*n-i+1)*i//2-i*(i-1)//2+1
ans%=mod
print(ans) | n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(n-i+1)*i+1
ans%=mod
print(ans) | p02708 |
n,k=list(map(int,input().split()))
ans=0
mod=10**9+7
for i in range(k,n+2):
ans+=(n-i+1)*i+1
ans%=mod
print(ans) | n,k=list(map(int,input().split()))
print(((n*(n+1)*(n+2)//6-(3*n-2*k+4)*(k-1)*k//6-k+n+2)%(10**9+7))) | p02708 |
n,k=list(map(int,input().split()))
mod=10**9+7
ans=0
for i in range(k,n+2):
down=i*(i-1)//2
up=n*(n+1)//2-(n-i)*(n-i+1)//2
ans+=up-down+1
ans%=mod
print(ans) | n,k=list(map(int,input().split()))
mod=10**9+7
ans=0
for kk in range(k,n+2):
mi=kk*(kk-1)//2
ma=n*(n+1)//2-(n-kk)*(n-kk+1)//2
ans+=ma-mi+1
ans%=mod
print(ans) | p02708 |
MOD = 1000000007
n, k = list(map(int, input().split()))
n_li = list(range(n+1))
ans = 0
while(k <= n+1):
p = (k - 1) * k / 2
q = ((n + n - k + 1) * k) / 2
ans += q - p + 1
ans %= MOD
k += 1
print((int(ans)))
| MOD = 1000000007
n, k = list(map(int, input().split()))
n_li = list(range(n+1))
ans = 0
for i in range(k, n+2):
p = (k - 1) * k / 2
q = ((n + n - k + 1) * k) / 2
ans += q - p + 1
ans %= MOD
k += 1
print((int(ans)))
| p02708 |
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
# 選ぶ個数で場合分け
# 選べる個数はK,K+1,K+2,...,N+1
# 等差数列の和S
# 項数n, 初項a,末項l,公差d
# S=(n/2)*(a+l)
# S=(n/2)*{2a+(n-1)d}
# 0+1+2+...（項数=i）
for i in range(K, N + 2):
min_sum = i * (i - 1) // 2 # 0+1+...(項数=i)
max_sum = (2 * N - i + 1) * i // 2... | N, K = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
# 選ぶ個数で場合分け
# 選べる個数はK,K+1,K+2,...,N+1
# 等差数列の和S
# 項数n, 初項a,末項l,公差d
# S=(n/2)*(a+l)
# S=(n/2)*{2a+(n-1)d}
for i in range(K, N + 2):
min_sum = i * (i - 1) // 2 # 0+1+...(項数=i)
max_sum = (2 * N - i + 1) * i // 2 # N+(N-1)+...(項数=i)
... | p02708 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowerc... | p02708 |
def solution():
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n+2):
smallest = (i-1) * i // 2
largest = (n-i+1) * i + smallest
ans += largest - smallest + 1
ans %= 10 ** 9 + 7
print(ans)
solution()
| def solution():
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n+2):
smallest = (i-1) * i / 2
largest = (n-i+1) * i + smallest
ans += largest - smallest + 1
ans %= 10 ** 9 + 7
print((int(ans)))
solution()
| p02708 |
MOD = 10**9 + 7
def main():
N, K = (int(i) for i in input().split())
ans = 0
for i in range(K, N+2):
lower = (i-1)*i//2
upper = N*(N+1)//2 - (N-i)*(N-i+1)//2
ans += upper - lower + 1
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| MOD = 10**9 + 7
def main():
N, K = (int(i) for i in input().split())
ans = 0
for i in range(K, N+2):
# lower = (i-1)*i//2
# upper = N*i - (i-1)*i//2
# ans += upper - lower + 1
ans += i*(N-i+1)+1
ans %= MOD
print(ans)
if __name__ == '__main__':
... | p02708 |
mod, ans = 10 ** 9 + 7, 0
N, K = list(map(int, input().split()))
for k in range(K, N + 2):
ans += (N + 1) * (N + 2) // 2 - (N + 2 - k) * (N + 1 - k) // 2 + 1
ans -= k * (k + 1) // 2
ans = ans % mod
print(ans)
| mod = 10 ** 9 + 7
N, K = list(map(int, input().split()))
ans, R, L = 1, N * (N + 1) // 2, N * (N + 1) // 2
for i in range(N + 1 - K):
R, L = R - i, L - (N - i)
ans = (ans + R - L + 1) % mod
print(ans)
| p02708 |
N,K=list(map(int,input().split()))
p=10**9 + 7
ans=0
for i in range(K-1,N+1):
L_min=i*(i+1)//2
L_max=(N*(N+1)//2)-((N-i-1)*(N-i)//2)
ans += (L_max-L_min+1)%p
print((ans%p)) | N,K=list(map(int,input().split()))
p=10**9 + 7
L_min,L_max=0,0
for i in range(K-1,N+1):
L_min+=i*(i+1)//2 - 1
L_max+=(N*(N+1)//2)-((N-i-1)*(N-i)//2)
ans = (L_max-L_min)%p
print(ans)
| p02708 |
n, k = list(map(int, input().split()))
p = 10**9 + 7
cnt = 0
for i in range(k, n + 2):
cnt += (i * (n - (i - 1)) + 1) % p
print((cnt % p)) | n, k = list(map(int, input().split()))
cnt = 0
for i in range(k, n + 2):
cnt += i * (n - i + 1) + 1
print((cnt % (10**9 + 7))) | p02708 |
n, k = list(map(int, input().split()))
cnt = 0
for i in range(k, n + 2):
cnt += i * (n - i + 1) + 1
print((cnt % (10**9 + 7))) | n, k = list(map(int, input().split()))
print((((n*(n + 1)*(n + 2) - (k - 1)*k*(3*n - 2*k + 4))//6 + n - k + 2) % (10**9 + 7))) | p02708 |
n, k = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for t in range(k, n+2):
mini = t * (t-1) // 2 % mod
residue = n - t + 1
maxim = mini + t * residue
maxim %= mod
count = maxim - mini + 1
count %= mod
ans += count
ans %= mod
print(ans)
| n, k = list(map(int, input().split()))
mod = 10 ** 9 + 7
ans = 0
for t in range(k, n+2):
pattern = t * (n+1-t) + 1 % mod
ans = (ans + pattern) % mod
print(ans)
| p02708 |
from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
mins = [0]
maxs = [n]
tmp_min = 0
tmp_max = n
for i in range(1, n + 1):
tmp_min += i
mins.append(tmp_min)
... | from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n + 2):
ans += (n - i + 1) * i + 1
ans %= mod
print((ans % mod))
if __name__ == "__main__":
... | p02708 |
from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n + 2):
ans += (n - i + 1) * i + 1
ans %= mod
print((ans % mod))
if __name__ == "__main__":
... | from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n + 2):
ans += (n - i + 1) * i + 1
print((ans % mod))
if __name__ == "__main__":
setrecursionlimit(1... | p02708 |
from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, ... | from collections import deque
import sys
import bisect
import math
import itertools
from queue import deque
from math import gcd
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inp_list(): return list(map(int, sys.stdin.readline().split()))
def lcm(x, ... | p02708 |
n, k = list(map(int, input().split()))
i = n + 1
mod = 10 ** 9 + 7
ans = 0
while i >= k:
ans += i * (n - i + 1) + 1
ans %= mod
i -= 1
print(ans) | n, k = list(map(int, input().split()))
print(((((-2 + k - n)*(-6 + 2* k**2 - n - n**2 - k*(2 + n)))//6)%(10**9+7))) | p02708 |
class Combination:
def __init__(self, size, mod=10**9 + 7):
self.size = size + 2
self.mod = mod
self.fact = [1, 1] + [0] * size
self.factInv = [1, 1] + [0] * size
self.inv = [0, 1] + [0] * size
for i in range(2, self.size):
self.fact[i] = self.fa... | N, K = list(map(int, input().split()))
MOD = 10**9 + 7
S = N * (N + 1) // 2
ans = 1
for d in range(N + 1):
if N - d < K:
break
mx = S - (d * (d + 1) // 2)
mi = max(0, (N - d - 1) * ((N - d - 1) + 1) // 2)
ans += (mx - mi + 1) % MOD
ans %= MOD
print(ans) | p02708 |
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
S = N * (N + 1) // 2
ans = 1
for d in range(N + 1):
if N - d < K:
break
mx = S - (d * (d + 1) // 2)
mi = max(0, (N - d - 1) * ((N - d - 1) + 1) // 2)
ans += (mx - mi + 1) % MOD
ans %= MOD
print(ans) | N, K = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
for k in range(K, N + 2):
base = k * (k - 1) // 2
mx = base + k + (N - k) * k
ans += mx - base + 1
ans %= MOD
print(ans)
| p02708 |
N, K = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
for k in range(K, N + 2):
base = k * (k - 1) // 2
mx = base + k + (N - k) * k
ans += mx - base + 1
ans %= MOD
print(ans)
| N, K = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
for k in range(K, N + 2):
S = k * (k - 1) // 2
mx = N * k - S
mi = S
ans += mx - mi + 1
ans %= MOD
print(ans)
| p02708 |
n, k = list(map(int, input().split()))
ans = 0
mod = 10 **9 + 7
for i in range(k, n+2):
# i個(k<= i <= n+1)を選ぶとき
# i * 10^100 + (1+2+・・・+(i-1)) 〜 i * 10^100 + (n + (n-1) + ・・・ + (n-(i-1) ) )
# の間の値をとりうるので
# i*(n + n-(i-1))//2 - (i-1)*i//2 + 1 = i * (n-i+1) + 1
ans += i * (n - i + 1) + 1
prin... | n,k=list(map(int,input().split()))
print(((((k-n-2)*(2*k**2-k*(n+2)-n**2-n-6)))//6%(10**9+7))) | p02708 |
n, k = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(k, n+2):
ans += i*(n-i+1) + 1
ans %= mod
print(ans) | n, k = list(map(int, input().split()))
print(((n-k+2)*(n**2-2*k**2+k*(n+2)+n+6)//6 % (10**9+7))) | p02708 |
N, K = list(map(int, input().split()))
ans = 0
for i in range(K, N+2):
ans += i*(N-i+1)+1
print((ans%1000000007)) | N, K = list(map(int, input().split()))
print((int(((N*(N+1)*(N+2) - K*(K-1)*(3*N-2*K+4))/6 + N - K + 2)%1000000007))) | p02708 |
a,b=(int(x) for x in input().split())
z=0
for i in range(b,a+2):
z=(z+(a-i+1)*i+1)%int(1e9+7)
print(z) | a,b=(int(x) for x in input().split())
z=0
for i in range(b,a+2):z=(z+(a-i+1)*i+1)%(10**9+7)
print(z) | p02708 |
a,b=(int(x) for x in input().split())
z=0
while b<=a+1:z=(z+(a-b+1)*b+1)%int(1e9+7);b+=1
print(z) | a,b=(int(x)for x in input().split())
z=0
while b<=a+1:z=(z+(a-b+1)*b+1)%(10**9+7);b+=1
print(z) | p02708 |
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
res = 0
for i in range(k, n + 2):
mi = (i - 1) * i // 2
ma = n * (n + 1) // 2 - (n - i) * (n - i + 1) // 2
res += ma - mi + 1
... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, k = list(map(int, input().split()))
res = 0
for i in range(k, n + 2):
mi = (i - 1) * i // 2
ma = (n + (n - i + 1)) * i // 2
res += ma - mi ... | p02708 |
'''ika tako
選ぶ個数を固定して、それ毎に結果を足し合わせればよい。
k 個の数を選ぶとき、各項に含まれる 10^100 は除いて考えても
和の個数を求める上では問題ない。
最小値は小さい方から k 個を足し合わせた数0+1+2+…+(k-1)
初項 0 、末項 k−1 、長さ k の等差数列の総和なので
k(k−1)/2
最大値は大きい方から k 個を足し合わせた数(N-k+1)+…+(N-1)+N
初項 N−k+1 、末項N 、長さk の等差数列の総和なので
k(2N−k+1)/2
数字は1刻みで、特に選び方に制約も無いので、最小値～最大値の間の整数は全て作れる... | N, K = list(map(int,input().split()))
ans = 0
MOD = 10**9 + 7
for i in range(K,N+2):
x = (N+1-i) * i + 1
ans += x
ans %= MOD
print (ans) | p02708 |
import math
import queue
def readInt():
return int(eval(input()))
def readInts():
return list(map(int, input().split()))
def readChars():
return input().split()
x = readInts()
n = x[0]
k = x[1]
def ts(l):
return int((l*(l-1))/2)
def ts2(l):
return int(l*(n+n-(l-1))/2)
s = 0
for i... | x=list(map(int,input().split()))
n,k=x
s=0
for i in range(k,n+2):
s+=int(i*(n+n-(i-1))/2)+1-int((i*(i-1))/2)
print((s%(1000000007))) | p02708 |
n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=int(i*(n+n-(i-1))/2)+1-int((i*(i-1))/2)
print((s%(1000000007))) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n+n-(i-1))//2+1-(i*(i-1))//2
print((s%(1000000007))) | p02708 |
n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n+n-(i-1))//2+1-(i*(i-1))//2
print((s%(1000000007))) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(2*n-i+1)//2+1-(i*(i-1))//2
print((s%(1000000007))) | p02708 |
n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(2*n-i+1)//2+1-(i*(i-1))//2
print((s%(1000000007))) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print((s%(1000000007))) | p02708 |
n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print((s%(1000000007))) | n,k=list(map(int,input().split()))
s=0
for i in range(k,n+2):
s+=i*(n-i+1)+1
print((s%(10**9+7))) | p02708 |
N, K = list(map(int, input().split()))
ans = 0
mod = 10**9+7
for i in range(K, N+2):
_min = (i+1)*i//2
_max = ((N+1) + (N+1-i+1)) * i // 2
ans += (_max - _min + 1) % mod
ans %= mod
print(ans) | N, K = list(map(int, input().split()))
M = 10**9 + 7
ans = 0
for i in range(K, N+2):
_min = (i-1)*i//2
_max = (N + N-i+1) * i //2
ans += (_max - _min + 1)
print((ans % M)) | p02708 |
N, K = list(map(int, input().split()))
M = 10**9 + 7
ans = 0
for i in range(K, N+2):
_min = (i-1)*i//2
_max = (N + N-i+1) * i //2
ans += (_max - _min + 1)
print((ans % M)) | N, K = list(map(int, input().split()))
ans = 0
mod = 10**9+7
for i in range(K, N+2):
min = i*(i-1)/2
max = (2*N-i+1)*i/2
ans += max - min + 1
print((int(ans%mod))) | p02708 |
n, k = list(map(int, input().split()))
MOD = 10**9 + 7
ans = 0
for c in range(k, n + 2):
m = c * (c - 1) // 2
M = c * (2 * (n + 1) - c - 1) // 2
ans += M - m + 1
ans %= MOD
print(ans)
| n, k = list(map(int, input().split()))
MOD = 10**9 + 7
print(((-2 + k - n) * (-6 - 2 * k + 2 * k**2 - n - k * n - n**2) // 6 % MOD)) | p02708 |
n, k = list(map(int, input().split()))
MOD = 10**9 + 7
print(((-2 + k - n) * (-6 - 2 * k + 2 * k**2 - n - k * n - n**2) // 6 % MOD)) | n,k=list(map(int,input().split()))
print(((-2+k-n)*(-6-2*k+2*k**2-n-k*n-n**2)//6%(10**9+7))) | p02708 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): retur... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02708 |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | p02708 |
mod = 10**9 + 7
n,k = list(map(int,input().split()))
tot = []
cur = 0
for i in range(n+1):
cur += i
tot.append(cur)
cnt = 0
for i in range(k, n+2):
if n > i:
max_ = tot[n] - tot[n - i]
else:
max_ = tot[n]
min_ = tot[i - 1]
cnt += max_ - min_ + 1
cnt %= mod
... | # しゃくとり
mod = 10**9 + 7
n,k = list(map(int,input().split()))
cnt = 0
sum_ = sum(range(n + 1))
#print("sum", sum_)
#print(list(range(n + 1)))
max_ = sum(range(n - k + 1, n + 1))
min_ = sum(range(k))
for i in range(k, n+2):
#print(max_, min_, cnt)
cnt += max_ - min_ + 1
cnt %= mod
#prin... | p02708 |
N,K = list(map(int,input().split()))
s = 0
for i in range(K,N+2):
s += i*N +1 - i*(i -1)
print((s%(10**9 +7))) | N,K = list(map(int,input().split()))
s = int( (N*(N+1)*(N+2))/6 - (K*(K-1)*(3*N-2*K+4))/6 + N-K+2 )
print((s%(10**9 + 7))) | p02708 |
def rui_sum(n,k):
k_lsum = (k-1)*k//2
k_usum = k*n - (k-1)*k//2
return k_usum - k_lsum + 1
n, k = list(map(int,input().split()))
cnt = []
for i in range(k,n+2):
cnt.append(rui_sum(n,i))
print((sum(cnt)%(10**9+7))) | n, k = list(map(int,input().split()))
cnt = []
for i in range(k,n+2):
cnt.append(i*n -(i-1)*i +1)
print((sum(cnt)%(10**9+7))) | p02708 |
import sys
mod = 7 + 10 ** 9
def solve():
input = sys.stdin.readline
N, K = list(map(int, input().split()))
ans = 0
for k in range(K, N + 2):
minSum = (0 + k - 1) * k // 2
maxSum = (N - k + 1 + N) * k // 2
ans += (maxSum - minSum + 1) % mod
ans %= mod
pri... | import sys
mod = 7 + 10 ** 9
def solve():
input = sys.stdin.readline
N, K = list(map(int, input().split()))
ans = 0
for k in range(K, N + 2):
minS = (k - 1) * k // 2
maxS = (N - k + 1 + N) * k // 2
ans += (maxS - minS + 1)
ans %= mod
print(ans)
... | p02708 |
n,k = list(map(int,input().split()))
mod = 10**9 + 7
ans = 0
for i in range(k, n+2):
ans += max(0, n*(n+1)//2 - (n-i)*(n+1-i)//2 - i*(i-1)//2 + 1)
ans %= mod
print(ans) | n,k = list(map(int,input().split()))
mod = 10**9 + 7
ans = 1
for i in range(k,n+1):
low = i*(i-1)//2
high = n*(n+1)//2 - (n-i)*(n-i+1)//2
ans += high - low + 1
ans %= mod
print(ans) | p02708 |
N,K = list(map(int, input().split()))
div = 10**9 + 7
ans = 0
for i in range(K, N+2):
ans += i + N*i - i**2 + 1
print((ans%div)) | N,K = list(map(int, input().split()))
div = 10**9 + 7
ans = 0
for p in range(K,N+2):
ans += p * (N - p + 1) + 1
print((ans%div)) | p02708 |
N, K = list(map(int,input().split()))
MOD = 10**9 + 7
ans = 0
for k in range(K,N+2):
t = N*(N+1)//2 - (N-k)*(N-k+1)//2
s = k*(k-1)//2
ans += t-s+1
ans %= MOD
print(ans)
| N, K = list(map(int,input().split()))
MOD = 10**9 + 7
ans = 0
for i in range(K,N+2):
# iこ えらぶ
ans += (N+1)*N//2-(N-i)*(N-i+1)//2-i*(i-1)//2+1
ans %= MOD
print(ans)
| p02708 |
N, K = list(map(int,input().split()))
MOD = 10**9 + 7
ans = 0
for i in range(K,N+2):
# iこ えらぶ
ans += (N+1)*N//2-(N-i)*(N-i+1)//2-i*(i-1)//2+1
ans %= MOD
print(ans)
| N, K = list(map(int,input().split()))
MOD = 10**9 + 7
ans = 0
for k in range(K,N+2):
m = (k*(k-1))//2
M = (k*(N+N-k+1))//2
ans += M-m+1
print((ans%MOD))
| p02708 |
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
import sys,bisect,string,math,time,functools,random
def Golf():*a,=map(int,open(0))
def I():return int(input())
def S_():return input()
def IS():return input().spli... | n,k=list(map(int,input().split()))
a=0
for i in range(k,n+2):
l=(i-1)*i//2
r=(n-i+1+n)*i//2
a+=(r-l+1)
a%=10**9+7
print(a) | p02708 |
MOD = 10**9 + 7
N,K = list(map(int,input().split()))
s = 0
for k in range(K, N+2):
s = (s + N*k - k*k + k + 1) % MOD
print(s) | N,K = list(map(int,input().split()))
print(((((N+1)*(N+2-K)*(K+N+1))//2 - ((N+1)*(N+2)*(2*N+3))//6 + (K*(K-1)*(2*K-1))//6 + N + 2 - K) % (10**9 + 7))) | p02708 |
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list([x-1 for x in MII()])
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ i... | import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list([x-1 for x in MII()])
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ i... | p02708 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
... | p02708 |
n,k=list(map(int,input().split()))
ans=0
for i in range(k,n+2):
a=0.5*i*(i-1)
b=0.5*n*(n+1)-0.5*(n-i)*(n-i+1)
ans+=int(b-a+1)
print((ans%(10**9+7))) | MOD = 10 ** 9 + 7
n, k = list(map(int, input().split()))
def calc(a):
smallest = a * (a-1) // 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans)
| p02708 |
N,K=list(map(int,input().split()))
ans=0
kari=[i for i in range(N+1)]
for i in range(K,N+2):
saidai=(N+N-i+1)*i//2
saisyou=(i-1)*i//2
ans+=saidai-saisyou+1
ans%=10**9+7
print(ans) | N,K=list(map(int,input().split()))
ans=0
for i in range(K,N+2):
saidai=(N+N-i+1)*i//2
saisyou=(i-1)*i//2
ans+=saidai-saisyou+1
ans%=10**9+7
print(ans) | p02708 |
N, K = list(map(int, input().split()))
ans = 0
MOD = 10**9+7
f = lambda x:x*(x+1)//2
for i in range(K, N+2):
ans += f(N)-f(N-i)-f(i-1)+1
ans %= MOD
print(ans)
| N, K = list(map(int, input().split()))
MOD = 10**9+7
f = lambda x:x*(x+1)//2
ans = sum(f(N)-f(N-i)-f(i-1)+1 for i in range(K, N+2))%MOD
print(ans)
| p02708 |
N, K = list(map(int, input().split()))
MOD = 10**9+7
f = lambda x:x*(x+1)//2
ans = sum(f(N)-f(N-i)-f(i-1)+1 for i in range(K, N+2))%MOD
print(ans)
| N, K = list(map(int, input().split()))
f = lambda x:x*(x+1)//2
print((sum(f(N)-f(N-i)-f(i-1)+1 for i in range(K, N+2))%(10**9+7))) | p02708 |
### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
mod = 10**9+7
def modinv(a, mod):
return pow_mod(a, mod-2, mod)
def pow_mod(a, b, mod):
x = 1
while b > 0:
if b & 1:
x = (x*a)%mod
a = (a**2)%mod
b... | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print(("Yes" if b==1 else "No"))
return
def resolve():
readline=sys.stdin.readline
n,k=list(map(int, readline().rstrip().split()))
mod = 10**9+7
a=0
z=0
... | p02708 |
### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
mod = 10**9+7
def modinv(a, mod):
return pow_mod(a, mod-2, mod)
def pow_mod(a, b, mod):
x = 1
while b > 0:
if b & 1:
x = (x*a)%mod
a = (a**2)%mod
b... | ### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print(("Yes" if b==1 else "No"))
return
def resolve():
readline=sys.stdin.readline
n,k=list(map(int, readline().rstrip().split()))
mod = 10**9+7
a=0
z=0
... | p02708 |
n,k=list(map(int,input().split()))
ans=0
for i in range(k,n+2):
maxs=i*(2*n-i+1)//2
mins=i*(i-1)//2
ans+=maxs-mins+1
ans%=10**9+7
#print('#####')
#print(i)
#print(ans)
print((ans%(10**9+7)))
| n,k=list(map(int,input().split()))
mod=pow(10,9)+7
ans=0
for i in range(k,n+2):
ans+=(i*(n+n-i+1))//2-(i*(i-1))//2+1
ans%=mod
print(ans) | p02708 |
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k = list(map(int,input().split()))
class InverseTable:
__slots__ = ['In', 'fac', 'Ifac']
... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,k = list(map(int,input().split()))
for i in range(k,n+2):
ans += (n+n-i+1)*i//2 - i*(i-1)//2... | p02708 |
n,k=list(map(int,input().split()))
sum = 0
for i in range(k, n+2):
minunchi = (i*(i-1))//2
maxunchi = (n*(n+1))//2 - ((n+1-i)*(n-i))//2
sum += maxunchi - minunchi + 1
print((sum%(10**9+7))) | n,k=list(map(int,input().split()))
print((sum([(n*(n+1))//2-((n+1-i)*(n-i))//2-(i*(i-1))//2+1 for i in range(k,n+2)])%(10**9+7))) | p02708 |
N, K = list(map(int, input().split()))
DIVIDER = 1000000007
tab_sum = [0]
sum_tmp = 0
for i in range(N + 1):
sum_tmp = (sum_tmp + i) % DIVIDER
tab_sum.append(sum_tmp)
ans = 0
for cnt in range(K, N + 2):
val_min = (tab_sum[cnt] - tab_sum[0]) % DIVIDER
val_max = (tab_sum[-1] - tab_sum[-1 -... | N, K = list(map(int, input().split()))
tab_sum = [0]
sum_tmp = 0
for i in range(N + 1):
sum_tmp += i
tab_sum.append(sum_tmp)
ans = 0
DIVIDER = 1000000007
for cnt in range(K, (N + 1) + 1):
sum_min = tab_sum[cnt] - tab_sum[0]
sum_max = tab_sum[-1] - tab_sum[-1 - cnt]
#
ans = (ans +... | p02708 |
M=10**9+7
n,k=list(map(int,input().split()))
a=0
for i in range(k,n+2):
l=i*~-i//2
r=n*-~n//2-(n-i)*(n-i+1)//2
a=(a+r+1-l)%M
print(a) | n,k=list(map(int,input().split()))
print((sum(-~i+i*(n-i)for i in range(k,n+2))%(10**9+7))) | p02708 |
n,k=list(map(int,input().split()))
print((sum(-~i+i*(n-i)for i in range(k,n+2))%(10**9+7))) | n,k=list(map(int,input().split()))
print(((n-k+2)*((-k-~n)*(n+2*k)+6)//6%(10**9+7))) | p02708 |
N, K = list(map(int, input().split()))
num = [0] * (N + 1)
ans = 1
for i in range(N + 1):
num[i] += i
#print(num)
for k in range(K, N + 1):
sum_min = k * (k - 1) // 2
sum_max = k * N - k * (k - 1) // 2
#print(sum_min, sum_max, k, num[N:N-k:-1])
ans += sum_max - sum_min + 1
#print(ans)... | N, K = list(map(int, input().split()))
ans = 1
for k in range(K, N + 1):
sum_min = k * (k - 1) // 2
sum_max = k * N - k * (k - 1) // 2
ans += sum_max - sum_min + 1
print((ans % (10**9 + 7)))
| p02708 |
n, k = list(map(int, input().split()))
ans = 0
mod = 10**9+7
for i in range(k, n+2):
ans += int(n*(n+1)/2 - (n-i)*(n-i+1)/2 - (i-1)*i/2 + 1)
print((ans % mod))
'''
n, k = map(int, input().split())
ans = 0
for i in range(k, n+2):
a = 0.5*i*(i-1)
b = 0.5*n*(n+1)-0.5*(n-i)*(n-i+1)
ans += ... | n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n+2):
ma = (n+n-i+1)*i//2
mi = (i-1)*i//2
# print(ma, mi)
add = ma-mi+1
ans += add
print((int(ans % (10**9+7))))
| p02708 |
n, k = list(map(int, input().split()))
ans = 0
p = 10 ** 9 + 7
a = 0
b = 0
for j in range(k):
a += j
b += n-j
for i in range(k, n+2):
ans = (ans+b-a+1)%p
a += i
b += n-i
print(ans) | n, k = list(map(int, input().split()))
ans = 0
p = 10 ** 9 + 7
a = 0
b = 0
for j in range(k-1):
a += j
b += n-j
for i in range(k-1, n+1):
a += i
b += n-i
ans = (ans+b-a+1)%p
print(ans) | p02708 |
N, K = list(map(int, input().split()))
ans = 0
for i in range(K, N + 2):
max_num = i * (N + N + 1 - i) // 2
min_num = i * (0 + i - 1) // 2
ans += max_num - min_num + 1
print((ans % (10**9 + 7))) | N, K = list(map(int, input().split()))
ans = (K - N - 2) * (2 * K * K - K * (N + 2) - N * N - N - 6) // 6
print((ans % (10**9 + 7))) | p02708 |
n, k = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ans = 0
num = 0
for i in range(1, n + 2):
num += (i - 1)
if i >= k:
# print(num, i, i * n - 2 * num + 1)
ans += max(i * n - 2 * num + 1, 1)
ans = ans % MOD
print(ans) | n, k = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ans = 0
a = 1
for i in range(1, n + 2):
a -= 2 * (i - 1)
if i >= k:
ans += (i * n + a)
ans %= MOD
print(ans) | p02708 |
n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n+2):
ans += ((i * (2 * n - i + 1) / 2) - (i * (i - 1) / 2) + 1) % (10 ** 9 + 7)
print((int(ans % (10 ** 9 + 7))))
| n, k = list(map(int, input().split()))
ans = 0
for i in range(k, n+2):
ans += (i * (2 * n - i + 1) / 2) - (i * (i - 1) / 2) + 1
print((int(ans % (10 ** 9 + 7))))
| p02708 |
def main():
N, K = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for i in range(K, N + 2):
a = N - i + 1
ans = (ans + i * a + 1) % mod
print(ans)
if __name__ == '__main__':
main()
| def main():
N, K = list(map(int, input().split()))
mod = 10**9 + 7
ans1 = (N + 2 - K) % mod
ans2 = ((N + 1) * (N + 1) * (N + 2) // 2 - (N + 1) * K * (K - 1) // 2) % mod
ans3 = ((N + 1) * (N + 2) * (2 * N + 3) // 6 - (K - 1) * K * (2 * K - 1) // 6) % mod
ans = (ans1 + ans2 - ans3) % mod
... | p02708 |
# -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | # -*- coding: utf-8 -*-
# 入力を整数に変換して受け取る
def input_int():
return int(eval(input()))
# マイナス1した値を返却
def int1(x):
return int(x) - 1
# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
return list(map(int, input().split()))
# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
re... | p02708 |
n, k = list(map(int, input().split()))
ans = 0
for num in range(k, n + 2):
maximum = (2 * n - num + 1) * num // 2
minimum = (num - 1) * num // 2
ans += maximum - minimum + 1
ans = ans % (10**9 + 7)
print(ans) | n, k = list(map(int, input().split()))
m = n + 1
l = k - 1
ans = m * (m**2 + 5) // 6
ans += l * (2 * l**2 + 3 * l - 5 - 3 * m * (l + 1)) // 6
ans = ans % (10**9 + 7)
print(ans)
| p02708 |
N, K = list(map(int,input().split()))
def sum_(i, j):
return (a[i] + a[j]) * (j - i + 1) // 2
a = [i for i in range(N + 1)]
ans = 0
for i in range(K, N + 2):
min_ = sum_(0, i - 1)
max_ = sum_(N - i + 1, N)
ans += (max_ - min_ + 1)
ans %= 10 ** 9 + 7
print(ans) | N, K = list(map(int,input().split()))
ans = 0
INF = 10 ** 9 + 7
for i in range(K, N + 2):
mi = i * (i - 1) // 2
ma = i * (2 * N - i + 1) // 2
ans += ma - mi + 1
ans %= INF
print(ans) | p02708 |
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
n,k=n1()
down=[0]*(n+1)
up=[0]*(n+1)
up[0]=n
ans=0 if k>1 else n+1
for i in range(1,n+1):
... |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [[input().split()] for _ in range(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
de... | p02708 |
N,K=list(map(int,input().split()))
ans=0
for i in range(K,N+2):
kos=((2*N-i+1)*i)//2-((i-1)*i)//2+1
ans=(ans+kos)%(10**9+7)
print(ans) | N,K=list(map(int,input().split()))
ans=0
for i in range(K,N+2):
kos=i*(N-i+1)+1
ans=(ans+kos)%(10**9+7)
print(ans) | p02708 |
N,K=list(map(int,input().split()))
ans=0
for i in range(K,N+2):
kos=i*(N-i+1)+1
ans=(ans+kos)%(10**9+7)
print(ans) | N,k=list(map(int,input().split()))
print((((2+N-k)*(6+N+N**2+2*k+k*N-k**2*2)//6)%(10**9+7))) | p02708 |
import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
for k in reversed(list(range(1, (N+1)+1))):
a = (N + (N-k+1))*k//2
b = k*(k-1)//2
ans += a - b + 1
ans %= P
if k == K :
... | import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N, K = list(map(int, input().split()))
ans = 0
for k in range(K, N + 2):
a = k * (k - 1) // 2
b = k * (2 * N - (k - 1)) // 2
ans = (ans + (b - a + 1)) % P
print(ans)
if __name__ == "__main_... | p02708 |
n,k=list(map(int,input().split()))
ans=0
for i in range(k,n+2):
ans+=n*i-(i-1)*i//2-(i-1)*i//2+1
ans%=10**9+7
print(ans) | n,k=list(map(int,input().split()));print((sum(i*(n-i+1)+1for i in range(k,n+2))%(10**9+7))) | p02708 |
def d_sum_of_large_numbers(MOD=10**9 + 7):
N, K = [int(i) for i in input().split()]
ans = 0
for k in range(K, N + 2):
tmp = 1 - k * (k - 1)
ans += k * N + tmp
ans %= MOD
return ans
print((d_sum_of_large_numbers())) | def d_sum_of_large_numbers(MOD=10**9 + 7):
N, K = [int(i) for i in input().split()]
return (N + 2 - K) * (N**2 + (K + 1) * N - 2 * K**2 + 2 * K + 6) // 6 % MOD
print((d_sum_of_large_numbers())) | p02708 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.