The Football Season CodeForces - 1244C 扩展欧几里得

问题：

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 w points, and the opposing team gets 0 points. If the game results in a draw, both teams get d 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 n games and got p points for them.

You have to determine three integers x, y and z — 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), report about it.

Input
The first line contains four integers n, p, w and d (1≤n≤10^12,0≤p≤10^17,1≤d<w≤10^5) — 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>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.

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

x⋅w+y⋅d=p,
x+y+z=n.
Examples

Input
30 60 3 1
Output
17 9 4

Input
10 51 5 4
Output
-1

Input
20 0 15 5
Output
0 0 20
Note
One of the possible answers in the first example — 17 wins, 9 draws and 4 losses. Then the team got 17⋅3+9⋅1=60 points in 17+9+4=30 games.

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

In the third example the team got 0 points, so all 20 games were lost.

题意：根据两个公式就可以得到x，y，z；

思路：由第一个公式x*w+y*d=p，用扩展欧几里得求出gcd（w，d）；和x，y的通解，由于y的值可能爆long long 所以需要处理一下，首先我们要知道的是，x的周期为d / gcd,y的周期为w / gcd;  y应该等于y*（p%gcd）但是y会超long long 所以令y*（p%gcd）对y的周期求余；即可求出答案。

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
ll gcd(ll a,ll b,ll &x,ll &y)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    ll r=gcd(b,a%b,x,y);
    ll temp=y;
    y=x-a/b*y;
    x=temp;
    return r;
}
//ax+by=gcd(a,b);x的周期为b/gcd,y的周期为a/gcd;
int main()
{
    ll n,p,w,d,x,y;
    scanf("%lld%lld%lld%lld",&n,&p,&w,&d);
    ll k=gcd(w,d,x,y);
    if(p%k!=0)
        printf("-1\n");
    else
    {
        ll h=w/k;
        y=(y%h*((p/k)%h)%h+h)%h;//因为w>d
        x=(p-y*d)/w;
        if(x>=0&&y>=0&&n-x-y>=0)
            printf("%lld %lld %lld\n",x,y,n-x-y);
        else
            printf("-1\n");
    }
}