codeforces brush title record

Codefest 19 (open for everyone, rated, Div. 1 + Div. 2)

C. Magic Grid

  • This problem constructed directly
  • The number n is a multiple of the n-th power of 2 when the number of divisions may be so
  • Example, n is a multiple of n 4 = k * 4
  • 000        001         010         011
  • 100        101         110         111
  • (k-1)00   (k-1)01   (k-1)10   (k-1)11
  • Then fill in the grid

Codeforces Round #581 (Div. 2)

D2. Kirk and a Binary String (hard version)

  • Question is intended: to a string containing only 01, and a further string configured to meet any given l ~ r, the original string and the new string does not decrease up to the same sequence length
  • 000 001 111 111 you put this in front of a 1 to a 0 will not affect
  • This can not be changed completely 111100000
  • So consider getting this method does not drop sequence: Let all the 01 and back pack, and the rest will all be, that part of the package to be half
  • Apparently the rest of that section in the all-1 becomes 0 is not affected

Codeforces Global Round 4

D. Prime Graph

 

Guess you like

Origin www.cnblogs.com/jiecaoer/p/11421017.html