Pagini recente » Pitici2 | Istoria paginii teoria-jocurilor/adunarea-jocurilor | Diferente pentru utilizator/tvlad intre reviziile 32 si 30 | Infoarena Monthly 2012, Runda 5 | Cod sursa (job #737579)
Cod sursa(job #737579)
#include <stdio.h>
FILE* f=fopen("flip.in","r");
FILE* g=fopen("flip.out","w");
long v[1000],x,n2,n,i,j,v2[1000],m[1000][1000],sav1,sav2,maxc,maxl,s;
int main()
{
fscanf(f,"%ld%ld",&n,&n2);
for (i=1;i<=n;i++)
{
for (j=1;j<=n2;j++)
{
fscanf(f,"%ld",&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];
fprintf(g,"%ld\n",s);
fclose(f);
return 0;
}