Pagini recente » Cod sursa (job #2135473) | Cod sursa (job #2677384) | Cod sursa (job #448675) | Cod sursa (job #2550974) | Cod sursa (job #2293227)
#include<fstream>
#include<cstring>
using namespace std;
ifstream fin("dreptunghiuri.in");
ofstream fout("dreptunghiuri.out");
int i,f[160001],n,m,h,w,a,delta,sol,aux,c1,c2;
long long ss;
int main()
{
for(i=0;i<=400;i++)
f[i*i]=i;
fin>>m>>n;
for(h=1;h<n;h++)
for(w=1;w<m;w++)
{
sol=1;
for(a=1;a<h;a++)
{
delta=w*w-4*a*(h-a);
if(delta==0&&w%2==0) sol++;
else
if(delta>0&&f[delta])
{
aux=f[delta];
c1=(w-aux)/2;c2=(w+aux)/2;
if(!((w-aux)%2)&&c1>0&&c1<w) sol++;
if(!((w+aux)%2)&&c2>0&&c2<w) sol++;
}
}
ss+=1LL*sol*(n-h)*(m-w);
}
fout<<ss;
return 0;
}