Commit ef99d2a

authored

Merge pull request #2 from ShreyaswadE/patch-1

a number change

2 parents 696600d + b19a67b commit ef99d2aCopy full SHA for ef99d2a

File tree

-3

lines changed

-3

lines changed

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,10 +1,10 @@`
`1`	`1`	`Let f(i, j) be the number of ways of distributing j chocolates to the first i people.`
`2`	`2`
`3`		`-Then we can give the j-th person - 0, 1, 2, ... , A[i] chocolates.`
	`3`	`+Then we can give the i-th person - 0, 1, 2, ... , A[i] chocolates.`
`4`	`4`
`5`	`5`	`So, f(i, j) = f(i - 1, j ) + f(i - 1, j - 1) + ... + f(i - 1, j - A[i] - 1)`
`6`	`6`
`7`		`-If (j - A[i] - 1), then f(i, j) = f(i - 1, j) + ... + f(i - 1, 0).`
	`7`	`+If (j = A[i] - 1), then f(i, j) = f(i - 1, j) + ... + f(i - 1, 0).`
`8`	`8`
`9`	`9`	`So the base case is that f(0, 0) = 1 and f(0, j) = 0 for all other j.`
`10`	`10`
`@@ -54,4 +54,4 @@ int main()`
`54`	`54`
`55`	`55`	`cout << no_of_ways[no_of_people][no_of_candies];`
`56`	`56`	`return 0;`
`57`		`-}`
	`57`	`+}`

Comments

(0)