解题思路
用桶存一下每个数(相当于一斤做好了排序和去重),然后
f
o
r
for
for一遍,统计答案。
代码
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const long long INF=11111111;
long long n,a,b,c,maxn,ans,t,j;
int d[11111111];
int main(){
freopen("password.in","r",stdin);
freopen("password.out","w",stdout);
scanf("%lld%lld%lld%lld",&n,&a,&b,&c);
for(long long i=1;i<=n;i++)
{
t=(i*i*a+i*b+c)%INF;
if(!d[t])
d[t]=1;
if(t>maxn)
maxn=t;
}
j=1;
for(long long i=0;i<=maxn;i++)
{
if(d[i])
{
ans=(ans+(i*j)%INF)%INF;
j++;
}
}
printf("%lld",ans);
}