Pagini recente » Cod sursa (job #991360) | Cod sursa (job #2937698) | Cod sursa (job #2504780) | Cod sursa (job #524373) | Cod sursa (job #1114132)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int i,j,r,t,n,m,s,S,a[17][17],Max;
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(a[0][m+1]==0){
S=0;
s=0;
for(i=1;i<=m+1;i++){
if(a[0][i]==0){
a[0][i]=1;
break;}
else
a[0][i]=0;}
for(t=1;t<=n;t++){
s=0;
for(r=1;r<=m;r++)
if(a[0][r]==1)
s=s-a[t][r];
else
s=s+a[t][r];
if(s<0)
S=S-s;
else
S=S+s;}
if(S>Max)
Max=S;;}
g<<Max;
return 0;
}