**344 problems solved**

**Rank by points:**#277

**Total points:**476

**4 contests written**

**Rank by rating:**#1183

**Rating:**1658

**Min. rating:**1389

**Max rating:**1854

**From**
Codeforces

#### About

8120751ffe96bb037d41c86b51525c091ae65f747edebb13b6eb030b752648ac

### Timeline:

5-9-2021: First 15-pointer

5-10-2021: Second 15-pointer (Improved it to 16 points on 5-18 and 17 points on 5-19)

5-16-2021: Got 200 weighted points sometime around the 16th.

5-17-2021: Five 15+ point problems :)

5-18-2021: Highest score (as of May 20th) on this problem, although my solution is kinda wack

5-20-2021: Got fastest code for this problem

5-22-2021: Ten 15+ point problems!

5-23-2021: 100 problems solved! Also I'm now in top 1000 by points.

5-24-2021: 1<<7 problems solved :]

5-25-2021: First 20-point problem! Also 300 points and top 800 by points :)

5-26-2021: Fastest submission to this problem.

5-27-2021: Top 700 by points, 200pp, and 55 problems solved today (37 with Rust)! Also fastest solution to this problem.

6-3-2021: This is what happens when a programmer is bored.

6-13-2021: Top 600 by points!

6-17-2021: Fastest solution to this problem. My solution runs in 0.11s, and doing `bool f(int n) { return false; }`

runs in 0.10s, so my actual program runs in 0.01s (and I think the rest is function overhead and the tester program).

6-28-2021: Spent a lot of time today golfing Longest Flight Route. It's not very honorable to use the ruby trick, but if I don't, someone else will :( compression methods like that should be banned

8-6-2021: After a LONG time away from DMOJ, I came back and got my first 25 pt problem :)

8-24-2021: Somehow I got the fastest solution for this problem (on Yosupo Judge) on my first submission :o. After I improved it, the next fastest solution takes 69% more time than mine lol. (Edit: I have now been overtaken by nor!)

7-7-2022: I solved Hello, World!

6-8-2023: ~\lfloor 100\pi \rfloor~ problems solved

### Fun Problems:

CCC '04 S3 - Spreadsheet

DWITE '07 R4 #5 - It all adds up (slightly harder than above)