CF71B.Progress Bar

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

A progress bar is an element of graphical interface that displays the progress of a process for this very moment before it is completed. Let's take a look at the following form of such a bar.

A bar is represented as nn squares, located in line. To add clarity, let's number them with positive integers from 11 to nn from the left to the right. Each square has saturation ( aia_{i} for the ii -th square), which is measured by an integer from 00 to kk . When the bar for some ii ( 1<=i<=n1<=i<=n ) is displayed, squares 1,2,... ,i11,2,...\ ,i-1 has the saturation kk , squares i+1,i+2,... ,ni+1,i+2,...\ ,n has the saturation 00 , and the saturation of the square ii can have any value from 00 to kk .

So some first squares of the progress bar always have the saturation kk . Some last squares always have the saturation 00 . And there is no more than one square that has the saturation different from 00 and kk .

The degree of the process's completion is measured in percents. Let the process be tt % completed. Then the following inequation is fulfilled:

An example of such a bar can be seen on the picture.

For the given nn , kk , tt determine the measures of saturation for all the squares aia_{i} of the progress bar.

输入格式

We are given 3 space-separated integers nn , kk , tt ( 1<=n,k<=1001<=n,k<=100 , 0<=t<=1000<=t<=100 ).

输出格式

Print nn numbers. The ii -th of them should be equal to aia_{i} .

输入输出样例

  • 输入#1

    10 10 54
    

    输出#1

    10 10 10 10 10 4 0 0 0 0 
  • 输入#2

    11 13 37
    

    输出#2

    13 13 13 13 0 0 0 0 0 0 0 
首页