結果
問題 | No.982 Add |
ユーザー |
![]() |
提出日時 | 2020-02-11 14:22:47 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,237 bytes |
コンパイル時間 | 1,680 ms |
コンパイル使用メモリ | 169,772 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-10-01 07:34:17 |
合計ジャッジ時間 | 2,225 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
ソースコード
/* #region Head */#include <bits/stdc++.h>using namespace std;using ll = long long;using ull = unsigned long long;using ld = long double;using pll = pair<ll, ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vc<vc<T>>;using vll = vc<ll>;using vvll = vvc<ll>;using vld = vc<ld>;using vvld = vvc<ld>;using vs = vc<string>;using vvs = vvc<string>;#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)#define ALL(x) begin(x), end(x)#define SIZE(x) ((ll)(x).size())#define PREM(c) \sort(all(c)); \for (bool c##p = 1; c##p; c##p = next_permutation(all(c)))#define UNIQ(v) v.erase(unique(ALL(v)), v.end());constexpr ll INF = 1'010'000'000'000'000'017LL;constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7constexpr ld EPS = 1e-12;constexpr ld PI = 3.14159265358979323846;// vector入力template <typename T>istream &operator>>(istream &is, vc<T> &vec){for (T &x : vec)is >> x;return is;}// vector出力 (for dump)template <typename T>ostream &operator<<(ostream &os, vc<T> &vec){ll len = SIZE(vec);os << "{";for (int i = 0; i < len; i++)os << vec[i] << (i == len - 1 ? "" : ", ");os << "}";return os;}// vector出力 (inline)template <typename T>ostream &operator>>(ostream &os, vc<T> &vec){ll len = SIZE(vec);for (int i = 0; i < len; i++)os << vec[i] << (i == len - 1 ? "\n" : " ");return os;}// pair入力template <typename T, typename U>istream &operator>>(istream &is, pair<T, U> &pair_var){is >> pair_var.first >> pair_var.second;return is;}// pair出力template <typename T, typename U>ostream &operator<<(ostream &os, pair<T, U> &pair_var){os << "(" << pair_var.first << ", " << pair_var.second << ")";return os;}// map出力template <typename T, typename U>ostream &operator<<(ostream &os, map<T, U> &map_var){os << "{";REPI(itr, map_var){os << *itr;itr++;if (itr != map_var.end())os << ", ";itr--;}os << "}";return os;}// set 出力template <typename T>ostream &operator<<(ostream &os, set<T> &set_var){os << "{";REPI(itr, set_var){os << *itr;itr++;if (itr != set_var.end())os << ", ";itr--;}os << "}";return os;}// dump#define DUMPOUT cerrvoid dump_func(){DUMPOUT << endl;}template <class Head, class... Tail>void dump_func(Head &&head, Tail &&... tail){DUMPOUT << head;if (sizeof...(Tail) > 0){DUMPOUT << ", ";}dump_func(move(tail)...);}// chmax (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>>bool chmax(T &xmax, const U &x, Comp comp = {}){if (comp(xmax, x)){xmax = x;return true;}return false;}// chmin (更新「される」かもしれない値が前)template <typename T, typename U, typename Comp = less<>>bool chmin(T &xmin, const U &x, Comp comp = {}){if (comp(x, xmin)){xmin = x;return true;}return false;}// ローカル用#define DEBUG_#ifdef DEBUG_#define DEB#define dump(...) \DUMPOUT << " " << string(#__VA_ARGS__) << ": " \<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \<< endl \<< " ", \dump_func(__VA_ARGS__)#else#define DEB if (false)#define dump(...)#endifstruct AtCoderInitialize{static constexpr int IOS_PREC = 15;static constexpr bool AUTOFLUSH = false;AtCoderInitialize(){ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cout << fixed << setprecision(IOS_PREC);if (AUTOFLUSH)cout << unitbuf;}} ATCODER_INITIALIZE;/* #endregion *//**Problem*/void solve(){ll a, b;cin >> a >> b;// if (min(a, b) == 1)// {// cout << 0 << endl;// return;// }ll g = __gcd(a, b);if (g > 1){cout << -1 << endl;return;}vll table(2 * a * b + 1, 0);REPM(x, 0, b)REPM(y, 0, a){if (x + y == 0)continue;ll n = a * x + b * y;table[n] += 1; // いい整数// dump(n);}// dump(table);ll ret = 0;REPM(n, 1, a * b){if (table[n] == 0) // 良い整数ではないret++;}cout << ret << endl;}/*** エントリポイント.* @return 0.*/int main(){solve();return 0;}