Hi Codeoforces, Where(websites) do most of the USA coders practice and participate in contests?

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

1 | tourist | 3757 |

2 | jiangly | 3590 |

3 | ksun48 | 3582 |

4 | Um_nik | 3539 |

5 | maroonrk | 3533 |

6 | slime | 3498 |

7 | djq_cpp | 3486 |

8 | Radewoosh | 3442 |

9 | cnnfls_csy | 3427 |

10 | ko_osaga | 3355 |

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

1 | -is-this-fft- | 184 |

2 | awoo | 181 |

3 | dario2994 | 171 |

4 | SecondThread | 169 |

4 | maroonrk | 169 |

6 | Um_nik | 168 |

7 | adamant | 166 |

8 | YouKn0wWho | 165 |

8 | errorgorn | 165 |

10 | antontrygubO_o | 162 |

Hi Codeoforces, Where(websites) do most of the USA coders practice and participate in contests?

There are two while loop conditions:

1. while(low<high)

2. while(low<=high)

There are two ways to find mid element:

1. mid = (low+high)/2

2. mid = (low+high+1)/2

And then depending on the required condition we do low = mid+1 and right = mid or low = mid and right = mid-1 or something else. I know it's something keeping low always as our answer and returning that after while loop breaks and if high is always possible answer we return high. But I don't know clearly what to do when. Is there any logical way to do this stuff, I have try some combinations before getting right pair of conditions.

Thanks in advance.

1. Segment Trees

2. Square Root Decomposition

3. Fenwick Tree

4. Mo's Algorithm

5. Heavy Light Decomposition

6. Sparse Table

Can anybody please tell me or give link to any previous already published blog (I couldn't find any) regarding which algo to use when? Which is most important among them all?

1. DP / Greedy

2. DFS/BFS

4. Sorting/Binary Search/ Data Structures like maps and sets 4. Maths (Basic not FFt or something)

Although these algorithms are sufficient to become candidate master and 5 star if one has speed and accuracy but I believe I will need to learn some advanced algorithms to further increase the level. Can somebody please share the algorithms which are most occurring in 4th/5th question of Codeforces Div 2 round and 2nd/3rd question of codechef div 1 cookoff.

a. Calculate the height of tallest tower.

b. Calculate the minimum number of towers to equip all the blocks.

Obviously, the the answer of first part is longest decreasing array. I am not sure about second part but according to me the answer will the longest strictly increasing array.

Correct me if I am wrong.

I am ready for lot of downvotes but I want a serious advice.

I am pre-final year student in Tier 1/Tier 2 college(new IIT, consider it in whichever tier you want). I have done internship in a small start-up. Now I have two options, can do one more internship in relatively good company(obviously not in Amazon/Microsoft) or can do lot of coding, enhance my coding skills and core subject knowledge.

Which option will be more beneficial for my placements, a good internship or coding skills.

For those who will downvote, I have no problem with you but please give me advise before doing that.

I am sure lot of students may have same question.

Tight you seat belts for back to back contests

1. LeetCode(8:00-9:30)

2. KickStart(9:30-12:30)

3. Atcoder (4:30-6:30)

4. Codeforces (6:30-8:30)

5. Cook-Off (9:30-midnight)

Have fun day XD.

His notes link: https://drive.google.com/file/d/1UISiTL7J3VKXfE43h1lDLld6Id26jF8j/view?usp=sharing

Start reading from page 6.

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/06/2022 07:51:17 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|