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

Автор Mehrdad_Sohrabi, история, 3 года назад, По-английски

We want to mention BamiTorabi who we thank for helping us with translating the problems and writing the tutorials, and also we apologize for div1 A2 and B hopefully you will forgive us :( .

Tutorial is loading...

Prepared by Mohammad.H915 Editorial by Mehrdad_Sohrabi

official solution
Tutorial is loading...

Prepared by Mohammad.H915 Editorial by Mehrdad_Sohrabi

official solution
Tutorial is loading...

Prepared by Mohammad.H915 Editorial by Mehrdad_Sohrabi

official solution
Tutorial is loading...

Prepared by AliShahali1382 Editorial by Amoo_Safar

official solution
Tutorial is loading...

prepared by Mehrdad_Sohrabi Editorial by Mehrdad_Sohrabi

official solution
Tutorial is loading...

prepared by Mehrdad_Sohrabi Editorial by Mehrdad_Sohrabi

official solution
O(n2) solution
Tutorial is loading...

Prepared by AliShahali1382 Editorial by AliShahali1382

official solution

Полный текст и комментарии »

Разбор задач Codeforces Round 684 (Div. 1)
Разбор задач Codeforces Round 684 (Div. 2)
  • Проголосовать: нравится
  • +94
  • Проголосовать: не нравится

Автор Mehrdad_Sohrabi, 4 года назад, По-английски

Hi :)

Suppose whe have a tree that each vertex has a value

we have two types of query

1 : changing value of a vertex

2 : print the minimum value in the path of u and v

Do you have answer without hld

Полный текст и комментарии »

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

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

Hi everybody:)

Do you think these days most of the questions in contest are long and hard to understand? I think most of them have useless stories so it makes problems for those people who their English is not good as others

I hope lots of contests will have short questions that consists just important parts of question:)

Good luck:)

Полный текст и комментарии »

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