Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #12187469
Rezumat problemă
#511
KSort
Se dă un vector cu n elemente, numere naturale și un număr k. Ordonați crescător primele k elemente ale vectorului și descrescător ultimele n-k elemente.
Candale Silviu (silviu) Detalii
| Problema | KSort | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #12187469 | Utilizator |
Boca Ioana (bocaioana)
|
| Fișier | ksort.cpp | Dimensiune | 368 B |
| Data încărcării | 21 Noiembrie 2018, 17:37 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
ksort.cpp:2:9: error: #include expects "FILENAME" or <FILENAME> #include <iostream> ^ ksort.cpp:3:9: error: #include expects "FILENAME" or <FILENAME> #include <algorithm> ^ ksort.cpp:4:1: error: stray '\302' in program using namespace std; ^ ksort.cpp:4:1: error: stray '\240' in program ksort.cpp:4:1: error: stray '\302' in program ksort.cpp:4:1: error: stray '\240' in program ksort.cpp:5:1: error: stray '\302' in program int main(){ ^ ksort.cpp:5:1: error: stray '\240' in program ksort.cpp:6:1: error: stray '\302' in program int n,k,t=0,i; ^ ksort.cpp:6:1: error: stray '\240' in program ksort.cpp:6:1: error: stray '\302' in program ksort.cpp:6:1: error: stray '\240' in program ksort.cpp:6:1: error: stray '\302' in program ksort.cpp:6:1: error: stray '\240' in program ksort.cpp:6:1: error: stray '\302' in program ksort.cpp:6:1: error: stray '\240' in program ksort.cpp:6:1: error: stray '\302' in program ksort.cpp:6:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program cin>>n>>k;int v[n], v2[n]; ^ ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:7:1: error: stray '\302' in program ksort.cpp:7:1: error: stray '\240' in program ksort.cpp:8:1: error: stray '\302' in program for(i=0;i<k;cin>>v[i++]){} ^ ksort.cpp:8:1: error: stray '\240' in program ksort.cpp:8:1: error: stray '\302' in program ksort.cpp:8:1: error: stray '\240' in program ksort.cpp:8:1: error: stray '\302' in program ksort.cpp:8:1: error: stray '\240' in program ksort.cpp:8:1: error: stray '\302' in program ksort.cpp:8:1: error: stray '\240' in program ksort.cpp:9:1: error: stray '\302' in program for(i=k;i<n;i++,cin>>v2[t++]){} ^ ksort.cpp:9:1: error: stray '\240' in program ksort.cpp:9:1: error: stray '\302' in program ksort.cpp:9:1: error: stray '\240' in program ksort.cpp:9:1: error: stray '\302' in program ksort.cpp:9:1: error: stray '\240' in program ksort.cpp:9:1: error: stray '\302' in program ksort.cpp:9:1: error: stray '\240' in program ksort.cpp:10:1: error: stray '\302' in program sort(v, v+k); ^ ksort.cpp:10:1: error: stray '\240' in program ksort.cpp:10:1: error: stray '\302' in program ksort.cpp:10:1: error: stray '\240' in program ksort.cpp:10:1: error: stray '\302' in program ksort.cpp:10:1: error: stray '\240' in program ksort.cpp:10:1: error: stray '\302' in program ksort.cpp:10:1: error: stray '\240' in program ksort.cpp:10:1: error: stray '\302' in program ksort.cpp:10:1: error: stray '\240' in program ksort.cpp:11:1: error: stray '\302' in program sort(v2, v2+t); ^ ksort.cpp:11:1: error: stray '\240' in program ksort.cpp:11:1: error: stray '\302' in program ksort.cpp:11:1: error: stray '\240' in program ksort.cpp:11:1: error: stray '\302' in program ksort.cpp:11:1: error: stray '\240' in program ksort.cpp:11:1: error: stray '\302' in program ksort.cpp:11:1: error: stray '\240' in program ksort.cpp:11:1: error: stray '\302' in program ksort.cpp:11:1: error: stray '\240' in program ksort.cpp:12:1: error: stray '\302' in program for(i=0;i<k;cout<<v[i++]<<" "){} ^ ksort.cpp:12:1: error: stray '\240' in program ksort.cpp:12:1: error: stray '\302' in program ksort.cpp:12:1: error: stray '\240' in program ksort.cpp:12:1: error: stray '\302' in program ksort.cpp:12:1: error: stray '\240' in program ksort.cpp:12:1: error: stray '\302' in program ksort.cpp:12:1: error: stray '\240' in program ksort.cpp:13:1: error: stray '\302' in program for(i=t-1;i>=0;cout<<v2[i--]<<" "){} ^ ksort.cpp:13:1: error: stray '\240' in program ksort.cpp:13:1: error: stray '\302' in program ksort.cpp:13:1: error: stray '\240' in program ksort.cpp:13:1: error: stray '\302' in program ksort.cpp:13:1: error: stray '\240' in program ksort.cpp:13:1: error: stray '\302' in program ksort.cpp:13:1: error: stray '\240' in program ksort.cpp: In function 'int main()': ksort.cpp:7:9: error: 'cin' was not declared in this scope cin>>n>>k;int v[n], v2[n]; ^ ksort.cpp:10:21: error: 'sort' was not declared in this scope sort(v, v+k); ^ ksort.cpp:12:21: error: 'cout' was not declared in this scope for(i=0;i<k;cout<<v[i++]<<" "){} ^ ksort.cpp:13:24: error: 'cout' was not declared in this scope for(i=t-1;i>=0;cout<<v2[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 KSort 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ă.