A10951 | The Monster
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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 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$ ).
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.
输入输出样例
输入 #1
20 2 9 19
输出 #1
82
输入 #2
2 1 16 12
输出 #2
-1
In the first sample testcase, Rick's $5$ th scream and Morty's $8$ th 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.
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.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted