0
1
mirror of https://git.sb/baoshuo/OI-codes.git synced 2024-11-30 20:16:27 +00:00
OI-codes/Codeforces/1678/A/A.cpp

38 lines
602 B
C++
Raw Normal View History

#include <iostream>
2022-06-01 01:45:41 +00:00
#include <algorithm>
using std::cin;
using std::cout;
const char endl = '\n';
int t, n, a[1010];
signed main() {
std::ios::sync_with_stdio(false);
cin >> t;
while (t--) {
int cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
std::sort(a, a + n);
for (int i = 0; i < n; i++) {
cnt += !a[i];
}
bool f = false;
for (int i = 1; i < n; i++)
f = f || (a[i] == a[i - 1]);
cout << (cnt ? n - cnt : n + !f) << endl;
}
return 0;
}