I’m not looking for "use fastio" or "use long long" advice—everyone knows that. I want the real magic.
I mean do you have tips like "in those type of problems you should think that" .
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 146 |
| 3 | Proof_by_QED | 146 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
I’m not looking for "use fastio" or "use long long" advice—everyone knows that. I want the real magic.
I mean do you have tips like "in those type of problems you should think that" .
| Name |
|---|



remove 1331 from your handle.
no
interactive problem = binary search
Geometry = skip
i almost got on the ioi team because of a geometry problem (where the only geometry was "reflect a point across a line") so if the geometry is simple it's actually a pretty good way to get a lot of points that most people will skip
Correct me if i´m wrong (I am not very good at this codeforces thing) but wouldn´t you just multiply the given point (X and Y) by -1 to get the inversed point across the line y=x? I´m unsure on given constraints and input formats but it seems rather simple for a question that could qualify IOI teams.
This only works for line y=x, but he probably had all type of lines