Блог пользователя _blub

Автор _blub, история, 11 дней назад, По-английски

Firstly, the phrase "weird" I use is for problems that have a solution where you can't really prove the time complexity with real proof but rather with intuition, estimation... For example problem 2284C2, (I'm not sure if there's any other ways to solve but after my random guess during the contest which got AC and according to many sources) the solution for k = 2 is to brute force to find the value c that gcd(a, c) = gcd(b, c) = 1. It is said that c will be found after approximately 300 steps which I have no idea why. Can anyone explain the boundary 300 steps in the problem and are there any tips to recognize and solve these weird problems?

  • Проголосовать: нравится
  • +7
  • Проголосовать: не нравится

»
10 дней назад, скрыть # |
 
Проголосовать: нравится 0 Проголосовать: не нравится

Auto comment: topic has been updated by _blub (previous revision, new revision, compare).

»
10 дней назад, скрыть # |
 
Проголосовать: нравится +3 Проголосовать: не нравится

Prime Gaps — the difference between two adjacent primes in this range is ~100.

»
10 дней назад, скрыть # |
 
Проголосовать: нравится -6 Проголосовать: не нравится

bruh this contest was generally so ez. That's why you shouldn't call these problems weird. It only takes around 50 min for me to solve all

  • »
    »
    10 дней назад, скрыть # ^ |
     
    Проголосовать: нравится +1 Проголосовать: не нравится

    50m is crazy work, it took me the entire contest to solve A-C2

    • »
      »
      »
      10 дней назад, скрыть # ^ |
       
      Проголосовать: нравится +1 Проголосовать: не нравится

      same for me lol

      • »
        »
        »
        »
        10 дней назад, скрыть # ^ |
         
        Проголосовать: нравится 0 Проголосовать: не нравится

        individually i don't think it is about skill issue on you. Due to tips generally i don't have standart tips but i notice sth while i read the statemtn Initially

        1) Limits — it is too crucial for not to get TLE. 2) Edge cases for example what will happen if n == 1 or sth like that 3) MATH i think it is saving me in all the contests 4) Whenever i read the statement i think in my brain edge cases also which dsa structure will favor me in here? binary search, combinatoics or sth? 5) Sometimes i look proffessionals' codes then look problem the anti-logic it helps me to understand what they think while writing the code 6) And i love combinatorics so i revise combinatoric forimuals furthermore if some problem is hard or me and ther is key formula i note that formula ot tips

        But actually i don't think 50 min is crazy for this contest

  • »
    »
    10 дней назад, скрыть # ^ |
     
    Проголосовать: нравится 0 Проголосовать: не нравится

    50m is crazy, idk if it's skill issues or was I not good at there type of problems. Can you leave some tips on how to solve those kind of problems?

»
10 дней назад, скрыть # |
 
Проголосовать: нравится -6 Проголосовать: не нравится

And i think you have some CP experience prior to. I looked your codes and saw they demand good dsa sturcters knowledge furthermore great analyzing and logical knowledge.