CodeForces-1244C-The Football Season-思维
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
30 60 3 1
17 9 4
10 51 5 4
-1
20 0 15 5
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.
1 #include<stdio.h> 2 #include<algorithm> 3 #include<string.h> 4 using namespace std; 5 typedef long long ll; 6 7 int main() 8 { 9 ll n,p,w,d; 10 scanf("%lld %lld %lld %lld",&n,&p,&w,&d); 11 if(n*w<p) 12 printf("-1\n"); 13 else if(n*w>=p) 14 { 15 if(n*w==p) 16 { 17 printf("%lld 0 0\n",n); 18 } 19 else if(n*w>p) 20 { 21 ll x=p/w; 22 ll q=p%w;; 23 if(q%d==0) 24 { 25 ll y=q/d; 26 if(x+y<=n) 27 printf("%lld %lld %lld",x,y,n-x-y); 28 else 29 printf("-1\n"); 30 } 31 else if(q%d!=0)//说明需要从赢的局数点里面分出一部分点进行补充然后给到平局d 32 { 33 //需要求(q+wi)%d==0 34 int flag=0; 35 for(int i=1; i<=min(x,d); i++) 36 { 37 if((q+w*i)%d==0) 38 { 39 ll xx=x-i; 40 ll yy=(q+w*i)/d; 41 ll zz=n-xx-(q+w*i)/d; 42 if(xx+yy+zz<=n) 43 { 44 flag=1; 45 printf("%lld %lld %lld\n",xx,yy,zz); 46 } 47 else 48 printf("-1\n"); 49 break; 50 } 51 } 52 if(!flag) 53 printf("-1\n"); 54 } 55 } 56 } 57 return 0; 58 }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· 没有源码,如何修改代码逻辑?
· 全程不用写代码,我用AI程序员写了一个飞机大战
· MongoDB 8.0这个新功能碉堡了,比商业数据库还牛
· 记一次.NET内存居高不下排查解决与启示
· 白话解读 Dapr 1.15:你的「微服务管家」又秀新绝活了
· DeepSeek 开源周回顾「GitHub 热点速览」