Detalii evaluare #34588878

Rezumat problemă

Se dă lista muchiilor unui graf neorientat. Să se afișeze vârfurile de grad maxim.

Detalii

Problema GradMax Operații I/O gradmax.in/gradmax.out
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #34588878 Utilizator David Bogdan (Bogdan4573)
Fișier gradmax.cpp Dimensiune 1.57 KB
Data încărcării 07 Februarie 2022, 11:33 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

gradmax.cpp:1:10: error: stray '#' in program
 Problema #417 – GradMax – Rezolvari PBInfo

          ^
gradmax.cpp:1:1: error: stray '\342' in program
 Problema #417 – GradMax – Rezolvari PBInfo

 ^
gradmax.cpp:1:1: error: stray '\200' in program
gradmax.cpp:1:1: error: stray '\223' in program
gradmax.cpp:1:1: error: stray '\342' in program
gradmax.cpp:1:1: error: stray '\200' in program
gradmax.cpp:1:1: error: stray '\223' in program
gradmax.cpp:3:1: error: stray '\305' in program
 Cerinţa

 ^
gradmax.cpp:3:1: error: stray '\243' in program
gradmax.cpp:4:1: error: stray '\304' in program
 Se dă lista muchiilor unui graf neorientat. Să se afișeze vârfurile de grad maxim.

 ^
gradmax.cpp:4:1: error: stray '\203' in program
gradmax.cpp:4:1: error: stray '\304' in program
gradmax.cpp:4:1: error: stray '\203' in program
gradmax.cpp:4:1: error: stray '\310' in program
gradmax.cpp:4:1: error: stray '\231' in program
gradmax.cpp:4:1: error: stray '\303' in program
gradmax.cpp:4:1: error: stray '\242' in program
gradmax.cpp:7:1: error: stray '\305' in program
 Fişierul de intrare gradmax.in conţine pe prima linie numărul n, reprezentând numărul de vârfuri ale grafului. Fiecare dintre următoarele linii conține câte o pereche de numere i j, cu semnificația că există muchie între i și j.

 ^
gradmax.cpp:7:1: error: stray '\237' in program
gradmax.cpp:7:1: error: stray '\305' in program
gradmax.cpp:7:1: error: stray '\243' in program
gradmax.cpp:7:1: error: stray '\304' in program
gradmax.cpp:7:1: error: stray '\203' in program
gradmax.cpp:7:1: error: stray '\303' in program
gradmax.cpp:7:1: error: stray '\242' in program
gradmax.cpp:7:1: error: stray '\304' in program
gradmax.cpp:7:1: error: stray '\203' in program
gradmax.cpp:7:1: error: stray '\303' in program
gradmax.cpp:7:1: error: stray '\242' in program
gradmax.cpp:7:1: error: stray '\304' in program
gradmax.cpp:7:1: error: stray '\203' in program
gradmax.cpp:7:1: error: stray '\310' in program
gradmax.cpp:7:1: error: stray '\233' in program
gradmax.cpp:7:1: error: stray '\303' in program
gradmax.cpp:7:1: error: stray '\242' in program
gradmax.cpp:7:1: error: stray '\310' in program
gradmax.cpp:7:1: error: stray '\233' in program
gradmax.cpp:7:1: error: stray '\304' in program
gradmax.cpp:7:1: error: stray '\203' in program
gradmax.cpp:7:1: error: stray '\304' in program
gradmax.cpp:7:1: error: stray '\203' in program
gradmax.cpp:7:1: error: stray '\303' in program
gradmax.cpp:7:1: error: stray '\256' in program
gradmax.cpp:7:1: error: stray '\310' in program
gradmax.cpp:7:1: error: stray '\231' in program
gradmax.cpp:9:1: error: stray '\305' in program
 Date de ieşire

 ^
gradmax.cpp:9:1: error: stray '\237' in program
gradmax.cpp:10:1: error: stray '\305' in program
 Fişierul de ieşire gradmax.out va conţine pe prima linie numărul m de vârfuri de grad maxim, urmat de cele m vârfuri de grad maxim ,în ordine crescătoare, separate prin exact un spațiu.

 ^
gradmax.cpp:10:1: error: stray '\237' in program
gradmax.cpp:10:1: error: stray '\305' in program
gradmax.cpp:10:1: error: stray '\237' in program
gradmax.cpp:10:1: error: stray '\305' in program
gradmax.cpp:10:1: error: stray '\243' in program
gradmax.cpp:10:1: error: stray '\304' in program
gradmax.cpp:10:1: error: stray '\203' in program
gradmax.cpp:10:1: error: stray '\303' in program
gradmax.cpp:10:1: error: stray '\242' in program
gradmax.cpp:10:1: error: stray '\303' in program
gradmax.cpp:10:1: error: stray '\242' in program
gradmax.cpp:10:1: error: stray '\303' in program
gradmax.cpp:10:1: error: stray '\256' in program
gradmax.cpp:10:1: error: stray '\304' in program
gradmax.cpp:10:1: error: stray '\203' in program
gradmax.cpp:10:1: error: stray '\310' in program
gradmax.cpp:10:1: error: stray '\233' in program
gradmax.cpp:12:1: error: stray '\305' in program
 Restricţii şi precizări

 ^
gradmax.cpp:12:1: error: stray '\243' in program
gradmax.cpp:12:1: error: stray '\305' in program
gradmax.cpp:12:1: error: stray '\237' in program
gradmax.cpp:12:1: error: stray '\304' in program
gradmax.cpp:12:1: error: stray '\203' in program
gradmax.cpp:13:1: error: stray '\342' in program
 1 ≤ n ≤ 100

 ^
gradmax.cpp:13:1: error: stray '\211' in program
gradmax.cpp:13:1: error: stray '\244' in program
gradmax.cpp:13:1: error: stray '\342' in program
gradmax.cpp:13:1: error: stray '\211' in program
gradmax.cpp:13:1: error: stray '\244' in program
gradmax.cpp:14:1: error: stray '\342' in program
 1 ≤ i , j ≤ n

 ^
gradmax.cpp:14:1: error: stray '\211' in program
gradmax.cpp:14:1: error: stray '\244' in program
gradmax.cpp:14:1: error: stray '\342' in program
gradmax.cpp:14:1: error: stray '\211' in program
gradmax.cpp:14:1: error: stray '\244' in program
gradmax.cpp:15:1: error: stray '\303' in program
 muchiile se pot repeta în fișierul de intrare

 ^
gradmax.cpp:15:1: error: stray '\256' in program
gradmax.cpp:15:1: error: stray '\310' in program
gradmax.cpp:15:1: error: stray '\231' in program
gradmax.cpp:1:1: error: 'Problema' does not name a type
 Problema #417 – GradMax – Rezolvari PBInfo

 ^
gradmax.cpp: In function 'int main()':
gradmax.cpp:38:5: error: reference to 'cin' is ambiguous
     cin >> n;

     ^
gradmax.cpp:32:10: note: candidates are: std::ifstream cin
 ifstream cin("gradmax.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradmax.cpp:30:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gradmax.cpp:39:11: error: reference to 'cin' is ambiguous
     while(cin >> p >> r)

           ^
gradmax.cpp:32:10: note: candidates are: std::ifstream cin
 ifstream cin("gradmax.in");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradmax.cpp:30:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
gradmax.cpp:54:5: error: reference to 'cout' is ambiguous
     cout << x << " ";

     ^
gradmax.cpp:33:10: note: candidates are: std::ofstream cout
 ofstream cout("gradmax.out");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradmax.cpp:30:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^
gradmax.cpp:60:29: error: reference to 'cout' is ambiguous
             if(cnt == cmax) cout << i << " ";

                             ^
gradmax.cpp:33:10: note: candidates are: std::ofstream cout
 ofstream cout("gradmax.out");

          ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0,
                 from gradmax.cpp:30:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^

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