#4669
Dându-se o expresie aritmetică prefixată, postfixată sau infixată, să se afișeze toate celelalte forme ale ei.
| Problema | PPIfixata | Operații I/O |
tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64000272 | Utilizator | |
| Fișier | ppifixata.cpp | Dimensiune | 4.19 KB |
| Data încărcării | 03 Aprilie 2026, 12:18 | Scor/rezultat | Eroare de compilare |
ppifixata.cpp: In function 'void toInfix(int, std::string&)': ppifixata.cpp:88:18: error: expected unqualified-id before '[' token auto [n,par,ir]=ps.top(); ps.pop(); ^ ppifixata.cpp:89:17: error: 'par' was not declared in this scope if (par!=0&&isOp(pool[n].val)) { ^ ppifixata.cpp:89:35: error: 'n' was not declared in this scope if (par!=0&&isOp(pool[n].val)) { ^ ppifixata.cpp:91:52: error: 'ir' was not declared in this scope (prec(pool[n].val)==prec(par)&&ir&&(par=='-'||par=='/')); ^ ppifixata.cpp:94:27: error: 'n' was not declared in this scope if (isOp(pool[n].val)) { ^ ppifixata.cpp:95:58: error: no matching function for call to 'std::stack<toInfix(int, std::string&)::P>::push(<brace-enclosed initializer list>)' ps.push({pool[n].left, pool[n].val,false}); ^ ppifixata.cpp:95:58: note: candidates are: In file included from /usr/include/c++/4.8/stack:61:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:88, from ppifixata.cpp:1: /usr/include/c++/4.8/bits/stl_stack.h:186:7: note: void std::stack<_Tp, _Sequence>::push(const value_type&) [with _Tp = toInfix(int, std::string&)::P; _Sequence = std::deque<toInfix(int, std::string&)::P, std::allocator<toInfix(int, std::string&)::P> >; std::stack<_Tp, _Sequence>::value_type = toInfix(int, std::string&)::P] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_stack.h:186:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const toInfix(int, std::string&)::P&}' /usr/include/c++/4.8/bits/stl_stack.h:191:7: note: void std::stack<_Tp, _Sequence>::push(std::stack<_Tp, _Sequence>::value_type&&) [with _Tp = toInfix(int, std::string&)::P; _Sequence = std::deque<toInfix(int, std::string&)::P, std::allocator<toInfix(int, std::string&)::P> >; std::stack<_Tp, _Sequence>::value_type = toInfix(int, std::string&)::P] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_stack.h:191:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::stack<toInfix(int, std::string&)::P>::value_type&& {aka toInfix(int, std::string&)::P&&}' ppifixata.cpp:96:57: error: no matching function for call to 'std::stack<toInfix(int, std::string&)::P>::push(<brace-enclosed initializer list>)' ps.push({pool[n].right,pool[n].val,true}); ^ ppifixata.cpp:96:57: note: candidates are: In file included from /usr/include/c++/4.8/stack:61:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:88, from ppifixata.cpp:1: /usr/include/c++/4.8/bits/stl_stack.h:186:7: note: void std::stack<_Tp, _Sequence>::push(const value_type&) [with _Tp = toInfix(int, std::string&)::P; _Sequence = std::deque<toInfix(int, std::string&)::P, std::allocator<toInfix(int, std::string&)::P> >; std::stack<_Tp, _Sequence>::value_type = toInfix(int, std::string&)::P] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_stack.h:186:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const toInfix(int, std::string&)::P&}' /usr/include/c++/4.8/bits/stl_stack.h:191:7: note: void std::stack<_Tp, _Sequence>::push(std::stack<_Tp, _Sequence>::value_type&&) [with _Tp = toInfix(int, std::string&)::P; _Sequence = std::deque<toInfix(int, std::string&)::P, std::allocator<toInfix(int, std::string&)::P> >; std::stack<_Tp, _Sequence>::value_type = toInfix(int, std::string&)::P] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_stack.h:191:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::stack<toInfix(int, std::string&)::P>::value_type&& {aka toInfix(int, std::string&)::P&&}'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema PPIfixata 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ă.