Mid0's blog

By Mid0, history, 5 years ago, In English

i'm trying to solve this problem but i can't find any algorithm better than O(n^2) !

your help will be greatly appreciated.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By Mid0, history, 6 years ago, In English

i'm trying to calculate nCr mod prime power , i found this comment which is really helpful but the formula as i understand doesn't apply to some numbers and i don't know how it works , could anyone explain it in more details ?

Read more »

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

By Mid0, history, 6 years ago, In English

this is a solution for problem H from last contest , can anyone explain to me how this solution works ?

Read more »

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