you might remember me from this blog. Now after eating my way from Expert to CM, I do not intend to stop.

Watch out master I'm coming for you.

IEEEXtreme 18.0 was held yesterday, and there are problems to upsolve, so let's discuss them here.

If there's a problem you couldn't solve mention it in a comment and someone might help you.

I'll start, in the problem Power of three I couldn't get past 60%, I tried looking for any special properties of powers of 3 that I can use to solve for large numbers but I couldn't find anything that is unique to powers of 3 other than the 2nd to last digit being even and the last digit being either 1, 3, 9 or 7. That still doesn't reach the answer though, if anyone solved it could you share the idea?.

Congratulations to tourist for becoming the first tourist on codeforces

they say you are what you eat so I'll keep eating them until I become one

I was writing a problem on polygon and I came across a problem with the std::rcmp9 checker.

Whenever the output doesn't fit in a double variable it gives AC verdict even if the relative error is greater than 1e-9

I tried making my own version and reading the numbers as strings and then casting them as ld and making ld variations of the check functions but the same thing happens and I can't get correct verdicts, could anyone suggest any solutions?