#223
Se dă o matrice cu elemente numere naturale. Să se determine ultima cifră a produsului elementelor de pe diagonala secundară cu proprietatea că sunt minime pe coloanele lor.
Variante Bacalaureat 2009
| Problema | MinCols1 | Operații I/O |
mincols1.in/mincols1.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64748731 | Utilizator | |
| Fișier | mincols1.cpp | Dimensiune | 686 B |
| Data încărcării | 27 Mai 2026, 16:42 | Scor/rezultat | Eroare de compilare |
mincols1.cpp:6:5: error: expected ‘,’ or ‘;’ before ‘int’ 6 | int a[501][501],n,g; | ^~~ mincols1.cpp: In function ‘int main()’: mincols1.cpp:10:14: error: ‘n’ was not declared in this scope 10 | fin>>n; | ^ mincols1.cpp:13:18: error: ‘a’ was not declared in this scope 13 | fin>>a[i][j]; | ^ mincols1.cpp:19:16: error: ‘a’ was not declared in this scope 19 | if(a[i][j]<mn)mn=a[i][j]; | ^ mincols1.cpp:20:12: error: ‘a’ was not declared in this scope 20 | a[0][j]=mn; | ^ mincols1.cpp:23:8: error: ‘g’ was not declared in this scope 23 | g=0; | ^ mincols1.cpp:25:12: error: ‘a’ was not declared in this scope 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ^ mincols1.cpp:25:59: error: expected ‘)’ before ‘;’ token 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ~ ^ | ) mincols1.cpp:25:9: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation] 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ^~ mincols1.cpp:25:60: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’ 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ^ mincols1.cpp:24:8: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation] 24 | for(i=1;i<=n;i++) | ^~~ mincols1.cpp:25:60: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’ 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ^ mincols1.cpp:25:64: error: expected primary-expression before ‘)’ token 25 | if(a[i][n-i+1]==a[0][n-i+1]) (p=p*(a[i][n-i+1])%10;g=1;) | ^ mincols1.cpp:27:9: error: ‘else’ without a previous ‘if’ 27 | else fout<<p%10; | ^~~~
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema MinCols1 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ă.