#1332
Se dă o tablă de șah formată din n linii și m coloane, definind n*m zone, unele dintre ele fiind libere, altele conținând obstacole. În zona de coordonate 1 1 se află un cal care se poate deplasa pe tablă în L, ca la șah, fără a părăsi tabla, fără a trece prin zone care conțin obstacole și fără a trece de două ori prin aceeași zonă.
Determinați o modalitate prin care calul poate ajunge în zona de coordonate n m – unde se află o căpiță de fân.
| Problema | TraseuCal | Operații I/O |
traseucal.in/traseucal.out
|
|---|---|---|---|
| Limita timp | 1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #61763594 | Utilizator | |
| Fișier | traseucal.cpp | Dimensiune | 1.51 KB |
| Data încărcării | 09 Decembrie 2025, 12:38 | Scor/rezultat | Eroare de compilare |
traseucal.cpp:5:1: error: expected ',' or ';' before 'ofstream' ofstream fout("traseucal.out") ^ traseucal.cpp: In function 'void citire()': traseucal.cpp:12:7: error: 'n' was not declared in this scope {fin>>n>>m; ^ traseucal.cpp:12:10: error: 'm' was not declared in this scope {fin>>n>>m; ^ traseucal.cpp:16:18: error: 'a' was not declared in this scope fin>>a[i][j]; ^ traseucal.cpp:17:13: error: 'sol' was not declared in this scope sol[i][j]=0; ^ traseucal.cpp: In function 'void bordare()': traseucal.cpp:22:22: error: 'n' was not declared in this scope for (int i=0; i<=n+3; i++) ^ traseucal.cpp:23:9: error: 'a' was not declared in this scope a[i][0]=a[i][m+3]=1; ^ traseucal.cpp:23:22: error: 'm' was not declared in this scope a[i][0]=a[i][m+3]=1; ^ traseucal.cpp:24:22: error: 'm' was not declared in this scope for (int j=0; j<=m+3; j++) ^ traseucal.cpp:25:9: error: 'a' was not declared in this scope a[0][j]=a[n+3][j]=1; ^ traseucal.cpp:25:19: error: 'n' was not declared in this scope a[0][j]=a[n+3][j]=1; ^ traseucal.cpp:26:22: error: 'n' was not declared in this scope for (int i=1; i<=n+2; i++) ^ traseucal.cpp:27:9: error: 'a' was not declared in this scope a[i][1]=a[i][m+2]=1; ^ traseucal.cpp:27:22: error: 'm' was not declared in this scope a[i][1]=a[i][m+2]=1; ^ traseucal.cpp:28:22: error: 'm' was not declared in this scope for (int j=1; j<=m+2; j++) ^ traseucal.cpp:29:9: error: 'a' was not declared in this scope a[1][j]=a[n+2][j]=1; ^ traseucal.cpp:29:19: error: 'n' was not declared in this scope a[1][j]=a[n+2][j]=1; ^ traseucal.cpp: In function 'void afisare()': traseucal.cpp:33:22: error: 'n' was not declared in this scope for (int i=2; i<=n+1; i++) ^ traseucal.cpp:35:26: error: 'm' was not declared in this scope for (int j=2; j<=m+1; j++) ^ traseucal.cpp:36:13: error: 'fout' was not declared in this scope fout<<sol[i][j]<<' '; ^ traseucal.cpp:36:19: error: 'sol' was not declared in this scope fout<<sol[i][j]<<' '; ^ traseucal.cpp:37:9: error: 'fout' was not declared in this scope fout<<endl; ^ traseucal.cpp: In function 'void bkt(int, int, int)': traseucal.cpp:42:9: error: 'ok' was not declared in this scope if (ok) ^ traseucal.cpp:44:12: error: 'n' was not declared in this scope if (i==n+1 && j==m+1) ^ traseucal.cpp:44:22: error: 'm' was not declared in this scope if (i==n+1 && j==m+1) ^ traseucal.cpp:46:9: error: 'sol' was not declared in this scope sol[i][j]=nr-1, ok=1; ^ traseucal.cpp:46:25: error: 'ok' was not declared in this scope sol[i][j]=nr-1, ok=1; ^ traseucal.cpp:53:13: error: 'a' was not declared in this scope if (a[iv][jv]==0) ^ traseucal.cpp:55:27: error: 'sol' was not declared in this scope a[iv][jv]=-1, sol[iv][jv]=nr; ^ traseucal.cpp: In function 'int main()': traseucal.cpp:65:5: error: 'a' was not declared in this scope a[2][2]=-1, sol[2][2]=1; ^ traseucal.cpp:65:17: error: 'sol' was not declared in this scope a[2][2]=-1, sol[2][2]=1; ^ traseucal.cpp:67:9: error: 'ok' was not declared in this scope if (ok==0) ^ traseucal.cpp:68:26: error: 'n' was not declared in this scope for (int i=2; i<=n; i++) ^ traseucal.cpp:70:30: error: 'm' was not declared in this scope for (int j=2; j<=m; j++) ^ traseucal.cpp:71:17: error: 'fout' was not declared in this scope fout<<0<<' '; ^ traseucal.cpp:72:13: error: 'fout' was not declared in this scope fout<<endl; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema TraseuCal face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.