LightOJ 1236 Pairs Forming LCM

最新推荐文章于 2020-05-26 09:50:27 发布

cc_wood

最新推荐文章于 2020-05-26 09:50:27 发布

阅读量275

点赞数

分类专栏：算法之数学文章标签： lightoj

本文链接：https://blog.csdn.net/cccruel/article/details/76293871

版权

算法之数学专栏收录该内容

69 篇文章 2 订阅

订阅专栏

题目链接:点我

Find the result of the following code:

long long pairsFormLCM( int n ) {
    long long res = 0;
    for( int i = 1; i <= n; i++ )
        for( int j = i; j <= n; j++ )
           if( lcm(i, j) == n ) res++; // lcm means least common multiple
    return res;
}

A straight forward implementation of the code may time out. If you analyze the code, you will find that the code actually counts the number of pairs (i, j) for which lcm(i, j) = n and (i ≤ j).

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 1014).

Output

For each case, print the case number and the value returned by the function 'pairsFormLCM(n)'.

Sample Input

Sample Output

Case 1: 2

Case 2: 2

Case 3: 3

Case 4: 5

Case 5: 4

Case 6: 5

Case 7: 8

Case 8: 5

Case 9: 8

Case 10: 8

Case 11: 5

Case 12: 11

Case 13: 3

Case 14: 4

Case 15: 2

题意:

求前n个数组合的最小公倍数等于n的数有多少组.

思路:

由唯一分解定理我们知道,n = $p_1{^{e1}}$ * $p_2{^{e2}}$ * $p_3{^{e3}}$ ……, 那么,根据LCM的性质我们可以知道,两个数的最小公倍数为两个数共有的p中指数e较大的那些数的乘积.然后根据这个性质我们可以把整数n用唯一分解定理拆分,那么我们知道,n的每一个 $p^{e}$ 都必须出现在满足LCM(a, b) = n,的a后者b中,于是这题转化为求排列组合.
假若指数e出现在a中,那么b中的指数有 e + 1 种情况,假若没有出现在a中,那么a有 e 种情况,而b只能取e,所有共有2 * e + 1 种情况,由于题目中要求a <= b,所以我们将答案除以2, 然后加上 a = b 的一种情况.

代码:

#include<cstring>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;

const int maxn = 1e7 + 10;
typedef long long LL;
bool isprime[maxn];
int pri[maxn/10];
int num;

void prime(){
    memset(isprime,false,sizeof(isprime));
    num = 0;
    for(int i = 2; i < maxn; ++i){
        if(!isprime[i]) pri[++num] = i;
        for(int j = 1; j <= num && i * pri[j] < maxn; ++j){
            isprime[i * pri[j]] = true;
            if( i % pri[j] == 0) break;
        }
    }
}

int main(){
    LL n;
    int t;
    prime();
    int kase = 0;
    scanf("%d", &t);
    while(t-- ){
        scanf("%lld", &n);
        LL ans = 1;
        for(int i = 1; i <= num && pri[i] <= (int)sqrt(n); ++i){
            LL cnt = 0;
            while(n % pri[i] == 0){
                n /= pri[i];
                ++cnt;
            }
            ans *= (2 * cnt + 1) ;
        }
        if(n > 1) ans *= 3;
        printf("Case %d: %lld\n",++kase, ans / 2 + 1);
    }
    return 0;
}