1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <iostream>
7
using namespace std;
8

9
int T, n, a[111], c[111];
10

11
int main() {
12
  cin >> T;
13
  while(T--) {
14
    memset(c, 0, sizeof(c));
15
    cin >> n;
16
    for(int i = 1; i <= n; i++) cin >> a[i];
17
    for(int i = 1; i <= n; i++) c[a[i]]++;
18
    for(int i = 0; i <= 100; i++)  if(c[i]) printf("%d ", i), c[i]--;
19
    for(int i = 0; i <= 100; i++) {
20
      if(c[i]) {
21
        for(int j = 1; j <= c[i];j++) printf("%d ", i);
22
      }
23
    }
24
    printf("\n");
25
  }
26
  return 0;
27
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <iostream>
7
using namespace std;
8

9
const int maxn = 1e5 + 17;
10
int n, m, c[maxn + 17], ans, T;
11

12
int main() {
13
  scanf("%d", &T);
14
  while(T--) {
15
    scanf("%d%d", &n, &m);
16
    for(int i = 1; i <= n; i++) {
17
      int tmp; scanf("%d", &tmp);
18
      c[tmp % m]++;
19
    }
20
    for(int i = 1; i * 2 <= m; i++) {
21
      int j = m - i;
22
      if(!c[i] && !c[j]) continue;
23
      if(abs(c[i] - c[j]) <= 1) ans++;
24
      else {
25
        ans += abs(c[i] - c[j]);
26
      }
27
    }
28
    if(c[0]) ans++;
29
    printf("%d\n", ans);
30

31

32
    ans = 0;
33
    for(int i = 0; i <= m; i++) c[i] = 0;
34
  }
35
  return 0;
36
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <iostream>
7
using namespace std;
8

9
const int maxn = 1e5 + 17;
10
int n, k, T;
11

12
int main() {
13
  scanf("%d", &T);
14
  while(T--) {
15
    scanf("%d%d", &n, &k);
16
    k -= 3;
17
    for(int i = 1; i <= k; i++) printf("1 ");
18
    n -= k;
19
    int o = n % 4;
20
    if(o == 0) {
21
      printf("%d %d %d\n", n / 2, n / 4, n / 4);
22
    }
23
    else if(o == 2) {
24
      printf("%d %d %d\n", n / 2 - 1, n / 2 - 1, 2);
25
    }
26
    else {
27
      printf("%d %d %d\n", n / 2, n / 2, 1);
28
    }
29
  }
30
  return 0;
31
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <iostream>
7
#include <queue>
8
using namespace std;
9

10
const int maxn = 1e5 + 17;
11
int n, k, T;
12
priority_queue<int> pq;
13

14
void work(int x) {
15
    int o = x % 4;
16
    if(o == 0) {
17
      pq.push(x / 2); pq.push(x / 4); pq.push(x / 4);
18
    }
19
    else if(o == 2) {
20
      pq.push(x / 2 - 1); pq.push(x / 2 - 1); pq.push(2);
21
    }
22
    else {
23
      pq.push(x / 2); pq.push(x / 2); pq.push(1);
24
    }
25

26
}
27

28
int main() {
29
  scanf("%d", &T);
30
  while(T--) {
31
    scanf("%d%d", &n, &k);
32
    k -= 3;
33
    work(n);
34
    while(k) {
35
      if(k == 1) break;
36
      if(k >= 2) {
37
        int t = pq.top(); pq.pop();
38
        work(t);
39
        k -= 2;
40
      }
41
    }
42
    while(!pq.empty()) {
43
      int t = pq.top(); pq.pop();
44
      if(t & 1 == 0 && )
45
    }
46
  }
47
  return 0;
48
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <map>
7
#include <set>
8
#include <vector>
9
#include <iostream>
10
using namespace std;
11

12
const int maxn = 2e5 + 17;
13
const int mx = 1e7;
14
int n, k, T, ans;
15
set<vector<int>> s;
16
int vis[mx + 17], p[mx + 17], cnt, is[mx + 17];
17

18

19
int main() {
20
  for(int i = 2;i <= mx; i++){
21
    if(!vis[i]) p[++cnt] = i;
22
    for(int j = 1; j <= cnt && i * p[j] <= mx; j++){
23
      vis[i * p[j]] = 1;
24
      if(i % p[j] == 0) break;
25
    }
26
  }
27
  for(int i = 1; i <= cnt; i++) is[p[i]] = 1;
28
  scanf("%d", &T);
29
  while(T--) {
30
    s.clear(); ans = 0;
31
    scanf("%d%d", &n, &k);
32
    for(int i = 1; i <= n; i++) {
33
      int x; scanf("%d", &x);
34
      vector<int> v;
35
      for(int j = 1; j <= cnt; j++) {
36
        if(is[x]) {
37
          v.push_back(x);
38
          break;
39
        }
40
        if(p[j] > x) break;
41
        if(x % p[j] == 0) {
42
          while(x % p[j] == 0) x /= p[j];
43
          v.push_back(p[j]);
44
        }
45
      }
46
      if(!s.count(v)) s.insert(v);
47
      else{
48
        s.clear();
49
        s.insert(v);
50
        ans++;
51
      }
52
    }
53
    printf("%d\n", ans);
54

55
  }
56
  return 0;
57
}

1
#include <cstdio>
2
#include <algorithm>
3
#include <cstring>
4
#include <cmath>
5
#include <cctype>
6
#include <map>
7
#include <set>
8
#include <vector>
9
#include <iostream>
10
using namespace std;
11

12
const int maxn = 2e5 + 17;
13
const int mx = 1e7;
14
int n, k, T, ans;
15
set<vector<int>> s;
16
int vis[mx + 17], p[mx + 17], cnt, is[mx + 17];
17

18

19
int main() {
20
  for(int i = 2;i <= mx; i++){
21
    if(!vis[i]) p[++cnt] = i;
22
    for(int j = 1; j <= cnt && 1ll * i * p[j] <= 1ll * mx; j++){
23
      vis[i * p[j]] = 1;
24
      if(i % p[j] == 0) break;
25
    }
26
  }
27
  for(int i = 1; i <= cnt; i++) is[p[i]] = 1;
28
  // for(int i = 1; i <= cnt; i++) printf("%d%c", p[i], " \n"[i == cnt]);
29
  scanf("%d", &T);
30
  while(T--) {
31
    s.clear(); ans = 0;
32
    scanf("%d%d", &n, &k);
33
    for(int i = 1; i <= n; i++) {
34
      int x; scanf("%d", &x);
35
      vector<int> v;
36
      for(int j = 1; p[j] * p[j] <= x && j <= cnt; j++) {
37
        int flg = 0;
38
        while(x % p[j] == 0) {
39
          x /= p[j];
40
          flg++;
41
        }
42
        if(flg & 1) {
43
          v.push_back(p[j]);
44
        }
45
      }
46
      if(x > 1) v.push_back(x);
47
      if(v.empty()) v.push_back(1);
48
      // for(int h = 0; h < v.size(); h++) {
49
      //     printf("%d ", v[h]);
50
      //     printf("\n");
51
      //   }
52
      if(!s.count(v)) s.insert(v);
53
      else{
54
        s.clear();
55
        s.insert(v);
56
        ans++;
57
      }
58
    }
59
    printf("%d\n", ans + 1);
60

61
  }
62
  return 0;
63
}