Detalii evaluare #61955892

Rezumat problemă

Se dă un vector cu n elemente, numere naturale distincte. Ordonați crescător elementele situate înaintea valorii maxime din vector și descrescător elementele situate după această valoare.

Detalii

Problema SortMax Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #61955892 Utilizator Mailat Maia (Mailat_Maia)
Fișier sortmax.cpp Dimensiune 948 B
Data încărcării 18 Decembrie 2025, 23:01 Scor/rezultat Eroare de compilare

Evaluare

Mesaj compilare

sortmax.cpp:5:1: error: stray '\302' in program
     int a[1001],n,kmax,imax,tmp;

 ^
sortmax.cpp:5:1: error: stray '\240' in program
sortmax.cpp:5:1: error: stray '\302' in program
sortmax.cpp:5:1: error: stray '\240' in program
sortmax.cpp:6:1: error: stray '\302' in program
     cin>>n;

 ^
sortmax.cpp:6:1: error: stray '\240' in program
sortmax.cpp:6:1: error: stray '\302' in program
sortmax.cpp:6:1: error: stray '\240' in program
sortmax.cpp:7:1: error: stray '\302' in program
     imax=0;

 ^
sortmax.cpp:7:1: error: stray '\240' in program
sortmax.cpp:7:1: error: stray '\302' in program
sortmax.cpp:7:1: error: stray '\240' in program
sortmax.cpp:8:1: error: stray '\302' in program
     kmax=0;

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

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

 ^
sortmax.cpp:10:1: error: stray '\240' in program
sortmax.cpp:10:1: error: stray '\302' in program
sortmax.cpp:10:1: error: stray '\240' in program
sortmax.cpp:11:1: error: stray '\302' in program
     for(int i=1;i<=n;i++){

 ^
sortmax.cpp:11:1: error: stray '\240' in program
sortmax.cpp:11:1: error: stray '\302' in program
sortmax.cpp:11:1: error: stray '\240' in program
sortmax.cpp:12:1: error: stray '\302' in program
         if(a[i]>kmax){

 ^
sortmax.cpp:12:1: error: stray '\240' in program
sortmax.cpp:12:1: error: stray '\302' in program
sortmax.cpp:12:1: error: stray '\240' in program
sortmax.cpp:12:1: error: stray '\302' in program
sortmax.cpp:12:1: error: stray '\240' in program
sortmax.cpp:12:1: error: stray '\302' in program
sortmax.cpp:12:1: error: stray '\240' in program
sortmax.cpp:13:1: error: stray '\302' in program
         kmax=a[i];

 ^
sortmax.cpp:13:1: error: stray '\240' in program
sortmax.cpp:13:1: error: stray '\302' in program
sortmax.cpp:13:1: error: stray '\240' in program
sortmax.cpp:13:1: error: stray '\302' in program
sortmax.cpp:13:1: error: stray '\240' in program
sortmax.cpp:13:1: error: stray '\302' in program
sortmax.cpp:13:1: error: stray '\240' in program
sortmax.cpp:14:1: error: stray '\302' in program
         imax=i;}

 ^
sortmax.cpp:14:1: error: stray '\240' in program
sortmax.cpp:14:1: error: stray '\302' in program
sortmax.cpp:14:1: error: stray '\240' in program
sortmax.cpp:14:1: error: stray '\302' in program
sortmax.cpp:14:1: error: stray '\240' in program
sortmax.cpp:14:1: error: stray '\302' in program
sortmax.cpp:14:1: error: stray '\240' in program
sortmax.cpp:15:1: error: stray '\302' in program
     }

 ^
sortmax.cpp:15:1: error: stray '\240' in program
sortmax.cpp:15:1: error: stray '\302' in program
sortmax.cpp:15:1: error: stray '\240' in program
sortmax.cpp:16:1: error: stray '\302' in program
     int k=imax;

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

 ^
sortmax.cpp:17:1: error: stray '\240' in program
sortmax.cpp:17:1: error: stray '\302' in program
sortmax.cpp:17:1: error: stray '\240' in program
sortmax.cpp:18:1: error: stray '\302' in program
         for(int j=i+1; j<=k; j++){

 ^
sortmax.cpp:18:1: error: stray '\240' in program
sortmax.cpp:18:1: error: stray '\302' in program
sortmax.cpp:18:1: error: stray '\240' in program
sortmax.cpp:18:1: error: stray '\302' in program
sortmax.cpp:18:1: error: stray '\240' in program
sortmax.cpp:18:1: error: stray '\302' in program
sortmax.cpp:18:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
             if(a[j]<a[i]){

 ^
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:19:1: error: stray '\302' in program
sortmax.cpp:19:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
                 tmp=a[j];

 ^
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:20:1: error: stray '\302' in program
sortmax.cpp:20:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
                 a[j]=a[i];

 ^
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:21:1: error: stray '\302' in program
sortmax.cpp:21:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
                 a[i]=tmp;

 ^
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:22:1: error: stray '\302' in program
sortmax.cpp:22:1: error: stray '\240' in program
sortmax.cpp:23:1: error: stray '\302' in program
             }

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

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

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

 ^
sortmax.cpp:26:1: error: stray '\240' in program
sortmax.cpp:26:1: error: stray '\302' in program
sortmax.cpp:26:1: error: stray '\240' in program
sortmax.cpp:27:1: error: stray '\302' in program
     for(int i=k+1; i<n; i++){

 ^
sortmax.cpp:27:1: error: stray '\240' in program
sortmax.cpp:27:1: error: stray '\302' in program
sortmax.cpp:27:1: error: stray '\240' in program
sortmax.cpp:28:1: error: stray '\302' in program
         for(int j=i+1; j<=n; j++){

 ^
sortmax.cpp:28:1: error: stray '\240' in program
sortmax.cpp:28:1: error: stray '\302' in program
sortmax.cpp:28:1: error: stray '\240' in program
sortmax.cpp:28:1: error: stray '\302' in program
sortmax.cpp:28:1: error: stray '\240' in program
sortmax.cpp:28:1: error: stray '\302' in program
sortmax.cpp:28:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
             if(a[j]>a[i]){

 ^
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:29:1: error: stray '\302' in program
sortmax.cpp:29:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
                 tmp=a[j];

 ^
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:30:1: error: stray '\302' in program
sortmax.cpp:30:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
                 a[j]=a[i];

 ^
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:31:1: error: stray '\302' in program
sortmax.cpp:31:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
                 a[i]=tmp;

 ^
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:32:1: error: stray '\302' in program
sortmax.cpp:32:1: error: stray '\240' in program
sortmax.cpp:33:1: error: stray '\302' in program
             }

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

 ^
sortmax.cpp:34:1: error: stray '\240' in program
sortmax.cpp:34:1: error: stray '\302' in program
sortmax.cpp:34:1: error: stray '\240' in program
sortmax.cpp:34:1: error: stray '\302' in program
sortmax.cpp:34:1: error: stray '\240' in program
sortmax.cpp:34:1: error: stray '\302' in program
sortmax.cpp:34:1: error: stray '\240' in program
sortmax.cpp:35:1: error: stray '\302' in program
     }

 ^
sortmax.cpp:35:1: error: stray '\240' in program
sortmax.cpp:35:1: error: stray '\302' in program
sortmax.cpp:35:1: error: stray '\240' in program
sortmax.cpp:36:1: error: stray '\302' in program
    

 ^
sortmax.cpp:36:1: error: stray '\240' in program
sortmax.cpp:36:1: error: stray '\302' in program
sortmax.cpp:36:1: error: stray '\240' in program
sortmax.cpp:37:1: error: stray '\302' in program
     for(int i=1; i<=n; i++){

 ^
sortmax.cpp:37:1: error: stray '\240' in program
sortmax.cpp:37:1: error: stray '\302' in program
sortmax.cpp:37:1: error: stray '\240' in program
sortmax.cpp:38:1: error: stray '\302' in program
         cout << a[i] << " ";

 ^
sortmax.cpp:38:1: error: stray '\240' in program
sortmax.cpp:38:1: error: stray '\302' in program
sortmax.cpp:38:1: error: stray '\240' in program
sortmax.cpp:38:1: error: stray '\302' in program
sortmax.cpp:38:1: error: stray '\240' in program
sortmax.cpp:38:1: error: stray '\302' in program
sortmax.cpp:38:1: error: stray '\240' in program
sortmax.cpp:39:1: error: stray '\302' in program
     }

 ^
sortmax.cpp:39:1: error: stray '\240' in program
sortmax.cpp:39:1: error: stray '\302' in program
sortmax.cpp:39:1: error: stray '\240' in program
sortmax.cpp:40:1: error: stray '\302' in program
     

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

 ^
sortmax.cpp:41:1: error: stray '\240' in program
sortmax.cpp:41:1: error: stray '\302' in program
sortmax.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 SortMax 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!