#![allow(non_snake_case, unused_imports, unused_must_use, unused_macros)] use std::io::{self, prelude::*, BufWriter, StdinLock, StdoutLock}; use std::str; use std::collections::BTreeSet; fn main() { macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let (stdin, stdout) = (io::stdin(), io::stdout()); let mut scan = Scanner::new(stdin.lock()); let mut out = io::BufWriter::new(stdout.lock()); // let t = input!(scan, usize); let t = 1; for _ in 0..t { solve(&mut scan, &mut out); } } fn get_divisors(n: u64) -> Vec { let mut divisors = vec![]; for i in 1.. { if i * i > n { break; } if n % i == 0 { divisors.push(i); if i * i != n { divisors.push(n / i); } } } // divisors.sort(); divisors } fn solve(scan: &mut Scanner, out: &mut BufWriter) { macro_rules! input { ($T: ty) => { scan.token::<$T>() }; ($T: ty, $N: expr) => { (0..$N).map(|_| scan.token::<$T>()).collect::>() }; } let A = input!(usize); let B = input!(usize); let a = input!(usize); let b = input!(usize); for x in 1..100000000 { if x % A == a && x % B == b { writeln!(out, "{}", x); return; } } } struct Scanner { reader: R, buf_str: Vec, buf_iter: str::SplitWhitespace<'static>, } impl Scanner { fn new(reader: R) -> Self { Self { reader, buf_str: vec![], buf_iter: "".split_whitespace(), } } fn token(&mut self) -> T { loop { if let Some(token) = self.buf_iter.next() { return token.parse().ok().expect("Failed parse"); } self.buf_str.clear(); self.reader .read_until(b'\n', &mut self.buf_str) .expect("Failed read"); self.buf_iter = unsafe { let slice = str::from_utf8_unchecked(&self.buf_str); std::mem::transmute(slice.split_whitespace()) } } } }