Hi Codeforces, Today I decided to learn Convex hull trick, but I cannot find materials in internet. I need your help. Thank you in advance :)
Hi Codeforces, I have a problem where the solution is to solve diofant equation with K unknowns and K > 2. For example one equation of this type is: a1 * x + a2 * y + a3 * z = n and I have to find one solution of x, y and z. It is guaranteed that the equation always have a solution. Are there any algorithm that solve this problem? I will be thankful for helping :)
Hi Codeforces, I ask for help. Can I make a variable which is int type, but when it overflow, it convert to long long type. For example I make an integer variable x. I give max integer value on x. When I add 1 to x, I do not want to overflow. I want to make ( auto convert to) long long and continue with next number. Is it possible? I am sorry if I ask a stupid question.