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;}figure.acss1ba34{max-width:351px;}figure.acss2676c{max-width:300px;}figure.acss3c5ab{max-width:345px;}span.acssb4d53{color:#993300;}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 Three dimension Array in Cpp language
In the C++ Programming Language, an array is a fixed sequential collection of elements of the same data type. An array can be used to represent a list of numbers(int) or names (string) or other data type of similar elements. It is one of the ways of grouping similar type data with single variables names.
Three types of arrays in Cpp programming language
1. One dimensional array
3. Multi-dimensional array
Three dimensional Array
Now, we will look at three dimensional Array in C++. C++ programming supports multidimensional Array. The multidimensional array is also called a matrix. Here, we will declare the three-dimensional array.
Syntax
Data_type Array_name[size 1][size 2][size 3];
int marks[2][3][4];
char alphabet[3][4][5];
int marks[2][3][4]={ {{34,56,76,54},{98,53,86,34},{23,45,67,89}}, {{8,87,76,65},{75,46,52,32},{78,65,84,62}} };
Examples
Access elements in the array
insert elements from the array in C++
array name[index][index][index]=value; marks[0][0][0]=45;
display elements from the array in C++
cout<<array name[index][index][index]; cout<<marks[0][0][0];
Program 1
#include <iostream> #include <conio.h> using namespace std; int main() { int marks[2][2][3]; //array index must be index to Zero marks[0][0][0]=45; marks[0][0][1]=67; marks[0][0][2]=23; marks[0][1][0]=98; marks[0][1][1]=15; marks[0][1][2]=70; marks[1][0][0]=87; marks[1][0][1]=76; marks[1][0][2]=65; marks[1][1][0]=63; marks[1][1][1]=50; marks[1][1][2]=37; cout << "marks[0][0][0] :" << marks[0][0][0]<<"\n"; cout << "marks[0][0][1] :" << marks[0][0][1]<<"\n"; cout << "marks[0][0][2] :" << marks[0][0][2]<<"\n"; cout << "marks[0][1][0] :" << marks[0][1][0]<<"\n"; cout << "marks[0][1][1] :" << marks[0][1][1]<<"\n"; cout << "marks[0][1][2] :" << marks[0][1][2]<<"\n"; cout << "marks[1][0][0] :" << marks[1][0][0]<<"\n"; cout << "marks[1][0][1] :" << marks[1][0][1]<<"\n"; cout << "marks[1][0][2] :" << marks[1][0][2]<<"\n"; cout << "marks[1][1][0] :" << marks[1][1][0]<<"\n"; cout << "marks[1][1][1] :" << marks[1][1][1]<<"\n"; cout << "marks[1][1][2] :" << marks[1][1][2]<<"\n"; getch(); return 0; }
When the above code is executed, it produces the following results:
marks[0][0][0]=45; marks[0][0][1]=67; marks[0][0][2]=23; marks[0][1][0]=98; marks[0][1][1]=15; marks[0][1][2]=70; marks[1][0][0]=87; marks[1][0][1]=76; marks[1][0][2]=65; marks[1][1][0]=63; marks[1][1][1]=50; marks[1][1][2]=37;
Program 2
#include <iostream> #include <conio.h> using namespace std; int main() { cout << "Three dimension array in C++" << endl; int marks[2][2][3]={ { {56,78,67},{56,78,43}}, {{26,74,76},{36,58,90}}, }; cout<<marks[0][0][0]<<endl; cout<<marks[0][0][1]<<endl; cout<<marks[0][0][2]<<endl; cout<<marks[0][1][0]<<endl; cout<<marks[0][1][1]<<endl; cout<<marks[0][1][2]<<endl; cout<<marks[1][0][0]<<endl; cout<<marks[1][0][1]<<endl; cout<<marks[1][0][2]<<endl; cout<<marks[1][1][0]<<endl; cout<<marks[1][1][1]<<endl; cout<<marks[1][1][2]<<endl; getch(); return 0; }
When the above code is executed, it produces the following results:
Three dimension array in Cpp 56 78 67 56 78 43 26 74 76 36 58 90
Program 1
#include <iostream> using namespace std; int main() { int i,j,k; int marks[3][3][3]= { //declaration and initiation { {56,78,56}, {54,34,32}, {43,26,92}, }, { {48,94,62}, {41,39,66}, {68,40,90}, }, { {20,67,84}, {52,51,72}, {60,53,59},} }; cout<<("3 D Array element\n")<<endl; for(i=0;i<3;i++) { for(j=0;j<3;j++) { for(k=0;k<3;k++){ cout <<(marks[i][j][k]); } cout <<("\n"); } cout <<("\n"); } cout << "End of the program" << endl; return 0; }
When the above code is executed, it produces the following results:
3 D Array element 56,78,56 54,34,32 43,26,92 48,94,62 41,39,66 68,40,90 20,67,84 52,51,72 60,53,59 End of the program
store elements to the array in C++ using for loop
for(int i=0; i<max_array_index; i++){ for(int j=0; j<max_array_index; j++){ for(int j=0; j<max_array_index; j++){ cin>>array_name[i][j][k]; } } }
display elements from the array in C++ using for loop
for(int i=0; i<max_array_index; i++){ for(int j=0; j<max_array_index; j++){ for(int j=0; j<max_array_index; j++){ cout<<array_name[i][j][k]; } } }
C++ program to store the value entered by the user in the three-dimensional array using nested for loop
Program 1
#include <iostream> #include <conio.h> using namespace std; int main() { string Name[2][2][3];//Array declaration cout << "Enter your Names\n" << endl; for(int i=0; i<=1; i++){//input value using for loop for(int j=0; j<=1; j++){ for(int k=0; k<=2; k++){ cout << "Name["<<i<<"]["<<j<<"]["<<k<<"] :"; cin>> Name[i][j][k];//Ask input for element of array } } } cout << "\nyour input name here" << endl; for(int i=0; i<=1; i++){//Display value using for loop 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 element from Array } } } getch(); return 0; }
When the above code is executed, it produces the following results:
Enter your names Name[0][0][0] :Sathu Name[0][0][1] :Khan Name[0][0][2] :Nilu Name[0][1][0] :Suthu Name[0][1][1] :Kuru Name[0][1][2] Jhon Name[1][0][0] :Sam Name[1][0][1] :Sumo Name[1][0][2] :Remi Name[1][1][0] :Ragu Name[1][1][1] :Thivya Name[1][1][2] :Thurai Your input name here Name[0][0][0] :Sathu Name[0][0][1] :Khan Name[0][0][2] :Nilu Name[0][1][0] :Suthu Name[0][1][1] :Kuru Name[0][1][2] Jhon Name[1][0][0] :Sam Name[1][0][1] :Sumo Name[1][0][2] :Remi Name[1][1][0] :Ragu Name[1][1][1] :Thivya Name[1][1][2] :Thurai
Program 1
#include <iostream> #include <conio.h> using namespace std; int main() { int marks[2][3][3]=//array declaration { {{34,67,54},{37,73,80},{27,54,56} }, {{67,86,33},{52,47,69},{23,42,46} }, }; cout << "Display your marks here :" << endl; int m=0; while(m<=1){ int n=0; while(n<=2){ int l=0; while(l<=1){ cout <<"marks["<<m<<"]["<<n<<"]"<<l<<"]="<<marks[m][n][l]<< endl; l++; } n++; } m++; } cout << "End the program" << endl; getch(); return 0; }
When the above code is executed, it produces the following results:
Display your marks here : marks[0][0][0]=34 marks[0][0][1]=67 marks[0][1][0]=37 marks[0][1][1]=73 marks[0][0][0]=27 marks[0][0][1]=54 marks[1][1][0]=67 marks[1][1][1]=86 marks[1][0][0]=52 marks[1][0][1]=47 marks[1][1][0]=23 marks[1][1][1]=42 End the program
store elements in the array in C++ using while loop
int i=0; while(i<=max_array_index){ int j=0; while(j<=max_array_index){ intk=0; while(j<=max_array_index){ cin>>array_name[i][j][k]; } k++; } j++; } i++;
display elements from the array in C++ using while loop
int i=0; while(i<=max_array_index){ int j=0; while(j<=max_array_index){ intk=0; while(j<=max_array_index){ cout<<array_name[i][j][k]; } k++; } j++; } i++;
C++ program to store the value entered by the user in the three-dimensional array using while loop
Program 1
#include <iostream> #include <conio.h> using namespace std; int main() { string names[2][3][2]; cout <<"Enter names"<< endl; int i=0; while(i<=1){ int j=0; while(j<=2){ int k=0; while(k<=1){ cout <<"names["<<i<<"]["<<j<<"]["<<k<<"]="; cin>>names[i][j][k]; k++; } j++; } i++; } cout << "\n This names are stored in array :" << endl; int m=0; while(m<=1){ int n=0; while(n<=2){ int l=0; while(l<=1){ cout <<"names["<<m<<"]["<<n<<"]"<<l<<"]="<<names[m][n][l]<< endl; l++; } n++; } m++; } cout << "End of program" << endl; getch(); return 0; }
When the above code is executed, it produces the following results:
Enter names names[0][0][0]=Saru names[0][0][1]=Kuna names[0][1][0]=Joe names[0][1][1]=Jhon names[0][2][0]=Pilib names[0][2][1]=Para names[1][0][0]=Mohi names[1][0][1]=Suba names[1][1][0]=Guru names[1][1][1]=Nila names[1][2][0]=Mala names[1][2][1]=Mathu This names are stored in array names[0][0][0]=Saru names[0][0][1]=Kuna names[0][1][0]=Joe names[0][1][1]=Jhon names[0][2][0]=Pilib names[0][2][1]=Para names[1][0][0]=Mohi names[1][0][1]=Suba names[1][1][0]=Guru names[1][1][1]=Nila names[1][2][0]=Mala names[1][2][1]=Mathu
Similar post
Single dimension Array in C++ language
Two dimension Array in C++ language
Three dimension Array in C++ language
Single dim- Array in Java language
Two dim- Array in Java language
Three dim- Array in Java language
Single dim- Array in C language
Three dim- Array in C language
Nested for loop in C++ language
Nested while 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…