How to find nCr for large numbers

Правка en2, от umsh1ume, 2016-06-11 00:48:05

I was trying to find binomial co-efficient nCr mod 1000000007 (n and r are large) using inverse modulo but there is some error. What is the problem in this code? https://ideone.com/SWPmty

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский umsh1ume 2016-06-11 00:48:05 21 Tiny change: 're large) but there' -> 're large) using inverse modulo but there'
en1 Английский umsh1ume 2016-06-11 00:47:21 201 Initial revision (published)