Issue with large value

Правка en1, от _doomboo_, 2023-09-02 11:18:06

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 36, 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

Теги combinatorics, modular arithmetic, pow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский _doomboo_ 2023-09-02 11:24:09 3 Tiny change: ' N up to 36, then my ' -> ' N up to 34, then my '
en1 Английский _doomboo_ 2023-09-02 11:18:06 516 Initial revision (published)