zoukankan      html  css  js  c++  java
  • CodeForces

    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 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 x1, x2, ..., xn. Number xi 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 ≤ 105; 1 ≤ a, b ≤ 109). The second line of input contains n space-separated integers x1, x2, ..., xn (1 ≤ xi ≤ 109).

    Output

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

    Example

    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
    0 
    
    
     1 #include<iostream>
     2 #include<stdio.h>
     3 using namespace std;
     4 long long int num[100010];
     5 int main()
     6 {
     7     int n;
     8     while(cin>>n)
     9     {
    10         long long int a,b;
    11         scanf("%lld%lld",&a,&b);
    12         for(int i=0;i<n;i++)
    13             cin>>num[i];
    14         long long int ans;
    15         for(int i=0;i<n;i++)
    16         {
    17             ans=((num[i]*a)%b)/a;
    18             printf("%lld ",ans);
    19         }
    20         cout<<endl;
    21     }
    22     return 0;
    23 }
    
    
    
    
    
    
    
  • 相关阅读:
    好的博客
    left join 后边的on条件 小记
    ElasticSearch构建订单服务的博客
    nacos mysql8.0修改
    maven配置
    idea常用配置
    http状态码
    Web Application:Exploded和Web Application:Archive
    将一个简单远程调用的方式例子改为异步调用 -- 2
    将一个简单远程调用的方式例子改为异步调用
  • 原文地址:https://www.cnblogs.com/ISGuXing/p/7236475.html
Copyright © 2011-2022 走看看