← 返回题目

题库练习 [COCI-2010_2011-contest4]#6 PROSJEK

← 上一题下一题 →

A1208 | $[COCI-2010_2011-contest4]#6 PROSJEK$

来源COCI

时间限制1s

内存限制128MB

通过 / 提交0/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.

输入格式

First and only line of input contains real number P. P will have between 1 and 9 decimal places, inclusive (1 \leq P \leq 5).

输出格式

First and only line of output should contain five nonnegative integers - numbers of ones, twos, threes, fours and fives used, respectively. If there are multiple solutions, output any one of them.

输入输出样例

输入 #1

5.0

输出 #1

0 0 0 0 1

输入 #2

4.5

输出 #2

0 0 0 1 1

输入 #3

3.20

输出 #3

0 0 4 1 0

C++ 编辑器

输入

输出