BZOJ1263: [SCOI2006]整数划分

 1 #include<cstdio>
 2 #include<cstdlib>
 3 #include<cmath>
 4 #include<cstring>
 5 #include<algorithm>
 6 #include<iostream>
 7 #include<vector>
 8 #include<map>
 9 #include<set>
10 #include<queue>
11 #include<string>
12 #define inf 1000000000
13 #define maxn 5000+100
14 #define maxm 500+100
15 #define eps 1e-10
16 #define ll long long
17 #define pa pair<int,int>
18 #define for0(i,n) for(int i=0;i<=(n);i++)
19 #define for1(i,n) for(int i=1;i<=(n);i++)
20 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
21 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
22 #define mod 10
23 using namespace std;
24 inline int read()
25 {
26     int x=0,f=1;char ch=getchar();
27     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
28     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
29     return x*f;
30 }
31 int n,a[maxn];
32 void mul(int x)
33 {
34     for1(i,a[0])a[i]*=x;
35     for1(i,a[0])
36     {
37         a[i+1]+=a[i]/mod;
38         a[i]%=mod;
39     }
40     while(a[a[0]+1])a[0]++;
41 }
42 int main()
43 {
44     freopen("input.txt","r",stdin);
45     freopen("output.txt","w",stdout);
46     n=read();
47     a[a[0]=1]=1;
48     if(n%3==0)for1(i,n/3)mul(3);
49     else if(n%3==1)
50      {
51          for1(i,(n/3-1))mul(3);
52          mul(4);
53      }
54     else 
55      {
56          for1(i,n/3)mul(3);
57          mul(2);
58      }
59     printf("%d\n",a[0]);
60     for3(i,a[0],max(a[0]-100+1,1))printf("%d",a[i]);
61     printf("\n");    
62     return 0;
63 }