Here is my view when coding :)

# | User | Rating |
---|---|---|

1 | tourist | 3947 |

2 | ecnerwala | 3654 |

3 | jiangly | 3627 |

4 | jqdai0815 | 3620 |

5 | orzdevinwang | 3612 |

6 | Benq | 3586 |

7 | Radewoosh | 3582 |

8 | Geothermal | 3569 |

8 | cnnfls_csy | 3569 |

10 | ksun48 | 3474 |

# | User | Contrib. |
---|---|---|

1 | awoo | 163 |

2 | maomao90 | 160 |

3 | adamant | 156 |

4 | atcoder_official | 154 |

5 | maroonrk | 152 |

6 | -is-this-fft- | 148 |

6 | SecondThread | 148 |

8 | Petr | 147 |

9 | nor | 145 |

10 | cry | 144 |

Here is my view when coding :)

Hello there!

Today is Persian New Year's day, Nowruz!

I wish this year be an amazing year for you!

I hope to see all you in RED...

Hello everyone!

Today I'm going to talk you about a useful problem-solving method, **binary search**. If you have seen, in some problems we can't use an algorithm with $$$O(n^2)$$$ (because your program would be too slow to solve such problems). In those cases, you can use faster algorithms, but one of the popular algorithm is binary search. In binary search, you assume an integer as the answer, and you try that to see if it is the real answer or not. In this algorithm, you have an answer range, with usually starts with 0 and the end of the range will be maximum possible answer (i.g. 1e9). Let's play a game to understand better. One of your friends choose an integer from 1 to 100 and you need to ask some questions of your friend to find the number your friend had chosen. If you work smart (you will because you are smart) you start with this question: Is it less than 50? Do you agree if the friend's answer is yes, your range will be divided by 2 and also if your friend's answer is no. We assume he/she said NO, then you choose the number that is in the middle to work more efficiently, so you choose 25 and **until you trap 1 exact integer**, which is the answer!

Binary search is so similar to this game. You choose the middle integer in your **current** range, and check it. Let's calculate the order of algorithm. We assume you divide the range $$$x$$$ times, then $$$x$$$ would be $$$⌈log2(x)⌉$$$, because you it divides by 2 at most $$$⌈log2(x)⌉$$$ times! So the binary search is $$$O(⌈log(n)⌉)$$$.

Here's a simple code of binary search game:

```
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n; //assume we don't know the answer is n
int left = 1, middle, right = 101; //defining left and right of the range
while(left < right - 1) { //because our program does not check 101 and more!
middle = (left + right) / 2; //getting the middle of the current range
if (middle <= n) { //here is the question: is my guess less than the answer?
left = middle; //if yes, remove the left part of current range by moving the pointer
}
else {
right = middle; //and also similar thing for this
}
}
cout << "The answer is " << left; //finally we have found the exact answer
}
```

I explained the game in detail in the code comments ;)

Binary search is optimal algorithm to solve a lot of problems, so if you didn't know how to solve some problems **without** "Time limit exceeded", then try this!

Hope you enjoy my entry, please make me happy by clicking this little green button below :)

Thanks codeforces!

//This tutorial is just for begginers!

Happy New Year 2024 to all people around the world including Codeforces users! ;)

Please make me happy by giving me like on this entry <3 Thanks!

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Aug/04/2024 10:42:03 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|