結果

問題 No.864 四方演算
ユーザー gazellegazelle
提出日時 2019-08-16 21:30:44
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 20 ms / 1,000 ms
コード長 4,592 bytes
コンパイル時間 710 ms
コンパイル使用メモリ 77,208 KB
実行使用メモリ 27,028 KB
最終ジャッジ日時 2024-09-25 10:42:19
合計ジャッジ時間 2,055 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 9 ms
26,920 KB
testcase_01 AC 20 ms
26,884 KB
testcase_02 AC 17 ms
26,768 KB
testcase_03 AC 17 ms
26,944 KB
testcase_04 AC 18 ms
26,764 KB
testcase_05 AC 16 ms
26,868 KB
testcase_06 AC 18 ms
27,028 KB
testcase_07 AC 17 ms
26,908 KB
testcase_08 AC 16 ms
26,828 KB
testcase_09 AC 13 ms
26,840 KB
testcase_10 AC 14 ms
26,848 KB
testcase_11 AC 11 ms
26,824 KB
testcase_12 AC 16 ms
26,760 KB
testcase_13 AC 14 ms
26,844 KB
testcase_14 AC 10 ms
26,868 KB
testcase_15 AC 20 ms
26,872 KB
testcase_16 AC 17 ms
26,880 KB
testcase_17 AC 18 ms
26,844 KB
testcase_18 AC 17 ms
26,884 KB
testcase_19 AC 15 ms
26,932 KB
testcase_20 AC 18 ms
26,840 KB
testcase_21 AC 16 ms
26,760 KB
testcase_22 AC 15 ms
26,820 KB
testcase_23 AC 10 ms
26,756 KB
testcase_24 AC 15 ms
26,940 KB
testcase_25 AC 13 ms
26,928 KB
testcase_26 AC 17 ms
26,856 KB
testcase_27 AC 8 ms
26,880 KB
testcase_28 AC 9 ms
26,828 KB
testcase_29 AC 8 ms
26,820 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <vector>
#include <queue>
#define FOR(i, n, m) for(int i = n; i < (int)m; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-15;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
    os << to_string(p.first) << " " << to_string(p.second);
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
    REP(i, v.size()) {
        if(i) os << " ";
        os << to_string(v[i]);
    }
    return os;
}

struct modint {
    ll n;
public:
    modint(const ll n = 0) : n((n % mod + mod) % mod) {}
    static modint pow(modint a, int m) {
        modint r = 1;
        while(m > 0) {
            if(m & 1) { r *= a; }
            a = (a * a); m /= 2;
        }
        return r;
    }
    modint &operator++() { *this += 1; return *this; }
    modint &operator--() { *this -= 1; return *this; }
    modint operator++(int) { modint ret = *this; *this += 1; return ret; }
    modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
    modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
    friend bool operator==(const modint& lhs, const modint& rhs) {
        return lhs.n == rhs.n;
    }
    friend bool operator<(const modint& lhs, const modint& rhs) {
        return lhs.n < rhs.n;
    }
    friend bool operator>(const modint& lhs, const modint& rhs) {
        return lhs.n > rhs.n;
    }
    friend modint &operator+=(modint& lhs, const modint& rhs) {
        lhs.n += rhs.n;
        if (lhs.n >= mod) lhs.n -= mod;
        return lhs;
    }
    friend modint &operator-=(modint& lhs, const modint& rhs) {
        lhs.n -= rhs.n;
        if (lhs.n < 0) lhs.n += mod;
        return lhs;
    }
    friend modint &operator*=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * rhs.n) % mod;
        return lhs;
    }
    friend modint &operator/=(modint& lhs, const modint& rhs) {
        lhs.n = (lhs.n * (~rhs).n) % mod;
        return lhs;
    }
    friend modint operator+(const modint& lhs, const modint& rhs) {
        return modint(lhs.n + rhs.n);
    }
    friend modint operator-(const modint& lhs, const modint& rhs) {
        return modint(lhs.n - rhs.n);
    }
    friend modint operator*(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * rhs.n);
    }
    friend modint operator/(const modint& lhs, const modint& rhs) {
        return modint(lhs.n * (~rhs).n);
    }
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }

#define MAX_N 3030303
long long extgcd(long long a, long long b, long long& x, long long& y) {
    long long d = a;
    if (b != 0) {
        d = extgcd(b, a % b, y, x);
        y -= (a / b) * x;
    } else {
        x = 1; y = 0;
    }
    return d;
}
long long mod_inverse(long long a, long long m) {
    long long x, y;
    if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
    else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
    if(fact[0] == inf) {
        fact[0]=1;
        if(MAX_N != 0) fact[1]=1;
        for(ll i = 2; i <= MAX_N; ++i) {
            fact[i] = (fact[i-1] * i) % mod;
        }
    }
    e = 0;
    if(n == 0) return 1;
    long long res = mod_fact(n / mod, e);
    e += n / mod;
    if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
    return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
    if(n < 0 || k < 0 || n < k) return 0;
    long long e1, e2, e3;
    long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
    if(e1 > e2 + e3) return 0;
    return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}

using mi = modint;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n, k;
    cin >> n >> k;
    ll ans = 0;
    for(ll i = 1; i * i <= k; i++) {
        if(k % i) continue;
        ll p = i, q = k / i;
        if(p == q) {
            ll l = max(1LL, p - n), r = min(p - 1, n);
            ans += max(0LL, (r - l + 1)) * max(0LL, (r - l + 1));
        } else {
            ll l1 = max(1LL, p - n), r1 = min(p - 1, n);
            ll l2 = max(1LL, q - n), r2 = min(q - 1, n);
            ans += 2LL * max(0LL, (r1 - l1 + 1)) * max(0LL, (r2 - l2 + 1));
        }
    }
    cout << ans << endl;
    return 0;
}
0