Pagini recente » Cod sursa (job #487454) | Cod sursa (job #1149565) | Cod sursa (job #481229) | Cod sursa (job #1283494) | Cod sursa (job #907988)
Cod sursa(job #907988)
#include<cstdio>
using namespace std;
int gcd( int a,int b ){
if(!b) return a;
return gcd( b, a%b );
}
int n,m,a,b,i,j,rez;
int main(){
freopen("dreptunghiuri.in","r",stdin);
freopen("dreptunghiuri.out","w",stdout);
scanf("%d %d", &n, &m );
for( a=1; a<n; ++a ){
for( b=0; b<m; ++b ){
for( i=1; i*a<n; ++i ){
for( j=1; i*a+b*j<n && i*b+j*a<m; ++j ){
if( gcd(i,j) == 1 ){
rez+=(n-(i*a+b*j))*(m-(b*i+a*j));
}
}
}
}
}
printf("%d\n",rez);
return 0;
}