BZOJ3028: 食物

题目:http://www.lydsy.com/JudgeOnline/problem.php?id=3028

题解:列出母函数乘起来化简之后再展开,用插板法即可。

代码:

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 1000+5
26 
27 #define maxm 200000+5
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define for4(i,x) for(int i=head[x],y=e[i].go;i;i=e[i].next,y=e[i].go)
44 
45 #define for5(n,m) for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)
46 
47 #define mod 10007
48 
49 #define lch k<<1,l,mid
50 
51 #define rch k<<1|1,mid+1,r
52 
53 using namespace std;
54 
55 inline int read()
56 
57 {
58 
59     int x=0,f=1;char ch=getchar();
60 
61     while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
62 
63     while(ch>='0'&&ch<='9'){x=10*x+ch-'0';ch=getchar();}
64 
65     return x*f;
66 
67 }
68 int n,m;
69 char s[maxn];
70 
71 int main()
72 
73 {
74 
75     freopen("input.txt","r",stdin);
76 
77     freopen("output.txt","w",stdout);
78 
79     scanf("%s",s);n=strlen(s);
80     for0(i,n-1)m=(m*10+s[i]-'0')%mod;
81     cout<<m*(m+1)%mod*(m+2)%mod*1668%mod<<endl;
82 
83     return 0;
84 
85 }  
View Code

 

posted @ 2015-03-10 16:11  ZYF-ZYF  Views(239)  Comments(0Edit  收藏  举报