Submission #313101

#	Time	Username	Problem	Language	Result	Execution time	Memory
313101		alextodoran	Asceticism (JOI18_asceticism)	C++17	49 / 100	87 ms	56568 KiB

asceticism

/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 3002;

const int MOD = 1e9+7;

int n, k;

int dp[N_MAX][N_MAX];

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> k;
    dp[1][0] = 1;
    for(int i = 2; i <= n; i++)
        for(int j = 0; j < i; j++)
        {
            dp[i][j] = 1LL * dp[i - 1][j] * (j + 1) % MOD + 1LL * dp[i - 1][j - 1] * (i - j) % MOD;
            if(dp[i][j] >= MOD)
                dp[i][j] -= MOD;
        }
    cout << dp[n][k - 1] << "\n";
    return 0;
}

• Subtask 1: 4 / 4
• Subtask 2: 20 / 20
• Subtask 3: 25 / 25
• Subtask 4: 0 / 51