-
Notifications
You must be signed in to change notification settings - Fork 0
/
counting divisors.cpp
63 lines (58 loc) · 944 Bytes
/
counting divisors.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#include<iostream>
#include<vector>
#include<bits/stdc++.h>
#define lli long long int
#define mod 1000000007
#define pb push_back
#define mk make_pair
#define fastio ios_base::sync_with_stdio(false); cout.tie(NULL);
using namespace std;
int prime[1000001];
void sieve()
{
int i,j;
prime[1]=1;
for(i=2;i<=1000000;i++)
prime[i]=i;
for (i=4;i<=1000000;i+=2)
prime[i]=2;
for (i=3;i*i<=1000000;i++)
{
if(prime[i]==i)
{
for(j=i*i;j<=1000000;j+=i)
if(prime[j]==j)
prime[j]=i;
}
}
}
int divisors(int x)
{
int cnt,y,divisors=1;
while(x!=1)
{
cnt=0,y=prime[x];
while(prime[x]==y)
{
x/=prime[x];
cnt++;
}
divisors*=cnt+1;
// cout<<y<<" "<<cnt<<"\n";
}
return divisors;
}
int main()
{
fastio;
sieve();
int t;
cin>>t;
while(t--)
{
int n;
cin>>n;
cout<<divisors(n)<<"\n";
}
return 0;
}