Discussion @ 1024. Permutations @ Timus Online Judge

Timus Online Judge

Online Judge	Problems	Authors	Online contests
About Online Judge Frequently asked questions Site news Webboard Links	Problem set Submit solution Judge status Guide	Register Update your info Authors ranklist	Current contest Scheduled contests Past contests Rules

Discussion of Problem 1024. Permutations

Show all messages Hide all messages

There is a simple O(n) algorithm that does not use mathematical GCD algorithm Nic Roets 24 Sep 2011 22:18

It does not use long long. It does not use any mathematical algorithm like GCD.
See if you can find it.

Re: There is a simple O(n) algorithm that does not use mathematical GCD algorithm Aman 15 Sep 2016 05:17

We can find permutaion using following formulae
nPr = n!/(n-r)!
http://www.techcrashcourse.com/2014/10/c-program-find-npr-and-ncr.html
http://www.techcrashcourse.com/