Hello! I'm beginner and would like a hint. I must learn all the pre-existing algorithms in order to solve the problems of programming competitions?
a hug. ;)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | Radewoosh | 3415 |
| 8 | Um_nik | 3376 |
| 9 | maroonrk | 3361 |
| 10 | XVIII | 3345 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 162 |
| 2 | adamant | 148 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 133 |
Hello! I'm beginner and would like a hint. I must learn all the pre-existing algorithms in order to solve the problems of programming competitions?
a hug. ;)
| Name |
|---|



I don't understand what do you mean when you say "pre-existing algorithms". If you mean some kinds of pre-existing algorithms like Floyd or Dijkstra then of course yes, because most of the problems solves with some algorithm or data structure and some idea.
To become red on topcoder you only need BFS, DFS, Dijkstra, Floyd and DP (the last one is not an algorithm but an important class of problems). Familiarity with some math will be handy (combinatorics, probabilities, sieve of Eratosthenes).
Are you cheating?
No.