We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Implementation
  4. Save the Prisoner!
  5. Discussions

Save the Prisoner!

  • alban_tyrex
     + 0 comments

    Here solution in c++, you can watch the explanation here : https://youtu.be/xoV2P0Pv9Fg

    Solution 1 : 

    int saveThePrisoner(int n, int m, int s) {
    int c = (m % n) + s - 1 ;
    if ( c > n) c -= n;
    if ( c == 0) return n;
    return c;
}

    Solution 2 : 

    int saveThePrisoner(int n, int m, int s) {
    return (m - 1  + s - 1 ) % n + 1;
}