_SmallBrain_'s blog

By _SmallBrain_, history, 4 weeks ago, In English

Feel free to share some of your best solved problems that you felt interesting to solve or taught you something new in range of 1800-2200.

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

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

I liked this problem although it is kind of classical but good to solve https://mirror.codeforces.com/contest/1155/problem/D

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

2036F - XORificator 3000. Easy to think of the approach until you realize

SPOILER ALERT - DON'T LOOK UNTIL YOU GIVE IT A SHOT AND FRUSTATE YOURSELF ENOUGH
  • »
    »
    4 weeks ago, # ^ |
      Vote: I like it +4 Vote: I do not like it

    long long works , just use (1ll<<i) instead of (1<<i) i guess

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

      Just submitted the editorial code replacing #define int unit64_t with #define int long long and it gave WA on 1. 293274046

      • »
        »
        »
        »
        4 weeks ago, # ^ |
        Rev. 2   Vote: I like it 0 Vote: I do not like it

        Replace (1<<i) with (1ll<<i) and try

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

        In this editorial solution it does not work i guess, because it is using the properties of unsigned for shifting (maybe because test case 1 is wrong even though no overflow), but you need not use unsigned integers just do normally and take care if the value goes negative somewhere

        • »
          »
          »
          »
          »
          4 weeks ago, # ^ |
          Rev. 2   Vote: I like it 0 Vote: I do not like it

          Can you elaborate a little more about those properties like what makes it different from long long? I thought the only difference between these two is the range of numbers they store.

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

    True!

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it
»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

Another classical but rarely used idea: 1155E - Guess the Root.

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

This one changed my life a few hours ago https://mirror.codeforces.com/contest/280/problem/C

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

the best problem I've seen? the one I set: 2031E - Penchick and Chloe's Trees

»
4 weeks ago, # |
  Vote: I like it +7 Vote: I do not like it

1844G - Tree Weights and 1770F - Koxia and Sequence. The coolest problems I have seen.

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

The most difficult to prove (solution/checker/etc) looks the best, so that would be e-olymp/3673, but they changed design so..

»
4 weeks ago, # |
  Vote: I like it +1 Vote: I do not like it

ask this to pienotpi as he is the best coder in India and he lives 4 rooms before your room