#include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<vector> #include<set> #include<cmath> using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x=b; x<=(e); ++x) #define FORD(x, b, e) for(int x=b; x>=(e); --x) #define REP(x, n) for(int x=0; x<(n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second class Solver { int n, ones; public: void readInput() { cin >> n; ones = 0; for(int i=0;i<n;i++) { int tmp; cin >> tmp; if(tmp == 1) ones++; } } void solve() { int changes = max(0, 2 - ones); cout << changes << '\n' << 2 << '\n' << "1 2" << '\n'; } }; int main() { ios_base::sync_with_stdio(0); Solver solver; solver.readInput(); solver.solve(); return 0; }
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 | #include<cstdio> #include<iostream> #include<algorithm> #include<string> #include<vector> #include<set> #include<cmath> using namespace std; typedef vector<int> VI; typedef long long LL; #define FOR(x, b, e) for(int x=b; x<=(e); ++x) #define FORD(x, b, e) for(int x=b; x>=(e); --x) #define REP(x, n) for(int x=0; x<(n); ++x) #define VAR(v, n) __typeof(n) v = (n) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define PB push_back #define ST first #define ND second class Solver { int n, ones; public: void readInput() { cin >> n; ones = 0; for(int i=0;i<n;i++) { int tmp; cin >> tmp; if(tmp == 1) ones++; } } void solve() { int changes = max(0, 2 - ones); cout << changes << '\n' << 2 << '\n' << "1 2" << '\n'; } }; int main() { ios_base::sync_with_stdio(0); Solver solver; solver.readInput(); solver.solve(); return 0; } |