300370: CF71B. Progress Bar

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Progress Bar

题意翻译

输入三个数 $n,k,t$,你需要构造一个长度为 $n$ 的整数序列,满足: - 存在一个位置 $i\ (1\le i \le n)$,使得所有下标小于 $i$ 的位置的数都为 $k$,下标大于 $i$ 的位置的数都为 $0$。位置 $i$ 上可以是 $0 \sim k$ 的任意数字。 - $\frac {\sum_{i = 1}^{n} a_i}{n\cdot k}\le \frac{t}{100}\le \frac {(\sum_{i = 1}^{n} a_i) +1}{n\cdot k}$ 输出你构造的序列。 By [Binary_1110011_](https://www.luogu.com.cn/user/241485)

题目描述

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: ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF71B/4e9efb78cef50edf8afa424b4903c5e6bf3cc77f.png)An example of such a bar can be seen on the picture. ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF71B/151c399de3b500275514615e73a7da37fbaf060b.png)For the given $ n $ , $ k $ , $ t $ determine the measures of saturation for all the squares $ a_{i} $ of the progress bar.

输入输出格式

输入格式


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

输出格式


Print $ n $ numbers. The $ i $ -th of them should be equal to $ 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 

Input

题意翻译

输入三个数 $n,k,t$,你需要构造一个长度为 $n$ 的整数序列,满足: - 存在一个位置 $i\ (1\le i \le n)$,使得所有下标小于 $i$ 的位置的数都为 $k$,下标大于 $i$ 的位置的数都为 $0$。位置 $i$ 上可以是 $0 \sim k$ 的任意数字。 - $\frac {\sum_{i = 1}^{n} a_i}{n\cdot k}\le \frac{t}{100}\le \frac {(\sum_{i = 1}^{n} a_i) +1}{n\cdot k}$ 输出你构造的序列。 By [Binary_1110011_](https://www.luogu.com.cn/user/241485)

加入题单

算法标签: