Description: Problem Description: numbered 1,2, ... ..., n n-clockwise around a circle of individuals, each holder of a password (positive integer) the beginning of either an integer number as the upper limit at m, from the first clockwise from 1 person to start off the beginning of the order, appearance, stopped at a few m. Those who reported m out of his seat a new password m value, in a clockwise direction from the next person to start off again from the 1 like that, know that all out of date. For example: m for the initial 20, n = 7,7 personal password are: 3,1,7,2,4,8,4 out the order for the 6,1,4,7,2,3, 5
To Search:
File list (Check if you may need any files):
joseph.cpp
Download