**207 problems solved**

**Rank by points:**#1580

**Total points:**272

**4 contests written**

**Rank by rating:**#2461

**Rating:**1330

**Min. rating:**1198

**Max rating:**1385

**From**
Richmond Hill H.S., University of Toronto Schools

#### About

Everyman of DMOJ.

**Milestones:**

3/28/2020- First 15 pt problem (Fibonacci Sequence).

5/29/2020- 200 points.

6/15/2020- 100 problems.

1/10/2021- Top 1000 (re-entry, got knocked out of top 1000 due to inactivity)

2/3/2021- 200 problems (200th problem was CCC '11 S3- Alice Through the Looking Glass)

**Random Achievements:**

6/17/2020- Got the first MLE on a problem with a 1 second time limit and 1 GB memory limit.

**PATENTED CODE: USE UP 1 GB OF MEMORY IN ONE SECOND**

```
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
typedef unsigned long long ULL;
using namespace std;
int main() {
vector<vector<vector<ULL>>> arr;
for (int i = 0; i < 10000; ++i) {
arr.push_back({});
for (int j = 0; j < 10000; ++j) {
arr[i].push_back({});
for (int k = 0; k < 1000; ++k) {
arr[i][j].push_back(10000);
}
}
}
for (int i = 0; i < 10000; ++i) {
arr.push_back({});
for (int j = 0; j < 10000; ++j) {
arr[i].push_back({});
for (int k = 0; k < 1000; ++k) {
arr[i][j].push_back(10000);
}
}
}
}
```

**EASY "HIGH" POINT QUESTIONS FOR BEGINNERS:**

Fibonacci Sequence- 15 points

PalinDrone- 12 points

CCC '13 S3- Chances of Winning- 12 points

**"DUPLICATE" PROBLEMS:**

CCC '00 S4- Golf & Coin Change

CCC '12 S5- Mouse Journey & Grid 1

IOI problems that require you to implement a function & their standard I/O variants

Problems and their (Hard) variants