Pagini recente » Cod sursa (job #1512362) | Cod sursa (job #2655477) | Cod sursa (job #131941) | Cod sursa (job #1948765) | Cod sursa (job #3122261)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("bemo.in");
ofstream fout("bemo.out");
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)
if (valid(l+1, c))
if (valid(l, c+1))
if (a[l+1][c] < a[l][c+1]) fout<<' '<<a[l+1][c], l++;
else fout<<' '<<a[l][c+1], c++;
else fout<<' '<<a[l+1][c], l++;
else if (valid(l, c+1)) fout<<' '<<a[l][c+1], c++;
else break;
return 0;
}