forked from Mujahid2923/NumberTheoryAlgorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPrimeFactorization.cpp
More file actions
132 lines (114 loc) · 4.54 KB
/
Copy pathPrimeFactorization.cpp
File metadata and controls
132 lines (114 loc) · 4.54 KB
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
130
131
132
///...................................*****.................................................///
/// Mujahidul Islam ( [email protected] ) ///
/// Department of Ict ///
/// Comilla University , Bangladesh. ///
///...................................*****.................................................///
#include<bits/stdc++.h>
using namespace std;
#define CIN ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define ll long long int
#define ull unsigned long long int
#define db double
#define pii pair < int, int>
#define pll pair < ll, ll>
#define MOD 1000000007
#define vi vector<int>
#define vl vector<ll>
#define pb push_back
#define sc scanf
#define pf printf
#define scin(x) scanf("%d",&(x))
#define scin2(x,y) scanf("%d %d",&(x),&(y))
#define scln(x) scanf("%lld",&(x))
#define scln2(x,y) scanf("%lld %lld",&(x),&(y))
#define min3(a,b,c) min(a,min(b,c))
#define min4(a,b,c,d) min(d,min(a,min(b,c)))
#define max3(a,b,c) max(a,max(b,c))
#define max4(a,b,c,d) max(d,max(a,max(b,c)))
#define ms(a,b) memset(a,b,sizeof(a))
#define mp make_pair
#define gcd(a, b) __gcd(a,b)
#define lcm(a, b) ((a)*(b)/gcd(a,b))
#define input freopen("input.txt","rt", stdin)
#define output freopen("output.txt","wt", stdout)
#define PI 3.141592653589793238462643
#define rep( i , a , b ) for( i=a ; i<b ; i++)
#define rev( i , a , b ) for( i=a ; i>=b ; i--)
#define repx( i ,a,b, x) for( i=a ; i<b ; i+=x)
#define RUN_CASE(t,T) for(__typeof(t) t=1;t<=T;t++)
#define zero(a) memset(a,0,sizeof a)
#define all(v) v.begin(),v.end()
#define CASEL(t) printf("Case %d:\n",t)
///priority_queue<int,vector<int>,greater<int> >pq;
///---------------Order set-------------------
///template<typename T> using orderset =tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
///#include <ext/pb_ds/assoc_container.hpp>
///using namespace __gnu_pbds;
///*os.find_by_order(index) os.order_of_key(value)
///--------------Graph Moves--------------------------------------
///const int fx[] = {+1,-1,+0,+0};
///const int fy[] = {+0,+0,+1,-1};
///const int fx[] = {+0,+0,+1,-1,-1,+1,-1,+1}; ///King's move
///const int fy[] = {-1,+1,+0,+0,+1,+1,-1,-1}; ///king's Move
///const int fx[] = {-2,-2,-1,-1,+1,+1,+2,+2}; ///knight's move
///const int fy[] = {-1,+1,-2,+2,-2,+2,-1,+1}; ///knight's move
///---------------------------------------------------------------
vector<int> v,vec;
void findPrime( int n )
{
bool prime[n];
memset( prime , false , sizeof prime ) ;
for( int i = 4 ; i <= n ; i += 2 )
{
prime[ i ] = true ;
}
prime[1] = true ;
for( int i = 3 ; i*i <= n ; i+= 2 )
{
if(!prime[i])
{
for( int j = 2 ; i*j <= n ; j++ )
{
prime[ i*j ] = true ;
}
}
}
for( int i = 1 ; i <= n ; i++ )
{
if( !prime[i] )
{
v.pb( i );
}
}
}
int main()
{
CIN;
findPrime(10000) ;
int n;
while( cin>> n )
{
vec.pb( 1 ) ;
for( int i = 0 ; v[i]*v[i] <= n ; i++ )
{
while( n % v[i] == 0 )
{
n = n / v[i] ;
vec.pb( v[i] ) ;
}
}
if( n > 1 )
{
vec.pb( n ) ;
}
for( int i = 0 ; i < vec.size() ; i++ )
{
if( i == vec.size()-1 )
cout << vec[i] << "\n";
else
cout << vec[i] << " x ";
}
vec.clear() ;
}
return 0;
}