Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #55950528
Rezumat problemă
#1157
KSort2
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.
Pentru sortare se va folosit metoda QuickSort sau MergeSort.
Candale Silviu (silviu) Detalii
| Problema | KSort2 | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #55950528 | Utilizator |
Tata Gabor (ThatGuyRares)
|
| Fișier | ksort2.cpp | Dimensiune | 1.36 KB |
| Data încărcării | 31 Ianuarie 2025, 12:28 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
ksort2.cpp:1:1: error: stray '\360' in program 😂🤣❤️😍😒🙌😁💕😘👌😁👍(●'◡'●)(❁´◡\`❁)☆*: .｡. o(≧▽≦)o .｡.:*☆(*/ω＼*)╰(*°▽°*)╯(^///^)©😂😎🎶🤷♀️🤷♂️😢💖✌️🤞😜🤦♀️😉😎😒👍😁😍👌❤️😘🤣💕😂🙌😊😶🌫️🫡😚😍😅😆😘☺️🤨🙄😏😐🙂🥰😉😋😊😗😙🤗🤩😑😶😣😥😮🫥🤔🥲😎😋😙🤩😶😶😶🌫️🙄😏😣😥😮😴🥱😫😪😯🤐😌😛😜😝🤤😒🫠🙃🫤😕😔😓🤑😲☹️🙁😖😧😧😦😦😦😦😭😭😢😤😤😨😧😷😵🤪🤬🤧🤠🤠🤫😈👻😿🐶🦊🐹🐸🐔🦧🐈⬛🦏🐏🐁🦎🦖🐋🐙🦆🦜🦚🐥🐛🐛🕸️🧟♂️🫂👄🦿⛷️👨👵👩🦱👩🦱🧑🦰👩🦰🦿🦿👅🦾🧓🧑🦱🧑🦳🫅🧔♂️👮♀️👮♀️💂♀️🧑🎓🧑⚖️🧑🍳🧑🏭🧑🎤🧑🔬🧑✈️🧑🚒🤵♂️🤰🦹♀️🧚♀️🙍♀️🧏♀️🤦♀️💆♀️🧖♀️👩🦽👩🦼👩🦯🧎♀️🧍♀️🚶♀️🏃♀️➡️🧗♂️🛌🏌️🚣🚣🤽🚴🚴🤸🦻🫵🖖🫸🤌🤜👐💅👯👩👧👦👩👧👦🧨🎄🎑🧶🥽🩳👘👛👞👢⛑️💍 ^ ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\202' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\244' in program ksort2.cpp:1:1: error: stray '\243' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\235' in program ksort2.cpp:1:1: error: stray '\244' in program ksort2.cpp:1:1: error: stray '\357' in program ksort2.cpp:1:1: error: stray '\270' in program ksort2.cpp:1:1: error: stray '\217' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\215' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\222' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\231' in program ksort2.cpp:1:1: error: stray '\214' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\201' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\222' in program ksort2.cpp:1:1: error: stray '\225' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\221' in program ksort2.cpp:1:1: error: stray '\214' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\201' in program ksort2.cpp:1:1: error: stray '\360' in program ksort2.cpp:1:1: error: stray '\237' in program ksort2.cpp:1:1: error: stray '\221' in program ksort2.cpp:1:1: error: stray '\215' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\227' in program ksort2.cpp:1:1: error: stray '\217' in program ksort2.cpp:1:55: warning: multi-character character constant [-Wmultichar] 😂🤣❤️😍😒🙌😁💕😘👌😁👍(●'◡'●)(❁´◡\`❁)☆*: .｡. o(≧▽≦)o .｡.:*☆(*/ω＼*)╰(*°▽°*)╯(^///^)©😂😎🎶🤷♀️🤷♂️😢💖✌️🤞😜🤦♀️😉😎😒👍😁😍👌❤️😘🤣💕😂🙌😊😶🌫️🫡😚😍😅😆😘☺️🤨🙄😏😐🙂🥰😉😋😊😗😙🤗🤩😑😶😣😥😮🫥🤔🥲😎😋😙🤩😶😶😶🌫️🙄😏😣😥😮😴🥱😫😪😯🤐😌😛😜😝🤤😒🫠🙃🫤😕😔😓🤑😲☹️🙁😖😧😧😦😦😦😦😭😭😢😤😤😨😧😷😵🤪🤬🤧🤠🤠🤫😈👻😿🐶🦊🐹🐸🐔🦧🐈⬛🦏🐏🐁🦎🦖🐋🐙🦆🦜🦚🐥🐛🐛🕸️🧟♂️🫂👄🦿⛷️👨👵👩🦱👩🦱🧑🦰👩🦰🦿🦿👅🦾🧓🧑🦱🧑🦳🫅🧔♂️👮♀️👮♀️💂♀️🧑🎓🧑⚖️🧑🍳🧑🏭🧑🎤🧑🔬🧑✈️🧑🚒🤵♂️🤰🦹♀️🧚♀️🙍♀️🧏♀️🤦♀️💆♀️🧖♀️👩🦽👩🦼👩🦯🧎♀️🧍♀️🚶♀️🏃♀️➡️🧗♂️🛌🏌️🚣🚣🤽🚴🚴🤸🦻🫵🖖🫸🤌🤜👐💅👯👩👧👦👩👧👦🧨🎄🎑🧶🥽🩳👘👛👞👢⛑️💍 ^ ksort2.cpp:1:1: error: stray '\342' in program 😂🤣❤️😍😒🙌😁💕😘👌😁👍(●'◡'●)(❁´◡\`❁)☆*: .｡. o(≧▽≦)o .｡.:*☆(*/ω＼*)╰(*°▽°*)╯(^///^)©😂😎🎶🤷♀️🤷♂️😢💖✌️🤞😜🤦♀️😉😎😒👍😁😍👌❤️😘🤣💕😂🙌😊😶🌫️🫡😚😍😅😆😘☺️🤨🙄😏😐🙂🥰😉😋😊😗😙🤗🤩😑😶😣😥😮🫥🤔🥲😎😋😙🤩😶😶😶🌫️🙄😏😣😥😮😴🥱😫😪😯🤐😌😛😜😝🤤😒🫠🙃🫤😕😔😓🤑😲☹️🙁😖😧😧😦😦😦😦😭😭😢😤😤😨😧😷😵🤪🤬🤧🤠🤠🤫😈👻😿🐶🦊🐹🐸🐔🦧🐈⬛🦏🐏🐁🦎🦖🐋🐙🦆🦜🦚🐥🐛🐛🕸️🧟♂️🫂👄🦿⛷️👨👵👩🦱👩🦱🧑🦰👩🦰🦿🦿👅🦾🧓🧑🦱🧑🦳🫅🧔♂️👮♀️👮♀️💂♀️🧑🎓🧑⚖️🧑🍳🧑🏭🧑🎤🧑🔬🧑✈️🧑🚒🤵♂️🤰🦹♀️🧚♀️🙍♀️🧏♀️🤦♀️💆♀️🧖♀️👩🦽👩🦼👩🦯🧎♀️🧍♀️🚶♀️🏃♀️➡️🧗♂️🛌🏌️🚣🚣🤽🚴🚴🤸🦻🫵🖖🫸🤌🤜👐💅👯👩👧👦👩👧👦🧨🎄🎑🧶🥽🩳👘👛👞👢⛑️💍 ^ ksort2.cpp:1:1: error: stray '\227' in program ksort2.cpp:1:1: error: stray '\217' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\235' in program ksort2.cpp:1:1: error: stray '\201' in program ksort2.cpp:1:1: error: stray '\302' in program ksort2.cpp:1:1: error: stray '\264' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\227' in program ksort2.cpp:1:1: error: stray '\241' in program ksort2.cpp:1:1: error: stray '\`' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\235' in program ksort2.cpp:1:1: error: stray '\201' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\206' in program ksort2.cpp:1:1: error: stray '\357' in program ksort2.cpp:1:1: error: stray '\275' in program ksort2.cpp:1:1: error: stray '\241' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\211' in program ksort2.cpp:1:1: error: stray '\247' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\226' in program ksort2.cpp:1:1: error: stray '\275' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\211' in program ksort2.cpp:1:1: error: stray '\246' in program ksort2.cpp:1:1: error: stray '\357' in program ksort2.cpp:1:1: error: stray '\275' in program ksort2.cpp:1:1: error: stray '\241' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\230' in program ksort2.cpp:1:1: error: stray '\206' in program ksort2.cpp:1:1: error: stray '\317' in program ksort2.cpp:1:1: error: stray '\211' in program ksort2.cpp:1:1: error: stray '\357' in program ksort2.cpp:1:1: error: stray '\274' in program ksort2.cpp:1:1: error: stray '\274' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\225' in program ksort2.cpp:1:1: error: stray '\260' in program ksort2.cpp:1:1: error: stray '\302' in program ksort2.cpp:1:1: error: stray '\260' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\226' in program ksort2.cpp:1:1: error: stray '\275' in program ksort2.cpp:1:1: error: stray '\302' in program ksort2.cpp:1:1: error: stray '\260' in program ksort2.cpp:1:1: error: stray '\342' in program ksort2.cpp:1:1: error: stray '\225' in program ksort2.cpp:1:1: error: stray '\257' in program ksort2.cpp:1:55: error: expected unqualified-id before '\xe297a1' 😂🤣❤️😍😒🙌😁💕😘👌😁👍(●'◡'●)(❁´◡\`❁)☆*: .｡. o(≧▽≦)o .｡.:*☆(*/ω＼*)╰(*°▽°*)╯(^///^)©😂😎🎶🤷♀️🤷♂️😢💖✌️🤞😜🤦♀️😉😎😒👍😁😍👌❤️😘🤣💕😂🙌😊😶🌫️🫡😚😍😅😆😘☺️🤨🙄😏😐🙂🥰😉😋😊😗😙🤗🤩😑😶😣😥😮🫥🤔🥲😎😋😙🤩😶😶😶🌫️🙄😏😣😥😮😴🥱😫😪😯🤐😌😛😜😝🤤😒🫠🙃🫤😕😔😓🤑😲☹️🙁😖😧😧😦😦😦😦😭😭😢😤😤😨😧😷😵🤪🤬🤧🤠🤠🤫😈👻😿🐶🦊🐹🐸🐔🦧🐈⬛🦏🐏🐁🦎🦖🐋🐙🦆🦜🦚🐥🐛🐛🕸️🧟♂️🫂👄🦿⛷️👨👵👩🦱👩🦱🧑🦰👩🦰🦿🦿👅🦾🧓🧑🦱🧑🦳🫅🧔♂️👮♀️👮♀️💂♀️🧑🎓🧑⚖️🧑🍳🧑🏭🧑🎤🧑🔬🧑✈️🧑🚒🤵♂️🤰🦹♀️🧚♀️🙍♀️🧏♀️🤦♀️💆♀️🧖♀️👩🦽👩🦼👩🦯🧎♀️🧍♀️🚶♀️🏃♀️➡️🧗♂️🛌🏌️🚣🚣🤽🚴🚴🤸🦻🫵🖖🫸🤌🤜👐💅👯👩👧👦👩👧👦🧨🎄🎑🧶🥽🩳👘👛👞👢⛑️💍 ^ ksort2.cpp:1:55: error: expected ')' before '\xe297a1'
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 KSort2 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ă.