#3808
ADFGVX
Să se cripteze sau să se decripteze un mesaj folosind cifrul ADFGVX.
cifrul ADFGVX
Problema | ADFGVX | Operații I/O |
adfgvx.in /adfgvx.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #53960418 | Utilizator | |
Fișier | adfgvx.cpp | Dimensiune | 3.35 KB |
Data încărcării | 15 Noiembrie 2024, 23:05 | Scor / rezultat | 0 puncte |
adfgvx.cpp: In function 'int main()': adfgvx.cpp:28:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<strlen(mesaj); i++) ^ adfgvx.cpp:73:53: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<=(strlen(mesaj)/strlen(cheie))*2+1; i++) ^ adfgvx.cpp:75:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=1; j<=strlen(cheie); j++) ^ adfgvx.cpp:78:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(j+1<=strlen(cheie)) ^ adfgvx.cpp:96:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<=strlen(vecsup); i++) ^ adfgvx.cpp:98:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=i+1; j<strlen(vecsup); j++) ^ adfgvx.cpp:105:65: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int k=1; k<=(strlen(mesaj)/strlen(cheie))*2+1; k++) ^ adfgvx.cpp:125:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=1; j<=strlen(cheie); j++) ^ adfgvx.cpp:127:57: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<=(strlen(mesaj)/strlen(cheie))*2+1; i++) ^ adfgvx.cpp:37:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:43:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:49:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:55:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:61:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:67:21: warning: array subscript is above array bounds [-Warray-bounds] cl[2][i+1]=j+1; ^ adfgvx.cpp:81:34: warning: array subscript is above array bounds [-Warray-bounds] fina[i][j+1]=cl[2][k]; ^ adfgvx.cpp:88:34: warning: array subscript is above array bounds [-Warray-bounds] fina[i+1][1]=cl[2][k]; ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | Raspuns gresit. | 5 | 0 | Exemplu | |
2 | 0 secunde | Raspuns gresit. | 5 | 0 | Exemplu | |
3 | 0 secunde | Raspuns gresit. | 10 | 0 | ||
4 | 0 secunde | Raspuns gresit. | 10 | 0 | ||
5 | 0.004 secunde | Raspuns gresit. | 20 | 0 | ||
6 | 0 secunde | Raspuns gresit. | 20 | 0 | ||
7 | 0 secunde | Raspuns gresit. | 10 | 0 | ||
8 | 0 secunde | Raspuns gresit. | 10 | 0 | ||
9 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
10 | 0 secunde | Raspuns gresit. | 5 | 0 | ||
Punctaj total | 0 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema ADFGVX 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ă.