I'm learning binary lifting right now, already solved LCA and http://mirror.codeforces.com/problemset/problem/932/D.

Can you please suggest other problems that can be solved via binary lifting, I want to train this technique.

Thank you.

I try to access https://cf-predictor-frontend.herokuapp.com/ and it seems like it's down.

I loved the app, hope the author will take a look at the logs if it's down.

Is there any alternative?

http://olympiad.cs.uct.ac.za/old/saco2007/day1_2007_solutions.pdf Can someone please explain how the formula for the 4th problem (The Knights Who Say Ni) was derived.

http://mirror.codeforces.com/contest/706/submission/21385544 on the test case 2 I get output "1" on my PC and 0 on the CF. I'm on linux gcc v 4.8.4 I compile with "g++ -std=c++11", I tryed all CF compilers. Can anyone help pls.

You are given a set of rectangles and you are asked to determine the length of the perimeter of the complex polygon formed by the silhouette of the overlapping rectangles. Any ideas?