#include<bits/stdc++.h>
#define llong long long
#define ldouble long double
#define uint unsigned int
#define ulong unsigned long long
using namespace std;
void solve() {
int n; cin >> n;
vector<int> xh(n * n, 0);
for (int x = 2; x <= n; x++) {
for (int h = 1; h < x; h++) {
xh[x * x - h * h]++;
}
}
int counter = 0;
for (int a = 1; a <= n; a++) {
for (int b = 1; b <= a; b++) {
int c = a * a + b * b;
if (c >= n * n) break;
counter += xh[c];
}
}
cout << counter << "\n";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
solve();
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 | #include<bits/stdc++.h> #define llong long long #define ldouble long double #define uint unsigned int #define ulong unsigned long long using namespace std; void solve() { int n; cin >> n; vector<int> xh(n * n, 0); for (int x = 2; x <= n; x++) { for (int h = 1; h < x; h++) { xh[x * x - h * h]++; } } int counter = 0; for (int a = 1; a <= n; a++) { for (int b = 1; b <= a; b++) { int c = a * a + b * b; if (c >= n * n) break; counter += xh[c]; } } cout << counter << "\n"; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); solve(); return 0; } |
English