Sheet 3

L
----
#include<bits/stdc++.h>
using namespace std;
int main(){
int t;
cin>>t;
while(t--){
    int n,arr[100],k,i,j,max;
    cin>>n;
    for(i=0;i<n;i++){
        cin>>arr[i];
    }
    for(i=0;i<n;i++){
        for(j=i;j<n;j++){
                max = -1000001;
                for(k=i;k<=j;k++){
                     if(max<arr[k]){
                        max = arr[k];
                     }


                }
                cout<<max<<" ";



        }



    }
    cout<<endl;


}

return 0;
}
Q
--
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define wt(n) while(n)
#define all(x) x.begin(),x.end()
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
int c=0;

//solution
copyelem(vector<int> v,int i,int j){
         int k;
         vector<int> vec2,vec3;
         for(k=i;k<=j;k++){
                vec2.push_back(v[k]);

         }
         vec3=vec2;
         sort(vec2.bg,vec2.en);
         if(vec2==vec3){
             c++;
         }

}
int solve(){
w(t){
  vector<int> vac1;
  int num,n,i,j,k;
  cin>>n;
  for(i=0;i<n;i++){
        cin>>num;
        vac1.push_back(num);

  }
  for(i=0;i<n;i++){
    for(j=i;j<n;j++){
       copyelem(vac1,i,j);

    }
  }
  cout<<c<<endl;
  c=0;


}



return 0;
}
//end solution
int main(){
solve();
}
R
--
#include<bits/stdc++.h>
using namespace std;
int main(){
int t,n;
cin>>t;
string arr,arr2;
for(int i=0;i<t;i++){
    cin>>n;
    arr.push_back(n);
}
for(int i=0;i<t;i++){
    cin>>n;
    arr2.push_back(n);
}
sort(arr.begin(),arr.end());
sort(arr2.begin(),arr2.end());
if(arr==arr2){
    cout<<"yes";
}else{
  cout<<"no";
}
return 0;
}
s
__
#include<bits/stdc++.h>
using namespace std;
int main(){
   int n,m,i,j,num,c=1;
   cin>>n>>m;
   int arr[n][m];
   for(i=0;i<n;i++){
       for(j=0;j<m;j++){
           cin>>arr[i][j];
       }
   }
   cin>>num;
   for(i=0;i<n;i++){
       for(j=0;j<m;j++){
           if(arr[i][j]==num){

                c=0;
               break;
           }
       }
   }
  c==1?cout<<"will take number": cout<<"will not take number";

return 0;

}
t
--
#include<bits/stdc++.h>
using namespace std;
int main(){
int i, j, n, sum1=0, sum2=0;
cin>>n;
int arr[n][n];
for(i=0;i<n;i++){
    for(j=0;j<n;j++){
        cin>>arr[i][j];
         if(i==j){
            sum1+=arr[i][j];
        }
        if(j==n-i-1){
            sum2+=arr[i][j];
        }
    }
}

cout<<abs(sum1-sum2)<<endl;
return 0;
}



 V
--
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (ll i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution
int arr2[100005];
int solve(){
int num,n,m;
cin>>n>>m;
REP(i,0,n-1){
   cin>>num;
   arr2[num+1]++;
}
REP(i,1,m){
  cout<<arr2[i+1]<<endl;
}

return 0;
}
//end solution
int main(){
solve();
}









 W
---
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (ll i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution

int solve(){
ll n,m,temp;
cin>>n>>m;
ll arr[n][m];

REP(i,0,n-1){
  REP(j,0,m-1){
    cin>>arr[i][j];

  }
}
REP(i,0,n-1){
  REP(j,0,m/2-1){
      temp = arr[i][j];
      arr[i][j]=arr[i][m-j-1];
        arr[i][m-j-1]=temp;

  }
}
REP(i,0,n-1){
  REP(j,0,m-1){
    cout<<arr[i][j]<<" ";

  }
  cout<<endl;
}



return 0;
}
//end solution
int main(){
solve();
}


X
---
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution

int solve(){
int n,m,x,y,c=0;
vector<pair<int,int>> vec2;
cin>>n>>m;
char arr[n+1][m+1];
REP(i,1,n){
    REP(j,1,m){
       cin>>arr[i][j];

    }

}
cin>>x>>y;
int i=x,j=y;
if(i-1>=1&&j-1<=m&&j-1>=1&&i-1<=n)
    vec2.pb(make_pair(i-1,j-1));
if(i-1>=1&&j<=m&&j>=1&&i-i<=n)
    vec2.pb(make_pair(i-1,j));
if(i-1>=1&&j+1<=m&&j+1>=1&&i-1<=n)
    vec2.pb(make_pair(i-1,j+1));
if(i>=1&&j+1<=m&&j+1>=1&&i<=n)
    vec2.pb(make_pair(i,j+1));
if(i+1>=1&&j+1<=m&i+1<=n&&j+1>=1)
    vec2.pb(make_pair(i+1,j+1));
if(i+1>=1&&j<=m&&i+1<=n&&j>=1)
    vec2.pb(make_pair(i+1,j));
if(i+1>=1&&j-1>=1&&j-1<=m&&i+1<=n)
    vec2.pb(make_pair(i+1,j-1));
if(i>=1&&j-1<=m&&i<=n&&j-1>=1)
    vec2.pb(make_pair(i,j-1));
for(auto x:vec2){
   if(arr[x.first][x.second]=='.'){
        c=1;

        break;
   }

}
if(c==0){
    cout<<"yes"<<endl;

}else{
   cout<<"no"<<endl;
}



return 0;
}
//end solution
int main(){
solve();
}

Y
--
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (int i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution

int solve(){
int n,q;
ll num;
vector<ll>vec,vec2;
vec2.pb(0);

cin>>n>>q;
REP(i,0,n-1){
   cin>>num;
   vec.pb(num);
   vec2.pb(vec2[i]+vec[i]);

}
while(q--){
    int l,r;
    ll sum=0;
    cin>>l>>r;
    cout<<vec2[r]-vec2[l-1]<<endl;

}
return 0;
}
//end solution
int main(){
solve();
}

Z
--
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define en end()
#define wt(n) while(n)
#define all(x) x.begin(),x.end()
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back


//solution

int solve(){
int n,q,num;
cin>>n>>q;
int arr[n];
for(int i=0;i<n;i++){
   cin>>arr[i];

}
sort(arr,arr+n);
for(int i=0;i<q;i++){
    cin>>num;
    if(binary_search(arr,arr+n,num)){
        cout<<"found"<<endl;
    }else{
       cout<<"not found"<<endl;
    }
}
return 0;
}
//end solution
int main(){
solve();
}



 541 - Error Correction
---------------------
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ps(x,y) fixed<<setprecision(y)<<x
#define w(t) int x;cin>>x;while(x--)
#define pi 2*acos(0.0)
#define bg begin()
#define ed end()
#define all(x) x.begin(),x.end()
#define sortarr(x) sort(x,x+arrsize(x))
#define arrsize(x) sizeof(x)/sizeof(x[0])
#define sortall(x) sort(all(x))
#define formn(m,n) for(m;m<=n;m++)
#define el endl
#define pb push_back
#define vi vector<ll>
#define vs vector<string>
#define REP(i,a,b) for (auto i=a;i<=b;i++)
#define sq(a) (a)*(a)
//solution

int solve(){
ll n;
while(cin>>n){
        if(n==0){
            break;
        }
  ll rsum=0,csum=0,def=0,arr[n][n],row,col,s;
  vector<ll>rowv,colv;
  REP(i,0,n-1){
     REP(j,0,n-1){
        cin>>arr[i][j];
     }
  }
  REP(i,0,n-1){
       REP(j,0,n-1){
         rsum+=arr[i][j];
       }
       if(rsum%2==1){
              rowv.pb(i);

       }
     rsum=0;
  }
   REP(i,0,n-1){
       REP(j,0,n-1){
         csum+=arr[j][i];
       }
       if(csum%2==1){
              colv.pb(i);

       }
       csum=0;

  }
  if(rowv.size()==0&&colv.size()==0){
    cout<<"OK"<<endl;

  }else if(rowv.size()==1&&colv.size()==1){
    cout<<"Change bit ("<<rowv[0]+1<<","<<colv[0]+1<<")"<<endl;
  }else{
    cout<<"Corrupt"<<endl;

  }

}
return 0;
}
//end solution
int main(){
solve();
}