51nod 数列求和（数学）

题目链接

解题思路：
考虑到n>mod 产生循环节，直接做前min(n,mod)项前缀和即可

const int M=10007;
ll s[11111];
signed main()
{
    ll t;
    read(t);
    while(t--)
    {
        ll n,k;
        read(n);
        read(k);
        memset(s,0,sizeof(s));
        for(int i=1; i<=M; i++)
        {
            s[i]+=qp(i,k,M)+s[i-1];
        }
        if(n<=M)
        {
            printf("%lld\n",(s[n])%M);
            continue;
        }
        else
        {
            ll ok=n/M;
            ll cnt=n%M;
            printf("%lld\n",(ok%M*s[M]%M+(s[cnt]%M))%M);
        }
    }

}