Scribd
Upload
82 views6 pages

Temă - Matrice 1) Sa Se Afiseze Minimul de Pe Fiecare Linie

The document contains 6 programming problems involving matrices. Each problem is presented with a short description and the C++ code solution. The problems include: displaying the minimum value of each row, counting the number of perfect squares in each column, counting lines with identical values, displaying indices of lines with consecutive increasing elements, displaying indices of columns that can form a geometric progression, and counting lines whose values can form a set.

Uploaded by

MARIA PANĂ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
82 views6 pages

Temă - Matrice 1) Sa Se Afiseze Minimul de Pe Fiecare Linie

The document contains 6 programming problems involving matrices. Each problem is presented with a short description and the C++ code solution. The problems include: displaying the minimum value of each row, counting the number of perfect squares in each column, counting lines with identical values, displaying indices of lines with consecutive increasing elements, displaying indices of columns that can form a geometric progression, and counting lines whose values can form a set.

Uploaded by

MARIA PANĂ
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

Temă - Matrice

1) Sa se afiseze minimul de pe fiecare linie.


#include <iostream>
using namespace std;
int main()
{
int m,n,i,j,a[50][50],minim;
cout<<"m=";
cin>>m;
cout<<"n=";
cin>>n;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
for(i=1; i<=m; j++)
{
j = 1;
minim = a[i][j];
for (j = 2; j <= n; j++)
if(a[i][j]<minim)
minim = a[i][j];
cout << minim << endl;
}
return 0;
}

Maria Pană, cl. X H


Temă - Matrice

2) Sa se afiseze numarul patratelor perfecte de pe fiecare coloana.


#include <iostream>
#include <cmath>
using namespace std;
int main()
{
int m,n,i,j, a[50][50], k=0;
float x;
cin >> m >> n;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++)
{
cout << "a[" << i << "][" << j << "] = ";
cin >> a[i][j];
}
for (j = 1; j <= n; j++)
{
for (i = 1; i <= m; i++)
{
m = sqrt(a[i][j]);
if (a[i][j]== m*m)
k++;
}
}
cout << k;

Maria Pană, cl. X H


Temă - Matrice

3) Sa se contorizeze liniile alcatuite din valori identice.


#include <iostream>
using namespace std;
int main()
{
int m,n,i,j,a[50][50],k=0;
cout<<"m=";cin>>m;
cout<<"n=";cin>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}

for(i=1;i<=m;i++)
{
j=1;
while(a[i][j]==a[i][j+1]&&j<=n-1)
j++;
if(j==n)
k++;
}
cout<<k;
return 0;
}

Maria Pană, cl. X H


Temă - Matrice

4) Sa se afiseze indicii liniilor cu elemente consecutive in sens crescator.


#include <iostream>
using namespace std;
int main()
{
int m,n,i,j, a[50][50], ;
cin >> n >> m;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++)
{
cout << "a[" << i << "][" << j << "] = ";
cin >> a[i][j];
}
for (i = 1; i <= m; i++)
{
j = 1;
while (a[i][j+1]-a[i][j] == 1)
j++;
if (j == n)
cout << i << " ";
}
return 0;
}

Maria Pană, cl. X H


Temă - Matrice

5) Sa se afiseze indicii coloanelor ale caror valori pot forma o progresie geometrica.
#include <iostream>
using namespace std;
int main()
{
int m,n,i,j,a[50][50];
cout<<"m=";
cin>>m;
cout<<"n=";
cin>>n;
for(i=1; i<=m; i++)
for(j=1; j<=n; j++)
{
cout<<"a["<<i<<"]["<<j<<"]=";
cin>>a[i][j];
}
for(j=1; j<=n; j++)
{
i = 1;
while (a[i+1][j]*a[i+1][j]==a[i][j]*a[i+2][j])
i++;
if(i == m-1)
cout << j <<" ";
}
return 0;
}

Maria Pană, cl. X H


Temă - Matrice

6) Sa se contorizeze liniile ale caror valori pot forma o multime.


#include <iostream>
using namespace std;
int main()
{
int m,n,i,j, a[50][50], ok, k;
cin >> m >> n;
for (i = 1; i <= m; i++)
for (j = 1; j <= n; j++)
{
cout << "a[" << i << "][" << j << "] = ";
cin >> a[i][j];
}
for (i = 1; i <= m; i++)
{ ok = 1;
for (j = 1; j <= n; j++)
for (k = j+1; k <= n && ok; k++)
if (a[i][j] == a[i][k])
ok = 0;
if (ok == 1)
k++;
}
cout << k;
return 0;
}

Maria Pană, cl. X H

You might also like