Bovmelo's blog

What are the most used “proof words” in CP?
By Bovmelo, history, 11 months ago, In English

Let me start with “note that”.

  • Vote: I like it
  • +92
  • Vote: I do not like it

»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Bovmelo (previous revision, new revision, compare).

→ Reply
»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

"consider"

→ Reply
»
11 months ago, # |
  Vote: I like it +818 Vote: I do not like it

→ Reply
»
11 months ago, # |
  Vote: I like it +73 Vote: I do not like it

"It can be shown that"

→ Reply
»
11 months ago, # |
  Vote: I like it +122 Vote: I do not like it

It is obvious that

→ Reply
»
11 months ago, # |
  Vote: I like it +183 Vote: I do not like it

Trust me bro

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    I literally wrote this on a blog after the most crucial claim and no one questioned it

    Thanks cf

    → Reply
»
11 months ago, # |
  Vote: I like it +4 Vote: I do not like it

Let's assume

→ Reply
»
11 months ago, # |
  Vote: I like it +111 Vote: I do not like it

I hate it when they use "it is easy to see that"

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +71 Vote: I do not like it

    Me too.. and whenever this is written its always hard to see that

    → Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It feels like they're big brain & you're smol brain lmao

    → Reply
»
11 months ago, # |
  Vote: I like it +1 Vote: I do not like it

We can notice that

→ Reply
»
11 months ago, # |
  Vote: I like it +101 Vote: I do not like it

“bitset”

→ Reply
»
11 months ago, # |
  Vote: I like it +319 Vote: I do not like it

well known trick in china!

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Hence Proved !

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It can be proved that...

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

somehow "it works" :)

→ Reply
»
11 months ago, # |
← Rev. 2   Vote: I like it -14 Vote: I do not like it

Pretest Passed or Accepted in Contest

→ Reply
»
11 months ago, # |
  Vote: I like it +1 Vote: I do not like it

We can achieve this by. ..

→ Reply
»
11 months ago, # |
  Vote: I like it +141 Vote: I do not like it

" We don't have the strict proof, but we have faith and stress."

→ Reply
»
11 months ago, # |
  Vote: I like it +123 Vote: I do not like it

The proof is left as an exercise to the reader.

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    It would be thoroughly appreciated if lazy editorials put this rather than a low-effort explanation that clears up nothing.

    → Reply
»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

Without loss of generality

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

let it be

→ Reply
»
11 months ago, # |
  Vote: I like it -13 Vote: I do not like it

TLE

→ Reply
»
11 months ago, # |
← Rev. 8   Vote: I like it -23 Vote: I do not like it

Well-Known Fact

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

obviously

→ Reply
»
11 months ago, # |
  Vote: I like it +21 Vote: I do not like it

This is a well-known fact that

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It can be shown that there is always at least one answer. I have seen it dozens of times

→ Reply
»
11 months ago, # |
  Vote: I like it +8 Vote: I do not like it

I "Claim"

→ Reply
»
11 months ago, # |
  Vote: I like it -17 Vote: I do not like it

"I am lgm"

→ Reply
»
11 months ago, # |
  Vote: I like it +9 Vote: I do not like it

"Observation:"

→ Reply
»
11 months ago, # |
  Vote: I like it +15 Vote: I do not like it

from "someoldname" 's theorem it's obvious that...

→ Reply
»
11 months ago, # |
  Vote: I like it +5 Vote: I do not like it

"There are other approaches..."

→ Reply
»
11 months ago, # |
  Vote: I like it +1 Vote: I do not like it

We can prove by induction that ...

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

"from the following observations"

→ Reply
»
11 months ago, # |
  Vote: I like it +5 Vote: I do not like it

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"

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The proof is left as homework.

Source : https://mirror.codeforces.com/blog/entry/9070 (word "homework" written in tutorial of 351C + 351D)

→ Reply
  • »
    »
    11 months ago, # ^ |
      Vote: I like it +13 Vote: I do not like it

    And sometimes "homework" is harder than the actual problem, so we just "prove it by AC"

    → Reply
»
11 months ago, # |
← Rev. 2   Vote: I like it +3 Vote: I do not like it

"Time complexity: O( )"

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

"Maximum Value among the minimums"

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It can be proven that

→ Reply
»
11 months ago, # |
  Vote: I like it +1 Vote: I do not like it

We can use (smth) to optimize $$$\mathcal{O}(n^2)$$$ to $$$\mathcal{O}(n \log n)$$$ due to monge property

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

(How?)

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

"First of all"

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Editorial

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Let's start with a naive solution

→ Reply
»
11 months ago, # |
  Vote: I like it +1 Vote: I do not like it

"We are programmers not mathematicians"

→ Reply
»
11 months ago, # |
  Vote: I like it 0 Vote: I do not like it

It was revealed to me in a dream

→ Reply