Pagini recente » Cod sursa (job #2538151) | Cod sursa (job #1109464) | Cod sursa (job #3156268) | Cod sursa (job #26659) | Cod sursa (job #2951751)
#include <stdio.h>
#include <stdlib.h>
int main()
{
FILE* f;
FILE* g;
f=fopen("D:\\Dragos Baiu\\programe\\Flip\\flip.in.txt","r");
g=fopen("D:\\Dragos Baiu\\programe\\Flip\\flip.out.txt","w");
int t[16][16],N,M,s=0,s1,S=0,T[16][16];
fscanf(f,"%d%d",&N,&M);
//s
for (int i=1;i<=N;i++)
{
s1=0;
for (int j=1;j<=M;j++)
{
fscanf(f,"%d",&t[i][j]);
T[i][j]=t[i][j];
s1=s1+t[i][j];
}
if (s1<0)
{
for (int k=1;k<=M;k++)
{
t[i][k]=t[i][k]*-1;
}
}
}
for (int m=1;m<=M;m++)
{
s1=0;
for (int n=1;n<=N;n++)
{
s1=s1+t[n][m];
}
if (s1<0)
{
for (int k=1;k<=N;k++)
{
t[k][m]=t[k][m]*-1;
}
}
}
//S
for (int m=1;m<=M;m++)
{
s1=0;
for (int n=1;n<=N;n++)
{
s1=s1+T[n][m];
}
printf("%d\n",s1);
if (s1<0)
{
int s2=0;
for (int k=1;k<=N;k++)
{
T[k][m]=T[k][m]*-1;
}
}
}
for (int i=1;i<=N;i++)
{
s1=0;
for (int j=1;j<=M;j++)
{
s1=s1+T[i][j];
}
if (s1<0)
{
for (int k=1;k<=M;k++)
{
T[i][k]=T[i][k]*-1;
}
}
}
//S sau s
for (int y=1;y<=N;y++)
{
for (int z=1;z<=M;z++)
{
s=s+t[y][z];
S=S+T[y][z];
}
}
if (S>s)
{
fprintf(g,"%d",S);
}
else
{
fprintf(g,"%d",s);
}
fclose(f);
fclose(g);
return 0;
}