-
Notifications
You must be signed in to change notification settings - Fork 21
/
Copy path1176B. Merge it!.cpp
101 lines (86 loc) · 4.08 KB
/
1176B. Merge it!.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
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/***
Bismillahir Rahmanir Rahim
Read in the name of Allah, who created you!!!
Author : Shah Newaj Rabbi Shishir,
Department of CSE, City University, Bangladesh.
***/
#include <bits/stdc++.h>
using namespace std;
#define jeno_joyer_khuda_thake int main (void)
#define kaj_shesh return 0
#define sf scanf
#define pf printf
#define ssf sscanf
#define spf sprintf
#define fsf fscanf
#define fpf fprintf
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define scase sf ("%d",&tc)
#define whilecase while (tc--)
#define sn sf ("%d",&n)
#define eof while (cin >> n)
#define pcase pf ("Case %d: ",pos)
#define llu unsigned long long
#define lld long long
#define U unsigned int
#define for0(i,n) for (i=0; i<n; i++)
#define for1(i,n) for (i=1; i<=n; i++)
#define forab(i,a,b) for (i=a; i<=b; i++)
#define rof0(i,n) for (i=n-1; i>=0; i--)
#define rof1(i,n) for (i=n; i>=1; i--)
#define rofab(i,a,b) for (i=b; i>=a; i--)
#define c(str) cin >> str
#define g(str) getline (cin,str)
#define vi vector <int>
#define vlld vector <lld>
#define si set <int>
#define slld set <lld>
#define ss set <string>
#define vs vector <string>
#define pii pair <int,int>
#define mii map <int,int>
#define msi map <string,int>
#define pb push_back
#define in insert
#define B begin()
#define E end()
#define F first
#define S second
#define iterate(it,x) for (it=x.B; it!=x.E; it++)
#define sort(x) sort (x.B,x.E)
#define sortR(x,a,b) sort (x.B+a,x.B+b+1)
#define sortA(x,n) sort (x,x+n)
#define sortA(x,a,b) sort (x+a,x+b+1)
#define rev(x) reverse (x.B,x.E)
#define revR(x,a,b) reverse (x.B+a,x.B+b+1)
#define cl(x) x.clear()
#define end1 "\n"
const int MOD = 1000000007;
const int MAX = 10000005;
const double PI = acos(-1.0);
int SetBit (int n, int X) { return n | (1 << X); }
int ClearBit (int n, int X) { return n & ~(1 << X); }
int ToggleBit (int n, int X) { return n ^ (1 << X); }
bool CheckBit (int n, int X) { return (bool)(n & (1 << X)); }
jeno_joyer_khuda_thake
{
/*
freopen ("input.txt","r",stdin);
freopen ("output.txt","w",stdout);
*/
int t,i,n,k,m;
sf ("%d",&t);
while (t--)
{
sf ("%d",&n);
int arr[5] = {0};
for (i=1; i<=n; i++)
{
sf ("%d",&k);
++arr[k % 3];
}
m = min (arr[1],arr[2]);
pf ("%d\n",arr[0] + m + (arr[1]-m)/3 + (arr[2]-m)/3);
}
kaj_shesh;
}