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

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

101864A - A Criminal

Setter: MesbahTanvir Alternate Writer: prophet_ov_darkness, s_h_shahin

Editorial
Solution Code

101864B - A Leap of faith

Setter: Tanzir5 Alternate Writer: bertho_coder, Alpha_Q

Editorial
Solution Code

101864C - BACS, Scoundrel Shopkeeper and Contiguous Sequence

Setter: Imran_Bin_Azad,raihatneloy Alternate Writer: bertho_coder, Imran_Bin_Azad, flash_7, aminul

Editorial

101864D - Beauty and The Tree

Setter: s_h_shahin Alternate Writer: MesbahTanvir, aminul

Editorial
Solution Code

101864E - Diverse Group

Setter: SkullKnight Alternate Writer: Alpha_Q

Editorial
Solution Code

101864F - Football Free Kick

Setter: kimbbakar Alternate Writer: Alpha_Q

Editorial
Solution Code

101864G - GCD and LCM of 3 numbers

Setter: codename27 Alternate Writer: Z0RR0, MesbahTanvir

Editorial
Solution Code

101864H - Little T2 and Derangements

Setter: Z0RR0 Alternate Writer: codename27, flash_7

Editorial
Solution Code

101864I - Marbelous Meena

Setter: Alpha_Q Alternate Writer: bertho_coder

Editorial
Solution Code

101864J - Non Super Boring Substring

Setter: flash_7 Alternate Writer: prophet_ov_darkness, aminul

Editorial
Solution Code

101864K - Ray Ray Array

Setter: aminul Alternate Writer: Z0RR0

Editorial
Solution Code

101864L - School Reunion

Setter: prophet_ov_darkness Alternate Writer: flash_7,codename27

Editorial
Solution Code

101864M - TFF

Setter: bertho_coder Alternate Writer: Tanzir5

Editorial
Solution Code
Разбор задач 2018 BACS Contest Replay
  • Проголосовать: нравится
  • +38
  • Проголосовать: не нравится

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

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

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

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

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

For Problem D, if we use a log factor for keep track of maximum overall time complexity will be around 10^10 for MO's