Relatively prime number

#include<iostream>
#include<string>
using namespace std;
int gcd(int a, int b)
{
    if (b == 0)
        return a;
    else
        return gcd(b, a % b);
}
int main()
{
    int a, b,i,j,k=0;
    cin >> a >> b;
    if (a < b)
    {
        for (i = a; i < b; i++)
        {
            for (j = i + 1; j < b + 1; j++)
            {
                if (gcd(i, j) == 1)
                {
                    k += 1;
                }
                else
                    continue;
            }
        }
        cout << k << endl;
        
    }
    else
    {
        for (i = b; i < a; i++)
        {
            for (j = i + 1; j < a + 1; j++)
            {
                if (gcd(i, j) == 1)
                {
                    k += 1;
                }
            }
        }
        cout << k << endl;

    }
    

    
}