#779
Se dă o matrice cu n
linii şi m
coloane şi elemente numere naturale. Să se determine câte elemente din matrice au toți vecinii numere pare.
Problema | VeciniPari | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58296443 | Utilizator | |
Fișier | vecinipari.c | Dimensiune | 964 B |
Data încărcării | 25 Mai 2025, 19:52 | Scor / rezultat | 100 puncte |
vecinipari.c: In function 'main': vecinipari.c:12:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[2][1]%2==0 && a[1][2]%2==0?++k:k; ^ vecinipari.c:14:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[1][n-1]%2==0 && a[2][n]%2==0?++k:k; ^ vecinipari.c:16:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[1][j-1]%2==0 && a[1][j+1]%2==0 && a[2][j]%2==0?++k:k; ^ vecinipari.c:19:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[m-1][1]%2==0 && a[m][2]%2==0?++k:k; ^ vecinipari.c:21:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[m][n-1]%2==0 && a[m-1][n]%2==0?++k:k; ^ vecinipari.c:23:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[m][j-1]%2==0 && a[m][j+1]%2==0 && a[m-1][j]%2==0?++k:k; ^ vecinipari.c:26:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[i][j+1]%2==0 && a[i-1][j]%2==0 && a[i+1][j]%2==0?++k:k; ^ vecinipari.c:28:7: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[i][j-1]%2==0 && a[i+1][j]%2==0 && a[i-1][j]%2==0?++k:k; ^ vecinipari.c:30:6: warning: operation on 'k' may be undefined [-Wsequence-point] k=a[i][j-1]%2==0 && a[i][j+1]%2==0 && a[i-1][j]%2==0 && a[i+1][j]%2==0?++k:k; ^ vecinipari.c:24:11: warning: suggest explicit braces to avoid ambiguous 'else' [-Wparentheses] else if(i!=1 || i!=m) ^ vecinipari.c:4:7: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result] scanf("%lld %lld",&m,&n); ^ vecinipari.c:7:9: warning: ignoring return value of 'scanf', declared with attribute warn_unused_result [-Wunused-result] scanf("%lld",&a[i][j]); ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 20 | 20 | Exemplu | |
2 | 0 secunde | OK. | 40 | 40 | ||
3 | 0 secunde | OK. | 40 | 40 | ||
Punctaj total | 100 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema VeciniPari 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ă.