#include <iostream>
//a^2+b^2=n^2-h2
const int MAX_N = 5010; ///ZMIEN!!!!
int n;
int counta2b2[MAX_N*MAX_N+1]; //moze byc int, bo sumuje sie do n*n
int main()
{
std::cin >> n;
for (int i = 0; i < n*n; i++) counta2b2[i] = 0;
for (int a = 1; a < n; a++) {
for (int b = a; b < n; b++) {
if (a*a + b * b < n*n) {
counta2b2[a*a + b * b] += 1;
}
}
}
long long count =0;
for (int p = 1; p <= n; p++) {
for (int h = 1; h < p; h++) {
count += counta2b2[p*p - h * h];
}
}
std::cout << count;
}
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 | #include <iostream> //a^2+b^2=n^2-h2 const int MAX_N = 5010; ///ZMIEN!!!! int n; int counta2b2[MAX_N*MAX_N+1]; //moze byc int, bo sumuje sie do n*n int main() { std::cin >> n; for (int i = 0; i < n*n; i++) counta2b2[i] = 0; for (int a = 1; a < n; a++) { for (int b = a; b < n; b++) { if (a*a + b * b < n*n) { counta2b2[a*a + b * b] += 1; } } } long long count =0; for (int p = 1; p <= n; p++) { for (int h = 1; h < p; h++) { count += counta2b2[p*p - h * h]; } } std::cout << count; } |
English