数论+唯一分解定理 Aladdin and the Flying Carpet

题意

给 一个 面积为a的矩形最小边长为b
求有多少种方案

思路

就是说
一共有 正因数/2个方案(先不考虑 最小边 b长度的约束条件)
然后考虑(1~b中是否有数能够整除 a 如果有就方案数–)

AC代码

#include<bits/stdc++.h>
#define endl "\n"
#define INF 0x3f3f3f3f3f3f3f
typedef long long ll;
const ll mod = 1e9 + 7;
const double PI = acos(-1.0);
const double EI = exp(1.0);
const int N = 1e6 + 50;
const int maxn = 2 * N;
const double eps = 1e-8;
using namespace std;
ll fast_pow(ll a, ll b)
{
	ll ans = a, res = 1;
	while (b>0)
	{
		if (b & 1)
			res = (res * ans) % mod;
		ans = (ans * ans) % mod;
		b /= 2;
	}
	return res;
}
ll inv(ll x) { return fast_pow(x, mod - 2); }
vector<ll>q;
bool is_prime[maxn + 1];
int prime[maxn];
int cnt = 0,cnt1=0;
int num[N];
int icase = 0;
ll d = 1;
void sieve()
{
	for (int i = 1; i <= maxn; i++)
		is_prime[i] = 1;
	for (int i = 2; i <= maxn; i++)
	{
		if (is_prime[i])prime[++cnt] = i;
		for (int j = 1; j <= cnt && prime[j] * i <= maxn; j++)
		{
			is_prime[prime[j] * i] = 0;
			if (i % prime[j] == 0)
				break;
		}
	}
}
void getfact(ll x)
{
	for (int i = 1; i <= cnt && prime[i] * prime[i] <= x; i++)
	{
		int num = 0;
		if (x % prime[i] == 0)
		{
			while (x%prime[i]==0)
			{
				x /= prime[i];
				num++;
			}
			d *= (num + 1);
		}
	}
	if (x > 1)
	{
		d *= 2;
	}
}
void solve()
{
	ll n,b;
	cnt1 = 0;
	cin >> n>>b;
	if (n < b * b)
	{
		cout << "Case " << ++icase << ": " << 0 << endl;
		return;
	}
	q.clear();
	d = 1;
	getfact(n);
	d /= 2;
	for (int i = 1; i < b; i++)
		if (n % i == 0)d--;
	cout << "Case " << ++icase << ": "<<d << endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(); cout.tie(0);
	sieve();
	int t; cin >> t; while (t--)
	solve();
	return 0;
}