CF93B.End of Exams

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Students love to celebrate their holidays. Especially if the holiday is the day of the end of exams!

Despite the fact that Igor K., unlike his groupmates, failed to pass a programming test, he decided to invite them to go to a cafe so that each of them could drink a bottle of... fresh cow milk. Having entered the cafe, the mm friends found nn different kinds of milk on the menu, that's why they ordered nn bottles — one bottle of each kind. We know that the volume of milk in each bottle equals ww .

When the bottles were brought in, they decided to pour all the milk evenly among the mm cups, so that each got a cup. As a punishment for not passing the test Igor was appointed the person to pour the milk. He protested that he was afraid to mix something up and suggested to distribute the drink so that the milk from each bottle was in no more than two different cups. His friends agreed but they suddenly faced the following problem — and what is actually the way to do it?

Help them and write the program that will help to distribute the milk among the cups and drink it as quickly as possible!

Note that due to Igor K.'s perfectly accurate eye and unswerving hands, he can pour any fractional amount of milk from any bottle to any cup.

输入格式

The only input data file contains three integers nn , ww and mm ( 1<=n<=501<=n<=50 , 100<=w<=1000100<=w<=1000 , 2<=m<=502<=m<=50 ), where nn stands for the number of ordered bottles, ww stands for the volume of each of them and mm stands for the number of friends in the company.

输出格式

Print on the first line "YES" if it is possible to pour the milk so that the milk from each bottle was in no more than two different cups. If there's no solution, print "NO".

If there is a solution, then print mm more lines, where the ii -th of them describes the content of the ii -th student's cup. The line should consist of one or more pairs that would look like " bb vv ". Each such pair means that vv ( v>0 ) units of milk were poured into the ii -th cup from bottle bb ( 1<=b<=n1<=b<=n ). All numbers bb on each line should be different.

If there are several variants to solve the problem, print any of them. Print the real numbers with no less than 6 digits after the decimal point.

输入输出样例

  • 输入#1

    2 500 3
    

    输出#1

    YES
    1 333.333333
    2 333.333333
    2 166.666667 1 166.666667
    
  • 输入#2

    4 100 5
    

    输出#2

    YES
    3 20.000000 4 60.000000
    1 80.000000
    4 40.000000 2 40.000000
    3 80.000000
    2 60.000000 1 20.000000
    
  • 输入#3

    4 100 7
    

    输出#3

    NO
    
  • 输入#4

    5 500 2
    

    输出#4

    YES
    4 250.000000 5 500.000000 2 500.000000
    3 500.000000 1 500.000000 4 250.000000
    
首页