Prosjek
골드 III의견: 0
Slavko decided to challenge Mirko! He gave him a real number \(P\) and a bag full of pieces of paper with exactly one number \(1\)–\(5\) written on each paper. There is an unlimited quantity of each type of paper.
Mirko's task is to pick the minimum number of papers in a way that the average of the numbers written on them equals exactly \(P\).
The first and only line of input contains a real number \(P\). \(P\) will have between \(1\) and \(9\) decimal places, inclusive (\(1 \le P \le 5\)).
First and only line of output should contain five nonnegative intege\(rs - nu\)mbers of ones, twos, threes,
fours and fives used, respectively. If there are multiple solutions, output any one of them.
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Test 1 | 10점 | None |
Test 2 | 9점 | None |
Test 3 | 9점 | None |
Test 4 | 9점 | None |
Test 5 | 9점 | None |
Test 6 | 9점 | None |
Test 7 | 9점 | None |
Test 8 | 9점 | None |
Test 9 | 9점 | None |
Test 10 | 9점 | None |
Test 11 | 9점 | None |
5.00 0 0 0 14.50 0 0 1 13.200 0 4 1 0평가 및 의견
Prosjek
Log in to rate problems.
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Prosjek