Fantasy of a Summation LightOJ - 1213

1. 总共出现的个数为$K\ast N^K$ 则每个数贡献为 $K\ast N^{K-1}$
2. 再加一加

 #include<bits/stdc++.h>
 using namespace std;
 #define fst first
 #define sec second
 #define sci(num) scanf("%d",&num)
 #define scl(num) scanf("%lld",&num)
 #define mem(a,b) memset(a,b,sizeof a)
 #define cpy(a,b) memcopy(a,b,sizeof b)
 typedef long long LL;
 typedef pair<int,int> P;
 const int MAX_N = 510;
 const int MAX_M = 10000;
 
   
   
    
    char
   
    s[MAX_N];
 LL b;
 int main() {
     int T;
     sci(T);
     for (int cs = 1;cs <= T;cs++) {
         scanf("%s%lld",s,&b);
         if (b < 0)  b = -b;
         int loc = 0;
         if (s[0] == '-') loc++;
         int ans = 0;
         for (;s[loc] !='\0';loc++) {
             ans = ((ans * (10% b)) % b + (s[loc] - '0') % b) % b;
         }
         if (ans == 0) {
             printf("Case %d: divisible\n",cs);
         } else {
             printf("Case %d: not divisible\n",cs);
         }
 
 
     }
     return 0;
 }