Codeforces Round #272 (Div. 2) C. Dreamoon and Sums 数学

C. Dreamoon and Sums

题目连接:

http://www.codeforces.com/contest/476/problem/C

Description

Dreamoon loves summing up something for no reason. One day he obtains two integers a and b occasionally. He wants to calculate the sum of all nice integers. Positive integer x is called nice if and , where k is some integer number in range [1, a].

By we denote the quotient of integer division of x and y. By we denote the remainder of integer division of x and y. You can read more about these operations here: http://goo.gl/AcsXhT.

The answer may be large, so please print its remainder modulo 1 000 000 007 (109 + 7). Can you compute it faster than Dreamoon?

Input

The single line of the input contains two integers a, b (1 ≤ a, b ≤ 107).

Output

Print a single integer representing the answer modulo 1 000 000 007 (109 + 7).

Sample Input

1 1

Sample Output

0

Hint

题意

求有满足条件的数的和,条件是x/b / x%b = b,问你x有多少种可能的选择

题解:

把式子的分母移过去,然后就可以枚举了

然后发现枚举实际上是可以O(1)计算的……

代码

#include<bits/stdc++.h>
using namespace std;
const int mod = 1e9+7;
long long a,b,x,y,sum;
int main()
{
    cin>>a>>b;
    x=(b*(b-1)/2)%mod;
    y=(a*(a+1)/2)%mod;
    sum=(x*((y*b)%mod+a)%mod)%mod;
    printf("%lld\n",sum);
}
posted @   qscqesze  阅读(356)  评论(0编辑  收藏  举报
编辑推荐:
· 开发中对象命名的一点思考
· .NET Core内存结构体系(Windows环境)底层原理浅谈
· C# 深度学习:对抗生成网络(GAN)训练头像生成模型
· .NET 适配 HarmonyOS 进展
· .NET 进程 stackoverflow异常后,还可以接收 TCP 连接请求吗?
阅读排行:
· 本地部署 DeepSeek:小白也能轻松搞定!
· 基于DeepSeek R1 满血版大模型的个人知识库,回答都源自对你专属文件的深度学习。
· 在缓慢中沉淀,在挑战中重生!2024个人总结!
· Tinyfox 简易教程-1:Hello World!
· 大人,时代变了! 赶快把自有业务的本地AI“模型”训练起来!
历史上的今天:
2015-08-22 Codeforces Gym 100733H Designation in the Mafia flyod
2015-08-22 Codeforces Gym 100733A Shitália 计算几何
2015-08-22 Codeforces Gym 100733J Summer Wars 线段树,区间更新,区间求最大值,离散化,区间求并
2015-08-22 Codeforces Gym 100338I TV Show 傻逼DFS,傻逼题
点击右上角即可分享
微信分享提示