CF71B.Progress Bar

普及-

通过率:0%

时间限制:1.00s

内存限制:256MB

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 n squares, located in line. To add clarity, let's number them with positive integers from 1 to n from the left to the right. Each square has saturation (a__i for the i-th square), which is measured by an integer from 0 to k. When the bar for some i (1 ≤ i ≤ n) is displayed, squares 1, 2, ... , i - 1 has the saturation k, squares i + 1, i + 2, ... , n has the saturation 0, and the saturation of the square i can have any value from 0 to k.

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

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

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

For the given n, k, t determine the measures of saturation for all the squares a__i of the progress bar.

进度条是一种图形界面元素,用于显示某项进程在完成前的当前进度。我们来看一下这种进度条的一种表现形式。

进度条由排成一行的 nn 个方块组成。为便于描述,我们从左至右用正整数 11 到 nn 对这些方块依次编号。每个方块具有一个饱和度(第 ii 个方块的饱和度记为 aia_i),其取值为 00 到 kk 之间的整数。当进度条显示某个位置 ii(其中 1≤i≤n1 \le i \le n)时,方块 1,2,…,i−11, 2, \dots, i-1 的饱和度均为 kk,方块 i+1,i+2,…,ni+1, i+2, \dots, n 的饱和度均为 00,而第 ii 个方块的饱和度 aia_i 可取 00 到 kk 之间的任意整数值。

因此,进度条最前面的若干方块饱和度恒为 kk,最后面的若干方块饱和度恒为 00,且至多只有一个方块的饱和度既不为 00 也不为 kk。

进程的完成程度以百分比表示。设该进程已完成 t%t\%,则满足如下不等式:

此类进度条的一个示例见下图。

给定 nn、kk、tt,请确定进度条中所有方块的饱和度 aia_i。

输入格式

We are given 3 space-separated integers n, k, t (1 ≤ n, k ≤ 100, 0 ≤ t ≤ 100).

我们给出三个用空格分隔的整数 nn、kk、tt(其中 1≤n,k≤1001 \leq n, k \leq 100,0≤t≤1000 \leq t \leq 100)。

输出格式

Print n numbers. The i-th of them should be equal to a__i.

输出 n 个数。其中第 i 个数应等于 a__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

输入解题思路,AI测评打分。不知道怎么写?

首页