题目1191：矩阵最大值

来源：互联网发布：结对编程恶搞编辑：程序博客网时间：2024/06/08 07:42
#include <iostream>#include <algorithm>#include <queue>#include <vector>#include <cstring>#include <stack>#include <string>#include <string.h>#include <stdio.h>#include <cmath>#include <map>#include <functional>#include <set>#include <limits.h>#include <math.h>#include <ctype.h>using namespace std;//1191 int m,n;int mtr[101][101];int main(){    //freopen("input.txt","r",stdin);    while(cin>>m>>n)    {        memset(mtr,0,sizeof(mtr));        for(int i=1;i<=m;i++)            for(int j=1;j<=n;j++)                cin>>mtr[i][j];         for(int i=1;i<=m;i++)        {            int mx=-1,sum=0;            int j,idx=0;            for(j=1;j<=n;j++)            {                sum+=mtr[i][j];                if(mtr[i][j]>mx)                    mx=mtr[i][j],idx=j;            }            mtr[i][idx]=sum;        }        for(int i=1;i<=m;i++)        {            bool flag=true;            for(int j=1;j<=n;j++)            {                if(flag)    cout<<mtr[i][j];                else        cout<<" "<<mtr[i][j];                flag=false;            }            cout<<endl;        }     }    return 0;}/**************************************************************    Problem: 1191    User: cust123    Language: C++    Result: Accepted    Time:110 ms    Memory:1560 kb****************************************************************/
0 0