1.Se citeste o matrice cu m linii si n coloane avand elemente nr intregi.

Afisati elementele prime din

matrice.

#include <iostream>

using namespace std;

bool prim(int x){

if(x<2){return false;}

if(x>2 && x%2==0){return false;}

for(int d=3;d*d<=x;d+=2){

if(x%d==0){return false;}

return true;

int main()

int m,n,a[101][101],i,j;

cin>>m>>n;

for(i=1;i<=m;i++){

for(j=1;j<=n;j++){

cin>>a[i][j];

for(i=1;i<=m;i++){

for(j=1;j<=n;j++){

if (prim (a[i][j])){cout<<a[i][j]<<" ";}

}}

return 0;

3. Se citeste o matrice patratica de dimensiune n. Calculati cel mai mic multiplu comun dintre suma
elementelor de pe diag principala si produsul elementelor de pe diag secundara.

4
3456

6458

5378

1234

Se va afisa 90.

#include <iostream>

using namespace std;

int main()

int n,a[101][101],i,j,s=0,p=1,x,y;

cin>>n;

for(i=1;i<=n;i++){

for(j=1;j<=n;j++){

cin>>a[i][j];

for(i=1;i<=n;i++){

s+=a[i][i];

for(i=1;i<=n;i++){

p*=a[i][n+1-i];}

x=s;

y=p;

while(x!=y){

if(x<y){x=x+s;}

if(x>y){y=y+p;}

}
 cout<<x;

return 0;

4.Se citeste o matrice patratica dde dimensiune n cu elemente nr intregi. Verificati daca suma
elementelor din fiecare zona este aceasi.

#include <iostream>

using namespace std;

int main()

int n,a[101][101],i,j,s1=0,s2=0,s3=0,s4=0;

cin>>n;

for(i=1;i<=n;i++){

for(j=1;j<=n;j++){

cin>>a[i][j];

for(i=1;i<=n;i++){

for(j=1;j<=n;j++){

if(i<j && i+j<=n){s1+=a[i][j];}

if(i>j && i+j<=n){s2+=a[i][j];}

if(i>j && i+j>n+1){s3+=a[i][j];}

if(i<j && i+j>n+1){s4+=a[i][j];}

if(s1==s2 && s2==s3 && s3==s4){cout<<"DA";}

else{cout<<"NU";}
 return 0;