Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Tudor's blog

By Tudor, history, 5 years ago, In English

Hi , I am interested to solve a problem and I can not find a polynomial solution . How many spanning trees are in a grid graph(N x M)?

Read more »

 
 
 
 
  • Vote: I like it
  • +18
  • Vote: I do not like it

By Tudor, history, 6 years ago, In English

It is an array with n elements and d[i] = how many substrings have XOR value i. What is the optimal algorithm for build this dp? substring = a[i1] , a[i2] , ... not contigous.

Read more »

 
 
 
 
  • Vote: I like it
  • +11
  • Vote: I do not like it