{"id":25346,"date":"2015-08-23T10:44:08","date_gmt":"2015-08-23T07:44:08","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=25346"},"modified":"2015-08-23T11:08:13","modified_gmt":"2015-08-23T08:08:13","slug":"%d0%b7%d0%b0%d0%b4%d0%b0%d1%87%d0%b8-%d1%81-%d0%bf%d0%b5%d1%80%d0%b2%d1%8b%d0%b9-%d0%ba%d1%83%d1%80%d1%81-%d0%be%d1%82%d0%b2%d0%b5%d1%82%d1%8b-%d1%86%d0%b8%d0%ba%d0%bb%d0%b8%d1%87%d0%b5%d1%81-3","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=25346","title":{"rendered":"\u0417\u0430\u0434\u0430\u0447\u0438 \u0421++ (\u043f\u0435\u0440\u0432\u044b\u0439 \u043a\u0443\u0440\u0441) &#8212; \u043e\u0442\u0432\u0435\u0442\u044b. \u0426\u0438\u043a\u043b\u0438\u0447\u0435\u0441\u043a\u0438\u0435 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u044b. \u0427\u0430\u0441\u0442\u044c 3."},"content":{"rendered":"<p><strong>3-103.cpp<\/strong><\/p>\n<p>\/\/najti v diapazone [1;n] chislo s minimal&#8217;noj summoj delitelej<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n,i,j,chislo,sum,min=4294967295;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<\/p>\n<p><!--more--><br \/>\nfor(i=6;i&lt;=n;i++)<br \/>\n{<br \/>\nsum=0;<br \/>\nfor (j=2;j&lt;=n\/2+1;j++)<br \/>\nif (i%j==0)<br \/>\nsum+=j;<br \/>\nif (sum&lt;min)<br \/>\n{<br \/>\nchislo=i;<br \/>\nmin=sum;<br \/>\n}<br \/>\n}<br \/>\nprintf(&#171;V diapazone [1;%u] %u &#8212; chislo s minimal&#8217;noj summoj delitelej, ravnoj %u (edinitsa i samo chislo ne uchityvayutsya)&#187;,n,chislo,min);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-027.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; summu ryada S<br \/>\n\/\/ x3 x5 x7 x9 x11 x13<br \/>\n\/\/ S = x &#8212; &#8212; + &#8212; &#8212; &#8212; + &#8212; &#8212; &#8212; + &#8212;<br \/>\n\/\/ 3! 5! 7! 9! 11! 13!<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat s=0,x,f1=1,f2=6;<br \/>\nprintf(&#187; x3 x5 x7 x9 x11 x13\\n S = x &#8212; &#8212; + &#8212; &#8212; &#8212; + &#8212; &#8212; &#8212; + &#8212;\\n 3! 5! 7! 9! 11! 13!\\nVvedite X: &#171;);<br \/>\nscanf(&#171;%f&#187;,&amp;x);<br \/>\nfor(int i=0;i&lt;7;i++)<br \/>\n{<br \/>\ns+=(f1\/f2);<br \/>\nf1*=(x*x);<br \/>\nf2*=(i+1)*(i+2);<br \/>\n}<br \/>\nprintf(&#187; S = %.4f&#187;,s);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-119.cpp<\/strong><\/p>\n<p>\/\/proverit&#8217;, est&#8217; li v chislah N i N odinakovye tsifry<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;stdio.h&gt;<\/p>\n<p>int F(unsigned k,unsigned n)<\/p>\n<p>{<br \/>\nunsigned i=0,m=n;<br \/>\nwhile(m)<br \/>\n{<br \/>\nif(k==m%10)<br \/>\ni++;<br \/>\nm\/=10;<br \/>\n}<br \/>\nreturn i;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned N,M,f=1;<br \/>\nprintf(&#171;Vvedite dva natural&#8217;nyh chisla: &#171;);<br \/>\nscanf(&#171;%u%u&#187;,&amp;M,&amp;N);<br \/>\nwhile(M&amp;&amp;f)<br \/>\n{<br \/>\nif(F(M%10,N))<br \/>\nf=0;<br \/>\nM\/=10;<br \/>\n}<br \/>\nif(f)<br \/>\nprintf(&#171;V zapisi etih chisel net odinakovyh tsifr&#187;);<br \/>\nelse<br \/>\nprintf(&#171;V zapisi etih chisel est&#8217; odinakovye tsifry&#187;);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-105.cpp<\/strong><\/p>\n<p>\/\/proverit&#8217;, budut li razlichnymi vse tsifry natural&#8217;nogo chisla N<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;stdio.h&gt;<\/p>\n<p>int F(unsigned k,unsigned n)<\/p>\n<p>{<br \/>\nunsigned i=0,m=n;<br \/>\nwhile(m)<br \/>\n{<br \/>\nif(k==m%10)<br \/>\ni++;<br \/>\nm\/=10;<br \/>\n}<br \/>\nreturn i;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned N,M,f=1;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;N);<br \/>\nM=N;<br \/>\nwhile(M)<br \/>\n{<br \/>\nif(F(M%10,N)!=1)<br \/>\nf=0;<br \/>\nM\/=10;<br \/>\n}<br \/>\nif(f)<br \/>\nprintf(&#171;Vse tsifry etogo chisla razlichny&#187;);<br \/>\nelse<br \/>\nprintf(&#171;Tsifry etogo chisla ne razlichny&#187;);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-088.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; f(x) na otrezke [a;b] s shagom h<br \/>\n\/\/ x<br \/>\n\/\/ f(x) = &#8212;&#8212;-<br \/>\n\/\/ cos x<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\n#include &lt;math.h&gt;<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat a,b,h,x;<br \/>\nprintf(&#187; x\\n f(x) = &#8212;&#8212;-\\n cos x\\nVvedite kontsy otrezka [a;b]: &#171;);<br \/>\nscanf(&#171;%f%f&#187;,&amp;a,&amp;b);<br \/>\nprintf(&#171;Vvedite shag izmeneniya argumenta: &#171;);<br \/>\nscanf(&#171;%f&#187;,&amp;h);<br \/>\nprintf(&#187; x | f(x) |\\n&#8212;&#8212;-+&#8212;&#8212;&#8212;&#8212;|\\n&#187;);<br \/>\nfor(x=a;x&lt;=b;x+=h)<br \/>\nprintf(&#187; %5.2f | %10.4f |\\n&#187;,x,x\/cos(x));<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-117.cpp<\/strong><\/p>\n<p>\/\/najti na otrezke [a;b] chislo s naimen&#8217;shim kolichestvom delitelej<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;stdio.h&gt;<br \/>\n#include &lt;values.h&gt;<\/p>\n<p>unsigned KD(unsigned n)<\/p>\n<p>{<br \/>\nunsigned i,k=0;<br \/>\nfor(i=1;i&lt;n;i++)<br \/>\nif(n%i==0)<br \/>\nk++;<br \/>\nreturn k;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned a,b,n,i,min=MAXINT,X;<br \/>\nprintf(&#171;Vvedite granitsy otrezka [a;b]: &#171;);<br \/>\nscanf(&#171;%u%u&#187;,&amp;a,&amp;b);<br \/>\nfor(i=a;i&lt;=b;i++)<br \/>\nif(KD(i)&lt;min)<br \/>\n{<br \/>\nmin=KD(i);<br \/>\nX=i;<br \/>\n}<br \/>\nprintf(&#171;Na etom otrezke naimenshee&#8217; chislo delitelej u chisla %u&#187;,X);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-091.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; funktsiyu f(x) na otrezke [a;b] s shagom h<br \/>\n\/\/ f(x) = 2*cos(x)*sqrt(x)+0.5<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\n#include &lt;math.h&gt;<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat a,b,x,h;<br \/>\nprintf(&#187; f(x) = 2*cos(x)*sqrt(x)+0.5\\nVvedite granitsy otrezka [a;b]: &#171;);<br \/>\nscanf(&#171;%f%f&#187;,&amp;a,&amp;b);<br \/>\nprintf(&#171;Vvedite shag izmeneniya argumenta x: &#171;);<br \/>\nscanf(&#171;%f&#187;,&amp;h);<br \/>\nprintf(&#187; x | f(x) |\\n&#8212;&#8212;&#8212;+&#8212;&#8212;&#8212;&#8212;&#8212;|\\n&#187;);<br \/>\nfor(x=a;x&lt;=b;x+=h)<br \/>\nprintf(&#187; %7.2f | %-12.5f |\\n&#187;,x,2*cos(x)*sqrt(x)+0.5);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-128.cpp<\/strong><\/p>\n<p>\/\/najti vse prostye chisla na otrezke [2;n]<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nint simple(unsigned m)<\/p>\n<p>{<br \/>\nunsigned j,f=1;<br \/>\nfor(j=2;j&lt;m;j++)<br \/>\nif(m%j==0)<br \/>\n{<br \/>\nf=0;<br \/>\nbreak;<br \/>\n}<br \/>\nif(f)<br \/>\nreturn 1;<br \/>\nelse<br \/>\nreturn 0;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n,i;<br \/>\nprintf(&#171;Vvedite tseloe chislo, bol&#8217;shee dvuh&gt; &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nprintf(&#171;Prostye chisla v diapazone [2;%u]:\\n&#187;,n);<br \/>\nfor(i=3;i&lt;=n;i++)<br \/>\nif(simple(i))<br \/>\nprintf(&#171;| %-u\\n&#187;,i);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-010.cpp<\/strong><\/p>\n<p>\/\/posle kazhdogo vved`nnogo s klaviatury chisla vyvesti na ekran srednee vseh vved`nnyh chisel<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat n,sred;<br \/>\nunsigned i,u;<br \/>\nprintf(&#171;Vvedite kolichestvo chisel: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;u);<br \/>\nprintf(&#171;Vvedite %u chisel:\\n&#187;,u);<br \/>\nfor (i=1;i&lt;=u;i++)<br \/>\n{<br \/>\nprintf(&#171;N%u&gt; &#171;,i);<br \/>\nscanf(&#171;%f&#187;,&amp;n);<br \/>\nsred=(sred+n)\/i;<br \/>\nprintf(&#171;Srednee uzhe vved`nnyh chisel: %f.3\\n&#187;,sred);<br \/>\n}<br \/>\nprintf(&#171;Nazmite lyubuyu klavishu&#8230;&#187;);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-036.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; P pri natural&#8217;nom N<br \/>\n\/\/ 1 1 1<br \/>\n\/\/ P = (1 &#8212; -)*(1 &#8212; -)*&#8230;(1 &#8212; &#8212;-)<br \/>\n\/\/ 2 4 2n<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n,i;<br \/>\nfloat p=1.0;<br \/>\nprintf(&#187; 1 1 1\\n P = (1 &#8212; -)*(1 &#8212; -)*&#8230;(1 &#8212; &#8212;-)\\n 2 4 2n\\nVvedite natural&#8217;noe chislo N: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nfor(i=1;i&lt;=n;i++)<br \/>\np*=(1-1.0\/(2*n));<br \/>\nprintf(&#187; P=%.4f&#187;,p);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-108.cpp<\/strong><\/p>\n<p>\/\/pomenyat&#8217; v natural&#8217;nom chisle poryadok sledovaniya tsifr na obratnuj, esli eto vozmozhno<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;stdio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n,m;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nif(n&gt;5927694924)<br \/>\nprintf(&#171;Pomenyat&#8217; poryadok sledovaniya tsifr v etom chisle\\nnevozmozhno v silu perepolneniya&#187;);<br \/>\nelse<br \/>\n{<br \/>\nm=n;<br \/>\nn=0;<br \/>\nwhile(m)<br \/>\n{<br \/>\nn=n*10+m%10;<br \/>\nm\/=10;<br \/>\n}<br \/>\nprintf(&#171;V obratnom poryadke: %u&#187;,n);<br \/>\n}<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-095.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; f(x)=sqrt(x)*pow(cos(x),2) na otrezke [a;b] s shagom h<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\n#include &lt;math.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat a,b,h,x;<br \/>\nprintf(&#171;\\tf(x)=sqrt(x)*pow(cos(x),2)\\nVvedite granitsy intervala [a;b] i shag izmeneniya argumenta: &#171;);<br \/>\nscanf(&#171;%f%f%f&#187;,&amp;a,&amp;b,&amp;h);<br \/>\nx=a;<br \/>\nprintf(&#187; x | f(x) |\\n&#8212;&#8212;-+&#8212;&#8212;&#8212;&#8212;&#8212;|\\n&#187;);<br \/>\nwhile(x&lt;=b)<br \/>\n{<br \/>\nprintf(&#187; %5.2f | %12.4f |\\n&#187;,x,sqrt(x)*pow(cos(x),2));<br \/>\nx+=h;<br \/>\n}<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-149.cpp<\/strong><\/p>\n<p>\/\/najti proizvedenie pervoj i poslednej tsifry natural&#8217;nogo chisla N<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n,first,last;<br \/>\nprintf(&#171;Vvedite tseloe polozhitel&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nif (n&lt;10)<br \/>\nprintf(&#171;Chislo dolzhno byt&#8217; hotya by dvuznachnym&#187;);<br \/>\nelse<br \/>\n{<br \/>\nlast=n%10;<br \/>\nwhile (n!=0)<br \/>\n{<br \/>\nif (n&gt;9)<br \/>\nfirst=n\/10;<br \/>\nn\/=10;<br \/>\n}<br \/>\n}<br \/>\nprintf(&#171;Proizvedenie pervoj i poslednej tsifr ravno %u&#187;,first*last);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-026.cpp<\/strong><\/p>\n<p>\/\/vychislit&#8217; proizvedenie ryada P pri natural&#8217;nom N<br \/>\n\/\/ 2 4 6 2n<br \/>\n\/\/ P = &#8212; * &#8212; * &#8212; * &#8230; * &#8212;&#8212;<br \/>\n\/\/ 3 5 7 2n+1<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned i,n;<br \/>\nfloat p=1;<br \/>\nprintf(&#187; 2 4 6 2n\\n P = &#8212; * &#8212; * &#8212; * &#8230; * &#8212;&#8212;\\n 3 5 7 2n+1\\nVvedite natural&#8217;noe N: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nfor(i=1;i&lt;=n;i++)<br \/>\np*=(2.0*i\/(2.0*i+1.0));<br \/>\nprintf(&#187; P=%.5f&#187;,p);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-116.cpp<\/strong><\/p>\n<p>\/\/perestavit&#8217; tsifry natural&#8217;nogo chisla taak, chtoby obrazovalos&#8217; minimal&#8217;no vozmozhnoe chislo<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;stdio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nunsigned n;<br \/>\nshort a[10],i,j,k,t;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nfor(k=0;n;k++)<br \/>\n{<br \/>\na[k]=n%10;<br \/>\nn\/=10;<br \/>\n}<br \/>\nfor(i=0;i&lt;k;i++)<br \/>\nfor(j=i+1;j&lt;k;j++)<br \/>\nif(a[i]&gt;a[j])<br \/>\n{<br \/>\nt=a[i];<br \/>\na[i]=a[j];<br \/>\na[j]=t;<br \/>\n}<br \/>\nfor(i=0;i&lt;k;i++)<br \/>\nprintf(&#171;%i&#187;,a[i]);<br \/>\ngetch();<br \/>\n}<\/p>\n","protected":false},"excerpt":{"rendered":"<p>3-103.cpp \/\/najti v diapazone [1;n] chislo s minimal&#8217;noj summoj delitelej #include &lt;stdio.h&gt; #include &lt;conio.h&gt; void main() { clrscr(); unsigned n,i,j,chislo,sum,min=4294967295; printf(&#171;Vvedite natural&#8217;noe chislo: &#171;); scanf(&#171;%u&#187;,&amp;n);<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[36],"tags":[],"_links":{"self":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25346"}],"collection":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=25346"}],"version-history":[{"count":2,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25346\/revisions"}],"predecessor-version":[{"id":25355,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25346\/revisions\/25355"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=25346"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=25346"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=25346"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}