**Save the Prisoner!**

### Problem Statement :

A jail has a number of prisoners and a number of treats to pass out to them. Their jailer decides the fairest way to divide the treats is to seat the prisoners around a circular table in sequentially numbered chairs. A chair number will be drawn from a hat. Beginning with the prisoner in that chair, one candy will be handed to each prisoner sequentially around the table until all have been distributed. The jailer is playing a little joke, though. The last piece of candy looks like all the others, but it tastes awful. Determine the chair number occupied by the prisoner who will receive that candy. Example n = 4 m = 6 s = 2 There are 4 prisoners, 6 pieces of candy and distribution starts at chair 2. The prisoners arrange themselves in seats numbered 1 to 4. Prisoners receive candy at positions 2, 3, 4, 1, 2, 3 . The prisoner to be warned sits in chair number 3. Function Description Complete the saveThePrisoner function in the editor below. It should return an integer representing the chair number of the prisoner to warn. saveThePrisoner has the following parameter(s): int n: the number of prisoners int m: the number of sweets int s: the chair number to begin passing out sweets from Returns int: the chair number of the prisoner to warn Input Format The first line contains an integer, t, the number of test cases. The next t lines each contain 3 space-separated integers: n : the number of prisoners m : the number of sweets s : the chair number to start passing out treats at Constraints 1 <= t <= 100 1 <= n,m <= 10^9 1 <= s <= n

### Solution :

` ````
Solution in C :
python 3 :
for _ in range(int(input().strip())):
n,m,s = map(int, input().strip().split(" "))
print(((s-2+m)%n)+1)
Java :
import java.io.*;
import java.util.*;
public class Solution {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int t = scanner.nextInt();
for(int i=0;i<t;i++)
{
int n = scanner.nextInt();
int m = scanner.nextInt();
int s = scanner.nextInt();
int result = (m + s - 1) % n;
if(result == 0)
result = n;
System.out.println(result);
}
}
}
C++ :
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int t; cin >> t;
while(t--) {
int n,m,s; cin >> n >> m >> s;
--s; --m;
s += m;
s %= n;
s++;
cout << s << endl;
}
return 0;
}
C :
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
int main() {
int t,n,m,s,i,p;
scanf("%d",&t);
for(int i=0;i<t;i++)
{
scanf("%d%d%d",&n,&m,&s);
p=(s+m-1)%n;
if(p==0)
p=n;
printf("%d\n",p);
}
return 0;
}
```

## View More Similar Problems

## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →## Self Balancing Tree

An AVL tree (Georgy Adelson-Velsky and Landis' tree, named after the inventors) is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. We define balance factor for each node as : balanceFactor = height(left subtree) - height(righ

View Solution →## Array and simple queries

Given two numbers N and M. N indicates the number of elements in the array A[](1-indexed) and M indicates number of queries. You need to perform two types of queries on the array A[] . You are given queries. Queries can be of two types, type 1 and type 2. Type 1 queries are represented as 1 i j : Modify the given array by removing elements from i to j and adding them to the front. Ty

View Solution →## Median Updates

The median M of numbers is defined as the middle number after sorting them in order if M is odd. Or it is the average of the middle two numbers if M is even. You start with an empty number list. Then, you can add numbers to the list, or remove existing numbers from it. After each add or remove operation, output the median. Input: The first line is an integer, N , that indicates the number o

View Solution →## Maximum Element

You have an empty sequence, and you will be given N queries. Each query is one of these three types: 1 x -Push the element x into the stack. 2 -Delete the element present at the top of the stack. 3 -Print the maximum element in the stack. Input Format The first line of input contains an integer, N . The next N lines each contain an above mentioned query. (It is guaranteed that each

View Solution →