Helyesek a következő kódok? (VTS)

Számtani középérték:

#include <iostream>

using namespace std;

void Atlag (int m,int n,int matrix[][10])

{

double atlag = 0;

for(int i = 0; i < n ; i++)

{

for(int j = 0 ; j < m ; j++){

atlag += (double)matrix[i][j];

}

}

atlag /= (m*n);

cout << "A matrix elemeinek szamtani kozepe: " << atlag;

}

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak?";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak?";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

Atlag(m,n,matrix);

}

Oszlop átlag:

#include <iostream>

using namespace std;

void Atlag (int m,int n,int matrix[][10])

{

double atlag[10];

for(int i = 0; i < m ; i++)

{

atlag [i] = 0;

for(int j = 0 ; j < n ; j++){

atlag[i] += matrix[j][i];

}

atlag[i] / = n;

}

cout << "A matrix oszlopainak szamtani kozepe: ";

for(int i = 0 ; i < m ; i++)

cout << atlag[i] << " ";

}

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak?";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak?";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

Atlag(m,n,matrix);

}

Legkisebb elem és index :

#include <iostream>

using namespace std;

void legkissebelem (int m,int n,int matrix[][10])

{

int a[0];

int a1[0];

int index;

int Lelem = matrix [0][0];

for(int i = 0; i < m ; i++)

{

for(int j = 0 ; j < n ; j++){

if( Lelem > matrix[i][j])

Lelem = matrix[i][j];

}

}

cout << "A matrix legkisseb eleme= " << Lelem;

cout<<endl;

for(int i = 0; i < m ; i++){

for(int j = 0; j < n ; j++)

if(Lelem == matrix[i][j])

cout<< "A legkisseb elem indexei= "<<a[i+1]<<" "<<a1[j+1];

}

}

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

legkissebelem(m,n,matrix);

}

Mátrix legnagyobb elem:

#include <iostream>

using namespace std;

void legnagyobbelem (int m,int n,int matrix[][10])

{

int a[0];

int a1[0];

int index;

int Lelem = matrix [0][0];

for(int i = 0; i < m ; i++)

{

for(int j = 0 ; j < n ; j++){

if( Lelem < matrix[i][j])

Lelem = matrix[i][j];

}

}

cout << "A matrix legkisseb eleme= " << Lelem;

cout<<endl;

for(int i = 0; i < m ; i++){

for(int j = 0; j < n ; j++)

if(Lelem == matrix[i][j])

cout<< "A legnagyobb elem indexei= "<<a[i+1]<<" "<<a1[j+1];

}

}

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

legnagyobbelem(m,n,matrix);

}

Összeg mátrix :

#include <iostream>

using namespace std;

void OszMatrix(int m,int n,int matrix[][10],int matrix1[][10],int matrix2[][10])

{

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

matrix2[i][j] = matrix[i][j] + matrix1[i][j];

}

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

cout << matrix2[i][j] <<" ";

cout <<endl;

}

}

int main()

{

int n,m;

int matrix[10][10];

int matrix1[10][10];

int matrix2[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

}

cout << "Kerem a masodik matrix elemeit.";

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

cin >> matrix1[i][j];

}

OszMatrix(m,n,matrix,matrix1,matrix2);

}

Mátrix szorzás:

#include <iostream>

using namespace std;

void MatrixSZ(int matrix[10][10], int matrix1[10][10], int matrix2[10][10], int n, int n1, int m, int m1)

{

for(int i = 0; i < n; i++)

for(int j = 0; j < m1; j++)

{

matrix2[i][j]=0;

}

for(int i = 0; i < n; i++)

for(int j = 0; j < m1; j++)

for(int k = 0; k < m; k++)

{

matrix2[i][j] += matrix[i][k] * matrix1[k][j];

}

cout << "Az eredmeny :";

cout << endl;

for(int i = 0; i < n; i++)

{for(int j = 0; j < m1; j++)

cout << matrix2[i][j]<<" ";

cout << endl;

}

}

int main()

{

int matrix[10][10], matrix1[10][10], matrix2[10][10], n, m, n1, m1;

cout << "Kerem az elso matrix Sorat:";

cin >> n ;

cout << "Kerem az elso matrix oszlopat:";

cin >> m ;

cout << "Kerem a masodik matrix Sorat:";

cin >> n1 ;

cout << "Kerem a masodik matrix Oszlopat:";

cin >> m1;

cout << "Az elso matrix elemei:" ;

for(int i = 0; i < n; i++)

for(int j = 0; j < m; j++)

{

cin >> matrix[i][j];

}

cout << "A masidik matrix elemi:" ;

for(int i = 0; i < n1; i++)

for(int j = 0; j < m1; j++)

{

cin >> matrix1[i][j];

}

MatrixSZ(matrix,matrix1,matrix2,n,m,n1,m1);

}

Bináris átalakítás:

#include <iostream>

using namespace std;

void Binaris (int szamok)

{

int binaris[30];

int inverz[30];

int valami = 0;

for(int j = 0 ; szamok != 0; j++){

if(szamok % 2 == 0){

inverz[j] = 0;

szamok /= 2;

valami++;

} else if (szamok % 2 == 1){

inverz[j] = 1;

szamok = (szamok-1) / 2;

valami++;

}

}

for(int i = 0, j = valami-1; i < valami; i++, j--){

binaris[i] = inverz[j];

}

for(int k = 0;k < valami; k++)

cout << binaris[k];

}

int main()

{

int szamok;

cout << "Kerem a szamot.";

cin >> szamok;

Binaris(szamok);

}

Legkisebb tömb:

#include <iostream>

using namespace std;

int main()

{

int Lelem ;

int n[10];

int p[10];

int m ;

cout << "Mien hosszu legyen a tomb?";

cout <<endl;

cin >> m;

if (1<=m || m<=50)

cout << "Kerem a tomb elemeit : ";

for(int i=0; i<m; i++)

cin >> n[i];

for(int i=0;i < m;i++)

{

if (Lelem > n[i])

Lelem = n[i];

}

cout << "A legkisseb elem a tomben = " << Lelem;

cout << endl;

for(int i=0; i< m ;i++)

{

p[0]=Lelem;

p[i+1]=n[i];

}

cout << "Az uj tomb elemi = ";

for(int i=0; i < m+1 ;i++)

cout << p[i] <<" ";

}

Oszthatóság K-val:

#include <iostream>

using namespace std;

int main()

{

int n,m,k;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

if ( 1 <= n || 1 <= m || n <= 50 || m <= 50 )

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

cout << "Kerem a szamot amivel majd elosztom a matrix elemit =" ;

cin >> k ;

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

if(matrix[i][j] % 2 == 1)

{

if (matrix[i][j] % k == 0)

cout << matrix[i][j] <<" " ;

}

}

Elemek k szorzása:

#include <iostream>

using namespace std;

int main()

{

int n,m,k;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

if ( 1 <= n || 1 <= m || n <= 50 || m <= 50 )

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

cout << "Kerem a szamot amivel majd elosztom a matrix elemit =" ;

cin >> k ;

for(int i = 0; i < n ; i++)

for(int j = 0; j < m; j++)

if(matrix[i][j] % 2 == 1)

{

if (matrix[i][j] > k )

cout << matrix[i][j] <<" ";

}

}

Képlet: #include <iostream>

using namespace std;

int main()

{

int n;

int x = 1;

int y = 2;

int a[100];

cout << "Hany sora legyen a tombnek ? = ";

cin >> n;

if ( 1 <= n || n <= 50 )

cout << "Kerem a tomb elemeit.";

cin >> a[1];

for(int i = 2; i <= n+1 ; i++)

{

a[2] = a[1] * a[1];

a[i+1]=a[x] * a[y];

x++;

y++;

}

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

cout << a[i] <<" ";

}

Mellék átló legkisebb elemek:

#include <iostream>

using namespace std;

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++){

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

}

int Lelem = matrix [1][m-1];

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

if(i + j > n - 1 && matrix[i][j] < Lelem)

Lelem = matrix[i][j];

}

cout << "A legkisseb ele= ";

cout << Lelem << " " ;

}

Képlet 2:

#include <iostream>

using namespace std;

int main()

{

int n;

int x = 1;

int y = 2;

int a[100];

cout << "Hany sora legyen a tombnek ? = ";

cin >> n;

if ( 1 <= n || n <= 50 )

cout << "Kerem a tomb elemeit.";

cin >> a[1];

for(int i = 2; i <= n+1 ; i++)

{

a[2] = a[1] * a[1];

a[i+1]=a[x] +(- a[y]);

x++;

y++;

}

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

cout << a[i] <<" ";

}

Főátló feletti legnagyobb elem:

#include <iostream>

using namespace std;

int main()

{

int n,m;

int matrix[10][10];

cout << "Hany sora legyen a matrixnak ? = ";

cin >> n;

cout << "Hany oszlopa legyen a matrixnak ? = ";

cin >> m;

cout << "Kerem a matrix elemeit.";

for(int i = 0; i < n ; i++){

for(int j = 0; j < m; j++)

cin >> matrix[i][j];

}

int Lelem = matrix [1][1];

for(int i = 0; i < n ; i++)

{

for(int j = 0; j < m; j++)

if(i + j < n - 1 && matrix[i][j] > Lelem)

Lelem = matrix[i][j];

}

cout << "A legkisseb ele= ";

cout << Lelem << " " ;

cout << endl;

for(int i = 0; i < n ; i++){

for(int j = 0; j < m; j++)

cout << matrix[i][j] << " " ;

cout << endl;

}

}