UVA 12034 Race

#include<bits/stdc++.h>
#include<stdio.h>
#include<iostream>
#include<cmath>
#include<math.h>
#include<queue>
#include<set>
#include<map>
#include<iomanip>
#include<algorithm>
#include<stack>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
int f[1005];
int c[1005][1005];
void init()
{
    for(int i=0;i<=1000;i++)c[i][0]=1;
    for(int i=1;i<=1000;i++)
        for(int j=0;j<=i;j++)
        c[i][j]=(c[i-1][j]+c[i-1][j-1])%10056;
    f[0]=1;f[1]=1;f[2]=3;
    for(int i=3;i<=1000;i++)
    {
        int sum=0;
        for(int j=1;j<=i;j++)
            sum=(sum+(c[i][j]*f[i-j])%10056)%10056;
        f[i]=sum;
    }
}
int id=1;
int main()
{
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
#endif // ONLIN
    init();
    int t;
    cin>>t;
    int n;
    while(t--)
    {
        cin>>n;
        cout<<"Case "<<id++<<": "<<f[n]<<endl;
    }
}

猜你喜欢

转载自blog.csdn.net/linruier2017/article/details/82018001
今日推荐