Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #62745064
Rezumat problemă
#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
Ioncioaia Calin (Ioncioaia_Calin) Detalii
| 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 | #62745064 | Utilizator |
Chiorean Tudor (Kio1985)
|
| Fișier | adfgx.cpp | Dimensiune | 3.93 KB |
| Data încărcării | 31 Ianuarie 2026, 19:26 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
adfgx.cpp: In function 'int main()': adfgx.cpp:74:53: error: parameter declared 'auto' sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:68: error: parameter declared 'auto' sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp: In lambda function: adfgx.cpp:75:16: error: 'a' was not declared in this scope if(a.first != b.first) return a.first < b.first; ^ adfgx.cpp:75:27: error: 'b' was not declared in this scope if(a.first != b.first) return a.first < b.first; ^ adfgx.cpp:76:20: error: 'a' was not declared in this scope return a.second < b.second; ^ adfgx.cpp:76:31: error: 'b' was not declared in this scope return a.second < b.second; ^ adfgx.cpp: In function 'int main()': adfgx.cpp:80:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < ord.size(); i++) { ^ adfgx.cpp:102:53: error: parameter declared 'auto' sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:68: error: parameter declared 'auto' sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp: In lambda function: adfgx.cpp:103:16: error: 'a' was not declared in this scope if(a.first != b.first) return a.first < b.first; ^ adfgx.cpp:103:27: error: 'b' was not declared in this scope if(a.first != b.first) return a.first < b.first; ^ adfgx.cpp:104:20: error: 'a' was not declared in this scope return a.second < b.second; ^ adfgx.cpp:104:31: error: 'b' was not declared in this scope return a.second < b.second; ^ 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 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' adfgx.cpp:77:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__i, *__first)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' adfgx.cpp:105:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__i, *__first)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' adfgx.cpp:77:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__i, *__first)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' adfgx.cpp:77:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__a, *__b)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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:116:25: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__b, *__c)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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:118:30: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__a, *__c)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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:123:33: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__a, *__c)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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:125:33: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__b, *__c)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Tp = std::pair<char, int>; _Compare = main()::__lambda4]': /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' adfgx.cpp:77:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, const std::pair<char, int>&)' while (__comp(*__first, __pivot)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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:2266:34: error: no match for call to '(main()::__lambda4) (const std::pair<char, int>&, std::pair<char, int>&)' while (__comp(__pivot, *__last)) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided 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 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' adfgx.cpp:105:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__i, *__first)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' adfgx.cpp:105:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__a, *__b)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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:116:25: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' if (__comp(*__b, *__c)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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:118:30: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__a, *__c)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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:123:33: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__a, *__c)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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:125:33: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' else if (__comp(*__b, *__c)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Tp = std::pair<char, int>; _Compare = main()::__lambda5]': /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' adfgx.cpp:105:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, const std::pair<char, int>&)' while (__comp(*__first, __pivot)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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:2266:34: error: no match for call to '(main()::__lambda5) (const std::pair<char, int>&, std::pair<char, int>&)' while (__comp(__pivot, *__last)) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ 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:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Distance = int; _Tp = std::pair<char, int>; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda4]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]' adfgx.cpp:77:10: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (std::pair<char, int>&, std::pair<char, int>&)' *(__first + (__secondChild - 1)))) ^ adfgx.cpp:74:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided adfgx.cpp:74:69: note: main()::__lambda4 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:74:69: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Distance = int; _Tp = std::pair<char, int>; _Compare = main()::__lambda5]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Size = int; _Compare = main()::__lambda5]' /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<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]' adfgx.cpp:105:10: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda5) (std::pair<char, int>&, std::pair<char, int>&)' *(__first + (__secondChild - 1)))) ^ adfgx.cpp:102:39: note: candidates are: sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided adfgx.cpp:102:69: note: main()::__lambda5 sort(ord.begin(), ord.end(), [](const auto& a, const auto& b) { ^ adfgx.cpp:102:69: note: candidate expects 0 arguments, 2 provided 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: At global scope: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]', declared using local type 'main()::__lambda5', is used but never defined [-fpermissive] In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from adfgx.cpp:1: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Compare = main()::__lambda5]', declared using local type 'main()::__lambda5', is used but never defined [-fpermissive] /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Distance = int; _Tp = std::pair<char, int>; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<char, int>*, std::vector<std::pair<char, int> > >; _Distance = int; _Tp = std::pair<char, int>; _Compare = main()::__lambda5]', declared using local type 'main()::__lambda5', is used but never defined [-fpermissive]
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema adfgx face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
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ă.