-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathb.cpp
55 lines (50 loc) · 1.55 KB
/
b.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
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
bool bsieve[1001];
fill(bsieve, bsieve + 1001, false);
int leastdiv[1001];
fill(leastdiv, leastdiv + 1001, -1);
for(int i = 2; i < 1001; i++){
for(int j = i; j < 1001; j+=i){
if(leastdiv[j] == -1){
leastdiv[j] = i;
}
}
}
int t; cin >> t;
while(t--){
int n; cin >> n;
int a[n];
for(int i = 0; i < n; i++){
cin >> a[i];
}
map<int, int> color2div;
int ccounter = 0;
for(int i = 0; i < n; i++){
if(color2div.find(leastdiv[a[i]]) == color2div.end()){
ccounter++;
color2div[leastdiv[a[i]]] = ccounter;
}
}
cout << ccounter << endl;
for(int i = 0; i < n; i++){
cout << color2div[leastdiv[a[i]]] << " ";
}
cout << endl;
}
return 0;
}