Duelist1234's blog

By Duelist1234, history, 6 weeks ago, In English

What are some other great websites with cp contests. i've heard of Atcoder and Codechef but which is the best(besides codeforces ofc)?

  • Vote: I like it
  • -24
  • Vote: I do not like it

»
6 weeks ago, # |
  Vote: I like it +2 Vote: I do not like it

The best for whom? For people who want to solve Div1 — Topcoders before mainstream seems, for people who want original natural problems — Codeforces before first problems with difficulty 3000+ appeared, for people who don't want complicated knowledge — AtCoder, there is unknown for wide range platforms type bestcoder/toki/csacademy/etc listed on clist.by, so better to talk about amazing problems instead of average problems, but yes, you require to rank it because ELO and systematization..

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it +3 Vote: I do not like it

    Your comments consistently provide me with great knowledge.

    • »
      »
      »
      6 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Hopefully, actually the trouble is that you spend more time on selecting of problems to solve and knowledge to follow nowadays more than actually on problemsolving and things are getting worse almost on every active platform..

  • »
    »
    6 weeks ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    where can i find these amazing problems?

    • »
      »
      »
      6 weeks ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      In private contests or finals of different worldwide contests mostly, because there is no purpose for anyone to set problems just for lulz..

      There was dozens techniques known by people before Chinese NOI, typo:

      • Sort on subsegment an array A[L..R] and find a sum; Seems that was a problem with implicit pre-requisites to Segment Tree Beats

      • IOI (Aliens trick is promoting so often);

      • Moscow Pre-Finals by MSU Tapirs (where tourist solved not so many problems, you can find out that there is a problem about Bertrand's postulate (!) that in combination with Ramanujan's and Eratosphene's heritage may provide you using basis of prime numbers you can notice that between [2^i and 2^(i+1)] there is prime numbers so maybe you would try to prove Goldbach's conjecture if use p-adic properties of mod 2^j (maybe other bases not only 2) or some inversion tricks, etc);

      • rng_58's, jqdai0815's, antontrygubO_o's or Errichto's problems;

»
6 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

leetcode is fun

»
6 weeks ago, # |
Rev. 2   Vote: I like it +5 Vote: I do not like it

Luogu :) It's how the Chinese get so good. <- No offense intended, roughly 40% of that is true tho