Pagini recente » Rating clabucel (Claudiahvariantaceamaibuna) | Cod sursa (job #3282676) | Cod sursa (job #1635129) | Cod sursa (job #553943) | Cod sursa (job #1114058)
#include <fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
int n,m,i,j,l,v[17],a[17][17],sum,s,Max;
int main()
{f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
while(v[m]==0)
{
for(i=1;i<=m;i++)
{
if(v[i]==1)
v[i]=0;
else
{
v[i]=1;
break;
}
}sum=0;
for(j=1;j<=n;j++)
{
s=0;
for(l=1;l<=m;l++)
{
if(v[l]==1)
s=s-a[j][l];
else
s=s+a[j][l];
}
if(s<0)
sum=sum-s;
else
sum=sum+s;
}
if(sum>Max)
Max=sum;}
g<<Max;
return 0;
}