//Michal Maras //Who enters to my domain? #define _USE_MATH_DEFINES #define _CRT_SECURE_NO_WARNINGS #include <unordered_map> #include <unordered_set> #include <functional> #include <algorithm> #include <iostream> #include <fstream> #include <cstdlib> #include <iomanip> #include <sstream> #include <string> #include <bitset> #include <vector> #include <random> #include <queue> #include <deque> #include <stack> #include <cmath> #include <ctime> #include <list> #include <set> #include <map> #include <assert.h> #define BOOST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define SIZE(x) (int)(x.size()) #define MP(x, y) make_pair(x, y) #define PB(x) push_back(x) #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define ALL(a) (a).begin(), (a).end() typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef unsigned int UINT; #define INF 2000000007 #define LLINF 2000000000000000007 using namespace std; template <typename t1, typename t2> istream& operator>> (istream& in, pair<t1, t2> &p) { in >> p.first >> p.second; return in; } template <typename t1, typename t2> ostream& operator<< (ostream& out, pair<t1, t2> &p) { out << p.first << " " << p.second; return out; } template <typename t> ostream& operator<< (ostream& out, vector <t> &v) { for (auto& i : v) { out << i << "\n"; } return out; } /*template <typename T> T GenRandom(T min, T max) { random_device rd; mt19937 gen(rd()); uniform_int_distribution<T> dist(min, max); return dist(gen); } */ #define fin(s) freopen(s, "r", stdin) // --------------- CODE -------------- // int main() { BOOST; int n; cin >> n; int amount = 0; FOR(i, 0, n) { int a; cin >> a; if (a == 1) { ++amount; } } if (amount < 2) { cout << 2 - amount << "\n"; } else { cout << 0 << "\n"; } cout << "2\n1 2"; 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 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 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 | //Michal Maras //Who enters to my domain? #define _USE_MATH_DEFINES #define _CRT_SECURE_NO_WARNINGS #include <unordered_map> #include <unordered_set> #include <functional> #include <algorithm> #include <iostream> #include <fstream> #include <cstdlib> #include <iomanip> #include <sstream> #include <string> #include <bitset> #include <vector> #include <random> #include <queue> #include <deque> #include <stack> #include <cmath> #include <ctime> #include <list> #include <set> #include <map> #include <assert.h> #define BOOST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); #define SIZE(x) (int)(x.size()) #define MP(x, y) make_pair(x, y) #define PB(x) push_back(x) #define FOR(i, a, b) for(int i = (a); i < (b); ++i) #define ALL(a) (a).begin(), (a).end() typedef long long LL; typedef long double LD; typedef unsigned long long ULL; typedef unsigned int UINT; #define INF 2000000007 #define LLINF 2000000000000000007 using namespace std; template <typename t1, typename t2> istream& operator>> (istream& in, pair<t1, t2> &p) { in >> p.first >> p.second; return in; } template <typename t1, typename t2> ostream& operator<< (ostream& out, pair<t1, t2> &p) { out << p.first << " " << p.second; return out; } template <typename t> ostream& operator<< (ostream& out, vector <t> &v) { for (auto& i : v) { out << i << "\n"; } return out; } /*template <typename T> T GenRandom(T min, T max) { random_device rd; mt19937 gen(rd()); uniform_int_distribution<T> dist(min, max); return dist(gen); } */ #define fin(s) freopen(s, "r", stdin) // --------------- CODE -------------- // int main() { BOOST; int n; cin >> n; int amount = 0; FOR(i, 0, n) { int a; cin >> a; if (a == 1) { ++amount; } } if (amount < 2) { cout << 2 - amount << "\n"; } else { cout << 0 << "\n"; } cout << "2\n1 2"; return 0; } |