Can you please tell me more efficient approach to TIP1(spoj).
Here is my code causing TLE problem.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Can you please tell me more efficient approach to TIP1(spoj).
Here is my code causing TLE problem.
Quetion link- Easy Sum Set Problem — https://www.hackerearth.com/practice/algorithms/searching/linear-search/practice-problems/algorithm/easy-sum-set-problem-7e6841ca/description
Solution for Best Submission — https://www.hackerearth.com/submission/45205049
For this test case:-
2
1 2
3
3 4 8
Output as by best submission code — 2
Real Answer should be — 2 6 or 2 7
Can anyone please help me with the real solution?
Name |
---|