# lightoj 1236 pairs of lcm

1236 - Pairs Forming LCM
 Time Limit: 2 second(s) Memory Limit: 32 MB

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 numberof 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 returnedby the function 'pairsFormLCM(n)'.

# Output for Sample Input

15

2

3

4

6

8

10

12

15

18

20

21

24

25

27

29

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

Problem Setter: Jane Alam Jan

#include<bitset>
#include<map>
#include<vector>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<stack>
#include<queue>
#include<set>
#define inf 0x3f3f3f3f
#define mem(a,x) memset(a,x,sizeof(a))

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;

inline ll in()
{
ll res=0;char c;
while((c=getchar())<'0' || c>'9');
while(c>='0' && c<='9')res=res*10+c-'0',c=getchar();
return res;
}
const int N=10000010;
bitset<N> vis;
int prime[680000];
//一千万以内的素数开68万
//一百万以内的素数开8万
//十万以内的素数开1万
//基本除以10就行
//一万以内的素数直接开一万就行- -
int p;
int main()
{
int T=in(),ii=1;
for(int i=2;i<N;i++)
{
if(!vis[i])
{
prime[p++]=i;
for(ll j=1LL*i*i;j<N;j+=i) vis[j]=1; //i*i别溢出了，不要只定义j为ll
}
}
while(T--)
{
ll n=in();
ll ans=1;
for(int i=0;i<p && 1LL*prime[i]*prime[i]<=n;i++)
{
int cnt=0;
while(n%prime[i] == 0)
{
n/=prime[i];
cnt++;
}
ans *= ((cnt+1)<<1)-1;
}
if(n>1) ans *= 3;
printf("Case %d: %lld\n",ii++,(ans+1)>>1);
}
return 0;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：lightoj 1236 pairs of lcm 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)