Pagini recente » Cod sursa (job #645356) | Cod sursa (job #2194160) | Cod sursa (job #2086059) | Cod sursa (job #679650) | Cod sursa (job #2920410)
#include <bits/stdc++.h>
using namespace std;
ifstream r("dreptunghiuri.in");
ofstream w("dreptunghiuri.out");
int n, m, cnt;
long long ans;
int rad[160005];
int main()
{
ios_base::sync_with_stdio(false);
r.tie(NULL);
r >> n >> m;
for(int i = 1; i <= 160000; i++)
{
rad[i] = sqrt(i);
}
for(int i = 1; i < n; i++)
{
for(int j = 1; j < m; j++)
{
cnt = 1;
for(int a = 1; a < i; a++)
{
int delta = j * j - 4 * a * (i - a);
if(delta == 0 && j % 2 == 0)
{
cnt++;
}
else
{
if(delta > 0 && rad[delta] * rad[delta] == delta && (j + rad[delta]) % 2 == 0 && j > rad[delta])
cnt += 2;
}
}
ans += cnt * (n - i) * (m - j);
}
}
w<< ans;
return 0;
}