Common algorithms (C #): Monkey election

Monkey King election problem: a bunch of monkeys have numbers, numbers are 1, 2, 3... m, this group of monkeys (m) sit around in the order of 1 to m,

The number starts from 1st, and the number of monkeys to the nth is about to leave this circle. In this way, the monkey goes down until there is only the last monkey in the circle. Then the monkey becomes the king.

Using system;
Using system. Collections. Generic;
Using system. text;

Namespace exmonkey
{
Class monkey
{
Public int King (int m, int N)
{
// The total number is m, and the number to N is excluded.
Int K = 0;
For (INT I = 2; I <= m; I ++)
K = (k + n) % I;
Return ++ K;
}
Static void main (string [] ARGs)
{
Monkey M = new monkey ();
Console. writeline ("Number" + M. King () + "Monkey King. ");
}
}
}