1e8? 5e8? 1e9? I seriously don't know so can someone kindly help me please? (Im still a newbie)
1e8? 5e8? 1e9? I seriously don't know so can someone kindly help me please? (Im still a newbie)
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | adamant | 152 |
| 3 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
idk maybe more than 3 ig
I'm pretty sure that in typical Competitive Programming, about $$$10^7$$$ or $$$10^8$$$ operations can be run in a second. So, for example, if you had a code that runs in $$$O(n^2)$$$ time, then your maximum value for $$$n$$$ would be like $$$10^4$$$.
1e8 Upper Bound.
In c++, absolutely 4 * 1e8
5e8, if your code has very good constant factor and use applicable pragmas maybe 1e9
then why do $$$1 \le n \le 10^9$$$ solutions TLE when their time limit is $$$\ge 1$$$ second?
"very good constant factor and use applicable pragmas"
It can go all the way to 1e10, if the operations take less time, compared to others.
It's about 5*10^7 commands that can run in 1 sec and in 2 seconds 10^8 commands can run
Depends on the type of operation; for example, if the bottleneck is bitwise operations (such as in traveling salesman problem) you can do even more than 1e8 a second. If you do a lot of pointer accessing (such as in a binary search tree or linked list) it is closer to 1e7. Overall 1e8 is a great rule of thumb.
Consider this chart and remember most CPUS have a clock speed ≥ 2Ghz. That is why bitwise operations are so fast (and it feels like it can even approach 1e9 ops / sec) while others are closer to 1e8.