I've discovered the secret to become lgm — part 2

Правка en1, от giant_text, 2020-08-17 19:27:44

this method (discovered by me!!!) allows to become lgm, but red black trees are very difficult and no one really wants to study them
so I've discovered a new (!) method to become lgm, and it requires no effort (!!!)
now I'll prove that everyone is an lgm

lemma: everyone has the same rating on codeforces
proof by induction: we will prove that every group of $$$n$$$ people has the same rating on codeforces
base case: this is obviously true for $$$n = 1$$$
induction: $$$n \rightarrow n + 1$$$
pick a group of $$$n + 1$$$ people: the $$$n$$$ people on the left and also the $$$n$$$ people on the right have the same rating, so the property is true also for $$$n + 1$$$
so everyone has the same rating (q. e. d.)
so you have the same rating of tourist (!!!)
so you are an lgm (!!!!!)

Теги lgm, secret, induction, tourist

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский giant_text 2020-08-17 19:27:44 901 Initial revision (published)