扩欧应用
来源:互联网 发布:ubuntu下安装jdk8 编辑:程序博客网 时间:2024/06/08 07:45
A monster is chasing after Rick and Morty on another planet. They're so frightened that sometimes they scream. More accurately, Rick screams at times b, b + a, b + 2a, b + 3a, ... and Morty screams at times d, d + c, d + 2c, d + 3c, ....
The Monster will catch them if at any point they scream at the same time, so it wants to know when it will catch them (the first time they scream at the same time) or that they will never scream at the same time.
The first line of input contains two integers a and b (1 ≤ a, b ≤ 100).
The second line contains two integers c and d (1 ≤ c, d ≤ 100).
Print the first time Rick and Morty will scream at the same time, or - 1 if they will never scream at the same time.
20 29 19
82
2 116 12
-1
In the first sample testcase, Rick's 5th scream and Morty's 8th time are at time 82.
In the second sample testcase, all Rick's screams will be at odd times and Morty's will be at even times, so they will never scream at the same time.
题目大意:
有一个怪物在追赶 Rick 和 Morty 他们两个人很害怕 所以不停的尖叫
Rick在 b, b + a, b + 2a, b + 3a, ... 时刻尖叫
Morty在 d, d + c, d + 2c, d + 3c, .... 时刻尖叫
问两个人会不会在同一时刻尖叫
分析:
扩展欧几里得 略微分析便可得到方程
若想两人同时尖叫 需满足 b + a*x = d + c*y ---> a*x - c*y = d - b
求出 满足方程的最小非负整数对 x,y
AC代码:
- #include<stdio.h>
- #include <math.h>
- int gcd(int a,int b,int &x,int &y){
- if (b==0){
- x=1,y=0;
- return a;
- }
- int ans=gcd(b,a%b,y,x);
- y-=(a/b)*x;
- return ans;
- }
- int main (){
- int a,b,c,d;
- while (scanf ("%d%d%d%d",&a,&b,&c,&d)!=EOF){
- int x,y;
- int g=gcd(a,-c,x,y);
- if ((d-b)%g!=0){// 不满足条件
- printf ("-1\n");
- continue;
- }
- x=x*(d-b)/g;// 求出方程的x
- // 接下来三行求出最小非负整数x
- x=x%(-c/g);
- if (x<0)
- x+=fabs(-c/g);
- y=((d-b)-a*x)/(-c); // 求出方程的y
- while (y<0){
- x=x+fabs(-c/g);//
- y=((d-b)-a*x)/(-c);
- }
- printf ("%d\n",b+x*a);
- }
- return 0;
- }
其实这题可以水
AC代码:
- #include<stdio.h>
- int main (){
- int a,b,c,d;
- scanf("%d%d%d%d",&a,&b,&c,&d);
- int flag=1;
- for (int i=1;i<=200&&flag;i++){
- for (int j=1;j<=200&&flag;j++){
- if ((i*a-j*c)==(d-b+a-c)){
- printf ("%d\n",d+(j-1)*c);
- flag=0;
- }
- }
- }
- if (flag)
- printf ("-1\n");
- return 0;
- }
- 扩欧应用
- 欧拉函数应用
- 欧拉函数应用
- 应用
- 应用
- 应用
- 应用
- 应用
- 应用
- 应用
- 0欧电阻的应用
- 欧拉函数应用1
- 欧拉函数的应用
- 欧拉定理与应用
- 欧拉函数及其应用
- 欧拉函数的应用
- 欧拉函数简单应用
- 欧拉四面体体积应用
- 数据库的事务处理
- 图片框(ImageView)
- 使用adb过程中遇到的问题
- uitextfield设置占位符颜色
- Android中的IPC方式
- 扩欧应用
- 新建maven项目pom.xml报错解决办法
- Machine learning_安装_dlib
- iOS 健康 获取运动步数 距离 时间
- win7安装Ubuntu16后,win7启动项不见了的解决方法
- 网络的那些事之网络模型
- Python解析JSON详解
- NFS
- Zookeeper学习资源