an idea of the approach would be enough.. plz help..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
https://groups.google.com/d/msg/algogeeks/-/3H3O2K4KBBMJ.
To post to this group, send email
an idea of the approach would be enough.. plz help..
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
To unsubscribe from this group, send email to
http://www.spoj.pl/problems/FACVSPOW/
Hi guys,
I'm trying to solve this problem but I'm getting TLE.
Basically, the problem wants to know when n! (a ^ n) for a given (a =
1000 000).
My basic idea was to pre-calculate all values n! for n = e * 100
using log.
Then use binary search in the
