Facto sum i dont know why i am getting 3 wrong test cases

#1

question
https://hack.codingblocks.com/contests/c/512/56

my code
https://ide.codingblocks.com/s/34858

#2

Actually the recursive method of finding factorial is very inefficient as its complexity is O(2^n)

#3

Hence recursive method of computing factorial will not work for numbers as big as 1000

#4

Try to find factorial by DP. That would make the program much more efficient…

#5

You can even compute and store factorial of 1000 numbers and store it in array of size 1000
And then just use element at index to compute answer

#6

Also use the formula
(a+b)%n = ( (a%n) + (b%n) ) % n

This would also make the program more efficient…

#7

why this is more efficient

#8

and how to use dynamic programming in this
please show me by editting my code

#9

i am still getting 4 wrong cases
my code;
https://ide.codingblocks.com/s/33091
please help asap

#10

please answer fast …