Aladdin and the Flying Carpet LightOJ - 1341 (算术基本定理）

Aladdin and the Flying Carpet LightOJ - 1341

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
算术基本定理（百度）

//算术基本定理 
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>

#define maxn 1000007
#define ll long long 

int prime[maxn];
int mark[maxn];
int count = 0; // 记录素数的总个数；

void find_prime() //素数打表，存放在prime[]数组中 
{
    for(int i = 2; i < maxn; i ++)
    {
        if( mark[i] == 0)
            {
                prime[count++] = i;

                for(int j = i + i; j < maxn; j += i)
                {
                    mark[j] = 1;
                }
            }
    }
}

int solve(ll a)
{
    if( a == 0)  return 0;

    int i = 0;
    int s = 1;

    while( i < count && prime[i] < a) // 根据算术基本定理第一条求出它所有因子的个数 
    {
        if( a % prime[i] == 0)
            {
                int cnt = 0;
                while( a % prime[i] == 0 )
                {
                    a /= prime[i];
                    cnt ++;         // 求出 a1,a2,a3..... 
                }

                s *= (cnt + 1);
            }
        i ++;
    }

    if( a > 1)         // 最后一个因子，本人认为可能是打表存放的素数有限，(该表只存到了1e6+3) 
        s *= (1 + 1);  // 导致有较大的素数为存在prime[]中，故未除去 ,而且只能是一次方(若平方会超出10^12) 

    return s;
}

int main()
{
    find_prime();
    int t;
    printf(" %d ",prime[count-1]);

    memset(mark,0,sizeof(mark));
    scanf("%d",&t);

    int k = 1;
    while( t --)
    {
        ll a,b;
        scanf("%lld%lld",&a,&b);

        if( b >= sqrt(a) )
            {
                printf("Case %d: 0\n",k++);
                continue;
            }
        else
            {
                int cnt = 0;
                for(int i = 1; i < b; i ++)  //  暴力求出比 b 的约数 
                    if( a % i == 0)
                        cnt ++; 

                ll cnt2 = solve(a) / 2;   // 因子个数除2 ，取到对数（多少对满足的个数） 
                printf("Case %d: %lld\n",k++,cnt2 - cnt); // 全部约数 - 不符合部分 
            } 
    }
    return 0;
}