Pagini recente » Cod sursa (job #3255074) | Cod sursa (job #33031) | Cod sursa (job #418311) | Solutii Autumn Warmup, Runda 2 | Cod sursa (job #10559)
Cod sursa(job #10559)
//#pragma option -3 -a -Z -O2 -r
#include<fstream.h>
int mat[17][17],n,m;
int s[11];
ifstream f("flip.in");
ofstream g("flip.out");
int main()
{int i,j,l,c,k,t,man;
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{f>>mat[i][j];mat[0][j]+=mat[i][j];mat[i][0]+=mat[i][j];}
f.close();
long min=2000000000;
for(i=1;i<=n;i++) if(mat[i][0]<min) {min=mat[i][0];l=i;}
min=1000001;
for(j=1;j<=m;j++) if(mat[0][j]<min) {min=mat[0][j];c=j;}
for(i=1;i<=n;i++) mat[i][c]=mat[i][c]*(-1);
for(j=1;j<=m;j++) mat[l][j]=mat[l][j]*(-1);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{k=10;
t=mat[i][j];
s[k]+=t%10;
if(s[k]>9) {man=s[k];
s[k]=man%10;
s[k-1]+=man/10;
}
t=t/10;
while(t)
{k--;
s[k]+=t%10;
if(s[k]>9) {s[k]=s[k]%10;s[k-1]+=s[k]/10;}
t=t/10;
}
}
k=1;
while(!s[k]) k++;
for(i=k;i<=10;i++) g<<s[i];
g<<'\n';
g.close();
return 0;
}