Pagini recente » Cod sursa (job #1001936) | Cod sursa (job #313715) | Cod sursa (job #157872) | Cod sursa (job #2387624) | Cod sursa (job #2335670)
#include <bits/stdc++.h>
using namespace std;
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
int n,m,i,j,k;
long long ans;
int main()
{
f>>n>>m;
for(i=2;i<=n;i++)
for(j=2;j<=m;j++)
{
ans+=(long long)(i-1)*(j-1);
for(k=i-1;k>1;k--)
{
//cout<<i<<' '<<j<<' '<<k<<" : "<<(k-1)*(i-k)<<'\n';
int val=(k-1)*(i-k);
if(val%(j-1))continue;
val/=j-1;
//cout<<val<<'\n';
if(m-j-val>=0)
ans+=(long long)(m-j-val+1)*(n-i+1);
}
}
g<<ans;
return 0;
}