Can you please tell me more efficient approach to TIP1(spoj).
Here is my code causing TLE problem.
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 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 |
---|