Shares#1402
A group of people and the ACM Chief Judge share equally a number of shares (not necessarily all of them). Let be the number of shares acquired by each person ( must be an integer). The problem is to determine the maximum possible value of .
Write a program that reads pairs of integer numbers from an input text file.
Each pair contains 1 \leq N \leq 10000 and 1 \leq S \leq 10^9, in that order. The input data are separated by whitespace, are correct, and terminate at the end of the file.
For each pair of numbers, the program computes the maximum value of and prints that value to the standard output, starting at the beginning of a line, as shown in the example below.
Esempio 1