| # | User | Rating |
|---|---|---|
| 1 | tourist | 3993 |
| 2 | jiangly | 3743 |
| 3 | orzdevinwang | 3707 |
| 4 | Radewoosh | 3627 |
| 5 | jqdai0815 | 3620 |
| 6 | Benq | 3564 |
| 7 | Kevin114514 | 3443 |
| 8 | ksun48 | 3434 |
| 9 | Rewinding | 3397 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 155 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 10 | nor | 152 |
You are given S,X and N.
S = size of an array
N = number of elements you have to find
X = sum
You have to find N elements from the array which sum is X.
Input:
7 25 3
1 5 10 7 13 15
Output:
5 7 13
If there are multiple solution you can output any of them. What are the best possible solutions with least complexity for this problem?
Hello, I am trying to learn recursion & DP techniques. As I am very beginner in these concepts, please help me by giving some links/tutorials/videos or any resources from which I can learn these concepts from scratch to advanced level.
Thanks in advance.
