using System;

​

using System.Collections.Generic;

​

public class Program

{

public static void Main()

{

var tupleList = new List<Tuple<int, int>>();

int m = 1;

int n = 5;

int numCycles = 12;

tupleList.Add(new Tuple<int, int>(m, n));

for(int i = 1; i < numCycles;i++)

{

//Step 1

m = mod(m+2*n, 55);

n = mod(3*n, 55);

tupleList.Add(new Tuple<int, int>(m, n));

​

//Step 2

m = mod(m+2*n, 55);

tupleList.Add(new Tuple<int, int>(m, n));

​

//Step 3

m = mod(m+2*n, 55);

n = modDivision(-n, 4, 55);

tupleList.Add(new Tuple<int, int>(m, n));

​

//Step 4

m = mod(m+2*n, 55);

tupleList.Add(new Tuple<int, int>(m, n));

​

//Step 5

m = mod(m+2*n, 55);

tupleList.Add(new Tuple<int, int>(m, n));

}

printOutput(tupleList);

        check(tupleList);

}

​

private static void printOutput(List<Tuple<int, int>> output)

{

for(int i = 0; i < output.Count; i++)

{

Console.WriteLine("(" + output[i].Item1 + ", " + output[i].Item2 + ")");

if((i+1)%5 == 0)

Console.WriteLine("----------------");

}

}

​

private static int mod(int x, int m) 

{

    int r = ((x-1)%m)+1;

    var v =  r<0 ? r+m : r;

return v;

}

​

private static int modDivision(int a, int b, int m) //a in numerator, b is divisor, m is modulus

{

if(a%b == 0)

return mod(a/b, m);

return modDivision(a+m,b,m);

}

​

private static void check(List<Tuple<int, int>> output)

{

for(int i = 0; i < 50; i++)

{

var complete = false;

for(int j = 0; j < output.Count; j++)

{

if(output[j].Item1 == i || output[j].Item2 == i)

complete = true;

}

if(!complete)

Console.WriteLine("NOT COMPLETE. " + i + " Missing");

}

Console.WriteLine("Done checking");

}

}