Pagini recente » Cod sursa (job #2989126) | Cod sursa (job #275772) | Cod sursa (job #2767265) | Cod sursa (job #366271) | Cod sursa (job #907990)
Cod sursa(job #907990)
#include<cstdio>
#include<iostream>
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;
long long rez;
int main(){
freopen("dreptunghiuri.in","r",stdin);
freopen("dreptunghiuri.out","w",stdout);
cin>>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=rez+1LL*(n-(i*a+b*j))*(m-(b*i+a*j));
}
}
}
}
}
cout<<rez<<"\n";
return 0;
}