It’s said that Aladdin had to solve seven mysteries before getting the Magical Lamp which summons a powerful Genie. Here we are concerned about the first mystery.
Aladdin was about to enter to a magical cave, led by the evil sorcerer who disguised himself as Aladdin’s uncle, found a strange magical flying carpet at the entrance. There were some strange creatures guarding the entrance of the cave. Aladdin could run, but he knew that there was a high chance of getting caught. So, he decided to use the magical flying carpet. The carpet was rectangular shaped, but not square shaped. Aladdin took the carpet and with the help of it he passed the entrance.
Now you are given the area of the carpet and the length of the minimum possible side of the carpet, your task is to find how many types of carpets are possible. For example, the area of the carpet 12, and the minimum possible side of the carpet is 2, then there can be two types of carpets and their sides are: {2, 6} and {3, 4}.
Input
Input starts with an integer T (≤ 4000), denoting the number of test cases.
Each case starts with a line containing two integers: a b (1 ≤ b ≤ a ≤ 1012) where a denotes the area of the carpet and b denotes the minimum possible side of the carpet.
Output
For each case, print the case number and the number of possible carpets.
Sample Input
2
10 2
12 2
Sample Output
Case 1: 1
Case 2: 2
Sponsor
解析:
试除法肯定超时
最优的方法就是我们把a的质因子筛出来,求唯一分解定理
ai(代表着幂次)
又因为(a,b)和(b,a)是相同的,所以只能算一次。
所以sum/2
最终我们还要把<b 且是a的因子也给筛去
#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
const int N=1e6+100;
int prime[N],cnt;
bool st[N];
int t;
ll a,b;
void init()
{
for(int i=2;i<=N;i++)
{
if(!st[i]) prime[++cnt]=i;
for(int j=1;j<=cnt&&prime[j]<=N/i;j++)
{
st[i*prime[j]]=true;
if(i%prime[j]==0) break;
}
}
}
int main()
{
init();
scanf("%d",&t);
while(t--)
{
ll ans=1;
scanf("%lld %lld ",&a,&b);
ll n=a;
if(b*b>a) ans=0;
else
{
for(int i=1;prime[i]<=n/prime[i]&&i<=cnt;i++)
{
ll s=0;
while(n%prime[i]==0) n/=prime[i],s++;
ans*=(s+1);
}
if(n>1) ans*=(1+1);
ans/=2;
for(int i=1;i<b;i++) if(a%i==0) ans--;
cout<<ans<<endl;
}
}
}