P29408 [洛谷] [COCI2010-2011#4] PROSJEK
普及+
题目描述

Problem Description

You have five types of numbers: $1, 2, 3, 4, 5$.

You need to select as few numbers as possible such that the average of these numbers is $P$.

Note that there are unlimited quantities of each of these five numbers.

Input Format

A single line containing a real number $P$.

$P$ is a decimal number with $1$ to $9$ digits.

Output Format

Output a single line with five numbers, representing the quantities of $1, 2, 3, 4, 5$ used.

If there are multiple optimal solutions, output any one of them. This problem uses a special judge.

Sample Input and Output

Sample Input #1

5.0

Sample Output #1

0 0 0 0 1

Sample Input #2

4.5

Sample Output #2

0 0 0 1 1

Sample Input #3

3.20

Sample Output #3

0 0 4 1 0

Notes

Data Size and Constraints

For $100\%$ of the data, it is guaranteed that $1 \le P \le 5$.

Notes

This problem is translated from COCI2010-2011 CONTEST #4 T4 PROSJEK.

输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
5.0
样例输出
0 0 0 0 1