Pagini recente » Cod sursa (job #713243) | Rating Filip Rares (filiprares) | Cod sursa (job #1644123) | Cod sursa (job #1685476) | Cod sursa (job #2066959)
#include <iostream>
#include <fstream>
using namespace std;
const int N=1001;
int v[N][N], d[N*N];
ifstream fin ("struti.in ");
ofstream fout ("struti.out");
int main()
{
int st=0, dr=-1, m, n, p, x, y, i;
bool ok=1;
fin>>m>>n>>p;
for( int i = 0 ; i < m ; i++ )
for( int j = 0 ; j < n; j++ )
fin>>v[i][j];
while(p!=0)
{
fin>>x>>y;
p--;
for( int j = 0 ; j < n ; j++ )
{
if(ok)
{
for( i = 0 ; i < m ; i++ )
{
}
ok=0;
}
else
{
for( i = m-1 ; i >= 0 ; i-- )
ok=1;
}
}
}
return 0;
}