Pagini recente » Cod sursa (job #212803) | Cod sursa (job #316450) | Cod sursa (job #2519055) | Cod sursa (job #3153688) | Cod sursa (job #3122243)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bemo.in");
ofstream fout("bemo.out");
#define fin cin
#define fout cout
const short NMAX = 1500;
int a[NMAX+5][NMAX+5];
short n, m;
bool valid(short i, short j)
{
return i >= 1 && i <= n && j >= 1 && j <= m;
}
int main()
{
short l = 1, c = 1;
fin>>n>>m;
for (short i = 1; i <= n; i++)
for (short j = 1; j <= m; j++) fin>>a[i][j];
fout<<a[1][1];
while (l < n && c < m) {
int minim;
if (valid(l+1, c)) minim = a[l+1][c];
if (valid(l, c+1)) minim = min(minim, a[l][c+1]);
fout<<' '<<minim;
if (minim == a[l+1][c]) l++;
else c++;
}
fout<<' '<<a[n][m];
return 0;
}