#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; ll res = 0; int cnt_pairs[n*n + 1]; for (int i = 0; i <= n*n; i++) { cnt_pairs[i] = 0; } for (int a = 1; a <= n; a++) { for (int b = a; a*a + b*b <= n*n; b++) { cnt_pairs[a*a + b*b]++; } } for (int d = 1; d <= n; d++) { for (int h = 1; h <= d; h++) { res += cnt_pairs[d*d - h*h]; } } cout << res << "\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 | #include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n; cin >> n; ll res = 0; int cnt_pairs[n*n + 1]; for (int i = 0; i <= n*n; i++) { cnt_pairs[i] = 0; } for (int a = 1; a <= n; a++) { for (int b = a; a*a + b*b <= n*n; b++) { cnt_pairs[a*a + b*b]++; } } for (int d = 1; d <= n; d++) { for (int h = 1; h <= d; h++) { res += cnt_pairs[d*d - h*h]; } } cout << res << "\n"; return 0; } |