Detalii evaluare #57584057

Rezumat problemă

Se dă un șir cu n elemente, numere întregi. Folosind metoda MergeSort, ordonați crescător elementele acestui șir.

Detalii

Problema MergeSort Operații I/O tastatură/ecran
Limita timp 0.3 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #57584057 Utilizator 6A Marginean Mihnea (marginean_mihnea)
Fișier mergesort.cpp Dimensiune 1009 B
Data încărcării 06 Aprilie 2025, 13:34 Scor / rezultat Eroare de compilare

Evaluare

Mesaj compilare

mergesort.cpp:25:1: error: stray '\302' in program
       aux[k++] = vec[i++];

 ^
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:25:1: error: stray '\302' in program
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:25:1: error: stray '\302' in program
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:25:1: error: stray '\302' in program
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:25:1: error: stray '\302' in program
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:25:1: error: stray '\302' in program
mergesort.cpp:25:1: error: stray '\240' in program
mergesort.cpp:26:1: error: stray '\302' in program
     else

 ^
mergesort.cpp:26:1: error: stray '\240' in program
mergesort.cpp:26:1: error: stray '\302' in program
mergesort.cpp:26:1: error: stray '\240' in program
mergesort.cpp:26:1: error: stray '\302' in program
mergesort.cpp:26:1: error: stray '\240' in program
mergesort.cpp:26:1: error: stray '\302' in program
mergesort.cpp:26:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
       aux[k++] = vec[j++];

 ^
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:27:1: error: stray '\302' in program
mergesort.cpp:27:1: error: stray '\240' in program
mergesort.cpp:28:1: error: stray '\302' in program
   }

 ^
mergesort.cpp:28:1: error: stray '\240' in program
mergesort.cpp:28:1: error: stray '\302' in program
mergesort.cpp:28:1: error: stray '\240' in program
mergesort.cpp:30:1: error: stray '\302' in program
     aux[k++] = vec[i++];

 ^
mergesort.cpp:30:1: error: stray '\240' in program
mergesort.cpp:30:1: error: stray '\302' in program
mergesort.cpp:30:1: error: stray '\240' in program
mergesort.cpp:30:1: error: stray '\302' in program
mergesort.cpp:30:1: error: stray '\240' in program
mergesort.cpp:30:1: error: stray '\302' in program
mergesort.cpp:30:1: error: stray '\240' in program
mergesort.cpp:32:1: error: stray '\302' in program
     aux[k++] = vec[j++];

 ^
mergesort.cpp:32:1: error: stray '\240' in program
mergesort.cpp:32:1: error: stray '\302' in program
mergesort.cpp:32:1: error: stray '\240' in program
mergesort.cpp:32:1: error: stray '\302' in program
mergesort.cpp:32:1: error: stray '\240' in program
mergesort.cpp:32:1: error: stray '\302' in program
mergesort.cpp:32:1: error: stray '\240' in program
mergesort.cpp:35:1: error: stray '\302' in program
     vec[l] = aux[l];

 ^
mergesort.cpp:35:1: error: stray '\240' in program
mergesort.cpp:35:1: error: stray '\302' in program
mergesort.cpp:35:1: error: stray '\240' in program
mergesort.cpp:35:1: error: stray '\302' in program
mergesort.cpp:35:1: error: stray '\240' in program
mergesort.cpp:35:1: error: stray '\302' in program
mergesort.cpp:35:1: error: stray '\240' in program
mergesort.cpp:38:1: error: stray '\302' in program
   if (st == dr) 

 ^
mergesort.cpp:38:1: error: stray '\240' in program
mergesort.cpp:38:1: error: stray '\302' in program
mergesort.cpp:38:1: error: stray '\240' in program
mergesort.cpp:38:1: error: stray '\302' in program
mergesort.cpp:38:1: error: stray '\240' in program
mergesort.cpp:39:1: error: stray '\302' in program
     return;

 ^
mergesort.cpp:39:1: error: stray '\240' in program
mergesort.cpp:39:1: error: stray '\302' in program
mergesort.cpp:39:1: error: stray '\240' in program
mergesort.cpp:39:1: error: stray '\302' in program
mergesort.cpp:39:1: error: stray '\240' in program
mergesort.cpp:39:1: error: stray '\302' in program
mergesort.cpp:39:1: error: stray '\240' in program
mergesort.cpp:41:1: error: stray '\302' in program
   mergeSort(st, mij);

 ^
mergesort.cpp:41:1: error: stray '\240' in program
mergesort.cpp:41:1: error: stray '\302' in program
mergesort.cpp:41:1: error: stray '\240' in program
mergesort.cpp:43:1: error: stray '\302' in program
   interclasare(st, dr); 

 ^
mergesort.cpp:43:1: error: stray '\240' in program
mergesort.cpp:43:1: error: stray '\302' in program
mergesort.cpp:43:1: error: stray '\240' in program
mergesort.cpp:43:1: error: stray '\302' in program
mergesort.cpp:43:1: error: stray '\240' in program
mergesort.cpp:47:1: error: stray '\302' in program
   int n;

 ^
mergesort.cpp:47:1: error: stray '\240' in program
mergesort.cpp:47:1: error: stray '\302' in program
mergesort.cpp:47:1: error: stray '\240' in program
mergesort.cpp:48:1: error: stray '\302' in program
   citire(n); 

 ^
mergesort.cpp:48:1: error: stray '\240' in program
mergesort.cpp:48:1: error: stray '\302' in program
mergesort.cpp:48:1: error: stray '\240' in program
mergesort.cpp:48:1: error: stray '\302' in program
mergesort.cpp:48:1: error: stray '\240' in program
mergesort.cpp:50:1: error: stray '\302' in program
   afisare(n);

 ^
mergesort.cpp:50:1: error: stray '\240' in program
mergesort.cpp:50:1: error: stray '\302' in program
mergesort.cpp:50:1: error: stray '\240' in program

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 MergeSort 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!