View Code of Problem 102

#include <stdio.h>

long long int gcd(long long int m,long long int n)
{
    long long int t;
    while(n)
    {
        t = m;
        m = n;
        n = t % n;
    }
    return m;
}

long long int mgcd(long long int m, long long int n)
{
    long long int t,nt = n,mt = m;
    while(nt)
    {
        t = mt;
        mt = nt;
        nt = t % nt;
    }
    return m * n / mt;
}

int main(void)
{
    long long int m,n;

    while(scanf("%lld%lld",&m,&n) != EOF)
    {
        int index = 0;
        int i,j;
        for(i = m;i <= n;i++)
        {
            for(j = m;j <= n;j++)
            {
                if(m == gcd(i,j) && n == mgcd(i,j))
                    index++;
            }
        }
        printf("%d\n",index);
    }
    return 0;
}