I have forgotten

• https://me.yahoo.com
COST (GBP)
0.42
0.00
0

# Derangements List

Returns the number of derangements of 0 through \e n objects.
Controller: CodeCogs

C++

## Derangements List

 std::vectorderangements_list( int n )
A derangement of n objects is a permutation with no fixed points. If we symbolize the permutation by , then for a derangment,  is never equal to .

## Example:

#include <codecogs/maths/combinatorics/sequences/derangements_list.h>
#include <iostream>
int main() {
std::vector<int> result = Maths::Combinatorics::Sequences::derangements_list(10);
std::cout << "For 0 through 10 objects, the number of derangements are:";
std::cout << std::endl;
for (int i = 0; i < result.size(); i++)
std::cout << result[i] << "  ";
std::cout << std::endl;
return 0;
}

## Output:

For 0 through 10 objects, the number of derangements are:
1  0  1  2  9  44  265  1854  14833  133496  1334961

## References:

SUBSET, a C++ library of combinatorial routines, http://www.csit.fsu.edu/~burkardt/cpp_src/subset/subset.html

### Returns

the number of derangements of 0 through n objects

### Authors

Lucian Bentea (August 2005)
##### Source Code

Source code is available when you agree to a GP Licence or buy a Commercial Licence.

Not a member, then Register with CodeCogs. Already a Member, then Login.