GO Solution For UVa 10015 - Joseph's Cousin. In this post we will see how we can solve this challenge in GoLang for UVa Online Judge.

Problem Description

The Josephs problem is notoriously known. For those who are not familiar with the problem, among n people numbered 1, 2, . . . , n, standing in circle every mth is going to be executed and only the life of the last remaining person will be saved. Joseph was smart enough to choose the position of the


You can find the full details of the problem Joseph's Cousin at UVa Online Judge

Sample Input


Sample Output


Solution: Please check the main.go snippet for the solution.

Solution originally posted at: Github by @codingsince1985