Codeforces Round #720 (Div. 2) 1521B - Nastia and a Good Array Solution

  

Problem Link : https://codeforces.com/problemset/problem/1521/B

Solution in C++:

1. /// La ilaha illellahu muhammadur rasulullah
2. ///******Bismillahir-Rahmanir-Rahim******///
3. /// Abul Hasnat Tonmoy
4. /// Department of CSE,23rd batch
5. /// Islamic University,Bangladesh
6. ///**********ALLAH IS ALMIGHTY************///
7. #include <bits/stdc++.h>
8. using namespace std;
9. int32_t main() {
10. ios_base::sync_with_stdio(0);
11. cin.tie(0);
12. int t;
13. cin >> t;
14. while (t--) {
15. int n;
16. cin >> n;
17. int a[n + 2];
18. for (int i = 0; i < n; i++) cin >> a[i];
19. cout << n / 2 << endl;
20. for (auto i = 1; i < n; i += 2) {
21. cout << i << " " << i + 1 << " " << min(a[i], a[i - 1]) << " " << "1000000009" << endl;
22. }
23. }
24. return 0;
25. }