Submission #19657405

---

Source Code Expand

#include <bits/stdc++.h>
#include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) std::cout<<((f)?"Yes":"No")<<endl;
#define YORN(f) std::cout<<((f)?"YES":"NO")<<endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
#define foreach(i, v) for (auto& i : v)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define put(x) std::cout << x << endl;
#define println(x) std::cout << x << endl;
#define elif else if
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define rrep(i, n) for (ll i = (ll)n-1; i >= 0; i--)
template<typename T>bool mins(T& x,const T&y){if(x>y){x=y;return true;}else return false;}
template<typename T>bool maxs(T& x,const T&y){if(x<y){x=y;return true;}else return false;}
const ll INF = 1e18;
const ll mod = 7+1e9;
using namespace std;
using namespace atcoder;
using BIT=fenwick_tree<ll>;
using UnionFind=dsu;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
typedef pair<ll, ll> P2;
typedef pair<ll, pair<ll, ll> > P3;
typedef tuple<ll, ll, ll> i3;

void Main()
{
    ll x, y;
    cin >> x >> y;

    if (x % y == 0) {
        put(-1);
        return;
    }

    repi(i, 1e18) {
        if (x * i % y != 0) {
            put(x * i);
            return;
        }
    }

}
signed main(){ Main();return 0;}

Submission Info

Judge Result