Pagini recente » Cod sursa (job #1701748) | Cod sursa (job #2862236) | Cod sursa (job #2046964) | Cod sursa (job #1435184) | Cod sursa (job #1246576)
#include<fstream>
using namespace std;
ifstream f("flip.in");
ofstream g("flip.out");
long long int a[16][16],b[16][4],s1,s2;
int n,m,i,j;
void adun(int l, int c)
{
int i=0,j=0;
for(i=1;i<=m;i++)
if(a[l][i]<0)
b[l][1]+=a[l][i];
else
b[l][2]+=a[l][i];
for(j=1;j<=n;j++)
if(a[j][c]<0)
b[l][3]+=a[j][c];
else
b[l][4]+=a[j][c];
}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
adun(i,i);
for(i=1;i<=n;i++)
{for(j=1;j<=4;j++)
g<<b[i][j]<<" ";
g<<"\n";
}
return 0;
}
/*#include<fstream>
using namespace std;
ifstream f("444.in");
ofstream g("444.out");
int s,b[100],c[100],n,i,j,k;
int main()
{
f>>s;
f>>n;
for(i=n;i>=1;i--)
f>>b[i];
for(i=1;i<=n;i++)
while(s>=b[i])
{
s=s-b[i];
c[i]++;
}
for(i=1;i<=n;i++)
g<<c[i]<<" "<<b[i]<<"\n";
return 0;
}*/