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 ?
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3390 |
| 6 | Um_nik | 3387 |
| 7 | tourist | 3384 |
| 8 | heuristica | 3322 |
| 9 | turmax | 3319 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 143 |
| 4 | AmShZ | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | maroonrk | 134 |
| 9 | BledDest | 132 |
| 10 | qwexd | 129 |
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 ?
| Название |
|---|



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