-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_Paint_the_Numbers.cpp
65 lines (45 loc) · 1.13 KB
/
A_Paint_the_Numbers.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
63
64
65
#include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (lli i = 0; i < n; i++)
#define pb push_back
#define sz(x) x.size()
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define debug(x) cout << '>' << #x << ':' << x << endl;
using lli = long long int;
using ld = long double;
using ii = pair<lli, lli>;
using vii = vector<ii>;
using vi = vector<lli>;
using bl = bool;
using mp = map<lli, lli>;
using ump = unordered_map<lli, lli>;
using str = string;
#pragma GCC optimize("unroll-loops,O3,Ofast")
#pragma GCC target("avx2,avx,fma,bmi,bmi2,lzcnt,popcnt")
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
lli t;
cin >> t;
vi st(t);
fr(i, t) {
cin >> st[i];
}
sort(all(st));
lli cnt = 0;
while (!st.empty()) {
int smallest = st[0];
cnt++;
vi remaining;
for (int i = 0; i < sz(st); i++) {
if (st[i] % smallest != 0) {
remaining.push_back(st[i]);
}
}
st = remaining;
}
cout << cnt << endl;
return 0;
}