BZOJ3028 食物

 1 /**************************************************************
 2     Problem: 3028
 3     User: rausen
 4     Language: C++
 5     Result: Accepted
 6     Time:0 ms
 7     Memory:804 kb
 8 ****************************************************************/
 9  
10 #include <cstdio>
11  
12 using namespace std;
13 const int mod = 10007;
14  
15 int n;
16 char st[505];
17  
18 int main() {
19   int i;
20   scanf("%s", st + 1);
21   for (i = 1; st[i]; ++i)
22     n = ((n << 1) + (n << 3) + (st[i] - ‘0‘)) % mod;
23   printf("%d\n", (n * (n + 1) % mod * (n + 2) % mod * 1668 % mod) % mod);
24   return 0;
25 }