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

Detalii evaluare #10060513

Rezumat problemă

#180 sortMinMax

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

Rezolvă

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 #10060513 Utilizator Barzoi Andrei (andreihhh)
Fișier sortminmax.cpp Dimensiune 600 B
Data încărcării 24 Iulie 2018, 21:19 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

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

 ^
sortminmax.cpp:5:1: error: stray '\240' in program
sortminmax.cpp:5:1: error: stray '\302' in program
sortminmax.cpp:5: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: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
    cin>>n;

 ^
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
    for(i=0;i<n;i++)

 ^
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
    {

 ^
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
       cin>>a[i];

 ^
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: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
       if(a[i]>=a[max]) max=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[min]) min=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
    }

 ^
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:15:1: error: stray '\302' in program
    if(min>max)

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

 ^
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
    {

 ^
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
       int m = i;

 ^
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
       for(j=i+1;j<=max;j++)

 ^
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
          if(a[j]<a[m]) m=j;

 ^
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: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: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: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:30:1: error: stray '\302' in program
    }

 ^
sortminmax.cpp:30:1: error: stray '\240' in program
sortminmax.cpp:30:1: error: stray '\302' in program
sortminmax.cpp:30:1: error: stray '\240' in program
sortminmax.cpp:31:1: error: stray '\302' in program
    

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

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

 ^
sortminmax.cpp:33:1: error: stray '\240' in program
sortminmax.cpp:33:1: error: stray '\302' in program
sortminmax.cpp:33:1: error: stray '\240' in program
sortminmax.cpp:33:1: error: stray '\302' in program
sortminmax.cpp:33:1: error: stray '\240' in program
sortminmax.cpp:34:1: error: stray '\302' in program
   

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

 ^
sortminmax.cpp:35:1: error: stray '\240' in program
sortminmax.cpp:35:1: error: stray '\302' in program
sortminmax.cpp:35:1: error: stray '\240' in program
sortminmax.cpp:1:1: error: 'include' does not name a type
 include <iostream>

 ^
sortminmax.cpp: In function 'int main()':
sortminmax.cpp:7:6: error: 'cin' was not declared in this scope
    cin>>n;

      ^
sortminmax.cpp:16:5: error: 'aux' was not declared in this scope
    {aux=min;

     ^
sortminmax.cpp:26:9: error: 'aux' was not declared in this scope
       { aux=a[i];

         ^
sortminmax.cpp:33:10: error: 'cout' was not declared in this scope
       cout<<a[i]<<' ';

          ^

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