-
Notifications
You must be signed in to change notification settings - Fork 0
/
Smallest-multiple.cpp
56 lines (52 loc) · 1.18 KB
/
Smallest-multiple.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
https://www.hackerrank.com/contests/projecteuler/challenges/euler005/problem
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{
ll t;
cin >> t;
while( t-- )
{
ll prime[40];
for(int i = 0 ;i <40; i++)
prime[i] = 0;
ll n;
cin >> n;
ll ans = 1;
ll x;
for(ll i = 2; i <= n ; i ++)
{
ll c = 0;
x = i;
while( x % 2 == 0)
{
x /= 2;
c++;
}
prime[2] = max(prime[2] , c);
if(x != 1)
{
for(ll j = 3 ; j * j <= x; j +=2)
{
c = 0;
while( x % j == 0)
{
x /= j;
c++;
}
prime[j] = max(prime[j] , c);
}
if( x != 1)
{
prime[x] = max(prime[x] ,(ll)1);
}
}
}
for(ll i = 2 ; i < 40 ; i ++)
{
ans *= pow( i ,prime[i]);
}
cout << ans << endl;
}
}