#1221
PieseSah
O tablă de șah cu n*n
căsuțe conține niște piese de șah . Să se stabilească dacă anumite căsuțe sunt atacate, neatacate sau ocupate de cel puțin una din acele piese.
Problema | PieseSah | Operații I/O |
piesesah.in /piesesah.out
|
---|---|---|---|
Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #28781932 | Utilizator | |
Fișier | piesesah.cpp | Dimensiune | 2.83 KB |
Data încărcării | 18 Martie 2021, 02:50 | Scor / rezultat | 90 puncte |
piesesah.cpp:5:78: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:78: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:102: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:102: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:125: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:148: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:186: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:186: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:186: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:224: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:224: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:224: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:263: warning: narrowing conversion of '-2' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:263: warning: narrowing conversion of '-2' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:263: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:263: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:302: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] unsigned long long int x, y, k, n, a[1001][1001], m, t, p1[] = { 1, -1, 1, -1}, p2[] = {-1, -1, 1, 1}, t1[] = {-1, 0, 1, 0}, t2[] = { 0, 1, 0, -1}, r1[] = {-1, -1, -1, 0, 0, 1, 1, 1}, r2[] = {-1, 0, 1, -1, 1, -1, 0, 1}, c1[] = {-2, -2, -1, 1, 2, 2, 1, -1}, c2[] = {-1, 1, 2, 2, 1, -1, -2, -2};; ^ piesesah.cpp:5:302: warning: narrowing conversion of '-1' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:302: warning: narrowing conversion of '-2' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp:5:302: warning: narrowing conversion of '-2' from 'int' to 'long long unsigned int' inside { } [-Wnarrowing] piesesah.cpp: In function 'bool inmat(int, int)': piesesah.cpp:8:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] return x>0 && y>0 && x<=n && y<=n; ^ piesesah.cpp:8:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] return x>0 && y>0 && x<=n && y<=n; ^ piesesah.cpp: In function 'int main()': piesesah.cpp:15:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1;i<=n;i++) ^ piesesah.cpp:16:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=1;j<=n;j++) ^ piesesah.cpp:18:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int l=1; l<=m; l++) ^ piesesah.cpp:26:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int l=1;l<=m;l++) ^ piesesah.cpp:99:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<=t; i++) ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 10 | 10 | Exemplu | |
2 | 0 secunde | OK. | 10 | 10 | Exemplu | |
3 | 0 secunde | OK. | 10 | 10 | ||
4 | 0 secunde | OK. | 10 | 10 | ||
5 | 0 secunde | OK. | 10 | 10 | ||
6 | 0.004 secunde | OK. | 10 | 10 | ||
7 | 0.008 secunde | OK. | 10 | 10 | ||
8 | 0.02 secunde | OK. | 10 | 10 | ||
9 | 0.044 secunde | OK. | 10 | 10 | ||
10 | 0.06 secunde | Raspuns gresit. | 10 | 0 | ||
Punctaj total | 90 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema PieseSah 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ă.