// Solve 2-3 easy problems (800-1000 rated) before the contest
// This activates your problem-solving circuits
// Choose problems from topics you're comfortable with

// Minute 0-1: Open ALL problems (Ctrl+Click each in new tab)
// Minute 1-3: SCAN all problems (just titles + first line)
// Minute 3-5: Read Problem A fully, start coding

// WHY: Sometimes A is harder than B
// You want awareness of all problems before diving deep

For each problem, ask:
1. Do I understand what it's asking? (1 min to decide)
2. Do I see a clear approach? (3 min to decide)
3. Am I confident I can implement it? (5 min to decide)

If any answer is "No" after time limit → SKIP, try next problem

2-hour contest breakdown:
[0:00 - 0:30]  Problems A + B (high urgency, quick wins)
[0:30 - 1:00]  Problem C (deep focus)
[1:00 - 1:05]  BREAK: Stand up, stretch, drink water
[1:05 - 1:35]  Problem D (or C if still working)
[1:35 - 2:00]  Final push: debug or attempt E

// SUBMIT FAST if:
// - Problem is clearly correct (greedy with proof)
// - You've tested 3+ edge cases
// - You're running low on time

// TEST MORE if:
// - There are tricky edge cases (n=0, n=1, negative)
// - Implementation was complex
// - You have time remaining
// - Problem has tight constraints (likely tricky cases)

// 1. Integer Overflow
int a = 1e9, b = 1e9;
int wrong = a * b;  // OVERFLOW!
long long right = (long long)a * b;  // Correct

// 2. Array Index
for(int i = 0; i <= n; i++)  // Should be i < n?

// 3. Uninitialized Variables
int dp[N][M];  // Random values! Use memset or fill

// 4. Modular Arithmetic
ans = (ans + x) % MOD;  // What if x is negative?
ans = ((ans + x) % MOD + MOD) % MOD;  // Safe version

// 5. Off-by-one in Binary Search
while(l < r) vs while(l <= r)  // Different semantics!

Typical focus pattern during 2-hour contest:
[0:00 - 0:45]  HIGH focus (use for hardest thinking)
[0:45 - 1:15]  MEDIUM focus (fatigue starts)
[1:15 - 1:30]  DIP (take micro-break if possible)
[1:30 - 2:00]  RECOVERY (adrenaline of deadline)

Day of contest: Read editorials only, no coding
Day after: Implement 1-2 unsolved problems
2 days after: Implement remaining problems
1 week later: Re-attempt hardest problem from scratch

## Contest: Codeforces Round #XXX
## Date: YYYY-MM-DD
## Performance: Solved X/Y, Rank: ZZZZ

### Problem A: [Name]
- Time: X minutes
- Status: ✅ / ⚠️ WA / ❌ Unsolved
- Key insight: 
- Mistake made (if any):

### Problem B: [Name]
...

### Lessons Learned:
1. 
2. 
3. 

### Action Items for Next Contest:
1. 
2. 

1. "I've prepared. I deserve to be here."
2. "Mistakes are learning opportunities, not failures."
3. "I focus on process, not rating."
4. "Every problem I solve makes me stronger."
5. "I am calm, focused, and ready."

TREAT LIKE RATED:
✅ Same pre-contest routine
✅ Same 2-hour time limit (strict!)
✅ No looking anything up during
✅ Same post-contest analysis

THE BENEFIT:
- Practice under pressure without rating risk
- Experiment with different strategies
- Build endurance for 3-hour contests

PRE-CONTEST (2 hours before):
☐ Light meal + hydration
☐ Physical warm-up (stretch, walk)
☐ Technical setup complete
☐ Warm-up problems solved
☐ Templates open and tested
☐ Distractions eliminated

DURING CONTEST:
☐ Read ALL problems first (5 min)
☐ Solve in optimal order (not always A→B→C)
☐ Use 20-minute rule for skipping
☐ Micro-breaks every 30 minutes
☐ Don't panic on WA - follow protocol

POST-CONTEST:
☐ Cool down (don't upsolve immediately)
☐ Quick reflection (what went well/wrong)
☐ Read editorials
☐ Fill mistake journal
☐ Upsolve within 48 hours