DMOJ · ccc15j5

CCC 2015 J5 π-day

This C++ solution uses dynamic programming for CCC 2015 J5 π-day. Read the reasoning, inspect the code, or try your own test case below.

ccc15j5CCC 2015 J5Dynamic programmingC++23 lines
Solution242of 248
Open official problem ↗ Download C++ file ↓ Search the library → Open full Code Lab ↗ Report an issue ↗

Approach

Dynamic programming

π-day matches distributing n pieces among k people in nondecreasing positive amounts and the partition-count DP.

Dynamic programming

Problem and code

Useful links.

Written by benbenyaojifen. Try the problem first, then compare your approach with the code.

Open official problem ↗View exact source file ↗
Implementation

J_5_π_day.cpp

C++

    #include <bits/stdc++.h>
    using namespace std;
    using ll = long long;
    using i128 = __int128;
    const int inf = 1e9;
    const ll INF = 2e18; //❄️
    int main() {
        ios::sync_with_stdio(0); cin.tie(0); 
        int n, k; cin >> n >> k;
        if (n == 1 || n == k) {
            cout << 1 << '\n';
            return 0;
        }
        vector<vector<int>> dp(k + 1, vector<int>(n + 1));
        dp[0][0] = 1;
        for (int i = 1; i <= k; i++) {
            for (int j = 1; j <= n; j++) {
                dp[i][j] = dp[i - 1][j - 1] + (j >= i ? dp[i][j -i ] : 0);
            }
        }
        cout << dp[k][n] << '\n';
        return 0;
    }
        

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗Keep studying →

Test this problem

Run your code here.

Paste your code, run a test case, compare the output, or trace selected values.

Full trace, comparison & stress testing ↗
StatusReady
Output
No run yet.
Diagnostics
No diagnostics yet.

Each run is isolated and has strict limits. Passing one test does not guarantee the judge will accept the solution.