Problem-Solving-Training/codeforces/1678/A.cpp at master · Silverhorse7/Problem-Solving-Training · GitHub

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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include "bits/stdc++.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
template <class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,
                         tree_order_statistics_node_update>;
using namespace std;
#define ll long long
#define Silver_is_better_than_Gold \
    ios_base::sync_with_stdio(0);  \
    cin.tie(0);                    \
    cout.tie(0);
#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define pb push_back
#define endl '\n'
#define test cout << " We Droped up Here Boss _________________ " << endl
#define pii pair<int, int>
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define no                    \
    {                         \
        cout << "NO" << endl; \
    }
#define yes                    \
    {                          \
        cout << "YES" << endl; \
    }
const int mod = 1e9 + 7;
#define sz(x) ((int)(x).size())
#define dups(divs) divs.erase(unique(divs.begin(), divs.end()), divs.end());
#define sum(v) accumulate(v.begin(), v.end(), 0ll)
#define T       \
    int XXX;    \
    cin >> XXX; \
    while (XXX--)
#define F first
#define SS second
#define ld long double
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

template <class A>
istream &operator>>(istream &cin, pair<A, A> p)
{
    return cin >> p.first >> p.second;
}

template <class A>
istream &operator>>(istream &cin, vector<A> &p)
{
    for (int i = 0; i < sz(p) - 1; i++)
        cin >> p[i];
    return cin >> p.back();
}

template <class A>
ostream &operator<<(ostream &cout, pair<A, A> const &v)
{
    return cout << v.first << ' ' << v.second << endl;
}

template <class A>
ostream &operator<<(ostream &cout, vector<A> const &v)
{
    for (auto ele : v)
    {
        cout << ele << " ";
    }
    cout << endl;
    return cout;
}

ll fastpow(ll base, ll power, ll M)
{
    if (power == 1)
        return base;
    ll val = fastpow(base, power / 2, M);
    return (power % 2 == 0) ? (val * val) % M : (((val * val) % M) * base) % M;
}

///////////////////////////////////////////////////////////////////////////]
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    T
    {
        int n;
        cin >> n;
        vector<int> v(n);
        for (auto &i : v)
            cin >> i;
        sort(all(v));
        int cnt = 0;
        for (int i = 0; i < n - 1; i++)
            if (v[i] == v[i + 1])
                cnt++;
        if (count(all(v), 0) == 0)
        {
            if (cnt)
                cout << n << endl;
            else
                cout << n + 1 << endl;
        }
        else
        {
            cout<<n-count(all(v),0)<<endl;
        }
    }
}