<?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=2276_-_cb</id>
	<title>2276 - cb - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://wiki.universitas.ro/index.php?action=history&amp;feed=atom&amp;title=2276_-_cb"/>
	<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=2276_-_cb&amp;action=history"/>
	<updated>2026-06-17T09:09:04Z</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=2276_-_cb&amp;diff=9036&amp;oldid=prev</id>
		<title>Brianna Waltner: Pagină nouă: Se consideră un șir &#039;&#039;&#039;a[1]&#039;&#039;&#039;, &#039;&#039;&#039;a[2]&#039;&#039;&#039;, …, &#039;&#039;&#039;a[n]&#039;&#039;&#039; de numere naturale. Se dau și &#039;&#039;&#039;T&#039;&#039;&#039; intervale închise de forma &#039;&#039;&#039;[x, y]&#039;&#039;&#039;, cu &#039;&#039;&#039;x ≤ y&#039;&#039;&#039;. == Cerinţa == Pentru fiecare din cele &#039;&#039;&#039;T&#039;&#039;&#039; intervale de forma &#039;&#039;&#039;[x, y]&#039;&#039;&#039; trebuie să răspundeți la întrebarea: câte numere din șir aparțin intervalului &#039;&#039;&#039;[x, y]&#039;&#039;&#039;? == Date de intrare == Programul citește de la tastatură numerele &#039;&#039;&#039;n&#039;&#039;&#039; și &#039;&#039;&#039;T&#039;&#039;&#039;, apoi &#039;&#039;&#039;n&#039;&#039;&#039; numere naturale, separate prin spații,...</title>
		<link rel="alternate" type="text/html" href="https://wiki.universitas.ro/index.php?title=2276_-_cb&amp;diff=9036&amp;oldid=prev"/>
		<updated>2024-01-04T22:41:42Z</updated>

		<summary type="html">&lt;p&gt;Pagină nouă: Se consideră un șir &amp;#039;&amp;#039;&amp;#039;a[1]&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;a[2]&amp;#039;&amp;#039;&amp;#039;, …, &amp;#039;&amp;#039;&amp;#039;a[n]&amp;#039;&amp;#039;&amp;#039; de numere naturale. Se dau și &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; intervale închise de forma &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039;, cu &amp;#039;&amp;#039;&amp;#039;x ≤ y&amp;#039;&amp;#039;&amp;#039;. == Cerinţa == Pentru fiecare din cele &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; intervale de forma &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039; trebuie să răspundeți la întrebarea: câte numere din șir aparțin intervalului &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039;? == Date de intrare == Programul citește de la tastatură numerele &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;, apoi &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039; numere naturale, separate prin spații,...&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Se consideră un șir &amp;#039;&amp;#039;&amp;#039;a[1]&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;a[2]&amp;#039;&amp;#039;&amp;#039;, …, &amp;#039;&amp;#039;&amp;#039;a[n]&amp;#039;&amp;#039;&amp;#039; de numere naturale. Se dau și &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; intervale închise de forma &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039;, cu &amp;#039;&amp;#039;&amp;#039;x ≤ y&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Cerinţa ==&lt;br /&gt;
Pentru fiecare din cele &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; intervale de forma &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039; trebuie să răspundeți la întrebarea: câte numere din șir aparțin intervalului &amp;#039;&amp;#039;&amp;#039;[x, y]&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;n&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039;, apoi &amp;#039;&amp;#039;&amp;#039;n&amp;#039;&amp;#039;&amp;#039; numere naturale, separate prin spații, &amp;#039;&amp;#039;&amp;#039;a[1]&amp;#039;&amp;#039;&amp;#039;, &amp;#039;&amp;#039;&amp;#039;a[2]&amp;#039;&amp;#039;&amp;#039;, …, &amp;#039;&amp;#039;&amp;#039;a[n]&amp;#039;&amp;#039;&amp;#039;. Pe următoarele &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; linii se află câte două numere naturale &amp;#039;&amp;#039;&amp;#039;x&amp;#039;&amp;#039;&amp;#039; și &amp;#039;&amp;#039;&amp;#039;y&amp;#039;&amp;#039;&amp;#039; reprezentând un interval &amp;#039;&amp;#039;&amp;#039;[x, y]&amp;#039;&amp;#039;&amp;#039;.&lt;br /&gt;
== Date de ieșire ==&lt;br /&gt;
Programul va afișa pe ecran &amp;#039;&amp;#039;&amp;#039;T&amp;#039;&amp;#039;&amp;#039; linii. Pe fiecare linie &amp;#039;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;#039; (&amp;#039;&amp;#039;&amp;#039;i=1..T&amp;#039;&amp;#039;&amp;#039;) se va afla un singur număr natural reprezentând răspunsul la a &amp;#039;&amp;#039;&amp;#039;i&amp;#039;&amp;#039;&amp;#039;-a întrebare.&lt;br /&gt;
== Restricţii şi precizări ==&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;1 &amp;amp;les; n, T &amp;amp;les; 200 000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;0 &amp;amp;les; a[i] &amp;amp;les; 2 000 000 000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
* &amp;#039;&amp;#039;&amp;#039;0 &amp;amp;les; x &amp;amp;les; y &amp;amp;les; 2 000 000 000&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
== Exemplul 1 ==&lt;br /&gt;
;Intrare&lt;br /&gt;
 9 7&lt;br /&gt;
 6 1 3 5 3 3 9 20 9&lt;br /&gt;
 4 10&lt;br /&gt;
 0 100&lt;br /&gt;
 0 1&lt;br /&gt;
 500 506&lt;br /&gt;
 3 3&lt;br /&gt;
 10 18&lt;br /&gt;
 3 9&lt;br /&gt;
;Iesire&lt;br /&gt;
 Datele de intrare corespund restrictiilor impuse&lt;br /&gt;
 4&lt;br /&gt;
 9&lt;br /&gt;
 1&lt;br /&gt;
 0&lt;br /&gt;
 3&lt;br /&gt;
 0&lt;br /&gt;
 7&lt;br /&gt;
== Exemplul 2 ==&lt;br /&gt;
;Intrare&lt;br /&gt;
 210000 5&lt;br /&gt;
 16 17 20 24 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 105&lt;br /&gt;
 4 10&lt;br /&gt;
 0 100&lt;br /&gt;
 0 1&lt;br /&gt;
 500 506&lt;br /&gt;
 3 3&lt;br /&gt;
 10 18&lt;br /&gt;
 3 9&lt;br /&gt;
;Iesire&lt;br /&gt;
 Datele de intrare nu corespund restrictiilor impuse&lt;br /&gt;
== Rezolvare ==&lt;br /&gt;
&amp;lt;syntaxhighlight lang=&amp;quot;python&amp;quot; line&amp;gt;&lt;br /&gt;
from bisect import bisect_left, bisect_right&lt;br /&gt;
&lt;br /&gt;
n, T = map(int, input().strip().split())&lt;br /&gt;
if not (1 &amp;lt;= n &amp;lt;= 200000 and 1 &amp;lt;= T &amp;lt;= 200000):&lt;br /&gt;
    print(&amp;quot;Datele de intrare nu corespund restrictiilor impuse&amp;quot;)&lt;br /&gt;
    exit(1)&lt;br /&gt;
students = sorted(list(map(int, input().split())))&lt;br /&gt;
if any(s &amp;lt; 0 or s &amp;gt; 2000000000 for s in students):&lt;br /&gt;
    print(&amp;quot;Datele de intrare nu corespund restrictiilor impuse&amp;quot;)&lt;br /&gt;
    exit(1)&lt;br /&gt;
intervals = [list(map(int, input().split())) for _ in range(T)]&lt;br /&gt;
if any(x &amp;lt; 0 or y &amp;lt; x or y &amp;gt; 2000000000 for x, y in intervals):&lt;br /&gt;
    print(&amp;quot;Datele de intrare nu corespund restrictiilor impuse&amp;quot;)&lt;br /&gt;
    exit(1)&lt;br /&gt;
&lt;br /&gt;
print(&amp;quot;Datele de intrare corespund restrictiilor impuse&amp;quot;)&lt;br /&gt;
&lt;br /&gt;
for x, y in intervals:&lt;br /&gt;
    start = bisect_left(students, x)&lt;br /&gt;
    end = bisect_right(students, y)&lt;br /&gt;
    print(end - start)&lt;br /&gt;
&amp;lt;/syntaxhighlight&amp;gt;&lt;/div&gt;</summary>
		<author><name>Brianna Waltner</name></author>
	</entry>
</feed>