<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://wiki.universitas.ro/index.php?action=history&amp;feed=atom&amp;title=1408_-_Numere_10</id>
	<title>1408 - Numere 10 - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.universitas.ro/index.php?action=history&amp;feed=atom&amp;title=1408_-_Numere_10"/>
	<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=1408_-_Numere_10&amp;action=history"/>
	<updated>2026-05-02T13:20:52Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.42.1</generator>
	<entry>
		<id>https://wiki.universitas.ro/index.php?title=1408_-_Numere_10&amp;diff=5262&amp;oldid=prev</id>
		<title>Robert Manc at 16:39, 28 April 2023</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=1408_-_Numere_10&amp;diff=5262&amp;oldid=prev"/>
		<updated>2023-04-28T16:39:12Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;col class=&quot;diff-marker&quot; /&gt;
				&lt;col class=&quot;diff-content&quot; /&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;2&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 16:39, 28 April 2023&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot; id=&quot;mw-diff-left-l75&quot;&gt;Line 75:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 75:&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;br&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot;&gt;&lt;/td&gt;&lt;td style=&quot;background-color: #f8f9fa; color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #eaecf0; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;== Explicație ==&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Acest program primește ca date de intrare un număr întreg &#039;&#039;&#039;nr&#039;&#039;&#039; urmat de o listă de &#039;&#039;&#039;nr&#039;&#039;&#039; numere întregi &#039;&#039;&#039;numere&#039;&#039;&#039;. Programul validează datele de intrare și afișează numărul total de numere prime din listă și cel mai mic și cel mai mare număr prim din listă.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;Funcția &#039;&#039;&#039;verif_prim&#039;&#039;&#039; verifică dacă un număr &#039;&#039;&#039;n&#039;&#039;&#039; este prim sau nu. Funcția &#039;&#039;&#039;numarare_prim&#039;&#039;&#039; numără numerele prime din lista de numere primite ca parametru, iar funcția &#039;&#039;&#039;gaseste_min_max_prim&#039;&#039;&#039; găsește cel mai mic și cel mai mare număr prim din listă.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-side-deleted&quot;&gt;&lt;/td&gt;&lt;td class=&quot;diff-marker&quot; data-marker=&quot;+&quot;&gt;&lt;/td&gt;&lt;td style=&quot;color: #202122; font-size: 88%; border-style: solid; border-width: 1px 1px 1px 4px; border-radius: 0.33em; border-color: #a3d3ff; vertical-align: top; white-space: pre-wrap;&quot;&gt;&lt;div&gt;&lt;ins style=&quot;font-weight: bold; text-decoration: none;&quot;&gt;În funcția &#039;&#039;&#039;gaseste_min_max_prim&#039;&#039;&#039;, numărul total de numere prime este calculat utilizând funcția &#039;&#039;&#039;numarare_prim&#039;&#039;&#039;. Prin iterarea prin lista de numere, se găsesc cele mai mici și cele mai mari numere prime din listă. Acestea sunt stocate în variabilele &#039;&#039;&#039;min_prim&#039;&#039;&#039; și &#039;&#039;&#039;max_prim&#039;&#039;&#039;, respectiv. Dacă niciun număr prim nu este găsit, &#039;&#039;&#039;min_prim&#039;&#039;&#039; și &#039;&#039;&#039;max_prim&#039;&#039;&#039; rămân &#039;&#039;&#039;None&#039;&#039;&#039;. La final, cele trei valori (numărul total de numere prime și cele mai mici și cele mai mari numere prime) sunt afișate.&lt;/ins&gt;&lt;/div&gt;&lt;/td&gt;&lt;/tr&gt;
&lt;/table&gt;</summary>
		<author><name>Robert Manc</name></author>
	</entry>
	<entry>
		<id>https://wiki.universitas.ro/index.php?title=1408_-_Numere_10&amp;diff=3465&amp;oldid=prev</id>
		<title>Robert Manc: Pagină nouă: == Cerinţa == Se dau &#039;&#039;&#039;nr&#039;&#039;&#039; numere naturale. Calculați câte dintre ele sunt prime, cel mai mare și cel mai mic număr prim. == Date de intrare == Programul citește de la tastatură numărul &#039;&#039;&#039;nr&#039;&#039;&#039;, iar apoi &#039;&#039;&#039;nr&#039;&#039;&#039; &#039;&#039;&#039;numere&#039;&#039;&#039; naturale. == Date de ieşire == Programul va afișa pe ecran numărul &#039;&#039;&#039;numere_prime&#039;&#039;&#039;, &#039;&#039;&#039;min_prim&#039;&#039;&#039;, &#039;&#039;&#039;max_prim&#039;&#039;&#039;, reprezentând câte dintre numerele date sunt prime, cel mai mic și cel mai pare număr prim. == Restricții și preciz...</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=1408_-_Numere_10&amp;diff=3465&amp;oldid=prev"/>
		<updated>2023-04-11T15:24:03Z</updated>

		<summary type="html">&lt;p&gt;Pagină nouă: == Cerinţa == Se dau &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039; numere naturale. Calculați câte dintre ele sunt prime, cel mai mare și cel mai mic număr prim. == Date de intrare == Programul citește de la tastatură numărul &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039;, iar apoi &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;numere&amp;#039;&amp;#039;&amp;#039; naturale. == Date de ieşire == Programul va afișa pe ecran numărul &amp;#039;&amp;#039;&amp;#039;numere_prime&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;min_prim&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;max_prim&amp;#039;&amp;#039;&amp;#039;, reprezentând câte dintre numerele date sunt prime, cel mai mic și cel mai pare număr prim. == Restricții și preciz...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;== Cerinţa ==&lt;br /&gt;
Se dau &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039; numere naturale. Calculați câte dintre ele sunt prime, cel mai mare și cel mai mic număr prim.&lt;br /&gt;
== Date de intrare ==&lt;br /&gt;
Programul citește de la tastatură numărul &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039;, iar apoi &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;numere&amp;#039;&amp;#039;&amp;#039; naturale.&lt;br /&gt;
== Date de ieşire ==&lt;br /&gt;
Programul va afișa pe ecran numărul &amp;#039;&amp;#039;&amp;#039;numere_prime&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;min_prim&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;max_prim&amp;#039;&amp;#039;&amp;#039;, reprezentând câte dintre numerele date sunt prime, cel mai mic și cel mai pare număr prim.&lt;br /&gt;
== Restricții și precizări ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;nr &amp;amp;isin; &amp;amp;Nu;&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;1 &amp;amp;les; nr &amp;amp;les; 10.000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* cele &amp;#039;&amp;#039;&amp;#039;nr&amp;#039;&amp;#039;&amp;#039; &amp;#039;&amp;#039;&amp;#039;numere&amp;#039;&amp;#039;&amp;#039; citite vor fi mai mici decât &amp;#039;&amp;#039;&amp;#039;1.000.000.000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* în fiecare test va exista cel puțin un număr prim&lt;br /&gt;
== Exemplu1 ==&lt;br /&gt;
; Intrare&lt;br /&gt;
: 9&lt;br /&gt;
: 7 3 10 17 14 1 9 3 13 &lt;br /&gt;
; Ieșire&lt;br /&gt;
: Datele de intrare corespund restricțiilor impuse.&lt;br /&gt;
: 5 3 17&lt;br /&gt;
== Exemplu2 ==&lt;br /&gt;
; Intrare&lt;br /&gt;
: 10&lt;br /&gt;
: 77 64 39 81 6 15 3 79 94 32&lt;br /&gt;
; Ieșire&lt;br /&gt;
: Datele de intrare corespund restricțiilor impuse.&lt;br /&gt;
: 2 3 79&lt;br /&gt;
== Rezolvare ==&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;python&amp;quot; line&amp;gt;&lt;br /&gt;
def validare_date(nr, numere):&lt;br /&gt;
    flag = False&lt;br /&gt;
    if 0 &amp;lt; int(nr) &amp;lt;= 10_000:&lt;br /&gt;
        flag = all(isinstance(x, int) and 1 &amp;lt;= x &amp;lt;= 1_000_000_000 for x in numere)&lt;br /&gt;
    return flag&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
def verif_prim(n):&lt;br /&gt;
    if n &amp;lt;= 1:&lt;br /&gt;
        return False&lt;br /&gt;
    else:&lt;br /&gt;
        for i in range(2, int(n ** 0.5) + 1):&lt;br /&gt;
            if n % i == 0:&lt;br /&gt;
                return False&lt;br /&gt;
        else:&lt;br /&gt;
            return True&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
def numarare_prim(numere):&lt;br /&gt;
    numere_prime = 0&lt;br /&gt;
    for numar in numere:&lt;br /&gt;
        if verif_prim(numar):&lt;br /&gt;
            numere_prime += 1&lt;br /&gt;
    return numere_prime&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
def gaseste_min_max_prim(numere):&lt;br /&gt;
    numere_prime = numarare_prim(numere)&lt;br /&gt;
    min_prim = None&lt;br /&gt;
    max_prim = None&lt;br /&gt;
    for numar in numere:&lt;br /&gt;
        if verif_prim(numar):&lt;br /&gt;
            if min_prim is None or numar &amp;lt; min_prim:&lt;br /&gt;
                min_prim = numar&lt;br /&gt;
            if max_prim is None or numar &amp;gt; max_prim:&lt;br /&gt;
                max_prim = numar&lt;br /&gt;
    print(numere_prime, min_prim, max_prim)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
if __name__ == &amp;#039;__main__&amp;#039;:&lt;br /&gt;
    nr = int(input())&lt;br /&gt;
    numere = list(map(int, input().split()))&lt;br /&gt;
    if validare_date(nr, numere):&lt;br /&gt;
        print(&amp;quot;\nDatele de intrare corespund restrictiilor impuse.\n&amp;quot;)&lt;br /&gt;
        gaseste_min_max_prim(numere)&lt;br /&gt;
    else:&lt;br /&gt;
        print(&amp;quot;Datele de intrare nu corespund restrictiilor impuse.&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>Robert Manc</name></author>
	</entry>
</feed>