Solution B

#include <iostream>

using namespace std;

int gcd(int a, int b)
{
    if (b == 0)
        return a;
    return gcd(b, a % b);
}

int main()
{
    double x;
    cin >> x;
    int n;
    cin >> n;
    int result = 0;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= n; ++j)
        {
            if ((double) j / (double)i <= x && gcd(j, i) == 1)
                ++result;
        }
    }
    cout << result;
    return 0;
}