<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>Tehnica Greedy (Probleme) by Doina Şimanschi</title>
      <link>https://padlet.com/doinasimanschi/oi32qpu4spf</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2017-04-09 16:13:43 UTC</pubDate>
      <lastBuildDate>2025-11-23 15:36:57 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url>https://padlet-assets.s3.amazonaws.com/icons/Lovecookie.png</url>
      </image>
      <item>
         <title>Problema SPECTACOLELOR</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165560276</link>
         <description><![CDATA[<div>Managerul artistic al unui festival trebuie sa selecteze o multime cat mai ampla de spectacole ce pot fi jucate in singura sala pe care o are .Stiind ca i s-a propus n&lt;=100 spectacole si pentru fiecare spectacol i i-a fost anuntat intervalul in care se poate desfasura [si,fi).<strong><em>SCRIETI </em></strong>un program care sa permita spectatorilor vizionarea unui numar cat mai mare de spectacole .</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/3544725ac003fb96120de18d1be31ec8/________bdfbhdfbhd__.png" />
         <pubDate>2017-04-09 16:16:08 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165560276</guid>
      </item>
      <item>
         <title></title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606402</link>
         <description><![CDATA[<div>2</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/d4134fd0790382f19bd6feca57b27e5d/Untitldsged.png" />
         <pubDate>2017-04-10 05:55:02 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606402</guid>
      </item>
      <item>
         <title></title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606492</link>
         <description><![CDATA[<div>1</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/9d8472cd8d082a0b27dec64b8604664e/Untitled.png" />
         <pubDate>2017-04-10 05:56:04 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606492</guid>
      </item>
      <item>
         <title></title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606534</link>
         <description><![CDATA[<div>3 Rezultat:</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/541281bd7c1d8223b795f080a3071082/Untitleggsd.png" />
         <pubDate>2017-04-10 05:56:56 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606534</guid>
      </item>
      <item>
         <title>Problema Rucsacului</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606624</link>
         <description><![CDATA[<div>Se cere sa se precizeze ce obiecte trebuie sa transporte in asa fel incat castigul sa fie maxim:1/2/3</div>]]></description>
         <enclosure url="" />
         <pubDate>2017-04-10 05:58:31 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606624</guid>
      </item>
      <item>
         <title></title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606763</link>
         <description><![CDATA[<div>Plata unei sume intr-un numar minim de bancnote:</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/096653b35b69dddd2fcc2569b4554cc8/Untitleggsd.png" />
         <pubDate>2017-04-10 06:00:36 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/165606763</guid>
      </item>
      <item>
         <title>Fiind dată o hartă cu n ţări, se cer toate soluţiile de colorare a hărţii, utilizând cel mult 4 culori, astfel încât 2 ţări cu frontiera comună să fie colorate diferit. Este demonstrat matematic faptul că sunt suficiente numai 4 culori pentru ca orice hartă să fie colorată astfel.</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/167820413</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/75db59e55a128c9d72810dbb2980dc0e/________fhdhdfhdf__.png" />
         <pubDate>2017-04-24 13:27:16 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/167820413</guid>
      </item>
      <item>
         <title>Harta</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/167822315</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/aa1de59a171dca7a46352f0a99966ad5/________fhdhdfhdf__.png" />
         <pubDate>2017-04-24 13:31:58 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/167822315</guid>
      </item>
      <item>
         <title>Problema comis-voiajorului </title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169146807</link>
         <description><![CDATA[<div>Se dau n orase si distantele intre oricare doua orase.Un comis-voiajor trebuie sa plece dintr-un oras , sa treaca prin fiecare oras o singura data si in final sa se intoarca in orasul de plecare . Sa se determine un traseu de lungime minima pentru comis-voiajor.</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/50af1f8b03dfb90e1cb21f4da492538a/__________.png" />
         <pubDate>2017-05-01 12:23:32 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169146807</guid>
      </item>
      <item>
         <title>Solutie</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169147835</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/8862c43846b3c9f6d907c73c00799260/__________.png" />
         <pubDate>2017-05-01 12:30:21 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169147835</guid>
      </item>
      <item>
         <title>Plata unei sume de bani</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169148936</link>
         <description><![CDATA[<div>Fie k si n doua numere naturale si S o suma de bani ce trebuie platita folosind monezi de urmatoare valori k0 =1, K1,...,Kn+1. Sa se determine o modalitate de plata a&nbsp; unei sume S folosind un numar minim din monezile precizate , presupunand ca din fiecare tip de moneda exista o cantitate nelimitata.</div>]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/1a6011fe6498ddaab13097303931f2be/__________.png" />
         <pubDate>2017-05-01 12:37:04 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/169148936</guid>
      </item>
      <item>
         <title>rezolvare Problema Spectacolelor</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/172587212</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/735a296a6499ec4f4b9aab3a04620804/______tyityi____.png" />
         <pubDate>2017-05-18 14:05:24 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/172587212</guid>
      </item>
      <item>
         <title>Rezultat:(plata uneisume</title>
         <author>doinasimanschi</author>
         <link>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/172590860</link>
         <description><![CDATA[]]></description>
         <enclosure url="https://padletuploads.blob.core.windows.net/prod/190802109/254b3b2faa5d97fffb3a423cbda76a46/______tyityi____.png" />
         <pubDate>2017-05-18 14:16:16 UTC</pubDate>
         <guid>https://padlet.com/doinasimanschi/oi32qpu4spf/wish/172590860</guid>
      </item>
   </channel>
</rss>
