// Bài Mẫu 1:
#include<iostream>
using namespace std;
#define MAX 100
int main(){
int A[MAX][MAX], N, i, j, S=0;
cout<<"Nhap so N cua MT vuong: ";
cin>>N;
for (i=0; i<N; i++)
for(j=0; j<N; j++)
{
cout<<"A["<<i<<"]["<<j<<"]: ";
cin>>A[i][j];
}
for(i=0; i<N; i++)
for(j=0; j<N; j++){
cout<<A[i][j]<<" ";
cout<<endl;
}
for(i=0; i<N; i++)
for(j=0; j<N; j++)
if(i==j)
S = S +A[i][j];
cout<<"Tong cac phan tu tren Duong Cheo Chinh: "<<S;
return 0;
}
// Bài mẫu 2:
#include<iostream>
using namespace std;
#define MAX 100
int main(){
int A[MAX][MAX], N, i, j, S=0;
cout<<"Nhap so N cua MT vuong: ";
cin>>N;
for (i=0; i<N; i++)
for(j=0; j<N; j++)
{
cout<<"A["<<i<<"]["<<j<<"]: ";
cin>>A[i][j];
}
for(i=0; i<N; i++)
for(j=0; j<N; j++){
cout<<A[i][j]<<" ";
cout<<endl;
}
for(i=0; i<N; i++)
for(j=0; j<N; j++)
if(i+j > N-1)
S = S +A[i][j];
cout<<"Tong cac phan tu tren Duong Cheo Phu: "<<S;
return 0;
}
// BAI 1
#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
bool KTSNT(int num) {
if (num < 2) {
return false;
}
for (int i = 2; i <= sqrt(num); ++i) {
if (num % i == 0) {
return false;
}
}
return true;
}
int main() {
int N;
cout<<"Nhap so N cua MT vuong: ";
cin >> N;
vector<vector<int>> A(N, vector<int>(N));
cout << "Nhap ma tran vuong:\n";
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
cout << " A[" << i << "][" << j << "]: ";
cin >> A[i][j];
}
}
int sumEven = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (A[i][j] % 2 == 0) {
sumEven += A[i][j];
}
}
}
int sumPrimeUpperDiagonal = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (i < j && KTSNT(A[i][j])) {
sumPrimeUpperDiagonal += A[i][j];
}
}
}
int sumDivisibleBy3Or4LowerDiagonal = 0;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (i + j > N-1 && (A[i][j] % 3 == 0 || A[i][j] % 4 == 0)) {
sumDivisibleBy3Or4LowerDiagonal += A[i][j];
}
}
}
int sumNonPrimeDiagonal = 0;
for (int i = 0; i < N; ++i) {
if (!KTSNT(A[i][i])) {
sumNonPrimeDiagonal += A[i][i];
}
}
cout << "a. Tong cac so chan tren ma tran: " << sumEven << endl;
cout << "b. Tong cac so nguyen to tren nua tren duong cheo chinh: " <<
sumPrimeUpperDiagonal << endl;
cout << "c. Tong cac so chia het cho 3 hoac 4 tren nua duoi duong cheo phu: " <<
sumDivisibleBy3Or4LowerDiagonal << endl;
cout << "d. Tong cac so khong phai la so nguyen to tren duong cheo chinh: " <<
sumNonPrimeDiagonal << endl;
return 0;
}
// BAI 2:
#include <iostream>
using namespace std;
#define MAX 100
int main() {
int N;
cout << "Nhap kich thuoc ma tran vuong (N): ";
cin >> N;
int A[MAX][MAX];
cout << "Nhap ma tran A:" << endl;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cout << "A[" << i << "][" << j << "]: ";
cin >> A[i][j];
}
}
int X;
cout << "Nhap so nguyen X: ";
cin >> X;
bool timThay = false;
int dong, cot;
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
if (A[i][j] == X) {
timThay = true;
dong = i;
cot = j;
break;
}
}
if (timThay) {
break;
}
}
if (timThay) {
cout << "Vi tri cua phan tu " << X << " la dong " << dong << ", cot " << cot << "."
<< endl;
} else {
cout << "Khong co" << endl;
}
return 0;
}
// BAI 3:
#include <iostream>
using namespace std;
#define MAX 100
int main() {
int N;
cout << "Nhap kich thuoc ma tran vuong (N): ";
cin >> N;
int A[MAX][MAX];
cout << "Nhap ma tran A:" << endl;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cout << "A[" << i << "][" << j << "]: ";
cin >> A[i][j];
}
}
int maxSum = 0;
int columnIndex = 0;
for (int j = 0; j < N; j++) {
int currentSum = 0;
for (int i = 0; i < N; i++) {
currentSum += A[i][j];
}
if (currentSum > maxSum) {
maxSum = currentSum;
columnIndex = j;
}
}
cout << "Tong cua cot co gia tri cac phan tu tren cot lon nhat (cot " << columnIndex <<
"): " << maxSum << endl;
return 0;
}
// BAI 4:
#include <iostream>
#include <algorithm>
#define MAX 100
using namespace std;
int main() {
int N;
cout << "Nhap kich thuoc ma tran vuong (N): ";
cin >> N;
int A[MAX][MAX];
cout << "Nhap ma tran A:" << endl;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cout << "A[" << i << "][" << j << "]: ";
cin >> A[i][j];
}
}
for (int i = 0; i < N; i++) {
sort(A[i], A[i] + N);
}
cout << "Ma tran sau khi sap xep tang dan theo chieu ngang:" << endl ;
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
cout << A[i][j] << " ";
}
cout << endl;
}
return 0;
}
