Anda di halaman 1dari 10

#include <iostream>

using namespace std;

void afisare(int n,int mat[100][100])


{
int i,j;
for(i=1;i<=1;i++)
{
for(j=1;j<=n;j++)
cout<<mat[i][j]<<" ";cout<<endl;
}
}
int suma(int n,int mat[100][100])
{
int i,j,s=0;
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)
s=s+mat[i][j];
return s;
}
int produs(int n,int mat[100][100])
{
int i,j,p=1;
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)

p=p*mat[i][j];
return p;
}
int maxim(int n,int mat[100][100])
{
int i,j,max=mat[1][1];
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)
{
if(max<mat[i][j])
max=mat[i][j];
}
return max;
cout<<endl;
}
int minim(int n,int mat[100][100])
{
int i,j,min=mat[1][1];
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)
{
if(min>mat[i][j])
min=mat[i][j];
}
return min;
cout<<endl;

}
void afisard(int n,int mat[100][100])
{
int i,j;
for(i=n;i>=1;i--)
{
for(j=n;j>=n;j--)
cout<<mat[i][j]<<" "<<endl;
}
}
void invl(int n,int mat[100][100],int x,int y)
{
int aux,i;
for(i=1;i<=1;i++)
{
aux=mat[i][x];
mat[x][i]=mat[y][i];
mat[y][i]=aux;
}
}
int invc(int n,int mat[100][100],int x,int y)
{
int aux,i;
for(i=1;i<=n;i++)
{
aux=mat[i][x];

mat[i][x]=mat[i][y];
mat[i][y]=aux;
}
}
void cautare(int n,int mat[100][100],int z)
{
int i,j,h;
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)
{
if(mat[i][j]==z)
h=1;
}
if(h!=0)
cout<<"nr e in mat";
else cout<<"nr nu e in mat ";
}
void trans(int n,int mat[100][100])
{
int i,j;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
cout<<mat[i][j]<<" ";
cout<<endl;
}

}
void spirala(int n,int mat[100][100])
{
int i,j,k;
for(k=1;k<=(n+1)/2;k++)
{
for(j=k;j<=n-k+1;j++)
cout<<mat[k][j]<<" ";
for(i=k+1;i<=n-k+1;i++)
cout<<mat[i][n-k+1]<<" ";
for(i=n-k;i>k;i--)
cout<<mat[n-k+1][i]<<" ";
for(i=n-k;i>k;j--)
cout<<mat[i][k]<<" ";
cout<<endl;
}
}

int main()
{
int mat[100][100],i,j,n,x,y,z;
cout<<"n=";cin>>n;
for(i=1;i<=1;i++)
for(j=1;j<=n;j++)
{
cout<<"mat["<<i<<"]["<<j<<"]=";cin>>mat[i][j];

}
cout<<"linie pt interieor: ";cin>>x;
cout<<"coloana pt interior: ";cin>>y;
cout<<"nt de cautat in mat:";cin>>z;
char opt;
do
{
cout<<endl<<endl<<"MENIU"<<endl;
cout<<"1.afisare mar de la s la d "<<endl;
cout<<"2.afisare mar de la d la s "<<endl;
cout<<"3.afisare spirala "<<endl;
cout<<"4.max"<<endl;
cout<<"5.min"<<endl;
cout<<"6.produs"<<endl;
cout<<"7.suma"<<endl;
cout<<"8.cautare"<<endl;
cout<<"9.interschimbare linii"<<endl;
cout<<"i.int. col"<<endl;
cout<<"t.transpusa"<<endl;
cout<<"intrc optiunea: ";cin>>opt;
switch(opt)
{
case '1':cout<<"afisarea mat s la d: ";
cout<<endl;afisard(n,mat);
break;
case '2':cout<<"afisarea mat d la s: ";

cout<<endl;afisard(n,mat);
break;
case '3':cout<<"afisarea in spirala: ";
cout<<endl;spirala(n,mat);
break;
case '4':cout<<"max: ";
cout<<endl;maxim(n,mat);
break;
case '5':cout<<"min: ";
cout<<endl;minim(n,mat);
break;
case '6':cout<<"produs: ";
cout<<endl;produs(n,mat);
break;
case '7':cout<<"suma: ";
cout<<endl;suma(n,mat);
break;
case '8':cout<<"cautare: ";
cout<<endl;afisard(n,mat);
break;
case '9':cout<<"int linii: ";
cout<<endl;
invl(n,mat,x,y);afisard(n,mat);
break;
case 'i':cout<<"int. col: ";
cout<<endl;invc(n,mat,x,y);afisare(n,mat);

break;
case 't':cout<<"transpusa: ";
cout<<endl;trans(n,mat);
break;
case '0': ;
default:cout<<"optiune incorecta!!!";
}
}while(opt!='0');

Meniu cu matrici

#include <iostream>

using namespace std;


int prim(int n,int a)
{
if(a==1)
return 1;
else if(n%a==0)
return 0;
else return prim(n,a-1);
}
int main()

{
int n;
cout<<"n=";cin>>n;
if(prim(n,n/2)==0)
cout<<"este prim";
else cout<<"nu este prim";
}
Prim recursive
#include <iostream>

using namespace std;

int main()
{
int n,i,j,k,mat[10][10];
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
cout<<"mat["<<i<<"]["<<j<<"]=";cin>>mat[i][j];
}
for(i=1;i<=n;i++)
{

for(j=1;j<=n;j++)
cout<<mat[j][i]<<" ";
cout<<endl;
}}
Afisare matrice

Anda mungkin juga menyukai