Shayan's blog

Codeforces Round 962 (Div. 3) — Video Tutorial
By Shayan, history, 16 hours ago, In English

1996A — Legs

1996B — Scale

1996C — Sort

1996D — Fun

1995E — Decode

1995F — Bomb

1996G — Penacony — My Segtree solution

1996G — Penacony — Jiangly's XOR hashing beautiful solution

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

»
15 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

why we ignored ac and bc in ab+ac+bc<=n ??

→ Reply
  • »
    »
    14 hours ago, # ^ |
    ← Rev. 2   Vote: I like it 0 Vote: I do not like it

    We do not ignore those terms. We just know that it is necessary for ab to be <= n (not sufficient. Therefore, our second loop for b goes to n / a, not n.

    → Reply
    • »
      »
      »
      13 hours ago, # ^ |
        Vote: I like it -7 Vote: I do not like it

      ok, thank you

      → Reply
»
4 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Why is this downvoted? I thought explanations were pretty good

→ Reply
»
3 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Great Explanations!

→ Reply