Codeforces Round 895 | Problem A-E (Div. 3) | Data Structures Fan | Plus Minus Permutation

Поделиться
HTML-код
  • Опубликовано: 18 сен 2024
  • #codeforces
    #coding
    #code
    #upsolve
    #cf

Комментарии • 8

  • @Acodedaily
    @Acodedaily  Год назад +1

    discord.com/invite/H8TeFjvq6z

  • @veljkomladenovic8397
    @veljkomladenovic8397 Год назад +2

    Nice solution for problem E

  • @Algorithmswithsubham
    @Algorithmswithsubham Год назад +1

    amezing explanation

  • @Bharat_Rider
    @Bharat_Rider Год назад +2

    I am doing CP since 6 months I wasn't able to do 2 problems . Today I was expecting better 😢.

    • @Acodedaily
      @Acodedaily  Год назад +5

      There are days when you beat your expectations and then there are days like these. All of this is just a part of process!

  • @abc-ym4zs
    @abc-ym4zs 10 месяцев назад

    I am in third year i dont have much friends i came to engineering college which is very far from my city day by day Acdemic pressure not able concentrate on studies and placments in these college are not so good i am not able to learn new skill now what should i do dialy i am getting thinking too much and getting tension about future not able to think about present what should i do sir should i drop out of college and join the college with in my premesis which have good placements literally now i am studying in givernment college which is very far from my state i dont have much friends and feeling very depressed if i drop out from the college and i will take 4-5 months break and again join some good college in my region it will create 3 year gap in my career is it create any problem in my career

  • @loudcapricorn5513
    @loudcapricorn5513 Год назад

    C was a bad problem.....rather than using much logic and thinking had to spend time on if-else type of edge cases. Overall the initial problems were mostly maths based and not much general thinking stuff.

    • @omgupta2590
      @omgupta2590 Год назад +1

      the if else cases with not be there if you could directly use sieve and handle accodingly