Pagini recente » Cod sursa (job #3243283) | Cod sursa (job #635073) | Cod sursa (job #3285021) | Cod sursa (job #1210577) | Cod sursa (job #1117650)
#include <fstream>
using namespace std;
ifstream f;
ofstream g;
int n, m;
long int a[17][17], vl[17], vc[17];
long int s, s1;
int i,j, k, s2;
int main()
{
f.open("flip.in");
g.open("flip.out");
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
f>>a[i][j];
s+=a[i][j];
}
f.close();
while(vc[0]==0)
{
k=m;
while(vc[k]==1)
{
vc[k]=0;
k--;
}
vc[k]=1;
s1=0;
for(i=1;i<=n;i++)
{
s2=0;
for(j=1;j<=m;j++)
if (vc[j]==0) s2+=a[i][j];
else s2-=a[i][j];
if(s2<0) s2*=(-1);
s1+=s2;
}
if (s1>s) s=s1;
}
g<<s;
g.close();
return 0;
}