Pagini recente » Cod sursa (job #726993) | Cod sursa (job #409183) | Cod sursa (job #1414249) | Cod sursa (job #424792) | Cod sursa (job #1494887)
#include <cstdio>
#include <cstring>
#include <algorithm>
#define maxN 402
#define maxR 895
using namespace std;
int i, j, Sqrt[maxR * maxR];
long long sol;
int n, m;
void read()
{
freopen("dreptunghiuri.in", "r", stdin);
scanf("%d %d", &n, &m);
}
long long nrr(int x, int y)
{
int i, delta;
long long ans = 0;
for (i = 1; i < n; ++ i)
{
delta = y * y - 4 * i * (x - i);
if (delta >= 0 && (Sqrt[delta] || !delta))
{
delta = Sqrt[delta];
if ((y + delta) % 2 == 0 && y + delta > 0 && (y + delta) / 2 <= y)
ans += (n - x) * (m - y) * 1LL;
if (delta && (y - delta) % 2 == 0 && y - delta > 0 && (y - delta) / 2 <= y)
ans += (n - x) * (m - y) * 1LL;
}
}
return ans;
}
void solve()
{
for (i = 1; i < maxR; ++ i)
Sqrt[i * i] = i;
for (i = 1; i <= n; ++ i)
for (j = 1; j <= m; ++ j)
sol += nrr(i, j);
}
void write()
{
freopen("dreptunghiuri.out", "w", stdout);
printf("%lld", sol);
}
int main()
{
read();
solve();
write();
return 0;
}