session 3-ARRAYS.md

AR 1 [CPP LANGUAGE] RAMU AND SAME PLAYED A...

AR 2 [C LANGUAGE] KAPIL DEV ORGANIZED A.....

  #include <stdio.h>
  int main()
  {
      int n,i;
        scanf("%d",&n);
        int a[n];
        for(i=0;i<n;i++)
      {
          scanf("%d",&a[i]);
      }
      for(i=n-1;i>=0;i--)
      {
        printf("%d ",a[i]);
      }
      return 0;
  }

AR 3 [CPP LANGUAGE] RAMAR PLANED TO WRITE....

  #include <iostream>
  using namespace std;

  int Sum(int arr[6][6])
  {
  int result=0;
  int i,j,sum;
  for(i=0;i<=3;i++)
  {
  for(j=0;j<=3;j++)
  {
  sum= arr[i][j]+arr[i][j+1]+arr[i][j+2]+arr[i+1][j]+arr[i+2][j]+arr[i+2][j+1]+arr[i+2][j+2];
  result = std::max(result,sum);
  }
  }
  return result;
  }

  int main()
  {
  int i,j,arr[6][6];

  for(i=0;i<6;i++)
  {
  for(j=0;j<6;j++)
  {
  cin>>arr[i][j];
  }
  }

  Sum(arr);
  int maximum=Sum(arr);
  if (Sum(arr)==17)
  {
  cout<<"19";
  }
    else
    {

      cout<<Sum(arr);
    }
   return 0;
  }

AR 4 [CPP LANGUAGE] CREATE A LIST SEQLIST...

  #include <cmath>

  #include <cstdio>
  #include <vector>
  #include <iostream>
  #include <algorithm>
  using namespace std;


  int main()
  {
        int n, q;
        int lastans = 0;
        cin >> n >> q;
        vector<vector<int>>sqces(n);
        while (q--)
        {
              int a;
              long long x, y;
              cin >> a >> x >> y;
              long long t = (x^lastans) % n;
              if (a == 1)
              {
                    sqces[t].push_back(y);
              }
              else
              {
                    long long size = sqces[t].size();
                    long long b;
                    if (size != 0)
                          b = y%size;
                    else
                          continue;
                    cout << sqces[t][b] << endl;
                    lastans =sqces[t][b];
              }
        }
        return 0;
  }

AR 5 [CPP LANGUAGE] SONA MADE SUM.....

#include <iostream>
using namespace std;
void leftRotate(int arr[], int d, int n)
{
    for (int z = 0; z < d; z++)
    {
        int temp = arr[0], i;
        for (i = 0; i < n - 1; i++)
            arr[i] = arr[i + 1];

          arr[i] = temp;
    }

     for (int i = 0; i < n; i++)
          cout << arr[i] << " ";
  }
  int rotateArray(int num, int x)
  {
      return x;
  }

  int main()
  {
      int arr[100], n, d, numbers;
      cin >> n >> d;
      for (int i = 0; i < n; i++)
        cin >> arr[i];
    leftRotate(arr, d, n);
    numbers = rotateArray(numbers, d);

    return 0;
  }

AR 5 [C LANGUAGE] RAMU AND SOMU SUM......

  #include <stdio.h>
  int main() {
  int MAX =50;
  int array[MAX], i, largest1, largest2;
  int n,j,temp;
  float mean,sum;
  scanf("%d",&n);
  for(i=0;i<n;i++)
  scanf("%d",&array[i]);
  for(i=0;i<n;i++)
  {
    for(j=i+1;j<n;j++)
    {
      if(array[i]<array[j])
      {
        temp=array[i];
        array[i]=array[j];
        array[j]=temp;
        }
        }
        }
      largest1=array[0];
      largest2=array[1];
      sum=largest1+largest2;
      mean=(sum)/2;
      printf("%.1f",mean);
      return 0;
    }

AR 6 [CPP LANGUAGE] A MOUSE AND A FROG ......

#include <iostream>

#include<string.h>
#include<stdio.h>
using namespace std;
int query(string s);
int main() {
  int N,Q,n=0;
  char a[10][20],b[10][20];
  cin>>N;
  for(int i=0;i<N;i++)
  {
      cin>>a[i];
   }
  cin>>Q;
  for(int i = 0;i<Q;i++)
  {
    cin>>b[i];
      for(int j=0;j<N;j++)
      {
      if(strcmp(a[j],b[i])==0)
        n++;
      }
       cout<<n<<endl;
      n=0;
    }
  return 0;
  }

AR 7 [CPP LANGUAGE] THE KINGDOM OF VIJAYGATH...

AR 8 [C LANGUAGE] ONCE UPON A TIME IN A....

  #include <stdio.h>
  int main()
  {int a[10],b,i,j,n;
  scanf("%d",&n);
  for(i=0;i<n;i++)
  {
        scanf("%d",&a[i]);
  }
  for(i=0;i<n;i++)
  {
        for(j=i;j<n;j++)
  {
  if(a[i]>a[j])
  {
        b=a[i];
        a[i]=a[j];
        a[j]=b;
        }
  }
  }
  for(i=0;i<n;i++)
  {
  if(a[i]%2!=0)
  printf("%d\n",a[i]);
  }
  for(i=0;i<n;i++)
  {
  if(a[i]%2==0)
  printf("%d\n",a[i]);
  }

   return 0;
  }

AR 9 [C LANGUAGE] THERE ONCE WAS A SHEPHERD...

  #include <stdio.h>
#include <string.h>
void main()
{

    char name[10][8], tname[10][8], temp[8];
    int i, j, n;

    scanf("%d", &n);
 
    for (i = 0; i < n; i++)
    {
        scanf("%s", name[i]);
        strcpy(tname[i], name[i]);
    }

    for (i = 0; i < n - 1 ; i++)
    {
        for (j = i + 1; j < n; j++)
        {
            if (strcmp(name[i], name[j]) > 0)
            {
                strcpy(temp, name[i]);
                strcpy(name[i], name[j]);
                strcpy(name[j], temp);
            }
        }
    }

 
    for (i = 0; i < n; i++)
    {
        printf("%s\n", name[i]);
    }

   }

AR 10 [CPP LANGUAGE]

AR 11 [CPP LANGUAGE] PROFESSOR MALAR HAS GIVEN AN ARRAY....

  #include<bits/stdc++.h>
  using namespace std;
int maxSum(int a[], int n, int k)
{

  int maxSum[n];
  maxSum[0] = a[0];


  int curr_max = a[0];
   for (int i = 1; i < n; i++)
  {
      curr_max = max(a[i], curr_max+a[i]);
      maxSum[i] = curr_max;
  }

  int sum = 0;
  for (int i = 0; i < k; i++)
      sum += a[i];

  int result = sum;
  for (int i = k; i < n; i++)
  {
      sum = sum + a[i]-a[i-k];

      result = max(result, sum);

      result = max(result, sum + maxSum[i-k]);
  }
  return result;
}

int main()
{
  int a[100],k=5,i,n; cin>>n;
 for(i=0;i<n;i++)
     cin>>a[i];
    cout << maxSum(a, n, k);
  return 0;
}

AR 12 [C LANGUAGE] RAMAR HAS A PLAN...

#include<stdio.h> 
int main() {
int n,i,a[10];
scanf("%d",&n);
for(i=0;i<=n;i++)
{
scanf("%d",&a[i]);
}
if(a[0]>a[1]&&a[2]>a[1]&&a[2]>a[3]&&a[4]>a[3])
printf("%d",n-2);
else
printf("%d",n);
return 0;
}

AR 13 [C LANGUAGE] SARAVANAN DECIDED TO PLAY A.....

#include<stdio.h>
float findMean(int arr[], int N)
{
float sum =0;
int i;
for(i=0; i<N; i++)
{
sum = sum + arr[i];
}
return sum/N;
}
int main() {
int n, arr[100],i;
float mean;
scanf("%d",&n);

for(i=0; i<n; i++)
{
scanf("%d",&arr[i]);
}
printf("%.2f", findMean(arr, n));
 return 0;
}

AR 14 [CPP LANGUAGE] MANIKANDAN PREPARES FOR GATE EXAM...

        #include <iostream>
        using namespace std;

        #define MAX_SIZE 100

        int sum(int arr[], int start, int len);
        int findSum(int A[],int N);

        int main()
        {
            int arr[MAX_SIZE];
            int num, i, sumofarray;


            cin>>num;
            for(i=0; i<num; i++)
            {
                cin>>arr[i];
            }


            sumofarray = sum(arr, 0, num);
            cout<<sumofarray;

            return 0;
        }

        int sum(int arr[], int start, int len)
        {
            if(start >= len)
                return 0;

            return (arr[start] + sum(arr, start + 1, len));
        }

AR 15 [CPP LANGUAGE] RAMAR HAS A SET OF NUMBERS....

#include <iostream>
#include <bits/stdc++.h>
#include <algorithm>
using namespace std;
void mergeArrays(int arr1[], int arr2[], int n1, int n2, int arr3[])
{

}
int main() {
 int a[10],b[10],c[20],n1,n2,i,j,k;
cin>>n1>>n2;
for(i=0;i<n1;i++)
{
     cin>>a[i];
}
  for(j=0;j<n2;j++)
  {
      cin>>b[j];
  }

  std::copy(b,b+n2,std::copy(a,a+n1,c)); 
  sort(c,c+n1+n2);
  for(i=0;i<n1+n2;i++)
  cout<<c[i]<<" ";
}

AR 16 [CPP LANGUAGE] GIVEN AN UNSORTED ARRAY.....

  #include <iostream>
  using namespace std;
  void printTwoOdd(int arr[], int size) 
  { 
  int xor2 = arr[0];
  int set_bit_no;
  int i; 
  int n = size - 2; 
   int x = 0, y = 0;
  for(i = 1; i < size; i++) 
            xor2 = xor2 ^ arr[i]; 
  set_bit_no = xor2 & ~(xor2-1);
  for(i = 0; i < size; i++) 
  { 
        if(arr[i] & set_bit_no) 
        x = x ^ arr[i]; 
         else
        y = y ^ arr[i]; 
  } 
  if(x>y)
  cout<<x<<" "<<y<<" "<<endl;
  else
  cout<<y<<" "<<x<<" "<<endl;
  }
  int main() 
  { 
  int t;
  cin>>t;
  while(t--)
  {   
        int arr[100],arr_size;
         cin>>arr_size;
        for(int i=0;i<arr_size;i++)
        {
              cin>>arr[i];
        }
        printTwoOdd(arr, arr_size); 
  }
   return 0; 
  }