UVa 440-eeny Meeny Moo

Title: Joseph Ring, there is a ring first delete the first element, and then every m number of deleted, ask the last left is the number 2nd element,

The minimum number of M to be gone.

Analysis: Number theory, simulation. The element number is 0~n-1, and the last numbered recurrence relationship is left: f (n,m) = (f (n-1,m) +m)%n.

Therefore, the problem is converted into n-1 element, the first element of the Joseph Ring, in order to enumerate m to find the first one can be established.

Description: ╮(╯▽╰)╭.

#include <iostream> #include <cstdlib> #include <cstdio>using namespace std;int deal (int n, int m) {int S = 0;for (int i = 2; i < n; + + i) s = (s+m)%i;return s;} int main () {int n;while (CIN >> n && N) {for (int i = 1;; + + i) {if (!deal (n, i)) {cout << i << E ndl;break;    }}} return 0;}

UVa 440-eeny Meeny Moo