Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<iomanip>
- using namespace std;
- //global. kintam.
- int n, k = 0;
- bool a=true;
- //ivedimo funkcija
- void ivedimas()
- {
- int Mas[n][n];
- cout << "Enter size of array" << endl;
- cin >> n;
- //Ivedami masyvu elementu stulpeliu ir eiluciu sk
- for (int i = 1; i <= n; i++) {
- for (int j = 1; j <= n; j++) {
- cout << "Enter element matrix" << i << "_" << j << endl;
- cin >> Mas[i][j];
- }
- }
- }
- //skaiciavimo funkcija
- void skaiciavimas()
- {
- int Mas[n][n];
- cout << "Matrix is" << endl;
- for (int i = 1;i <= n; i++)
- {
- for (int j = 1; j<=n; j++)
- {
- cout << fixed << setprecision(3) << setw(10) << Mas[i][j];
- }
- cout << endl;
- }
- for(int i=1; i<=n; i++){
- for(int j=1; j<=n; j++){
- int sum = 0;
- if((i-1>0) && (j-1>0) && (i-1<=n) && (j-1<=n)) { sum=sum+Mas[i-1][j-1]; }
- if((i-1>0) && (j>0) && (i-1<=n) && (j<=n)) { sum=sum+Mas[i-1][j]; }
- if((i-1>0) && (j+1>0) && (i-1<=n) && (j+1<=n)) { sum=sum+Mas[i-1][j+1]; }
- if((i>0) && (j+1>0) && (i<=n) && (j+1<=n)) { sum=sum+Mas[i][j+1]; }
- if((i+1>0) && (j+1>0) && (i+1<=n) && (j+1<=n)) { sum=sum+Mas[i+1][j+1]; }
- if((i+1>0) && (j>0) && (i+1<=n) && (j<=n)) { sum=sum+Mas[i+1][j]; }
- if((i+1>0) && (j-1>0) && (i+1<=n) && (j-1<=n)) { sum=sum+Mas[i+1][j-1]; }
- if((i>0) && (j-1>0) && (i<=n) && (j-1<=n)) { sum=sum+Mas[i][j-1]; }
- {
- if(sum!=Mas[i][j]){a=false;}
- }
- }
- }
- }
- //isvedimo funkcija
- void isvedimas()
- {
- int Mas[n][n];
- if(a==true)
- {
- cout<<"TAIP"<<endl;
- }
- else cout<<"NE"<<endl;
- }
- int main()
- {
- //kvieciam funkc
- ivedimas();
- skaiciavimas();
- isvedimas();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement