306729: CF1244C. The Football Season

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

The Football Season

题意翻译

       Berland capital team比了n场比赛,总得分为p。已知胜一场得w分,平局d分,败了0分。        答案表示为(x,y,z):表示胜了x场,平局y场,败了z场。使得: - x * w + y * d=p - x+y+z=n 若无方案则输出-1;若有多重方案,输出任意一个即可。

题目描述

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.

输入输出格式

输入格式


The first line contains four integers $ n $ , $ p $ , $ w $ and $ d $ $ (1 \le n \le 10^{12}, 0 \le p \le 10^{17}, 1 \le d < w \le 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.

输出格式


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 \cdot w + y \cdot d = p $ , - $ x + y + z = n $ .

输入输出样例

输入样例 #1

30 60 3 1

输出样例 #1

17 9 4

输入样例 #2

10 51 5 4

输出样例 #2

-1

输入样例 #3

20 0 15 5

输出样例 #3

0 0 20

说明

One of the possible answers in the first example — $ 17 $ wins, $ 9 $ draws and $ 4 $ losses. Then the team got $ 17 \cdot 3 + 9 \cdot 1 = 60 $ points in $ 17 + 9 + 4 = 30 $ games. In the second example the maximum possible score is $ 10 \cdot 5 = 50 $ . Since $ p = 51 $ , there is no answer. In the third example the team got $ 0 $ points, so all $ 20 $ games were lost.

Input

题意翻译

&#160;&#160;&#160;&#160;&#160;&#160;&#160;Berland capital team比了n场比赛,总得分为p。已知胜一场得w分,平局d分,败了0分。 &#160;&#160;&#160;&#160;&#160;&#160;&#160;答案表示为(x,y,z):表示胜了x场,平局y场,败了z场。使得: - x * w + y * d=p - x+y+z=n 若无方案则输出-1;若有多重方案,输出任意一个即可。

加入题单

算法标签: