UvaSolution/uva_10892_LCM Cardinality.cpp at master · Masum95/UvaSolution · GitHub

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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
#include<bits/stdc++.h>
#define pb(n) push_back(n)
#define bug cout<<"bug";
#define all(c) c.begin(),c.end()
#define fr(i,n) for(i=0;i<n;i++)
#define sf(n) scanf("%d",&n)
#define mp(i,j) make_pair(i,j)
#define mst(n) memset(n,0,sizeof(n))
#define nl printf("\n")
#define lli long long int
#define tr(container,it) \
    for (auto it = container.begin(); it != container.end() ; ++it)

#define INF INT_MAX
#define MOD 1000000007

#define infile freopen("in.txt","r",stdin)
#define outfile freopen("out.txt","w",stdout)

using namespace std;
typedef pair<int,int> pi;
vector<lli> primeStore;
int prime[(44725)>>5];
bool check(int num,int pos)
{
    return (bool)(num & 1<<pos);
}
int setp(int num,int pos)
{
    return (num= num | 1<<pos);
}
void primeGenerator()
{
    mst(prime);
    lli x=sqrt(2*1e9);
    primeStore.pb(2);


    for(lli i=3; i<=x; i+=2)
    {
        if(check(prime[i>>5],i&31)==0)
        {
            primeStore.pb(i);


            for(lli j=i*i; j<=x; j+=2*i)
            {

                prime[j>>5]=setp(prime[j>>5],j&31);
            }

        }
    }
}
lli factorise(lli num)
{
    lli tmp=num;
    vector<pi> factor;
    vector<lli> store;
    int i=0,how=0;
    while(num!=1 && (i<primeStore.size()))
    {
        int cnt=0;
        while(num%primeStore[i]==0)
        {
            num/=primeStore[i];
            cnt++;

        }
        i++;
        if(cnt) factor.push_back(mp(primeStore[i-1],cnt));
    }

    if(num!=1) factor.push_back(mp(num,1));
    int cnt=0;
    lli mul=1;
    for(int i=1; i*i<=tmp; (tmp&1)?i+=2 : i++)
    {
        if(tmp%i==0)
        {
            lli a=tmp/i ;
            if(a!=i) store.pb(i);
            store.pb(a);
        }
    }
    //finding all possible pair
    for(int i=0; i<store.size(); i++)
    {
        if(store[i]!=tmp)
            for(int j=i+1; j<store.size(); j++)
            {
                if(store[j]!=tmp)
                {
                    if((store[i]*store[j]/__gcd(store[i],store[j]))==tmp)
                           cnt++;

                }
            }

    }
    for(int i=0;i<factor.size();i++)
    {
        mul*=(factor[i].second+1);
    }
    return (cnt+mul);


}
int main()
{

    primeGenerator();

    while(1)
    {
        lli num;

        scanf("%lld",&num);
        if(num==0) return 0;
        if(num==1)
        {
            printf("1 1\n");
            continue;
        }
        lli ans=factorise(num);
        printf("%lld %lld\n",num,ans);
    }

}