_doomboo_'s blog

By _doomboo_, history, 7 months ago, In English

I was solving this problem with a combinatoric based approach. So I compute binomial coefficient using Fermat Little Th. and modular inverse. I have correct values for N up to 34, then my code starts giving wrong values. I belive the approach is correct but there is some issue I cant figure out related to modulo, modular inverse or powmod function. Can anybody help me understanding why my code fails? CODE

Full text and comments »

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