Let me start with “note that”.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Let me start with “note that”.
Name |
---|
Auto comment: topic has been updated by Bovmelo (previous revision, new revision, compare).
"consider"
that is best proof
"It can be shown that"
It is obvious that
Trust me bro
I literally wrote this on a blog after the most crucial claim and no one questioned it
Thanks cf
Let's assume
I hate it when they use "it is easy to see that"
Me too.. and whenever this is written its always hard to see that
It feels like they're big brain & you're smol brain lmao
We can notice that
“bitset”
well known trick in china!
haha, here for example.
Hence Proved !
It can be proved that...
somehow "it works" :)
Pretest Passed or Accepted in Contest
We can achieve this by. ..
" We don't have the strict proof, but we have faith and stress."
The proof is left as an exercise to the reader.
It would be thoroughly appreciated if lazy editorials put this rather than a low-effort explanation that clears up nothing.
Without loss of generality
let it be
TLE
Well-Known Fact
obviously
This is a well-known fact that
It can be shown that there is always at least one answer. I have seen it dozens of times
I "Claim"
"I am lgm"
"Observation:"
from "someoldname" 's theorem it's obvious that...
"There are other approaches..."
We can prove by induction that ...
"from the following observations"
If you actually want to prove something: "Assume that"
Once you realize that you don't know how to prove something: "It's obvious that"
The proof is left as homework.
Source : https://codeforces.net/blog/entry/9070 (word "homework" written in tutorial of 351C + 351D)
And sometimes "homework" is harder than the actual problem, so we just "prove it by AC"
"Time complexity: O( )"
"Maximum Value among the minimums"
It can be proven that
We can use (smth) to optimize $$$\mathcal{O}(n^2)$$$ to $$$\mathcal{O}(n \log n)$$$ due to monge property
amonge us
(How?)
"First of all"
Editorial
Let's start with a naive solution
"We are programmers not mathematicians"
It was revealed to me in a dream