#include #include #include #include using namespace std; int i, j, stj, sti, nr, si, sj, fi, fj, mi, mj, fn1i, fn1j, fn2i, fn2j; bool found; queue coada; int alt; int main() { si=0; sj=0; fi=199; fj=199; while(!found) { while(si>alt; if(alt==0) { found=true; break; } if(alt>0) { cout<>alt; if(alt==0) { found=true; break; } if(alt<0) { fn1i=mi; fn1j=mj; fn2i=mi-1; fn2j=mj-1; break; } fi=mi-1; fj=mj-1; } if(alt<0) { cout<>alt; if(alt==0) { found=true; break; } if(alt>0) { fn1i=mi; fn1j=mj; fn2i=mi+1; fn2j=mj+1; break; } si=mi+1; sj=mj+1; } } if(!found) { //from fn1i, fn1j for(i=fn1i-1; i>=0; i--) { cout<>alt; if(alt<0) break; if(alt==0) { found=true; break; } } if(found==true) break; for(i=fn1j-1; i>=0; i--) { cout<>alt; if(alt<0) break; if(alt==0) { found=true; break; } } if(found==true) break; for(i=fn2i-1; i>=0; i--) { cout<>alt; if(alt<0) break; if(alt==0) { found=true; break; } } if(found==true) break; for(i=fn2j-1; i>=0; i--) { cout<>alt; if(alt<0) break; if(alt==0) { found=true; break; } } if(found==true) break; } } }