in array of n +ve integers print the triplets if triplet is formed with the help of distinct integer and also having distinct sum
e.g. input 5 2 4 6 8 9
output 12 14 15 16 17 18 19 21 23
N<=10000
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | 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 | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
in array of n +ve integers print the triplets if triplet is formed with the help of distinct integer and also having distinct sum
e.g. input 5 2 4 6 8 9
output 12 14 15 16 17 18 19 21 23
N<=10000
Name |
---|
You should not ask this question. It's from an ongoing College contest on hackerearth.
You even copied the same input sample case provided.
You are unethical as well as stupid. Shame on you!