Pagini recente » Cod sursa (job #7800) | Cod sursa (job #2387007) | Cod sursa (job #772931) | Cod sursa (job #916554) | Cod sursa (job #1722109)
#include<cstdio>
#define MAXN 410
using namespace std;
int Sqrt[MAXN*MAXN];
int main(){
freopen("dreptunghiuri.in","r",stdin);
freopen("dreptunghiuri.out","w",stdout);
int n,m,current,l,c,a,delta,i;
long long answer=0;
scanf("%d%d",&n,&m);
n--;
m--;
for(i=1;i<=400;i++)
Sqrt[i*i]=i;
for(l=1;l<=n;l++)
for(c=1;c<=m;c++){
current=1;
for(a=1;a<c;a++){
delta=l*l-4*a*(c-a);
if(delta<0)
continue;
if(Sqrt[delta]*Sqrt[delta]!=delta||((l^Sqrt[delta])&1))
continue;
if(Sqrt[delta]==0)
current++;
else
if(Sqrt[delta]<l)
current+=2;
}
answer=answer+(long long)current*(n-l+1)*(m-c+1);
}
printf("%lld",answer);
return 0;
}