本文每个星期更新一次(+2道)
逆序排列
#include <iostream>
using namespace std;
const int MOD = 1000000007;
int n, k, i, j;
long long l, f[1005][10005], sum[1005][10005];
int main()
{
ios::sync_with_stdio(false);
cin >> n >> k;
f[0][0] = 1;
sum[0][0] = 1;
for (i = 1; i <= k; i++)
{
f[0][i] = 0;
sum[0][i] = sum[0][i - 1] + f[0