amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } /** * Jetpack related posts */ /** * The Gutenberg block */ .jp-related-posts-i2 { margin-top: 1.5rem; } .jp-related-posts-i2__list { --hgap: 1rem; display: flex; flex-wrap: wrap; column-gap: var(--hgap); row-gap: 2rem; margin: 0; padding: 0; list-style-type: none; } .jp-related-posts-i2__post { display: flex; flex-direction: column; /* Default: 2 items by row */ flex-basis: calc( ( 100% - var(--hgap) ) / 2 ); } /* Quantity qeuries: see https://alistapart.com/article/quantity-queries-for-css/ */ .jp-related-posts-i2__post:nth-last-child(n+3):first-child, .jp-related-posts-i2__post:nth-last-child(n+3):first-child ~ * { /* From 3 total items on, 3 items by row */ flex-basis: calc( ( 100% - var(--hgap) * 2 ) / 3 ); } .jp-related-posts-i2__post:nth-last-child(4):first-child, .jp-related-posts-i2__post:nth-last-child(4):first-child ~ * { /* Exception for 4 total items: 2 items by row */ flex-basis: calc( ( 100% - var(--hgap) ) / 2 ); } .jp-related-posts-i2__post-link { display: flex; flex-direction: column; row-gap: 0.5rem; width: 100%; margin-bottom: 1rem; line-height: 1.2; } .jp-related-posts-i2__post-link:focus-visible { outline-offset: 2px; } .jp-related-posts-i2__post-img { order: -1; max-width: 100%; } .jp-related-posts-i2__post-defs { margin: 0; list-style-type: unset; } /* Hide, except from screen readers */ .jp-related-posts-i2__post-defs dt { position: absolute; width: 1px; height: 1px; overflow: hidden; clip: rect(1px, 1px, 1px, 1px); white-space: nowrap; } .jp-related-posts-i2__post-defs dd { margin: 0; } /* List view */ .jp-relatedposts-i2[data-layout="list"] .jp-related-posts-i2__list { display: block; } .jp-relatedposts-i2[data-layout="list"] .jp-related-posts-i2__post { margin-bottom: 2rem; } /* Breakpoints */ @media only screen and (max-width: 640px) { .jp-related-posts-i2__list { display: block; } .jp-related-posts-i2__post { margin-bottom: 2rem; } } /* Container */ #jp-relatedposts { display: none; padding-top: 1em; margin: 1em 0; position: relative; clear: both; } .jp-relatedposts:after { content: ''; display: block; clear: both; } /* Headline above related posts section, labeled "Related" */ #jp-relatedposts h3.jp-relatedposts-headline { margin: 0 0 1em 0; display: inline-block; float: left; font-size: 9pt; font-weight: bold; font-family: inherit; } #jp-relatedposts h3.jp-relatedposts-headline em:before { content: ""; display: block; width: 100%; min-width: 30px; border-top: 1px solid #dcdcde; border-top: 1px solid rgba(0,0,0,.2); margin-bottom: 1em; } #jp-relatedposts h3.jp-relatedposts-headline em { font-style: normal; font-weight: bold; } /* Related posts items (wrapping items) */ #jp-relatedposts .jp-relatedposts-items { clear: left; } #jp-relatedposts .jp-relatedposts-items-visual { margin-right: -20px; } /* Related posts item */ #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { float: left; width: 33%; margin: 0 0 1em; /* Needs to be same as the main outer wrapper for Related Posts */ box-sizing: border-box; -moz-box-sizing: border-box; -webkit-box-sizing: border-box; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post { padding-right: 20px; filter: alpha(opacity=80); -moz-opacity: .8; opacity: .8; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:nth-child(3n+4), #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post:nth-child(3n+4) { clear: both; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:hover .jp-relatedposts-post-title a { text-decoration: underline; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:hover { filter: alpha(opacity=100); -moz-opacity: 1; opacity: 1; } /* Related posts item content */ #jp-relatedposts .jp-relatedposts-items-visual h4.jp-relatedposts-post-title, #jp-relatedposts .jp-relatedposts-items p, #jp-relatedposts .jp-relatedposts-items time { font-size: 14px; line-height: 20px; margin: 0; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs { position:relative; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs a.jp-relatedposts-post-aoverlay { position:absolute; top:0; bottom:0; left:0; right:0; display:block; border-bottom: 0; } #jp-relatedposts .jp-relatedposts-items p, #jp-relatedposts .jp-relatedposts-items time { margin-bottom: 0; } #jp-relatedposts .jp-relatedposts-items-visual h4.jp-relatedposts-post-title { text-transform: none; margin: 0; font-family: inherit; display: block; max-width: 100%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-title a { font-size: inherit; font-weight: normal; text-decoration: none; filter: alpha(opacity=100); -moz-opacity: 1; opacity: 1; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-title a:hover { text-decoration: underline; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post span { display: block; max-width: 90%; overflow: hidden; text-overflow: ellipsis; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post span { height: auto; max-width: 100%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-date, #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-context { opacity: .6; } /* Hide the date by default, but leave the element there if a theme wants to use css to make it visible. */ .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-date { display: none; } /* Behavior when there are thumbnails in visual mode */ #jp-relatedposts .jp-relatedposts-items-visual div.jp-relatedposts-post-thumbs p.jp-relatedposts-post-excerpt { display: none; } /* Behavior when there are no thumbnails in visual mode */ #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs p.jp-relatedposts-post-excerpt { overflow: hidden; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs span { margin-bottom: 1em; } /* List Layout */ #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post { clear: both; width: 100%; } #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post img.jp-relatedposts-post-img { float: left; overflow: hidden; max-width: 33%; margin-right: 3%; } #jp-relatedposts .jp-relatedposts-list h4.jp-relatedposts-post-title { display: inline-block; max-width: 63%; } /* * Responsive */ @media only screen and (max-width: 640px) { #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { width: 50%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:nth-child(3n) { clear: left; } #jp-relatedposts .jp-relatedposts-items-visual { margin-right: 20px; } } @media only screen and (max-width: 320px) { #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { width: 100%; clear: both; margin: 0 0 1em; } #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-list h4.jp-relatedposts-post-title { float: none; max-width: 100%; margin-right: 0; } } /* * Hide the related post section in the print view of a post */ @media print { .jp-relatedposts { display:none ; } }.wp-block-jetpack-rating-star span:not([aria-hidden="true"]) { display: none; } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ ins.acss263b2{display:block;}div.acss21998{clear:both;float:left;margin:0 0 20px 0;max-width:100%;}ins.acss6cf41{display:block;text-align:center;}div.acss138d7{clear:both;}div.acss2ef17{background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}div.acssa2514{background:transparent url(https://i0.wp.com/code4coding.com/wp-content/uploads/2018/11/multiplycpp.jpg?resize=150%2C150&ssl=1) no-repeat scroll 0% 0%;height:150px;max-width:150px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss2c000{font-size:13.300970873786pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acssfccbf{font-size:19.961165048544pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss639cb{font-size:18.873786407767pt;}a.acss72378{font-size:18.126213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
multiply

How to print multiplication table using Array in C++ language

How to print multiplication table using Array in C++ language

In this post, we will discuss how to print multiplication tables using Array in C++.

In this tutorial, we will discuss  how to implement and print a multiplication table in C++ Program to  using 2D Array.

Here’s a C++ program to print a multiplication table using nested for loop

How to print multiplication table using Array

Using nested for loop

Program 1

// C++ program to rpint multiplication table using array
#include <iostream>

int main() {
    const int size=10;
    // Size of the multiplication table (1 to 10)
    int table[size][size];
    //Declaring Array to store the multiplication table
    
    //initialize the array with multiplication value
    for(int i=0; i<size; i++){
        for(int j=0; j<size; j++){
        table[i][j]=(i+1)*(j+1);
    }
    }
    //print the multiplication table
    std::cout  << "multiplication table"<<"\n";
    for(int i=0; i<size; i++){
        for(int j=0; j<size; j++){
        std::cout <<table[i][j]<<"\t";
        }
       std::cout<<"\n";
    }

    return 0;
}

When the above code is executed, it produces the following result

multiplication table
1      2     3     4     5     6     7     8     9     10
2     4     6     8    10    12   14    16   18   20
3     6     9     12   15    18   21   24   27   30
4    8    12     16   20   24   28  32   36   40
5    10   15    20   25   30   35  40   45   50
6    12   18    24   30   36   42  48   54   60
7    14   21    28   35    42   49   56  63   70
8   16    24   32   40    48   56   64  72   80
9   18    27    36   45     54   63   72  81  90
10  20    30  40    50    60   70  80 90 100

 

Array declaration: We declare a 2D array table[size][size] to store multiplication table

Nested for loop : we are used two nested for loop to fill the array with values by multiplying the row and Column indices

Printing the multiplication  table: After initialize the array , the table is printed using another set of nested for loop

 

Here’s a C++ program to print a multiplication table using nested while loop

Using nested while loop

Program 2

// C++ program to rpint multiplication table using array
#include <iostream>

int main() {
    const int size=10;
    // Size of the multiplication table (1 to 10)
    int table[size][size];
    //Declaring Array to store the multiplication table
    
    //initialize the array with multiplication value
    //using nested while loop
    int i=0; 
    while(i<size){
        int j=0;
        while(j<size){
        table[i][j]=(i+1)*(j+1);
         j++;
    }
     i++;
    }
    //print the multiplication table
    std::cout  << "multiplication table"<<"\n";
    int k=0;
    while(k<size){
        int l=0; 
        while(l<size){
        std::cout <<table[k][l]<<"\t";
         l++;
        }
       std::cout<<"\n";
        k++;
    }

    return 0;
}

When the above code is executed, it produces the following result

multiplication table
1      2     3     4     5     6     7     8     9     10
2     4     6     8    10    12   14    16   18   20
3     6     9     12   15    18   21   24   27   30
4    8    12     16   20   24   28  32   36   40
5    10   15    20   25   30   35  40   45   50
6    12   18    24   30   36   42  48   54   60
7    14   21    28   35    42   49   56  63   70
8   16    24   32   40    48   56   64  72   80
9   18    27    36   45     54   63   72  81  90
10  20    30  40    50    60   70  80 90 100

 

Array declaration: We declare a 2D array table[size][size] to store multiplication table

Nested while loop : we are used two nested while loop to fill the array with values by multiplying the row and Column indices

Printing the multiplication  table: After initialize the array , the table is printed using another set of nested while loop

 

Here’s a C++ program to print a multiplication table using nested do-while loop

Using nested do-while loop

Program 3

// C++ program to rpint multiplication table using array
#include <iostream>

int main() {
    const int size=10;
    // Size of the multiplication table (1 to 10)
    int table[size][size];
    //Declaring Array to store the multiplication table
    
    //initialize the array with multiplication value
    //using nested do-while loop
    int i=0; 
    do{
        int j=0;
       do{
        table[i][j]=(i+1)*(j+1);
         j++;
    } while(j<size);
     i++;
    }while(i<size);
    //print the multiplication table
    std::cout  << "multiplication table"<<"\n";
    int k=0;
    do{
        int l=0; 
        do{
        std::cout <<table[k][l]<<"\t";
         l++;
        }while(l<size);
       std::cout<<"\n";
        k++;
    }while(k<size);

    return 0;
}

When the above code is executed, it produces the following result

multiplication table
1      2     3     4     5     6     7     8     9     10
2     4     6     8    10    12   14    16   18   20
3     6     9     12   15    18   21   24   27   30
4    8    12     16   20   24   28  32   36   40
5    10   15    20   25   30   35  40   45   50
6    12   18    24   30   36   42  48   54   60
7    14   21    28   35    42   49   56  63   70
8   16    24   32   40    48   56   64  72   80
9   18    27    36   45     54   63   72  81  90
10  20    30  40    50    60   70  80 90 100

 

Array declaration: We declare a 2D array table[size][size] to store multiplication table

Nested do-while loop : we are used two nested do-while loop to fill the array with values by multiplying the row and Column indices

Printing the multiplication  table: After initialize the array , the table is printed using another set of nested do-while loop

 

Suggested for you

Two dimension array in Java language

Operator in Java language

Data type in Java language

Nested for loop in Java language

Nested while loop in Java language

 

Java program to print multiplication table

C program to print multiplication table

C++ program to print multiplication table

Python program to print multiplication table

Java program to print multiplication table using array

C program to print multiplication table using array

C Program to multiplication table using Array
Karmehavannan

I am Mr S.Karmehavannan. Founder and CEO of this website. This website specially designed for the programming learners and very especially programming beginners, this website will gradually lead the learners to develop their programming skill.

Recent Posts

Explanation of one dimensional array (Data structure)

Explanation of one dimensional array In this post, we will discuss the concept of "Explanation…

2 months ago

Python program to calculate the sum of odd and even numbers in a list

Python program to calculate the sum of odd and even numbers in a list In…

2 months ago

Python code to Calculate sum of odd and even in a list

Python code to Calculate sum of odd and even in a list In this tutorial,…

2 months ago

How to find reverse number using method in Java

How to find reverse number using method In this article, we will discuss the concept…

2 months ago

C# inverted full pyramid star pattern

C# inverted full pyramid star pattern In this article, we will discuss the concept of…

3 months ago

C# Full Pyramid star pattern program

C# Full Pyramid star pattern program In this article, we will discuss the concept of…

3 months ago