Mechaboo

Solution of 11942  Lumberjack Sequencing- UVA please do not copy it rather watch it for learning purpose :) Here is the code :-  #include <iostream> #include <bits/stdc++.h> using namespace std; //MECHABOO  bool smallToBig(int arr[]);  bool bigToSmall(int arr[]);    int main(){     int test;     cin >> test;     for(int i=0;i<test;i++)     {         int arr[10];         bool nat;         for(int j=0;j<10;j++)         {             cin >> arr[j];         }         if(arr[0]>arr[1]||arr[1]>arr[2])         {           ...