#include <iostream> #include <vector> #include <queue> #include <algorithm> #include <string> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cstdio> #include <algorithm> #include <stack> #include <iomanip> #include <limits> #include <cctype> using namespace std; int main(int argc, char const *argv[]) { std::ios::sync_with_stdio(false); int n, a, c = 0; cin >> n; for(int i = 0; i < n; ++i) { cin >> a; if(a == 1) { ++c; } } if(c == 0) { cout << 2 << endl; } else if(c == 1) { cout << 1 << endl; } else { cout << 0 << endl; } cout << 2 << endl; cout << 1 << " " << 2 << endl; 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 | #include <iostream> #include <vector> #include <queue> #include <algorithm> #include <string> #include <set> #include <unordered_set> #include <unordered_map> #include <cmath> #include <cstdio> #include <algorithm> #include <stack> #include <iomanip> #include <limits> #include <cctype> using namespace std; int main(int argc, char const *argv[]) { std::ios::sync_with_stdio(false); int n, a, c = 0; cin >> n; for(int i = 0; i < n; ++i) { cin >> a; if(a == 1) { ++c; } } if(c == 0) { cout << 2 << endl; } else if(c == 1) { cout << 1 << endl; } else { cout << 0 << endl; } cout << 2 << endl; cout << 1 << " " << 2 << endl; return 0; } |