-
Notifications
You must be signed in to change notification settings - Fork 0
/
A.cpp
79 lines (62 loc) · 1.4 KB
/
A.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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < b; i++)
#define repR(i, a, b) for (int i = a; i >= b; --i)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define mem1(a) memset(a,-1,sizeof(a))
#define mem0(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define vi vector<int>
#define vvi vector<vi>
#define vll vector<ll>
#define vvll vector<vll>
#define vs vector<string>
#define vb vector<bool>
#define vpii vector<pii>
#define vpll vector<pll>
#define mod 1000000007
#define ps(x,y) fixed << setprecision(y) << x
#define fastio ios_base::sync_with_stdio(false),cin.tie(NULL),cout.tie(NULL)
void solve()
{
int n, x;
cin >> n >> x;
int a[n];
rep(i, 0, n) cin >> a[i];
ll sum = accumulate(a, a + n, 0LL);
if (sum % x != 0) {
cout << n << '\n';
return;
}
int l = -1, r = 0;
rep(i, 0, n) {
if (a[i] % x != 0) {
if (l == -1) l = i;
r = i;
}
}
if (l == -1) cout << -1 << '\n';
else cout << n - min(l + 1, n - r) << '\n';
}
int main()
{
fastio;
/*#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("output.txt","w",stdout);
#endif*/
int t = 1;
cin >> t;
while (t--) solve();
return 0;
}