Java solves Joseph's Problem

Package pack; <br/> Import Java. text. *; <br/> Import Java. util. *; <br/> Import Java. text. decimalformat; <br/> Import Java. util. *; <br/> public class test {<br/>/** <br/> * @ Param ARGs <br/> */<br/> Public static void main (string ARGs []) {</P> <p> yuesef (50, 3); <br/>}< br/> Public static void yuesef (int n, int m) {<br/> arraylist <integer> List = new arraylist <integer> (); <br/> for (INT I = 0; I <n; I ++) {<br/> list. add (I); <br/>}< br/> while (list. size ()> 1) {<br/> int COUNT = 0; <br/> for (INT I = 0; I <list. size (); I ++) {<br/> If (count ++ % 3 = 0) {<br/> system. out. print ("" + list. get (I); <br/> list. set (I, 0); <br/>}< br/> for (INT I = 0; I <list. size (); I ++) {<br/> If (list. get (I) = 0) {<br/> list. remove (I); <br/>}< br/> for (int I: List) {<br/> system. out. println ("the last number is:" + I); <br/>}< br/>