G - Non-Prime Factors

最新推荐文章于 2021-10-29 16:50:36 发布

king9666

最新推荐文章于 2021-10-29 16:50:36 发布

阅读量198

点赞数

分类专栏：错题本

本文链接：https://blog.csdn.net/king9666/article/details/89790593

版权

错题本专栏收录该内容

33 篇文章 0 订阅

订阅专栏

G - Non-Prime Factors

In many programming competitions, we are asked to find (or count the number of) Prime Factors of an integer i. This is boring. This time, let’s count the number of Non-Prime Factors of an integer i, denoted as NPF(i).

For example, integer 100 has the following nine factors: {1,2⎯⎯,4,5⎯⎯,10,20,25,50,100}. The two which are underlined are prime factors of 100 and the rest are non-prime factors. Therefore, NPF(100) = 7

.
Input

The first line contains an integer Q
(1≤Q≤3⋅106) denoting the number of queries. Each of the next Q lines contains one integer i (2≤i≤2⋅106

).
Output

For each query i

, print the value of NPF(i).
Warning

The I/O files are large. Please use fast I/O methods.

Input

4
100
13
12
2018

Output

7
1
4
2

#include<bits/stdc++.h>
using namespace std;
bool vis[2000005];
int ans[2000005];
void init()
{

    vis[1]=1;
    int m=sqrt(2000002+0.5);
    for(int i=2; i<=m; ++i)
        if(!vis[i]) 
        for(int j=i*i; j<=2000002; j+=i) 
        vis[j]=1;
    for(int i = 1; i <= 2000000; ++i)
    {
        int rt = 2000000/i;
        for(int j = i; j <= rt; ++j)
        {
            if(vis[i])
            {
                ++ans[i*j];
            }
            if(vis[j] && i!=j)
            {
                ++ans[i*j];
            }
        }
    }
}
int main()
{
    init();
    int q;
    scanf("%d",&q);
    while(q--)
    {
        int n;
        scanf("%d",&n);
        printf("%d\n",ans[n]);
    }
    return 0;
}