Educational Codeforces Round 136 (Rated for Div. 2) C. Card Game(递推)

#include<bits/stdc++.h>
using namespace std;

const int mod=998244353;
long long c[210][210];
int t;
long long f[70];

int main(){
	for(int i=0;i<=200;i++){
		for(int j=0;j<=i;j++){
			if(!j){
				c[i][j]=1;
				continue;
			}
			c[i][j]=(c[i-1][j-1]+c[i-1][j])%mod;
		}
	}
	
	f[0]=0;
	for(int i=2;i<=60;i+=2){
		f[i]=(c[i-1][i/2-1]+c[i-2][i/2-1]-1-f[i-2]+mod)%mod;//减去之后可能为负数，所以加上一个mod
	}
	
	cin>>t;
	for(int w=1;w<=t;w++){
		int n;
		cin>>n;
		cout<<f[n]<<" "<<(c[n][n/2]-1-f[n]+mod)%mod<<" "<<"1\n";
	}
	
	
	return 0;
}