Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.

Detalii evaluare #62129433

Rezumat problemă

sum
#1

Să se scrie un program care citeşte din fişier două numere întregi şi determină suma lor.

Fișiere Candale Silviu (silviu) ușoară
Clasa 9 Elemente de baza ale limbajului Operatori și expresii
Rezolvă

Detalii

Problema sum Operații I/O sum.in/sum.out
Limita timp 1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #62129433 Utilizator Verniceanu Darian (elevmoisil)
Fișier sum.cpp Dimensiune 2.06 KB
Data încărcării 10 Ianuarie 2026, 11:27 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

sum.cpp: In function 'void find(int)':
sum.cpp:23:12: error: return-statement with a value, in function returning 'void' [-fpermissive]
     return x;

            ^
sum.cpp: In function 'void join(int, int)':
sum.cpp:27:7: error: void value not ignored as it ought to be
     x = find(x);

       ^
sum.cpp:28:7: error: void value not ignored as it ought to be
     y = find(y);

       ^
sum.cpp:33:9: error: reference to 'rank' is ambiguous
     if (rank[x] < rank[y])

         ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp:33:19: error: reference to 'rank' is ambiguous
     if (rank[x] < rank[y])

                   ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp:37:9: error: reference to 'rank' is ambiguous
     if (rank[x] == rank[y])

         ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp:37:20: error: reference to 'rank' is ambiguous
     if (rank[x] == rank[y])

                    ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp:38:9: error: reference to 'rank' is ambiguous
         rank[x]++;

         ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp: In function 'void update(int, int, int, int, int, query)':
sum.cpp:45:36: error: expected primary-expression before '.' token
         aint[node].push_back({query.x,query.y});

                                    ^
sum.cpp:45:44: error: expected primary-expression before '.' token
         aint[node].push_back({query.x,query.y});

                                            ^
sum.cpp:45:47: error: no matching function for call to 'std::vector<std::pair<int, int> >::push_back(<brace-enclosed initializer list>)'
         aint[node].push_back({query.x,query.y});

                                               ^
sum.cpp:45:47: note: candidates are:
In file included from /usr/include/c++/4.8/vector:64:0,
                 from /usr/include/c++/4.8/bits/random.h:34,
                 from /usr/include/c++/4.8/random:50,
                 from /usr/include/c++/4.8/bits/stl_algo.h:65,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sum.cpp:1:
/usr/include/c++/4.8/bits/stl_vector.h:901:7: note: void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, int>]
       push_back(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_vector.h:901:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}'
/usr/include/c++/4.8/bits/stl_vector.h:919:7: note: void std::vector<_Tp, _Alloc>::push_back(std::vector<_Tp, _Alloc>::value_type&&) [with _Tp = std::pair<int, int>; _Alloc = std::allocator<std::pair<int, int> >; std::vector<_Tp, _Alloc>::value_type = std::pair<int, int>]
       push_back(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_vector.h:919:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::vector<std::pair<int, int> >::value_type&& {aka std::pair<int, int>&&}'
sum.cpp: In function 'int main()':
sum.cpp:60:12: error: 'N' was not declared in this scope
     cin >> N >> Q;

            ^
sum.cpp:60:17: error: 'Q' was not declared in this scope
     cin >> N >> Q;

                 ^
sum.cpp:63:9: error: reference to 'rank' is ambiguous
         rank[i] = 1;

         ^
sum.cpp:8:5: note: candidates are: int rank [100005]
 int rank[100005],p[100005],ans[100005];

     ^
In file included from /usr/include/c++/4.8/bits/move.h:57:0,
                 from /usr/include/c++/4.8/bits/stl_pair.h:59,
                 from /usr/include/c++/4.8/bits/stl_algobase.h:64,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from sum.cpp:1:
/usr/include/c++/4.8/type_traits:1243:12: note:                 template<class> struct std::rank
     struct rank
            ^
sum.cpp:100:15: error: expected unqualified-id before '[' token
     for (auto [edge, index] : last) {

               ^
sum.cpp:100:15: error: expected ';' before '[' token
sum.cpp:100:16: error: 'edge' was not declared in this scope
     for (auto [edge, index] : last) {

                ^
sum.cpp: In lambda function:
sum.cpp:100:29: error: expected '{' before ':' token
     for (auto [edge, index] : last) {

                             ^
sum.cpp: In function 'int main()':
sum.cpp:100:15: error: overloaded function with no contextual type information
     for (auto [edge, index] : last) {

               ^
sum.cpp:100:29: error: expected ';' before ':' token
     for (auto [edge, index] : last) {

                             ^
sum.cpp:100:29: error: expected primary-expression before ':' token
sum.cpp:100:29: error: expected ')' before ':' token
sum.cpp:100:29: error: expected primary-expression before ':' token
sum.cpp:100:29: error: expected ';' before ':' token
sum.cpp:114:1: error: expected '}' at end of input
 }
 ^

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 sum 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ă.

Du-te sus!