LightOJ 1067 – Combinations

Problem Link

Solution :-

 

Posted by Shipu Ahamed

1 comment

Md sabbir hasan
s=((f[n-r]%shipu)(f[r]%shipu))%shipu;
printf(“Case %lld: %lldn”,++no,(f[n]
mod(s,shipu-2))%shipu);
can you explain this last two line

Leave a Reply