#include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; unordered_set<int> sq; for (int i = 1; i <= n; i++) sq.insert(i * i); long long wynik = 0; for (int a = 1; a <= n; a++) { for (int b = a; b <= n; b++) { for (int h = 1; h <= n; h++) { int suma = a * a + b * b + h * h; if (sq.count(suma)) wynik++; } } } cout << wynik << 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 | #include <bits/stdc++.h> using namespace std; int main() { int n; cin >> n; unordered_set<int> sq; for (int i = 1; i <= n; i++) sq.insert(i * i); long long wynik = 0; for (int a = 1; a <= n; a++) { for (int b = a; b <= n; b++) { for (int h = 1; h <= n; h++) { int suma = a * a + b * b + h * h; if (sq.count(suma)) wynik++; } } } cout << wynik << endl; } |