suppose u have to find a % b , i see many red coders solution instead of using directly a%b they do like ..
if (a >=mod) a-=mod ??
why so ?
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | 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 |
10 | nor | 152 |
suppose u have to find a % b , i see many red coders solution instead of using directly a%b they do like ..
if (a >=mod) a-=mod ??
why so ?
Name |
---|
Its faster(if you do addition like 1e6(1,000,000) or more times in a program, writing an addition function using this if instead of % will save a lot of time),but this can be used only for addition and a similar if for subtraction. It can not be used for multiplication.
The plausible reason should be that the execution time of the statement
if(a >= b) a -= b;
is more likely to be less than the execution time of the statementa %= b;
when it is guaranteed that the expressiona < 2*b
is true. You may write a short C++ program to compare the average execution time of both statements so as to confirm or refute this hypothesis.Yes , i checked in c++14 , its 3.6 times faster than % .. thanks nikolapesic2802 , CodingKnight
With pleasure. Thanks for sharing the result of the experiment.
because
1000 ms
8700 ms