User creator

About

Nguyen Quang Duy, INED, IT1, 62ND.

LTOL's author ( ͡❛ ͜ʖ ͡❛)

\[~p_n = 1 + \displaystyle\sum_{i = 1}^{2^n}\left\lfloor\left(\frac{n}{\displaystyle\sum_{j = 1}^{i}\left\lfloor\left(cos\frac{(j - 1)! + 1}{j}\pi\right)^2\right\rfloor}\right)^{\frac{1}{n}}\right\rfloor~\]

Problem's point system

This is my own point system, other problem setters on LTOL may not apply it.

*This point system applies to my contests and contests that I participated as a problem setter.**

My problem's point is linked with Codeforces (CF) user's rating. For estimation: Users with ratings of \(1300, 1600\) on Codeforces will have at least \(2400\) (red), \(3000\) (target) rating correspondingly on LTOL, but not vice versa.

Average rating on Codeforces to get full AC of a problem in a reasonable time (\(1\) - \(20\) - \(40\) minutes for easy - normal - hard problems):

\(100 \leftarrow 100\) CF (Easy)

\(200 \leftarrow 1000\) CF (Normal)

\(300 \leftarrow 1300\) CF (Normal)

\(400 \leftarrow 1600\) CF (Hard)

\(500 \leftarrow 2000+\) CF (Very hard)

After the problems are published, each problem's point will be divided by \(100\), rounded to \(1/5\) and \(\pm\) \(0.4\) based on other contestants' submissions.