1e8? 5e8? 1e9? I seriously don't know so can someone kindly help me please? (Im still a newbie)
# | User | Rating |
---|---|---|
1 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 160 |
3 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
1e8? 5e8? 1e9? I seriously don't know so can someone kindly help me please? (Im still a newbie)
Name |
---|
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$$$.
Depends upon compiler optimizations, in c++ you can run upto 10^7 instructions in a second.
1e8 Upper Bound.
In c++, absolutely 4 * 1e8
5e8, if your code has very good constant factor and use applicable pragmas maybe 1e9
I use C and my program can run up to 1e9*1.5 if I don't use slow operations(such as "/","*","sqrt",etc)
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"
sometimes it even accepts 2e9 solutions with 1 second time limit also, https://codeforces.net/contest/1999/submission/275109409 , you can checkout this question and its hacks in which many people submitted O(t*n) solution where t is 1e4 and n is 2e5 but still hacks didn't work on them
It can go all the way to 1e10, if the operations take less time, compared to others.