矩阵的一个题
下面展示一些 内联代码片
。
#include <iostream>
using namespace std;
int func(int a){
int sum = 1;
for(int i = 0; i < a; i++){
sum *= 2;
}
return sum;
}
// 2+4 4*4 + 3*12 + 8*(10)
int main(){
int n, m;
cin >> n >> m;
int sum = 0;
int times = 1;
int a[2][3] = {
{1, 2, 3},
{3, 4, 2}
};
// for(int i = 0; i < n;i++){
// for(int j = 0; j < m; j++){
// cin >> a[i][j];
// }
// }
for(int times = 1; times <= m; times ++){
for(int i = 0; i < n;i++){
int head = 0, tail = n - 1;
for(int k = 0; k < m; k++){
if(a[i][k] != -1) {
head = k;
break;
}
}
for(int k = m - 1; k >= 0; k--){
if(a[i][k] != -1) {
tail = k;
break;
}
}
if(a[i][head] < a[i][tail]){
sum += (a[i][head] * func(times));
a[i][head]= -1;
}else{
sum += (a[i][tail] * func(times));
a[i][tail] = -1;
}
}
}
cout << sum << endl;
return 0;
}