[Codeforces 1244C] The Football Season（扩展欧几里得）_the football season ( )结束 in may-CSDN博客

本文链接：https://blog.csdn.net/qq_33831360/article/details/102537512

该博客介绍了如何运用扩展欧几里得算法解决一个数学问题，即在已知球队比赛总场数、总得分、胜利得分和平局得分的情况下，找出胜利场数、平局场数和失败场数。通过调整胜利和平局的数量，确保总得分和场数条件满足。当无法找到合适解时，输出-1。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

xw+yd=p,x+y+z=n求x,y,z

首先尽量让他赢p/w次，剩下m=p%w分，剩下的分给平，m/d个平，为什么不先分给平呢？w比较大，所以这样x+y比较小，不容易让z<0。

可是m%d不一定是0，这时候要调整，+-w，+-d能怎么调呢？就要用到扩展欧几里得算法了，aw+bd=gcd(w,d)，求出a,b,gcd.如果m%d%gcd不是0，那么无解，+-w，d调整的最小单位就是gcd。否则加上a*（m%d/gcd）个w和b*（m%d/gcd）个d，使得和为p。

还要注意，增加b/gcd个w同时减少w/gcd个d和是不变的，在胜利次数<0时可以这么调整。

#include <iostream>
#include <queue>
#include <cstring>
#include <algorithm>
 
using namespace std;

typedef long long LL;

void exgcd(LL a, LL b, LL& x, LL& y, LL& c) {
    if(!b) {y = 0; x = 1; c = a; return;}
    exgcd(b,a%b,y,x,c); y -= a/b*x;
}
  
int main() {
	LL n,p,w,d;
	cin >> n >> p >> w >> d;
	// wx+dy = gcd w,d
	LL x,y,c;
	exgcd(w,d,x,y,c);
	LL v1 = p/w,v2 = 0,m = p%w;
	v2 = m/d; m = m%d;
//cout << x << " " <<y<<"\n";
	if (m%c == 0) {
		LL t = m/c;
		v1 += t*x;
		v2 += t*y;
		LL t1 = w/c,t2 = d/c;
		// +t1 -t2
		while (v1 < 0) {
			v1 += t2;
			v2 -= t1;
			if (v2 < 0) {
				puts("-1");
				return 0;
			}
		}
		while (v2 < 0) {
			v1 -= t2;
			v2 += t1;
			if (v1 < 0) {
				puts("-1");
				return 0;
			}
		}
		while (n-v1-v2 < 0) {
			if (t1 > t2) {
				v1 += t2;
			    v2 -= t1;
			    if (v2 < 0) {
				  puts("-1");
				  return 0;
			    }
			} else if (t1 < t2) {
				v1 -= t2;
			    v2 += t1;
			    if (v1 < 0) {
			 	  puts("-1");
				  return 0;
			    }
			} else {
				puts("-1");
				return 0;
			}
		}
		if (v1>=0 && v2>=0 && n-v1-v2>=0) {
			cout << v1 << " " << v2 << " " << n-v1-v2 << "\n";
			return 0;
		}
	}
	puts("-1");
    return 0;
}

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 dd (1≤n≤1012,0≤p≤1017,1≤d<w≤105)(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:

x⋅w+y⋅d=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 17⋅3+9⋅1=6017⋅3+9⋅1=60 points in 17+9+4=3017+9+4=30 games.

In the second example the maximum possible score is 10⋅5=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.