EtherLand's blog

By EtherLand, history, 5 months ago, In English,

Hello,

Problem The Number of Sub permutations solve by problem k-d-sequence but in that case k = 0 and d = 1 and you count number of contiguous subsegments with a minimum number of one

Read more »

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