Pagini recente » Cod sursa (job #1074812) | Cod sursa (job #915151) | Cod sursa (job #2092534) | Cod sursa (job #2517505) | Cod sursa (job #987638)
Cod sursa(job #987638)
#include <fstream>
using namespace std;
ifstream f("elimin.in");
ofstream g("elimin.out");
int main()
{
int m,n,r,c,a[200][200],z=0,x,y,i,j,s=0,s1=0,su=0,su1=0,suc=0,sul=0,ok=0,nrc=0,nrl=0;
f>>m>>n>>r>>c;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
while(ok!=n)
{ ok++;
for(j=1;j<=n;j++)
if(ok%2==0)
{s1=s1+a[j][ok];
x=ok;}
else
{s=s+a[j][ok];
y=ok;}
if(s<s1)
{suc=s;
nrc=ok;}
else
{suc=s1;
nrc=ok;}
if(x==y+1)
s=0;
if(y==x+1)
s1=0;
}
ok=0;
while(ok!=m)
{ ok++;
for(i=1;i<=m;i++)
if(ok%2==0)
{su1=su1+a[i][ok];
x=ok;}
else
{su=su+a[i][ok];
y=ok;}
if(su<su1)
{sul=su;
nrl=ok;}
else
{sul=su1;
nrl=ok;}
if(x==y+1)
su=0;
if(y==x+1)
su1=0;
}
for(i=1;i<=m;i++)
if(nrl==i)
for(j=1;j<=n;j++)
a[i][j]=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
if(nrc==j)
a[i][j]=0;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
z=z+a[i][j];
g<<z;
return 0;
}