codeforces 787a

听说这其实就是一道水题,我硬生生用了数论方法来解,真是蠢。主要是因为跟青蛙的约会这道题很相似,直接套模板就过了。

关于青蛙的约会(poj 1061)我写的题解:http://blog.csdn.net/qq1059752567/article/details/53384273


#include <stdio.h>
#include <string.h>
#include <ctime>
#include <stack>
#include <string>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <map>
#include <queue>
#include <vector>
using namespace std;
#define LL long long
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define lowbit(x) (x&-x)

const int maxn = 1e6+5;
const int INF = 0x3f3f3f3f;
LL a1,a2,b1,b2;

LL exgcd(LL a,LL b,LL& d,LL& x,LL& y)
{
    if(!b){
        d = a; x = 1; y = 0;
    }
    else {
        exgcd(b,a%b,d,y,x); y-=x*(a/b);
    }
}

int main()
{
    while(scanf("%I64d%I64d%I64d%I64d",&a1,&b1,&a2,&b2)!=EOF)
    {
        LL d,x,y;
        if(b2>b1)
        {
            swap(a1,a2);
            swap(b1,b2);
        }
        exgcd(a1,a2,d,x,y);
        if((b2-b1)%d)
            puts("-1");
        else
        {
            x *= (b2-b1)/d;
            LL mod = a2/d;
            x = (x%mod+mod)%mod;
            printf("%I64d\n",a1*x+b1);
        }
    }
	return 0;
}


A. The Monster
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Input

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).

Output

Print the first time Rick and Morty will scream at the same time, or  - 1 if they will never scream at the same time.

Examples
input
20 2
9 19
output
82
input
2 1
16 12
output
-1

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值