結果

問題 No.800 四平方定理
ユーザー drken1215
提出日時 2019-03-17 22:09:59
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 112 ms / 2,000 ms
コード長 3,730 bytes
コンパイル時間 910 ms
コンパイル使用メモリ 105,792 KB
実行使用メモリ 82,760 KB
最終ジャッジ日時 2024-07-07 23:32:42
合計ジャッジ時間 4,222 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <unordered_map>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v.begin(), v.end())
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T1, class T2> ostream& operator << (ostream &s, pair<T1,T2> P)
{ return s << '<' << P.first << ", " << P.second << '>'; }
template<class T> ostream& operator << (ostream &s, vector<T> P)
{ for (int i = 0; i < P.size(); ++i) { if (i > 0) { s << " "; } s << P[i]; } return s; }
template<class T> ostream& operator << (ostream &s, vector<vector<T> > P)
{ for (int i = 0; i < P.size(); ++i) { s << endl << P[i]; } return s << endl; }
template<class T> ostream& operator << (ostream &s, set<T> P)
{ EACH(it, P) { s << "<" << *it << "> "; } return s << endl; }
template<class T1, class T2> ostream& operator << (ostream &s, map<T1,T2> P)
{ EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; } return s << endl; }
vector<long long> calc_divisor(long long n) {
    vector<long long> res;
    for (long long i = 1LL; i*i <= n; ++i) {
        if (n % i == 0) {
            res.push_back(i);
            long long j = n / i;
            if (j != i) res.push_back(j);
        }
    }
    sort(res.begin(), res.end());
    return res;
}
long long num[10000000];
int N;
int D;
int le[10000000];
int ri[10000000];
long long solve() {
    memset(le, 0, sizeof(le));
    memset(ri, 0, sizeof(ri));
    for (int x = 1; x <= N; ++x) {
        for (int y = 1; y <= N; ++y) {
            le[x*x + y*y]++;
        }
    }
    for (int z = 1; z <= N; ++z) {
        for (int w = 1; w <= N; ++w) {
            int val = D + w*w - z*z;
            if (val < 0) continue;
            ri[val]++;
        }
    }
    long long res = 0;
    for (int v = 1; v < 10000000; ++v) {
        res += (long long)(le[v]) * ri[v];
    }
    return res;
}
int main() {
    while (cin >> N >> D) {
        cout << solve() << endl;
        /*
        memset(num, -1, sizeof(num));
        long long res = 0;
        for (long long x = 1; x <= N; ++x) {
            for (long long y = 1; y <= N; ++y) {
                long long diff = abs(D - x*x - y*y);
                if (diff == 0) res += N;
                else if (num[diff] != -1) res += num[diff];
                else {
                    int tmp = 0;
                    auto div = calc_divisor(diff);
                    for (auto d : div) {
                        long long p = diff/d, q = d;
                        if (p <= q) break;
                        if ((p + q) % 2 == 0) {
                            long long z = (p + q) / 2, w = (p - q) / 2;
                            if (z >= 1 && z <= N && w >= 1 && q <= N) {
                                ++tmp;
                                //cout << x << ", " << y << ": " << diff << "; " << p << ", " << q << endl;
                            }
                        }
                    }
                    res += tmp;
                    num[diff] = tmp;
                }
            }
        }
        cout << res << endl;
         */
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0