fork download

copy

// dp[i][j][k] = number of ways to form a subset of sum i, using first j elements, and picking exactly k elements
for(int i = 0; i <= 100; ++i) {
	dp[0][i][0] = 1;
}
for(int i = 1; i <= 10000; ++i) {
	for(int j = 0; j <= 100; ++j) {
		dp[i][0][j] = 0;
	}
}
 
for(int sm = 1; sm <= 10000; ++sm) {
	for(int pos = 1; pos <= n; ++pos) {
		for(int used = 1; used <= n; ++used) {
			if(sm >= a[pos]) {
				dp[sm][pos][used] += dp[sm - a[pos]][pos - 1][used - 1];
			}
			dp[sm][pos][used] += dp[sm][pos - 1][used];
		}
	}
}

prog.cpp:2:1: error: expected unqualified-id before ‘for’
 for(int i = 0; i <= 100; ++i) {
 ^~~
prog.cpp:2:16: error: ‘i’ does not name a type
 for(int i = 0; i <= 100; ++i) {
                ^
prog.cpp:2:26: error: expected unqualified-id before ‘++’ token
 for(int i = 0; i <= 100; ++i) {
                          ^~
prog.cpp:5:1: error: expected unqualified-id before ‘for’
 for(int i = 1; i <= 10000; ++i) {
 ^~~
prog.cpp:5:16: error: ‘i’ does not name a type
 for(int i = 1; i <= 10000; ++i) {
                ^
prog.cpp:5:28: error: expected unqualified-id before ‘++’ token
 for(int i = 1; i <= 10000; ++i) {
                            ^~

Standard output is empty