# Hey, this is my blog

It is somewhat abandoned.

## Project Euler

A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are:

012   021   102   120   201   210

What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?

``````[TestClass]
public class Problem24
{
[TestMethod]
{
var tokens = new string[] { “0”, “1”, “2”, “3”, “4”, “5”, “6”, “7”, “8”, “9” };
var results = Permutations.Of(tokens).WithLength(10);
results
.Skip(999999)
.Take(1)
.ToList()
.ForEach(x => Console.WriteLine(x));
}
}

public class Permutations
{
public static Permutations Of(IEnumerable<string> tokens)
{
return new Permutations { tokens = tokens.ToList() };
}
private Permutations() { }

public IList<string> tokens { get; private set; }

public IEnumerable<String> WithLength(int length)
{
if (length < 1 || length > tokens.Count())
{
return null;
}
if (length == 1)
{