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;}figure.acss855b8{max-width:2480px;}span.acssb4d53{color:#993300;}div.acss21998{clear:both;float:left;margin:0 0 20px 0;max-width:100%;}ins.acss6cf41{display:block;text-align:center;}figure.acsse45dd{max-width:506px;}figure.acss36791{max-width:393px;}span.acssce51c{color:#808000;}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;}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";}
In this tutorial, We will learn about Nested for loop in CPP programming language
If the for loop contains another for loop inside its body, it is known as nested for loop in C++ language. Every time, both the outer loop and inner loop should complete their circulation.
Syntax
for(initialization; test_expression; updating_statement){ //codes inside the body of outer loop for(initialization; test_expression; updating_statement){ //codes inside the body of outer loop } }
Here, there is two for loops, Outer for loop exists inside a for loop known as inner for loop
Nested for loop has two types of loop
Outer for loop executes only once. when its test expression is true. the flow of control moves to inner loop iteration and inner loop executes until its test expression is false.
When the test expression of the inner loop is false, the flow of control skips the execution of the inner loop and come out to execute the outer loop again.
When the test expression of the outer loop is false, the flow of control exit from the loop control and go to rest.
Example
#include <iostream> #include <conio.h> using namespace std; int main() { for(int i=1; i<=3; i++){ cout << i<<"outer loop executed only once\n" << endl; for(int j=1; j<=4; j++){ cout << j<<"inner loop executed until to complition" << endl; } cout<<"\n"; } getch(); return 0; }
When the above code is executed, it produces the following results:
1 outer loop executed only once 1 inner loop executed until to complition 2 inner loop executed until to complition 3 inner loop executed until to complition 4 inner loop executed until to complition 2 outer loop executed only once 1 inner loop executed until to complition 2 inner loop executed until to complition 3 inner loop executed until to complition 4 inner loop executed until to complition 3 outer loop executed only once 1 inner loop executed until to complition 2 inner loop executed until to complition 3 inner loop executed until to complition 4 inner loop executed until to complition 4 outer loop executed only once 1 inner loop executed until to complition 2 inner loop executed until to complition 3 inner loop executed until to complition 4 inner loop executed until to complition
Example
program 1
#include <iostream> #include <conio.h> using namespace std; int main() { for(int i=1; i<=10; i++){ for(int j=1; j<=10; j++){ cout <<j; } cout << "\n"; } getch(); return 0; }
When the above code is executed, it produces the following results:
12345678910 12345678910 12345678910 12345678910 12345678910 12345678910 12345678910 12345678910 12345678910 12345678910
In this program, initially outer for loop start its execution and executes only once. When the test condition is evaluated to be true, the flow of control enters the inner for loop.
Then, the inner for loop completes its execution unless the test condition evaluated to be false.
In that case, the flow of control come out to the outer loop again and executes only once.
Then the flow of control enters the inner loop again.
This circulation should be held until outer loop test expression is false.
When the outer loop test expression is evaluated to be false, the flow of control comes out of the outer loop body and the loop control goes to rest.
Program 2
#include <iostream> #include <conio.h> using namespace std; int main() { for(int i=1; i<=10; i++){ for(int j=1; j<=10; j++){ cout <<"*"; } cout << "\n"; } getch(); return 0; }
When the above code is executed, it produces the following results:
********** ********** ********** ********** ********** ********** ********** ********** ********** **********
Program 3
We can use nested for loop to display in two dimension array and the three-dimensional array of elements in C++ language
#include <iostream> #include <conio.h> using namespace std; int main() { int marks[3][4]; cout<<"Enter the marks for Array \n"<<endl; for(int i=0; i<=2; i++){ for(int j=0; j<=3; j++){ cout<<"marks["<<i<<"]["<<j<<"]"<<":"; cin>>marks[i][j]; }//input marks from user } cout<<"\nYou entered:"<<endl; for(int i=0; i<=2; i++){ for(int j=0; j<=3; j++){ cout<<"marks["<<i<<"]["<<j<<"]" <<":"<<marks[i][j]<<endl; }//output marks } getch(); return 0; }
When the above code is executed, it produces the following results:
Enter the marks for Array marks[0][0]:56 marks[0][1]:76 marks[0][2]:78 marks[0][3]:87 marks[1][0]:89 marks[1][1]:98 marks[1][2]:90 marks[1][3]:54 marks[2][0]:45 marks[2][1]:65 marks[2][2]:56 marks[2][3]:73 you entered marks[0][0]:56 marks[0][1]:76 marks[0][2]:78 marks[0][3]:87 marks[1][0]:89 marks[1][1]:98 marks[1][2]:90 marks[1][3]:54 marks[2][0]:45 marks[2][1]:65 marks[2][2]:56 marks[2][3]:73
Program 1
#include <iostream> #include <conio.h> using namespace std; int main() { string Name[2][2][3]; //Array diclaration cout<<"Enter your name here\n"<< endl; for(int i=0; i<=1; i++){ for(int j=0; j<=1; j++){ for(int k=0; k<=2; k++){ cout <<"Name["<<i<<"]["<<j<<"]["<<k<<"] :"; cin>>Name[i][j][k];//Take input from user } } } cout<<"\nyou Entered :"<< endl; for(int i=0; i<=1; i++){ for(int j=0; j<=1; j++){ for(int k=0; k<=2; k++){ cout <<"Name["<<i<<"]["<<j<<"]["<<k<<"] :"<<Name[i][j][k] << endl;//Display names from array } } } getch(); return 0; }
When the above code is executed, it produces the following results:
Enter your name here Name[0][0][0] :Jhon Name[0][0][1] :Smith Name[0][0][2] :Nilu Name[0][1][0] :Suman Name[0][1][1] :Shagan Name[0][1][2] :Mackal Name[1][0][0] :Amir Name[1][0][1] :Khan Name[1][0][2] :Bala Name[1][1][0] :Robert Name[1][1][1] :Kamith Name[1][1][2] :Siya you entered : Name[0][0][0] :Jhon Name[0][0][1] :Smith Name[0][0][2] :Nilu Name[0][1][0] :Suman Name[0][1][1] :Shagan Name[0][1][2] :Mackal Name[1][0][0] :Amir Name[1][0][1] :Khan Name[1][0][2] :Bala Name[1][1][0] :Robert Name[1][1][1] :Kamith Name[1][1][2] :Siya
In the above program, initially, a user can enter the String value to the array for the store using nested for loop.
after we can display elements from the array using nested for loop.
For loop in Java language
For loop in C language
Explanation of one dimensional array In this post, we will discuss the concept of "Explanation…
Python program to calculate the sum of odd and even numbers in a list In…
Python code to Calculate sum of odd and even in a list In this tutorial,…
How to find reverse number using method In this article, we will discuss the concept…
C# inverted full pyramid star pattern In this article, we will discuss the concept of…
C# Full Pyramid star pattern program In this article, we will discuss the concept of…
View Comments
Thanks from your about programming tutorial