题目链接:
http://codeforces.com/problemset/problem/787/A
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 2 9 19
82
2 1 16 12
-1
题目大意:
有两个人被一个怪物追杀,第一个人在b+i*a时刻尖叫(i=1、2、3......),第二个人在d+i*c时刻尖叫(i=1、2、3......),当他们在同一时刻尖叫的话,他们将被怪物抓住。判断他们是否会被怪物抓住,如果不存在同时尖叫的时刻,输出 -1 。
解题思路:
虽然是暴力做的题,但是对时间要求非常严格,可以说不可以循环里面套循环。下面请大家看一下代码应该就明白了(一个for循环)。
代码:
#include<iostream>
using namespace std;
int main()
{
int a,b,c,d;
while(cin>>a>>b>>c>>d)
{
int flag=0,t1; //flag用于标记,t1用于存储第一个人尖叫的时刻
for(int i=0;i<=1000000;i++) //让i值尽可能的大
{
t1=b+i*a; //计算第一个人尖叫的时刻
if((t1-d)%c==0&&t1-d>=0) //说明存在同时尖叫的时刻
{
flag=1; //把flag标记为1
cout<<t1<<endl;
break;
}
}
if(flag==0) //没有同时尖叫的时刻
cout<<-1<<endl;
}
return 0;
}