40,6WA
查看原帖
40,6WA
980202
Ultimate_Cactus楼主2023/12/1 19:50
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll x,y,ans,f;
ll gcd(ll a,ll b)
{
	if(b==0)
	{
		return a;
	}
	return gcd(b,a%b);
}
int main()
{
	cin>>x>>y;
	for(int i=1;i<=sqrt(1ll*x*y);i++)
	{
		if((1ll*x*y)%i==0&&gcd(i,(1ll*x*y))==x)
		{
			ans++;
			if((1ll*i*i)==(1ll*x*y))
			{
				f=1;
			}
		}
	}
	cout<<ans*2-f<<endl;
    return 0;
}

呜呜,帮帮忙!

2023/12/1 19:50
加载中...