https://www.acmicpc.net/problem/3733
3733번: Shares
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
www.acmicpc.net
|
1
2
3
4
5
6
|
while 1:
try:
n, s=map(int,input().split())
print(s//(n+1))
except EOFError:
break
|
cs |
n+1명이 s를 나눠가짐
N+1 persons share S
반응형
'python-algorithm' 카테고리의 다른 글
| 백준 8760 Schronisko (0) | 2022.11.08 |
|---|---|
| 백준 25304 영수증 (0) | 2022.11.07 |
| 백준 1855 암호 (0) | 2022.11.03 |
| 백준 24937 SciComLove (2022) (0) | 2022.11.02 |
| 백준 16916 부분 문자열 (0) | 2022.11.01 |
댓글