Hi everyone I was practicing on this problem https://mirror.codeforces.com/contest/283/problem/A and i am getting a TLE but my solution works in o(1) time for each query so i figured that it is a problem in the input or output this is the submission 72396868 so can you please send some c++ input/output optimizations that make them faster also how can we input long doubles with scanf ...thanks

hello everyone i have spent about 3 hours trying to implement the articulation point tree and it is also called Block-cut tree but it failed because of cycles with articulation points... so can anyone send an implementation to it or a tutorial please.

Hi i wrote in my previous blog that i changed the base of the number that i used as the sqrt and my solution passed and this time i i was getting a wrong answer and i just changed the base and got an accepted and i was looking for bugs in my code for quite a while but i didn't find any so can anybody explain to me why this happened??
this is the problem btw: 455D - Serega and Fun

hi cf community Spoiler alert for someone who hasn't solve the problem!!!!!!

i was solving this problem https://mirror.codeforces.com/contest/13/problem/E using sqrt decomposition and got tle the first time then i just increased the sqrt by one and got accepted but i know for a fact that by increasing the sqrt some operations has to take longer time so is it a known method to increase the sqrt or that was just luck?

Hey everyone i have been training on cp for more than one year now and 4 months ago i started listing the problems that i can not solve to solve them later and now the list contains more than 70 problems and (most of the high ranked programmers that i know) say that u should open the tutorial if u tried everything you can so what should i do with those problems?

I am getting a Runtime error 69696816 and i can not understand why any help please. this is the problem https://mirror.codeforces.com/contest/1092/problem/E (excuse me for my poor english)