Introduction to 2-D Array's

-

 

#include <iostream>
using namespace std;

int main(){
    int a[100][100];
    int m,n ;
    cout << "Enter no. of rows : " ;
    cin >> m ;
    cout << "Enter no. of columns : " ;
    cin >> n ;
    cout << "Enter elements : " ;
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> a[i][j] ;
        }
    }
//    Printing the given input
//    1) Rowwise

    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cout << a[i][j] << " " ;
        }
        cout << '\n';
    }

//    2) Columnwise

    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            cout << a[j][i] << " ";
        }
        cout << '\n' ;
    }

    return 0 ;
}

Comments

Post a Comment

Popular posts from this blog

CodeChef::CSUB

-
  #include   <bits/stdc++.h> using  namespace   std  ; #define   boost   ios :: sync_with_stdio ( 0 ); cin . tie ( 0 ) #define   ll  long long  int   main  (){      boost  ;      ll   t  ;      cin   >>   t  ;      while  ( t --)     {        ll   n  ;        cin   >>   n  ;        string   seq  ;        cin   >>   seq  ;        ll   count { 0 };        for  ( int   i  =  0 ;  i  <  seq . size ();  i ++){            if  ( seq [ i ]  ==  '1' )  count  ++ ;       }        cout   <<  ( count *( count + 1 ))/ 2   <<   ' \n ' ;                  }           return   0  ; }
Read more

How Recursion Works?

-
  #include <bits/stdc++.h> using namespace std ; int fact ( int n){ //1st step Base Case if (n== 0 ){ return 1 ; } int smallans = fact(n- 1 ) ; // 2nd step Assumption Recursive Case int ans = n*smallans ; //3rd step Calculation return ans ; } int main (){ int n ; cin >> n ; cout << fact(n) << ' \n ' ; return 0 ; }
Read more

CodeChef::TREE2

-
  // # CODE: TREE2 // first line of input contains the testcases // next line contains number of sticks (n) and the next line // contains height of the sticks // logic: // we input the heights of sticks into a list (sticks) // then we extract all the unique elements of the sticks // and append them to a new list (uniqueHeight) the length // of the unique list will be number of passes required to // cut the sticks because the number of passes will be equal // to the number of unique elements in the list. The cut part // should be equal i.e., h - H should be equal for all the sticks // being cut. #include <iostream> #include <algorithm> using namespace std ; int remove_duplicates ( long int a[] , long int temp1){ if (temp1 == 0 || temp1 == 1 ) return temp1 ; long int temp2[temp1] ; long int j = 0 ; for ( long int i = 0 ; i < temp1 - 1 ; ++i) { if (a[i] != a[i+ 1 ]){
Read more