#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 | #54682070 | Utilizator | |
Fișier | adfgvx.cpp | Dimensiune | 4.15 KB |
Data încărcării | 05 Decembrie 2024, 11:48 | Scor / rezultat | 100 puncte |
adfgvx.cpp: In function 'void task1()': adfgvx.cpp:21:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='A'; ^ adfgvx.cpp:23:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='D'; ^ adfgvx.cpp:25:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='F'; ^ adfgvx.cpp:27:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='G'; ^ adfgvx.cpp:29:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='V'; ^ adfgvx.cpp:31:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].i='X'; ^ adfgvx.cpp:34:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='A'; ^ adfgvx.cpp:36:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='D'; ^ adfgvx.cpp:38:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='F'; ^ adfgvx.cpp:40:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='G'; ^ adfgvx.cpp:42:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='V'; ^ adfgvx.cpp:44:22: warning: array subscript has type 'char' [-Wchar-subscripts] v[m[i][j]].j='X'; ^ adfgvx.cpp:52:26: warning: array subscript has type 'char' [-Wchar-subscripts] b[k++]=v[a[i]].i; ^ adfgvx.cpp:53:26: warning: array subscript has type 'char' [-Wchar-subscripts] b[k++]=v[a[i]].j; ^ adfgvx.cpp: In function 'void task2()': adfgvx.cpp:92:23: warning: array subscript has type 'char' [-Wchar-subscripts] v[adfgvx[i]][adfgvx[j]]=m[i][j]; ^ adfgvx.cpp:92:34: warning: array subscript has type 'char' [-Wchar-subscripts] v[adfgvx[i]][adfgvx[j]]=m[i][j]; ^ adfgvx.cpp:123:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0;i<=strlen(a);i++) ^ adfgvx.cpp:180:23: warning: array subscript has type 'char' [-Wchar-subscripts] fout<<v[a[i-1]][a[i]]; ^ adfgvx.cpp:180:29: warning: array subscript has type 'char' [-Wchar-subscripts] fout<<v[a[i-1]][a[i]]; ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 5 | 5 | Exemplu | |
2 | 0 secunde | OK. | 5 | 5 | Exemplu | |
3 | 0 secunde | OK. | 10 | 10 | ||
4 | 0 secunde | OK. | 10 | 10 | ||
5 | 0 secunde | OK. | 20 | 20 | ||
6 | 0.088 secunde | OK. | 20 | 20 | ||
7 | 0 secunde | OK. | 10 | 10 | ||
8 | 0 secunde | OK. | 10 | 10 | ||
9 | 0 secunde | OK. | 5 | 5 | ||
10 | 0 secunde | OK. | 5 | 5 | ||
Punctaj total | 100 |
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ă.