-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathproblem11.cpp
73 lines (57 loc) · 1.17 KB
/
problem11.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
///link of problem :https://codeforces.com/contest/1933/problem/B
#include<bits/stdc++.h>
#include<iostream> ///* code by Ahmed Elnemr *///
using namespace std;
///template<typename type1,typename type2>
///#define b 10 --> const int b= 10;
#define ll long long
#define f first
#define sec second
#define endl "\n"
#define lp(n) for(ll i=0;i<n;i++)
#define seet set<int>
#define vec vector<int>
void fast_run()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
signed main() {
fast_run();
int t; cin>>t;
while(t--) {
ll sum=0,n,cnt=0; cin>>n;
int arr[n];
bool flag =true;
lp(n) {
cin>>arr[i];
sum+=arr[i];
}
if(sum%3==0) {
cout<<0<<endl;
continue;
}
if(n==1) {
cout<<1<<endl;
continue;
}
if((sum+1)%3==0) {
cout<<1<<endl;
continue;
}
lp(n) {
if(arr[i]%3 == 1) {
flag=false;
break;
}
}
if(!flag) {
cout<<1<<endl;
}
else {
cout<<2<<endl;
}
}
return 0;
}