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 | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
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