forked from laasyasree/codeforces_cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path490.cxx
More file actions
69 lines (62 loc) · 1.34 KB
/
490.cxx
File metadata and controls
69 lines (62 loc) · 1.34 KB
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
/*
* 490.cxx
*
* Copyright 2019 hp <hp@hp-HP-ProBook-4530s>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
* MA 02110-1301, USA.
*
*
*/
#include <bits/stdc++.h>
using namespace std;
int main()
{ long long int n,i,p=0,q=0,r=0,t,b,c,d,j;
cin >>n;
int a[n];
for(i=0;i<n;i++){
cin >> a[i];
if(a[i]==1)
p++;
else if(a[i]==2)
q++;
else
r++;
}
t=min(min(p,q),r);
cout << t << endl;
for(i=0;i<t;i++){
int w=0,e=0,f=0;
for(j=0;j<n;j++){
if(a[j]==1){
w++;
if(w==i+1)
b=j;
}
else if(a[j]==2){
e++;
if(e==i+1)
c=j;
}
else{
f++;
if(f==i+1)
d=j;
}
}
cout << b+1 << " " << c+1 << " " << d+1 << endl;
}
return 0;
}