К вопросу о лысины

#define _USE_MATH_DEFINES
#include <iostream>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <vector>
#include <stdio.h>
#include <cmath>
#include <math.h>
#include <queue>
#include <stack>
#include <climits>
#include <deque>
#include <ctime>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;

#define mh() make_heap()
#define poph() pop_heap()
#define pushh() push_heap()
#define sor(n) n.begin(), n.end()
#define mp make_pair
#define files freopen("vampire.in", "rt", stdin); freopen("vampire.out", "wt", stdout)

#define formx(a1,b1,c1,a2,b2,c2) ((a1*c2-a2*c1)/(a1*b2-b1*a2))
#define formy(a1,b1,c1,a2,b2,c2) ((c1*b2-c2*b1)/(a1*b2-b1*a2))
#define forma(y1,y2) (y2-y1)
#define formb(x1,x2) (x1-x2)
#define formc(x1,y1,x2,y2) (x1*(y2-y1)-y1*(x2-x1))
#define ras(x1,y1,x2,y2) sqrt((x2-x1)*(x2-x1)-(y2-y1)*(y2-y1))

struct cord
{
    double x1, y1, x2, y2;
};
struct limcord
{
    double x, y;
    bool good;
};

bool checkparal(double a1, double a2, double b1, double b2)
{
    return a1 / b1 == a2 / b2;
}

limcord findt(cord c, cord now)
{
    double a1 = forma(now.y1, now.y2);
    double b1 = formb(now.x1, now.x2);
    double c1 = formc(now.x1, now.y1, now.x2, now.y2);
    double a2 = forma(c.y1, c.y2);
    double b2 = formb(c.x1, c.x2);
    double c2 = formc(c.x1, c.y1, c.x2, c.y2);

    if (!checkparal(a1, a2, b1, b2))
    {
        double x = formx(a1, b1, c1, a2, b2, c2);
        double y = formy(a1, b1, c1, a2, b2, c2);
        return{ x,y, true };
    }
    else
    {
        return{ NULL,NULL, false };
    }
}

bool checkT(limcord now, cord ot)
{
    if (ras(ot.x1, ot.y1, ot.x2, ot.y2) == ras(ot.x1, ot.y1, now.x, now.y) + ras(ot.x2, ot.y2, now.x, now.y))
        return true;
    else
        return false;
}

int findpt(int a, int b)
{
    int answ = 1;
    int o = b/a;
    int i = 2;
    while (i<=sqrt(b))
    {
        if (o%i == 0)
        {
            answ ++;
            o /= i;
        }
        else
            i++;
    }
    if (o > 1)
        answ++;
    return answ;
}
int main()
{
    //files;
    int T;
    cin >> T;
    for (int i = 1; i <= T; i++)
    {
        ll a, b;
        cin >> a >> b;
        if (b%a == 0)
        {
            if (a == b)
                cout << 1 << endl;
            else
                cout <<findpt(a,b) << endl;
        }
        else
            cout << 0 << endl;
    }

    system("pause");
    return 0;
}