日志
c++20250416
||
1.计算鞍点：
#include <iostream>
using namespace std;
int main() {
int ar[5][5], b[2];
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
cin >> ar[i][j];
}
}
bool min = 1;
for (int i = 0; i < 5; i++) {
b[0] = ar[i][0];
b[1] = 0;
for (int j = 1; j < 5; j++) {
if (ar[i][j] > b[0]) {
b[0] = ar[i][j];
b[1] = j;
}
}
min = 1;
for (int k = 0; k < 5; k++) {
if (ar[k][b[1]] < b[0]) {
min = 0;
break;
}
}
if (min == 1) {
cout << i + 1 << " " << b[1] + 1 << " " << b[0];
}
}
if (min==0) {
cout<<"not found";
}
}
2.计算相似度：
#include <iostream>
using namespace std;
int main() {
int m, n,s=0;
cin >> m >> n;
int ar1[m][n], ar2[m][n];
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> ar1[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
cin >> ar2[i][j];
}
}
for (int i = 0; i < m; i++) {
for (int j = 0; j < n; j++) {
if(ar1[i][j]==ar2[i][j]){
s++;
}
}
}
printf("%.2f%%",100.00*s/m/n);
}
全部作者的其他最新日志
- • c++20250521
- • c++20250514
- • c++20250409
- • c++20250402