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

Detalii evaluare #19929534

Rezumat problemă

#1927 Bitsort

Se dă un vector cu n elemente, numere naturale nenule. Afișați termenii în ordine crescătoare.

Termenii care apar de mai multe ori se vor afișa o singură dată.

Rezolvă

Detalii

Problema Bitsort Operații I/O tastatură/ecran
Limita timp 0.65 secunde Limita memorie Total: 0.1 MB / Stivă 0.1 MB
Id soluție #19929534 Utilizator Maxim Cuzub (Maxim_Cuzub)
Fișier bitsort.cpp Dimensiune 504 B
Data încărcării 12 Ianuarie 2020, 10:18 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

bitsort.cpp:15:1: error: stray '\302' in program
   ios::sync_with_stdio(false);

 ^
bitsort.cpp:15:1: error: stray '\240' in program
bitsort.cpp:17:1: error: stray '\302' in program
   int n, x, maxim = 0;

 ^
bitsort.cpp:17:1: error: stray '\240' in program
bitsort.cpp:19:1: error: stray '\302' in program
   cin>> n;

 ^
bitsort.cpp:19:1: error: stray '\240' in program
bitsort.cpp:21:1: error: stray '\302' in program
   for(int i=1 ; i<=n ; i++)

 ^
bitsort.cpp:21:1: error: stray '\240' in program
bitsort.cpp:23:1: error: stray '\302' in program
   {

 ^
bitsort.cpp:23:1: error: stray '\240' in program
bitsort.cpp:25:1: error: stray '\302' in program
       cin>> x;

 ^
bitsort.cpp:25:1: error: stray '\240' in program
bitsort.cpp:25:1: error: stray '\302' in program
bitsort.cpp:25:1: error: stray '\240' in program
bitsort.cpp:25:1: error: stray '\302' in program
bitsort.cpp:25:1: error: stray '\240' in program
bitsort.cpp:27:1: error: stray '\302' in program
       A[x] = true;

 ^
bitsort.cpp:27:1: error: stray '\240' in program
bitsort.cpp:27:1: error: stray '\302' in program
bitsort.cpp:27:1: error: stray '\240' in program
bitsort.cpp:27:1: error: stray '\302' in program
bitsort.cpp:27:1: error: stray '\240' in program
bitsort.cpp:29:1: error: stray '\302' in program
       if(x > maxim)

 ^
bitsort.cpp:29:1: error: stray '\240' in program
bitsort.cpp:29:1: error: stray '\302' in program
bitsort.cpp:29:1: error: stray '\240' in program
bitsort.cpp:29:1: error: stray '\302' in program
bitsort.cpp:29:1: error: stray '\240' in program
bitsort.cpp:31:1: error: stray '\302' in program
        maxim = x;

 ^
bitsort.cpp:31:1: error: stray '\240' in program
bitsort.cpp:31:1: error: stray '\302' in program
bitsort.cpp:31:1: error: stray '\240' in program
bitsort.cpp:31:1: error: stray '\302' in program
bitsort.cpp:31:1: error: stray '\240' in program
bitsort.cpp:31:1: error: stray '\302' in program
bitsort.cpp:31:1: error: stray '\240' in program
bitsort.cpp:33:1: error: stray '\302' in program
   }

 ^
bitsort.cpp:33:1: error: stray '\240' in program
bitsort.cpp:35:1: error: stray '\302' in program
   for(int i=1 ; i<=maxim ; i++)

 ^
bitsort.cpp:35:1: error: stray '\240' in program
bitsort.cpp:37:1: error: stray '\302' in program
        if(A[i])

 ^
bitsort.cpp:37:1: error: stray '\240' in program
bitsort.cpp:37:1: error: stray '\302' in program
bitsort.cpp:37:1: error: stray '\240' in program
bitsort.cpp:37:1: error: stray '\302' in program
bitsort.cpp:37:1: error: stray '\240' in program
bitsort.cpp:37:1: error: stray '\302' in program
bitsort.cpp:37:1: error: stray '\240' in program
bitsort.cpp:39:1: error: stray '\302' in program
        cout<<i<<" ";

 ^
bitsort.cpp:39:1: error: stray '\240' in program
bitsort.cpp:39:1: error: stray '\302' in program
bitsort.cpp:39:1: error: stray '\240' in program
bitsort.cpp:39:1: error: stray '\302' in program
bitsort.cpp:39:1: error: stray '\240' in program
bitsort.cpp:39:1: error: stray '\302' in program
bitsort.cpp:39:1: error: stray '\240' in program
bitsort.cpp:41:1: error: stray '\302' in program
   return 0;

 ^
bitsort.cpp:41: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 Bitsort 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ă.