백준: 3773번 Shares (Python3) 문제 A group of N persons and the ACM Chief Judge share equally a number of S shares (not necessary all of them). Let x be the number of shares aquired by each person (x must be an integer).
The problem is to compute the maximum value of x. Write a program that reads pairs of integer numbers from an input text file.
Each pair contains the values of 1 ≤ N ≤ 10000 and 1 ≤ .....
원문 링크 : 백준: 3773번 Shares (Python3)
