小兔的棋盘
Time Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 35 Accepted Submission(s) : 17
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
Input
Output
Sample Input
1 3 12 -1
Sample Output
1 1 2
2 3 10
3 12 416024
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAX 100
#define BASE 10000
void multiply(int a[],int Max,int b)
{
int i,array=0;
for(i=Max-1;i>=0;i--)
{
array+=b*a[i];
a[i]=array%BASE;
array/=BASE;
}
}
void divide(int a[],int Max,int b)
{
int i,div=0;
for(i=0;i<Max;i++)
{
div=div*BASE+a[i];
a[i]=div/b;
div%=b;
}
}
int main(int argc, char *argv[])
{
int a[101][MAX],i,j,n;
memset(a[1],0,MAX*sizeof(int));
for(i=2,a[1][MAX-1]=2;i<101;i++)
{
memcpy(a[i],a[i-1],MAX*sizeof(int));
divide(a[i],MAX,2); \\这样a[i]就是Catalan数的两倍了
multiply(a[i],MAX,8*i-4);
divide(a[i],MAX,i+1);
}
int aa=1;
while(cin>>n)
{
if(n==-1) break;
cout<<aa<<" "<<n<<" ";
aa++;
for(i=0;i<MAX&&a[n][i]==0;i++) ;
cout<<a[n][i++];
for(;i<MAX;i++) printf("%04d",a[n][i]);
cout<<endl;
}
return 0;
}