Cod sursa(job #953074)
Utilizator | Darie Sergiu primul | Data | 24 mai 2013 18:48:24 |
---|---|---|---|
Problema | Dreptunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Lista lui wefgef | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("dreptunghiuri.in");
ofstream g("dreptunghiuri.out");
int gcd( int a, int b )
{
if( !b ) return a;
return gcd( b, a%b );
}
int main()
{
long long rez=0;
int n,m,i,j,a,b;
f>>n>>m;
for( i=1; i<n; ++i )
for( j=0; j<m; ++j )
{
if( gcd(i,j) == 1)
{
for( a=1; i*a<=n; ++a )
for( b=1; i*a+b*j<n && j*a+i*b<m; ++ b ) rez+=1LL*(n-i*a-j*b)*(m-j*a-i*b);
}
}
g<<rez<<'\n';
return 0;
}