zoukankan      html  css  js  c++  java
  • C. The Football Season (枚举) ( Codeforces Round #592 (Div. 2) )

    The football season has just ended in Berland. According to the rules of Berland football, each match is played between two teams. The result of each match is either a draw, or a victory of one of the playing teams. If a team wins the match, it gets ww points, and the opposing team gets 00 points. If the game results in a draw, both teams get dd points.

    The manager of the Berland capital team wants to summarize the results of the season, but, unfortunately, all information about the results of each match is lost. The manager only knows that the team has played nn games and got pp points for them.

    You have to determine three integers xx, yy and zz — the number of wins, draws and loses of the team. If there are multiple answers, print any of them. If there is no suitable triple (x,y,z)(x,y,z), report about it.

    Input

    The first line contains four integers nn, pp, ww and d(1n1012,0p1017,1d<w105)(1≤n≤1012,0≤p≤1017,1≤d<w≤105) — the number of games, the number of points the team got, the number of points awarded for winning a match, and the number of points awarded for a draw, respectively. Note that w>dw>d, so the number of points awarded for winning is strictly greater than the number of points awarded for draw.

    Output

    If there is no answer, print 1−1.

    Otherwise print three non-negative integers xx, yy and zz — the number of wins, draws and losses of the team. If there are multiple possible triples (x,y,z)(x,y,z), print any of them. The numbers should meet the following conditions:

    • xw+yd=px⋅w+y⋅d=p,
    • x+y+z=nx+y+z=n.
    Examples
    input
    Copy
    30 60 3 1
    
    output
    Copy
    17 9 4
    
    input
    Copy
    10 51 5 4
    
    output
    Copy
    -1
    
    input
    Copy
    20 0 15 5
    
    output
    Copy
    0 0 20
    
    Note

    One of the possible answers in the first example — 1717 wins, 99 draws and 44 losses. Then the team got 173+91=6017⋅3+9⋅1=60 points in 17+9+4=3017+9+4=30 games.

    In the second example the maximum possible score is 105=5010⋅5=50. Since p=51p=51, there is no answer.

    In the third example the team got 00 points, so all 2020 games were lost.

     

     

    #include <bits/stdc++.h>
    using namespace std;
    #define ll long long
    #define TLE     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ll m,n,l,r;
    int main()
    {
        TLE;
        while(cin>>n>>m>>l>>r)
        {
            for(int i=0;i<min(n,l);i++)
            {
                if(m-i*r<0) break;
                if( !((m-i*r)%l) )
                {
                    if(i+((m-i*r)/l) <=n )
                    {
                        cout<<(m-i*r)/l<<" "<<i<<" "<<n-i-(m-i*r)/l<<endl;
                        return 0;
                    }
                }
            }
            cout<<-1<<endl;
        }
        return 0;
    }
    所遇皆星河
  • 相关阅读:
    软件开发项目失败原因分析
    浅析ASP.NET三层架构(原创)
    ASP.NET中常用的26个优化性能方法
    软件设计原则
    垃圾回收(GC,Garbage Collection)机制
    值类型和引用类型的区别
    在OpenWrt中使用socket通信
    在windows下通过samba的共享编辑过的openwrt的样式文件无法访问的解决办法
    在OpenWrt中保存数据到config
    将openwrt的系统同步时间的显示修改为19700312 14:20的格式
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11688031.html
Copyright © 2011-2022 走看看