#3616
Cifrul ADFGX este un cifru care folosește o matrice pătratică 5x5 și o cheie. În matricea pătratică, liniile și coloanele vor fi numerotate cu litere. Avem această matrice ca exemplu.
A D F G X A a b c d e D f g h i j F k l m n o G p q r s t X u v w x y
| Problema | adfgx | Operații I/O |
adfgx.in/adfgx.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #58794342 | Utilizator | |
| Fișier | adfgx.cpp | Dimensiune | 2.26 KB |
| Data încărcării | 09 August 2025, 20:52 | Scor/rezultat | Eroare de compilare |
adfgx.cpp: In function 'int main()': adfgx.cpp:27:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0;i< key.length();i++){ ^ adfgx.cpp:36:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0;i < cuvant.length();i++){ ^ adfgx.cpp:53:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(cnt == key.size()){ ^ adfgx.cpp:61:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(cnt == key.size()){ ^ adfgx.cpp:72:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j = 0;j<incript.size();j++){ ^ adfgx.cpp:76:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(cnt==key.size()){ ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<id*, std::vector<id> >; _Tp = id; _Compare = bool (*)(id&, id&)]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<id*, std::vector<id> >; _Compare = bool (*)(id&, id&)]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<id*, std::vector<id> >; _Size = int; _Compare = bool (*)(id&, id&)]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<id*, std::vector<id> >; _Compare = bool (*)(id&, id&)]' adfgx.cpp:70:45: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: invalid initialization of reference of type 'id&' from expression of type 'const id' while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: invalid initialization of reference of type 'id&' from expression of type 'const id' while (__comp(__pivot, *__last)) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema adfgx 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ă.