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 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
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*bis 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