{"trustable":false,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Problem Statement","value":{"format":"HTML","content":"\u003cscript type\u003d\"text/x-mathjax-config\"\u003eMathJax.Hub.Config({messageStyle:\"none\",tex2jax:{skipTags:[\"script\",\"noscript\",\"style\",\"textarea\",\"code\"],inlineMath:[[\u0027\\\\(\u0027,\u0027\\\\)\u0027]]},delayStartupUntil:\"onload\"});\u003c/script\u003e\n\u003cscript src\u003d\"https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.0/MathJax.js?config\u003dTeX-MML-AM_CHTML\"\u003e\u003c/script\u003e\n\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003eAna a aranjat in fata ei \u003ci\u003eN\u003c/i\u003e gramezi de pietre numerotate de la \u003ci\u003e1\u003c/i\u003e la \u003ci\u003eN\u003c/i\u003e. Aceasta doreste sa foloseasca acest aranjament pentru a juca un joc foarte bine cunoscut impreuna cu prietenul ei, Bogdan.\u003c/p\u003e\n\n\u003cp\u003eDin nefericire, Bogdan s-a saturat sa mai joace jocuri, asa ca Ana va trebui sa se joace singura cu cele \u003ci\u003eN\u003c/i\u003e gramezi de pietre. Aceasta se gandeste sa construiasca un sir s astfel:\u003c/p\u003e\n\u003col\u003e\n\u003cli\u003e\nVom nota cu \u003ci\u003ex\u003c/i\u003e pozitia celei mai din stanga gramezi cu numar maxim de pietre si vom adauga la sfarsitul lui \u003ci\u003es\u003c/i\u003e pe \u003ci\u003ex\u003c/i\u003e.\n\u003c/li\u003e\n\u003cli\u003e\nEliminam o piatra dintr-o gramada.\n\u003c/li\u003e\n\u003cli\u003e\nDaca mai exista o piatra intr-o gramada, ne intoarcem la pasul 1. Altfel, s-a terminat constructia sirului.\n\u003c/li\u003e\n\u003c/ol\u003e\n\n\u003cp\u003eScopul jocului pe care si l-a propus Ana, este de a obtine cel mai mic lexicografic sir posibil urmarind regulile de mai sus. Deoarece acest sir poate fi foarte mare, se cere a se afisa de cate ori va aparea fiecare numar de la \u003ci\u003e1\u003c/i\u003e la \u003ci\u003eN\u003c/i\u003e in sirul final.\n\u003c/p\u003e"}},{"title":"Constraints","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cul\u003e \n \u003cli\u003e\u003cvar\u003e1 ≤ N ≤ 10\u003csup\u003e5\u003c/sup\u003e\u003c/var\u003e\u003c/li\u003e \n \u003cli\u003e\u003cvar\u003e1 ≤ a\u003csub\u003ei\u003c/sub\u003e ≤ 10\u003csup\u003e9\u003c/sup\u003e\u003c/var\u003e\u003c/li\u003e \n\u003c/ul\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003ePe prima linie din input se va afla \u003ci\u003eN\u003c/i\u003e - numarul de gramezi.\nPe cea de a doua linie din input se vor afla \u003ci\u003eN\u003c/i\u003e numere - ai reprezentand numarul de pietre din gramada \u003ci\u003ei\u003c/i\u003e.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cp\u003eSe vor afisa N linii. Linia i va contine numarul de aparitii a numarului i in sirul minim lexicografic format urmarind regulile din enunt.\u003c/p\u003e "}},{"title":"Sample Input 1","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2\n1 2\n\u003c/pre\u003e"}},{"title":"Sample Output 1","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e2\n1\n\u003c/pre\u003e \n\u003cp\u003eCel mai mic lexicografic sir se poate forma astfel:\u003cbr\u003e\nDeoarece gramada a doua are cele mai multe pietre, vom adauga la sfarsitul sirului pe 2 (indicele gramezii) si vom elimina o piatra din a doua gramada. \u003cbr\u003e\nDupa care, vom avea doua gramezi cu o piatra fiecare. Deoarece prima gramada este cea mai din stanga gramada ce are cele mai multe pietre, vom adauga la sfarsitul lui s pe 1 si vom elimina o piatra din a doua gramada. \u003cbr\u003e\nIn final vom avea doar o singura gramada cu o singura piatra (gramada a doua). Asadar, vom adauga la sfarsitul lui s pe 2, eliminam ultima piatra si se incheie procesul. \u003cbr\u003e\nIn final vom avea sirul 2, 1, 1 - indexul 1 apare de 2 ori, iar indexul 2 apare o data.\n\u003c/p\u003e"}},{"title":"Sample Input 2","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e10\n1 2 1 3 2 4 2 5 8 1\n\u003c/pre\u003e"}},{"title":"Sample Output 2","value":{"format":"HTML","content":"\u003ch3\u003e\u003c/h3\u003e\n\u003cpre\u003e10\n7\n0\n4\n0\n3\n0\n2\n3\n0\n\u003c/pre\u003e"}}]}