Submission #3120219

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <fstream>
#include <queue>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <sstream>

#define For(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)  For(i,0,n)

//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
#define SORT(c) sort((c).begin(),(c).end())
#define vi(m,a) vector<int> m(a)
#define vti(m,a,i) vector<vector<int>> m(a,vector<int>(i))
#define ALL(it,a) for(auto it = a.begin(); it!=a.end(); it++)
#define Fe(it,a) for(auto &it : a)
#define all(a) begin(a),end(a)

using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
#define WARU 1000000007;

int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
void printhoge(set<int> v) {
	ALL(it, v) {
		cout << *it << " ";
	}
	cout << endl;

}

ll v[4005][4005];
void comb() {
	rep(i,4005){
		v[i][0] = 1;
		v[i][i] = 1;
	}
	rep(k,4005){
		For(j,1,k){
			v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % 998244353;
		}
	}
}

ll h(int a, int b) {
	ll c = a + b - 1;
	return v[c][b];
}

int main() {
	int k, n;
	cin >> k >> n;

	comb();
	vector<ll> kosuu(4005);
	For(i, 1, k + 1) {
		For(m, i, k + 1) {
			kosuu[i + m]++;
		}
	}

	ll goukei = h(k, n);
	For(i, 2, 2 * k + 1) {
		ll result = goukei;
		result -= h(k, n - 2) * kosuu[i];
		ll tmp = n - 2;
		ll kos = kosuu[i];
		ll kosv = 1;
		while (tmp > 0 && kos > 1 && kosv!= kosuu[i]) {
			tmp -= 2;
			kos--;
			kosv++;
			result += h(k, tmp) * (v[kosuu[i]][kosv]);
		}
		if (result < 0) {
			while (result < 0) {
				result += 998244353;
			}
		}
		cout << result % 998244353 << endl;
	}

}

Submission Info

Judge Result