【Codeforces】 477A Dreamoon and Sums

最新推荐文章于 2020-04-07 11:06:32 发布

yysys

最新推荐文章于 2020-04-07 11:06:32 发布

阅读量521

点赞数

分类专栏： Codeforces 文章标签： codeforces

本文链接：https://blog.csdn.net/blankcqk/article/details/40049043

版权

Codeforces 专栏收录该内容

58 篇文章 0 订阅

订阅专栏

简单数学题。。。

#include <iosteam>
#include <queue> 
#include <stack> 
#include <map> 
#include <set> 
#include <bitset> 
#include <cstdio> 
#include <algorithm> 
#include <cstring> 
#include <climits>
#include <cstdlib>
#include <cmath>
#include <time.h>
#define maxn 200005
#define maxm 400005
#define eps 1e-10
#define mod 1000000007
#define INF 1e17
#define lowbit(x) (x&(-x))
#define mp make_pair
#define ls o<<1
#define rs o<<1 | 1
#define lson o<<1, L, mid 
#define rson o<<1 | 1, mid+1, R
typedef long long LL;
typedef unsigned long long ULL;
//typedef int LL;
using namespace std;
LL qpow(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base;base=base*base;b/=2;}return res;}
LL powmod(LL a, LL b){LL res=1,base=a;while(b){if(b%2)res=res*base%mod;base=base*base%mod;b/=2;}return res;}
void scanf(int &__x){__x=0;char __ch=getchar();while(__ch==' '||__ch=='\n')__ch=getchar();while(__ch>='0'&&__ch<='9')__x=__x*10+__ch-'0',__ch = getchar();}
LL gcd(LL _a, LL _b){if(!_b) return _a;else return gcd(_b, _a%_b);}
// head

LL a, b;

void read(void)
{
	scanf("%I64d%I64d", &a, &b);
}

void work(void)
{
	LL t = 0, ans;
	t = b * (b - 1) / 2;
	t %= mod;
	ans = t * a % mod;
	for(LL i = 1;  i <= a; i++) ans = (ans + i * b % mod * t % mod) % mod;
	printf("%I64d\n", ans);
}

int main(void)
{
	read();
	work();

	return 0;
}