// Witold Milewski
// PA 2025
#include <bits/stdc++.h>
#define int long long
using namespace std;
#define FOR(i, a, b) for(int i=a; i<=b; ++i)
#define FORB(i, b, a) for(int i=b; i>=a; --i)
#define sz(A) (int)(A.size())
#define ll long long
#define eb emplace_back
#define pb push_back
#define pi pair<int, int>
#define f first
#define s second
#define rs resize
#define V vector
int n;
map<int, int> jest;
signed main() {
cin.tie(0) -> ios_base::sync_with_stdio(0);
cin >> n;
FOR(a, 1, n) FOR(b, a, n) {
int aa = a*a;
int bb = b*b;
int s = aa+bb;
jest[s]++;
}
int w=0;
FOR(c, 1, n) {
int cc = c*c;
FOR(h, 1, c) {
int hh = h*h;
int aapbb = cc-hh;
if(aapbb+hh<=(n*n)) w+=jest[aapbb];
}
}
cout << w << '\n';
}
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 | // Witold Milewski // PA 2025 #include <bits/stdc++.h> #define int long long using namespace std; #define FOR(i, a, b) for(int i=a; i<=b; ++i) #define FORB(i, b, a) for(int i=b; i>=a; --i) #define sz(A) (int)(A.size()) #define ll long long #define eb emplace_back #define pb push_back #define pi pair<int, int> #define f first #define s second #define rs resize #define V vector int n; map<int, int> jest; signed main() { cin.tie(0) -> ios_base::sync_with_stdio(0); cin >> n; FOR(a, 1, n) FOR(b, a, n) { int aa = a*a; int bb = b*b; int s = aa+bb; jest[s]++; } int w=0; FOR(c, 1, n) { int cc = c*c; FOR(h, 1, c) { int hh = h*h; int aapbb = cc-hh; if(aapbb+hh<=(n*n)) w+=jest[aapbb]; } } cout << w << '\n'; } |
English