c++ find the column number(index) that have maximum sum of i

问题描述：

c++ find the column number(index) that have maximum sum of it's elements
You task is to find the column number(index) that have maximum sum of it's elements.
Input
First line N and M (1
1个回答 分类：综合 2014-11-22

问题解答：

我来补答
#include
#include
using namespace std;
int main(){
int n;
int m;
cin>>n>>m;
int* array = new int[m*n];
int i,j;
for(i=0; i>array[i];
int max = -1;
int col = 1;
for(j=0; j
 
 
展开全文阅读
剩余:2000字
上一页：椭圆简单性质
下一页：求解这个表格
也许感兴趣的知识