[P2671][NOIP2015]求和 (数论)

[题目链接]

这位大神讲得很详细：点我

本蒟蒻只会抄抄题解了

#include<bits/stdc++.h>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a<b?a:b)
#define ll long long
#define N 100005
#define mod 10007
#define inc(a,b) (a=(a+b)%mod)
using namespace std;
inline int read() {
    int f = , x = ; char ch;
    do { ch = getchar(); if (ch == '-')f = -; } while (ch<'' || ch>'');
    do { x = x *  + ch - ''; ch = getchar(); } while (ch >= ''&&ch <= '');
    return f * x;
}
int a[N],c[N],f[][N],d[][N];
int ans;
int main()
{
    #ifdef onlinejudge
        freopen("sum.in","r",stdin);
        freopen("sum.out","w",stdout);
    #endif
    int n=read(),m=read();
    for(int i=;i<=n;i++) a[i]=read()%mod;
    for(int i=;i<=n;i++)
    {
        c[i]=read();
        inc(f[i%][c[i]],a[i]);
        inc(d[i%][c[i]],);
    }
    for(int i=;i<=n;i++)
        inc(ans,(i%mod * ((f[i%][c[i]]+(d[i%][c[i]]-)%mod*a[i]+mod)%mod)));
    cout<<ans;
}