orz's blog

Codeforces Round 969 (Div. 1) — Screencast & Editorial of A–D
By orz, history, 20 months ago, In English

I solved problems A–D, but I was quite slow, also I had two incorrect submissions for problem A, so my rating delta was -21.

If you want to watch my screencast and editorial, it will appear (UPD: has appeared) behind this link in several minutes: https://youtu.be/NuyV1LIMX3E; or in this box:

And, of course, my warmest congratulations to tourist on reaching 4000 rating points milestone!

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

»
20 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Thanks, I always do appreciate your editorials!

→ Reply
»
20 months ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

edit : he mentioned that the number is prime for a brief second

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

    Yes, it works only for an odd modulus, but I of course was proving it for an odd divisor of $$$g$$$ (proving that it only can be $$$1$$$, thus $$$g$$$ is a power of two).

    → Reply