<?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=0044_-_Prime_Interval</id>
	<title>0044 - Prime Interval - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.universitas.ro/index.php?action=history&amp;feed=atom&amp;title=0044_-_Prime_Interval"/>
	<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=0044_-_Prime_Interval&amp;action=history"/>
	<updated>2026-05-01T07:39:35Z</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=0044_-_Prime_Interval&amp;diff=5261&amp;oldid=prev</id>
		<title>Robert Manc at 16:36, 28 April 2023</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=0044_-_Prime_Interval&amp;diff=5261&amp;oldid=prev"/>
		<updated>2023-04-28T16:36:28Z</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:36, 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-l65&quot;&gt;Line 65:&lt;/td&gt;
&lt;td colspan=&quot;2&quot; class=&quot;diff-lineno&quot;&gt;Line 65:&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;Programul primește două numere de la tastatură și verifică dacă acestea se încadrează în limitele impuse de funcția &#039;&#039;&#039;validare_date&#039;&#039;&#039;. Dacă numerele sunt valide, programul numără câte numere prime sunt între cele două numere primite, folosind funcția &#039;&#039;&#039;numarare_prime&#039;&#039;&#039;. Pentru a număra numerele prime, se folosește funcția &#039;&#039;&#039;verif_prim&#039;&#039;&#039;, care primește un număr și returnează &#039;&#039;&#039;True&#039;&#039;&#039; dacă numărul este prim, sau &#039;&#039;&#039;False&#039;&#039;&#039; altfel.&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=0044_-_Prime_Interval&amp;diff=3464&amp;oldid=prev</id>
		<title>Robert Manc: Pagină nouă: == Cerinţa == Să se scrie un program care citește două numere naturale &#039;&#039;&#039;numar1&#039;&#039;&#039; și &#039;&#039;&#039;numar2&#039;&#039;&#039; și determină câte numere prime sunt în intervalul închis determinat de &#039;&#039;&#039;numar1&#039;&#039;&#039; și &#039;&#039;&#039;numar2&#039;&#039;&#039;. == Date de intrare == Programul citește de la tastatură numerele &#039;&#039;&#039;numar1&#039;&#039;&#039; și &#039;&#039;&#039;numar2&#039;&#039;&#039;. == Date de ieşire == Programul afișează pe ecran numărul &#039;&#039;&#039;numere_prime&#039;&#039;&#039;, reprezentând numărul de numere prime din intervalul închis determinat de &#039;&#039;&#039;numar1&#039;&#039;&#039;...</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=0044_-_Prime_Interval&amp;diff=3464&amp;oldid=prev"/>
		<updated>2023-04-11T15:19:23Z</updated>

		<summary type="html">&lt;p&gt;Pagină nouă: == Cerinţa == Să se scrie un program care citește două numere naturale &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039; și determină câte numere prime sunt în intervalul închis determinat de &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039;. == Date de intrare == Programul citește de la tastatură numerele &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039;. == Date de ieşire == Programul afișează pe ecran numărul &amp;#039;&amp;#039;&amp;#039;numere_prime&amp;#039;&amp;#039;&amp;#039;, reprezentând numărul de numere prime din intervalul închis determinat de &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039;...&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;
Să se scrie un program care citește două numere naturale &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039; și determină câte numere prime sunt în intervalul închis determinat de &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Date de intrare ==&lt;br /&gt;
Programul citește de la tastatură numerele &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Date de ieşire ==&lt;br /&gt;
Programul afișează pe ecran numărul &amp;#039;&amp;#039;&amp;#039;numere_prime&amp;#039;&amp;#039;&amp;#039;, reprezentând numărul de numere prime din intervalul închis determinat de &amp;#039;&amp;#039;&amp;#039;numar1&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;numar2&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Restricții și precizări ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;numar1, numar2 &amp;amp;isin; &amp;amp;Nu;&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;0 &amp;lt; numar1, numar2 &amp;lt; 100.000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* numerele citite nu respectă obligatoriu relația &amp;#039;&amp;#039;&amp;#039;numar1 ≤ numar2&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* un număr natural este &amp;#039;&amp;#039;&amp;#039;prim&amp;#039;&amp;#039;&amp;#039; dacă are exact doi divizori distincți: &amp;#039;&amp;#039;&amp;#039;1&amp;#039;&amp;#039;&amp;#039; și el însuși.&lt;br /&gt;
== Exemplu1 ==&lt;br /&gt;
; Intrare&lt;br /&gt;
: 10 20&lt;br /&gt;
; Ieșire&lt;br /&gt;
: Datele de intrare corespund restricțiilor impuse.&lt;br /&gt;
: 4&lt;br /&gt;
== Explicație ==&lt;br /&gt;
În intervalul &amp;#039;&amp;#039;&amp;#039;[10,20]&amp;#039;&amp;#039;&amp;#039; sunt &amp;#039;&amp;#039;&amp;#039;4&amp;#039;&amp;#039;&amp;#039; numere prime: &amp;#039;&amp;#039;&amp;#039;11&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;13&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;17&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;19&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Exemplu2 ==&lt;br /&gt;
; Intrare&lt;br /&gt;
: 5 17&lt;br /&gt;
; Ieșire&lt;br /&gt;
: Datele de intrare corespund restricțiilor impuse.&lt;br /&gt;
: 5&lt;br /&gt;
== Explicație ==&lt;br /&gt;
În intervalul &amp;#039;&amp;#039;&amp;#039;[5,17]&amp;#039;&amp;#039;&amp;#039; sunt &amp;#039;&amp;#039;&amp;#039;5&amp;#039;&amp;#039;&amp;#039; numere prime: &amp;#039;&amp;#039;&amp;#039;5&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;7&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;11&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;13&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;17&amp;#039;&amp;#039;&amp;#039;.&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(numar1, numar2):&lt;br /&gt;
    flag = False&lt;br /&gt;
    if 0 &amp;lt; int(numar1) &amp;lt; 100_000 and 0 &amp;lt; int(numar2) &amp;lt; 100_000:&lt;br /&gt;
         flag = True&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_prime(numar1, numar2):&lt;br /&gt;
    if numar1 &amp;gt; numar2:&lt;br /&gt;
        numar1, numar2 = numar2, numar1&lt;br /&gt;
    numere_prime = 0&lt;br /&gt;
    for numar in range(numar1, numar2+1):&lt;br /&gt;
        if verif_prim(numar):&lt;br /&gt;
            numere_prime += 1&lt;br /&gt;
    print(numere_prime)&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
if __name__ == &amp;#039;__main__&amp;#039;:&lt;br /&gt;
    numar1, numar2 = input().split()&lt;br /&gt;
    if validare_date(numar1, numar2):&lt;br /&gt;
        print(&amp;quot;\nDatele de intrare corespund restrictiilor impuse.\n&amp;quot;)&lt;br /&gt;
        numarare_prime(int(numar1), int(numar2))&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>