#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 | #50655591 | Utilizator | |
Fișier | adfgvx.cpp | Dimensiune | 1.55 KB |
Data încărcării | 18 Aprilie 2024, 19:09 | Scor / rezultat | Eroare de compilare |
adfgvx.cpp: In function 'int main()': adfgvx.cpp:19:55: error: variable-sized object 'm1' may not be initialized char m1[strlen(k)][(strlen(msj)*2)/strlen(k)+1]={0}; ^ adfgvx.cpp:21:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i=0;i<strlen(msj);i++) ^ adfgvx.cpp:35:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(c2<strlen(k)-1) ^ adfgvx.cpp:41:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(c2==strlen(k)) ^ adfgvx.cpp:46:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] }else if(c2<strlen(k)) ^ adfgvx.cpp:53:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(c2==strlen(k)) ^ adfgvx.cpp:61:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(i=0;i<strlen(k)-1;i++) ^ adfgvx.cpp:63:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(j=i+1;i<strlen(k);j++) ^ adfgvx.cpp:67:55: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(c1=0;c1<(strlen(msj)*2)/strlen(k)+1,c1++) ^ adfgvx.cpp:67:28: warning: left operand of comma operator has no effect [-Wunused-value] for(c1=0;c1<(strlen(msj)*2)/strlen(k)+1,c1++) ^ adfgvx.cpp:67:61: error: expected ';' before ')' token for(c1=0;c1<(strlen(msj)*2)/strlen(k)+1,c1++) ^ adfgvx.cpp:68:13: error: expected primary-expression before '}' token } ^ adfgvx.cpp:68:13: error: expected ';' before '}' token
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ă.