Detalii evaluare #23159868

Rezumat problemă

Să se ordoneze crescător elementele dintr-un şir dat cuprinse între elementul de valoare maximă şi cel de valoare minimă.

Detalii

Problema sortMinMax Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #23159868 Utilizator uteu emir (Minegalaxy30)
Fișier sortminmax.cpp Dimensiune 591 B
Data încărcării 27 Mai 2020, 14:09 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

sortminmax.cpp:6:1: error: stray '\302' in program
    int a[1000], n, max = 0, min = 0;

 ^
sortminmax.cpp:6:1: error: stray '\240' in program
sortminmax.cpp:6:1: error: stray '\302' in program
sortminmax.cpp:6:1: error: stray '\240' in program
sortminmax.cpp:7:1: error: stray '\302' in program
    

 ^
sortminmax.cpp:7:1: error: stray '\240' in program
sortminmax.cpp:7:1: error: stray '\302' in program
sortminmax.cpp:7:1: error: stray '\240' in program
sortminmax.cpp:8:1: error: stray '\302' in program
    cin>>n;

 ^
sortminmax.cpp:8:1: error: stray '\240' in program
sortminmax.cpp:8:1: error: stray '\302' in program
sortminmax.cpp:8:1: error: stray '\240' in program
sortminmax.cpp:9:1: error: stray '\302' in program
    for(int i = 0; i < n; ++i)

 ^
sortminmax.cpp:9:1: error: stray '\240' in program
sortminmax.cpp:9:1: error: stray '\302' in program
sortminmax.cpp:9:1: error: stray '\240' in program
sortminmax.cpp:10:1: error: stray '\302' in program
    {

 ^
sortminmax.cpp:10:1: error: stray '\240' in program
sortminmax.cpp:10:1: error: stray '\302' in program
sortminmax.cpp:10:1: error: stray '\240' in program
sortminmax.cpp:11:1: error: stray '\302' in program
       cin>>a[i];

 ^
sortminmax.cpp:11:1: error: stray '\240' in program
sortminmax.cpp:11:1: error: stray '\302' in program
sortminmax.cpp:11:1: error: stray '\240' in program
sortminmax.cpp:11:1: error: stray '\302' in program
sortminmax.cpp:11:1: error: stray '\240' in program
sortminmax.cpp:12:1: error: stray '\302' in program
       if(a[i] >= a[max]) max = i;

 ^
sortminmax.cpp:12:1: error: stray '\240' in program
sortminmax.cpp:12:1: error: stray '\302' in program
sortminmax.cpp:12:1: error: stray '\240' in program
sortminmax.cpp:12:1: error: stray '\302' in program
sortminmax.cpp:12:1: error: stray '\240' in program
sortminmax.cpp:13:1: error: stray '\302' in program
       if(a[i] < a[min]) min = i;

 ^
sortminmax.cpp:13:1: error: stray '\240' in program
sortminmax.cpp:13:1: error: stray '\302' in program
sortminmax.cpp:13:1: error: stray '\240' in program
sortminmax.cpp:13:1: error: stray '\302' in program
sortminmax.cpp:13:1: error: stray '\240' in program
sortminmax.cpp:14:1: error: stray '\302' in program
    }

 ^
sortminmax.cpp:14:1: error: stray '\240' in program
sortminmax.cpp:14:1: error: stray '\302' in program
sortminmax.cpp:14:1: error: stray '\240' in program
sortminmax.cpp:16:1: error: stray '\302' in program
    if(min > max) swap(min, max);

 ^
sortminmax.cpp:16:1: error: stray '\240' in program
sortminmax.cpp:16:1: error: stray '\302' in program
sortminmax.cpp:16:1: error: stray '\240' in program
sortminmax.cpp:17:1: error: stray '\302' in program
    for(int i = min; i <= max; ++i)

 ^
sortminmax.cpp:17:1: error: stray '\240' in program
sortminmax.cpp:17:1: error: stray '\302' in program
sortminmax.cpp:17:1: error: stray '\240' in program
sortminmax.cpp:18:1: error: stray '\302' in program
    {

 ^
sortminmax.cpp:18:1: error: stray '\240' in program
sortminmax.cpp:18:1: error: stray '\302' in program
sortminmax.cpp:18:1: error: stray '\240' in program
sortminmax.cpp:19:1: error: stray '\302' in program
       int m = i;

 ^
sortminmax.cpp:19:1: error: stray '\240' in program
sortminmax.cpp:19:1: error: stray '\302' in program
sortminmax.cpp:19:1: error: stray '\240' in program
sortminmax.cpp:19:1: error: stray '\302' in program
sortminmax.cpp:19:1: error: stray '\240' in program
sortminmax.cpp:20:1: error: stray '\302' in program
       for(int j = i + 1; j <= max; ++j)

 ^
sortminmax.cpp:20:1: error: stray '\240' in program
sortminmax.cpp:20:1: error: stray '\302' in program
sortminmax.cpp:20:1: error: stray '\240' in program
sortminmax.cpp:20:1: error: stray '\302' in program
sortminmax.cpp:20:1: error: stray '\240' in program
sortminmax.cpp:21:1: error: stray '\302' in program
          if(a[j] < a[m]) m = j;

 ^
sortminmax.cpp:21:1: error: stray '\240' in program
sortminmax.cpp:21:1: error: stray '\302' in program
sortminmax.cpp:21:1: error: stray '\240' in program
sortminmax.cpp:21:1: error: stray '\302' in program
sortminmax.cpp:21:1: error: stray '\240' in program
sortminmax.cpp:21:1: error: stray '\302' in program
sortminmax.cpp:21:1: error: stray '\240' in program
sortminmax.cpp:21:1: error: stray '\302' in program
sortminmax.cpp:21:1: error: stray '\240' in program
sortminmax.cpp:22:1: error: stray '\302' in program
       

 ^
sortminmax.cpp:22:1: error: stray '\240' in program
sortminmax.cpp:22:1: error: stray '\302' in program
sortminmax.cpp:22:1: error: stray '\240' in program
sortminmax.cpp:22:1: error: stray '\302' in program
sortminmax.cpp:22:1: error: stray '\240' in program
sortminmax.cpp:22:1: error: stray '\302' in program
sortminmax.cpp:22:1: error: stray '\240' in program
sortminmax.cpp:23:1: error: stray '\302' in program
       swap(a[i], a[m]);

 ^
sortminmax.cpp:23:1: error: stray '\240' in program
sortminmax.cpp:23:1: error: stray '\302' in program
sortminmax.cpp:23:1: error: stray '\240' in program
sortminmax.cpp:23:1: error: stray '\302' in program
sortminmax.cpp:23:1: error: stray '\240' in program
sortminmax.cpp:24:1: error: stray '\302' in program
    }

 ^
sortminmax.cpp:24:1: error: stray '\240' in program
sortminmax.cpp:24:1: error: stray '\302' in program
sortminmax.cpp:24:1: error: stray '\240' in program
sortminmax.cpp:25:1: error: stray '\302' in program
    

 ^
sortminmax.cpp:25:1: error: stray '\240' in program
sortminmax.cpp:25:1: error: stray '\302' in program
sortminmax.cpp:25:1: error: stray '\240' in program
sortminmax.cpp:26:1: error: stray '\302' in program
    for(int i = 0; i < n; ++i)

 ^
sortminmax.cpp:26:1: error: stray '\240' in program
sortminmax.cpp:26:1: error: stray '\302' in program
sortminmax.cpp:26:1: error: stray '\240' in program
sortminmax.cpp:27:1: error: stray '\302' in program
       cout<<a[i]<<' ';

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

 ^
sortminmax.cpp:28:1: error: stray '\240' in program
sortminmax.cpp:28:1: error: stray '\302' in program
sortminmax.cpp:28:1: error: stray '\240' in program
sortminmax.cpp:29:1: error: stray '\302' in program
    return 0;

 ^
sortminmax.cpp:29:1: error: stray '\240' in program
sortminmax.cpp:29:1: error: stray '\302' in program
sortminmax.cpp:29: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 sortMinMax 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ă.