codeforces Mashmokh and Tokens

最新推荐文章于 2018-05-03 19:35:31 发布

zthgreat

最新推荐文章于 2018-05-03 19:35:31 发布

阅读量653

点赞数

分类专栏：【基础题】

本文链接：https://blog.csdn.net/u014634338/article/details/38622727

版权

【基础题】专栏收录该内容

175 篇文章 1 订阅

订阅专栏

Mashmokh and Tokens

Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u

Submit Status

Description

Bimokh is Mashmokh's boss. For the following n days he decided to pay to his workers in a new way. At the beginning of each day he will give each worker a certain amount of tokens. Then at the end of each day each worker can give some of his tokens back to get a certain amount of money. The worker can save the rest of tokens but he can't use it in any other day to get more money. If a worker gives back w tokens then he'll get $\text{[math]}$ dollars.

Mashmokh likes the tokens however he likes money more. That's why he wants to save as many tokens as possible so that the amount of money he gets is maximal possible each day. He has n numbers x₁, x₂, ..., x_n. Number x_i is the number of tokens given to each worker on the i-th day. Help him calculate for each of n days the number of tokens he can save.

Input

The first line of input contains three space-separated integers n, a, b (1 ≤ n ≤ 10⁵; 1 ≤ a, b ≤ 10⁹). The second line of input containsn space-separated integers x₁, x₂, ..., x_n (1 ≤ x_i ≤ 10⁹).

Output

Output n space-separated integers. The i-th of them is the number of tokens Mashmokh can save on the i-th day.

Sample Input

Input

5 1 4
12 6 11 9 1

Output

0 2 3 1 1

Input

3 1 2
1 2 3

Output

1 0 1

Input

1 1 1
1

Output

题意：老板一天发x张代币券，员工能用它来换大洋，用w张代币券可换[a*w/b](下取整)块大洋，代币券只能当天适用，求换最多大洋时最多能留多少代币券.(a个员工)。

#include <iostream>
using namespace std;
int main()
{
    long long n,a,b,x;
    cin>>n>>a>>b;
    for (long long i=0; i<n; i++)
    {
        cin>>x;
        if(i==0)
        {
            cout<<x*a%b/a;
    
        }
        else
        {
            cout<<" "<<x*a%b/a;
        }
    }
    cout<<endl;
  
    return 0;
}