#include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (a); i < (b); i++) #define all(x) begin(x), end(x) #define sz(x) int((x).size()) using ll = long long; using pii = pair<int, int>; using vi = vector<int>; #ifdef LOCAL auto operator<<(auto& o, auto x) -> decltype(x.first, o); auto operator<<(auto& o, auto x) -> decltype(x.end(), o) { o << "{"; for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y; return o << "}"; } auto operator<<(auto& o, auto x) -> decltype(x.first, o) { return o << "(" << x.first << ", " << x.second << ")"; } void __print(auto... x) { ((cerr << x << " "), ...) << endl; } #define debug(x...) __print("[" #x "]:", x) #else #define debug(...) 2137 #endif int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<int> f(n * n + 1); for(int a = 1; a <= n; a++) { for(int b = a; b <= n; b++) { int c = a * a + b * b; if(c < f.size()) f[c]++; } } ll ans = 0; for(int res = 1; res <= n; res++) { for(int h = 1; h < res; h++) { ans += f[res * res - h * h]; } } cout << ans << endl; }
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 | #include <bits/stdc++.h> using namespace std; #define rep(i, a, b) for (int i = (a); i < (b); i++) #define all(x) begin(x), end(x) #define sz(x) int((x).size()) using ll = long long; using pii = pair<int, int>; using vi = vector<int>; #ifdef LOCAL auto operator<<(auto& o, auto x) -> decltype(x.first, o); auto operator<<(auto& o, auto x) -> decltype(x.end(), o) { o << "{"; for (int i = 0; auto y : x) o << ", " + !i++ * 2 << y; return o << "}"; } auto operator<<(auto& o, auto x) -> decltype(x.first, o) { return o << "(" << x.first << ", " << x.second << ")"; } void __print(auto... x) { ((cerr << x << " "), ...) << endl; } #define debug(x...) __print("[" #x "]:", x) #else #define debug(...) 2137 #endif int main() { cin.tie(0)->sync_with_stdio(0); int n; cin >> n; vector<int> f(n * n + 1); for(int a = 1; a <= n; a++) { for(int b = a; b <= n; b++) { int c = a * a + b * b; if(c < f.size()) f[c]++; } } ll ans = 0; for(int res = 1; res <= n; res++) { for(int h = 1; h < res; h++) { ans += f[res * res - h * h]; } } cout << ans << endl; } |