#include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef vector<LL> VL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef double db; const int N = 5005; int c[N * N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; FOR(a, 1, n + 1) { FOR(b, a, n + 1) { int s = a * a + b * b; if (s > n * n) break; c[s]++; } } LL ans = 0; FOR(d, 1, n + 1) { FOR(h, 1, d) { ans += c[d * d - h * h]; } } cout << ans << "\n"; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 | #include <bits/stdc++.h> using namespace std; #define FOR(i, a, b) for(int i = (a); i < (b); i++) #define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--) #define SZ(a) int(a.size()) #define ALL(a) a.begin(), a.end() #define PB push_back #define MP make_pair #define F first #define S second typedef long long LL; typedef vector<int> VI; typedef vector<LL> VL; typedef pair<int, int> PII; typedef pair<LL, LL> PLL; typedef double db; const int N = 5005; int c[N * N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n; cin >> n; FOR(a, 1, n + 1) { FOR(b, a, n + 1) { int s = a * a + b * b; if (s > n * n) break; c[s]++; } } LL ans = 0; FOR(d, 1, n + 1) { FOR(h, 1, d) { ans += c[d * d - h * h]; } } cout << ans << "\n"; return 0; } |