Pagini recente » Cod sursa (job #1862104) | Cod sursa (job #3121720) | Cod sursa (job #299370) | Cod sursa (job #2097225) | Cod sursa (job #696663)
Cod sursa(job #696663)
#include <fstream.h>
ifstream f("filip.in");
ofstream g("filip.out");
long v[17],x,n2,n,i,j,v2[17],m[17][17],sav1,sav2,maxc,maxl,s;
int main()
{
f>>n>>n2;
for (i=1;i<=n;i++)
{
for (j=1;j<=n2;j++)
{
f>>m[i][j];
v[i]=v[i]+m[i][j];
}
}
for (i=1;i<=n2;i++)
for (j=1;j<=n;j++)
v2[i]=v2[i]+m[j][i];
if (n>n2) x=n;
else x=n2;
for (i=1;i<=n;i++)
{
if (v[i]<maxc)
{
sav1=i;
maxc=v[i];
}
if (v2[i]<maxl)
{
sav2=i;
maxl=v2[i];
}
}
for (i=1;i<=n2;i++)
m[sav1][i]=m[sav1][i]*-1;
for (i=1;i<=n;i++)
m[i][sav2]=m[i][sav2]*-1;
for (i=1;i<=n;i++)
for (j=1;j<=n2;j++)
s=s+m[i][j];
g<<s;
f.close();
g.close();
return 0;
}