{"id":25352,"date":"2015-08-23T11:07:19","date_gmt":"2015-08-23T08:07:19","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=25352"},"modified":"2015-08-23T11:07:43","modified_gmt":"2015-08-23T08:07:43","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-6","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=25352","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 5."},"content":{"rendered":"<p><strong>3-085.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/vychislit na otrezke [a;b] s shagom h znachenie funktsii F(x)=sin(1\/x)+2<\/p>\n<p>#include &lt;conio.h&gt;<br \/>\n#include &lt;math.h&gt;<br \/>\n#include &lt;stdio.h&gt;<br \/>\nvoid main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfloat a,b,h,x;<br \/>\nprintf(&#171;Vvedite granitsy otrezka [a;b] i znachenie shaga h: &#171;);<br \/>\nscanf(&#171;%f%f%f&#187;,&amp;a,&amp;b,&amp;h);<br \/>\nfor(x=a;x&lt;=b;x+=h)<br \/>\nprintf(&#171;\\n %5.2f | %-.4f&#187;,x,sin(1\/x)+2);<br \/>\ngetch();<br \/>\n}<!--more--><br \/>\n<strong>3-093.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/vychislit&#8217; funktsiyu f(x)=2*cos(x)-1 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 x,a,b,h;<br \/>\nprintf(&#171;\\tf(x)=2*cos(x)-1\\nVvedite granitsy otrezka [a;b] i shag h: &#171;);<br \/>\nscanf(&#171;%f%f%f&#187;,&amp;a,&amp;b,&amp;h);<br \/>\nprintf(&#187; x | f(x) |\\n&#8212;&#8212;-+&#8212;&#8212;&#8212;&#8212;|\\n&#187;);<br \/>\nx=a;<br \/>\nwhile(x&lt;=b)<br \/>\n{<br \/>\nprintf(&#187; %5.2f | %10.4f |\\n&#187;,x,2*cos(x)-1);<br \/>\nx+=h;<br \/>\n}<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-099.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/vychislit&#8217; na otrezke [a;b] s shagom h funktsiyu f(x)=x-sinx<\/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 \/>\nprintf(&#171;\\tf(x)=x-sinx\\nVvedite granitsy otrezka [a;b] i shag izmeneneniya argumenta: &#171;);<br \/>\nfloat a,b,h,x;<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;-|\\n&#187;);<br \/>\nwhile(x&lt;=b)<br \/>\n{<br \/>\nprintf(&#187; %5.2f | %8.4f |\\n&#187;,x,x-sin(x));<br \/>\nx+=h;<br \/>\n}<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-100.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti kolichestvo tsifr v vved`nnom s klaviatury chisle<\/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,k=0;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nwhile(n)<br \/>\n{<br \/>\nn\/=10;<br \/>\nk++;<br \/>\n}<br \/>\nprintf(&#171;V etom chisle %u tsifr&#187;,k);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-101.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/pomenyat&#8217; v chisle pervuyu i poslednyuyu tsifru mestami<\/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,i,last,first;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nlast=n%10;<br \/>\nunsigned m=n,k=0;<br \/>\ndo<br \/>\n{<br \/>\nk++;<br \/>\nfirst=m%10;;<br \/>\nm\/=10;<br \/>\n}<br \/>\nwhile(m);<br \/>\nm=1;<br \/>\nfor(i=1;i&lt;k;i++)<br \/>\nm=m*10;<br \/>\nn=(n%m\/10)*10+first+last*m;<br \/>\nprintf(&#171;Rezul&#8217;tat: %u&#187;,n);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-102.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/chitaetsya li chislo N odinakovo sprava nalevo i sleva napravo<\/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;<br \/>\nprintf(&#171;Vvedite tseloe polozhitel&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nunsigned m=n,p=0;<br \/>\nwhile(m)<br \/>\n{<br \/>\np=10*p+m%10;<br \/>\nm\/=10;<br \/>\n}<br \/>\nif(p==n)<br \/>\nprintf(&#171;Otvet: da&#187;);<br \/>\nelse<br \/>\nprintf(&#171;Otvet: net&#187;);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-106.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/proverit&#8217;, budet li tsifra M vhodit&#8217; v desyatichnuyu zapis&#8217; chisla N<\/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 M,N,n,f=0;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo i nekotoruyu tsifru: &#171;);<br \/>\nscanf(&#171;%u%u&#187;,&amp;N,&amp;M);<br \/>\nn=N;<br \/>\nwhile(n)<br \/>\n{<br \/>\nif(n%10==M)<br \/>\nf++;<br \/>\nn\/=10;<br \/>\n}<br \/>\nif(f)<br \/>\nprintf(&#171;Tsifra %u vhodit v zapis&#8217; chisla %u&#187;,M,N);<br \/>\nelse<br \/>\nprintf(&#171;Tsifra %u ne vhodit v zapis&#8217; chisla %u&#187;,M,N);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-109.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti vse deliteli 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,i;<br \/>\nprintf(&#171;Vvedite polozhitel&#8217;noe tseloe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nprintf(&#171;Deliteli chisla %u:\\n&#187;,n);<br \/>\nfor(i=1;i&lt;=n\/2;i++)<br \/>\nif(n%i==0)<br \/>\nprintf(&#171;%5u |&#187;,i);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-118.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti summu pervoj i poslednej tsifr natural&#8217;nogo chisla N<\/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,s,k;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\ns=n%10;<br \/>\nwhile(n)<br \/>\n{<br \/>\nk=n%10;<br \/>\nn\/=10;<br \/>\n}<br \/>\ns+=k;<br \/>\nprintf(&#171;Summa pervoj i poslednej tsifr ravna %u&#187;,s);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-121.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/dopisat&#8217; v nachalo i konets natural&#8217;nogo chisla N tsifru K<\/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,i,m,k;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo i lyubuyu tsifru: &#171;);<br \/>\nscanf(&#171;%u%u&#187;,&amp;n,&amp;k);<br \/>\nm=n;<br \/>\nfor(i=1;m;i*=10)<br \/>\nm\/=10;<br \/>\nn=(n+i*k)*10+k;<br \/>\nprintf(&#171;Rezul&#8217;tat: %u&#187;,n);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-127.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti na otrezke [n;m] chislo s maksimal&#8217;nym kolichestvom delitelej<\/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,m,x,max,i,j,k;<br \/>\nprintf(&#171;Vvedite granitsy otrezka [n;m]: &#171;);<br \/>\nscanf(&#171;%u%u&#187;,&amp;n,&amp;m);<br \/>\nfor(i=n;i&lt;=m;i++)<br \/>\n{<br \/>\nk=0;<br \/>\nfor(j=2;j&lt;i\/2;j++)<br \/>\nif(i%j==0)<br \/>\nk++;<br \/>\nif(k&gt;max)<br \/>\n{<br \/>\nmax=k;<br \/>\nx=i;<br \/>\n}<br \/>\n}<br \/>\nprintf(&#171;Rezul&#8217;tat: %u (delitelej &#8212; %u)&#187;,x,max);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-135.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti kolichestvo chisel, ne prevyshayuschih N i ne delyaschihsya na 2,3 i 5<\/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,i,k=0;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nprintf(&#171;Rezul&#8217;tat:\\n&#187;);<br \/>\nfor(i=1;i&lt;=n;i++)<br \/>\nif(i%2&amp;&amp;i%3&amp;&amp;i%5)<br \/>\nk++;<br \/>\nif(k)<br \/>\nprintf(&#171;Najdeno %u takih chisel&#187;,k);<br \/>\nelse<br \/>\nprintf(&#171;Takie chisla ne najdeny&#187;);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-140.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/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}<br \/>\n<strong>3-141.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/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]&lt;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}<br \/>\n<strong>3-143.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/budut li odinakovymi pervaya i poslednyaya tsifry natural&#8217;nogo chisla?<\/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,k;<br \/>\nprintf(&#171;Vvedite natural&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nfor(m=n;m;m\/=10)<br \/>\nk=m%10;<br \/>\nif(k==n%10)<br \/>\nprintf(&#171;Pervaya i poslednyaya tsifry ravny&#187;);<br \/>\nelse<br \/>\nprintf(&#171;Pervaya i poslednyaya tsifry ne ravny&#187;);<br \/>\ngetch();<br \/>\n}<br \/>\n<strong>3-145.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/yavlyaetsya li chislo N palindromom<\/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;<br \/>\nprintf(&#171;\\tPalindrom\\nVvedite tseloe polozhitel&#8217;noe chislo: &#171;);<br \/>\nscanf(&#171;%u&#187;,&amp;n);<br \/>\nunsigned m=n,p=0;<br \/>\nwhile(m)<br \/>\n{<br \/>\np=10*p+m%10;<br \/>\nm\/=10;<br \/>\n}<br \/>\nif (p==n)<br \/>\nprintf(&#171;Eto chislo yavlyaetsya palindromom&#187;);<br \/>\nelse<br \/>\nprintf(&#171;Eto chislo ne yavlyaetsya palindromom&#187;);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-146.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti tselye chisla, pri vozvedenii v kvadrat dayuschie palindromy<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nint palindrom(unsigned n)<\/p>\n<p>{<br \/>\nunsigned m=n,p=0;<br \/>\nwhile(m)<br \/>\n{<br \/>\np=p*10+m%10;<br \/>\nm\/=10;<br \/>\n}<br \/>\nif (p==n)<br \/>\nreturn 1;<br \/>\nelse<br \/>\nreturn 0;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfor(unsigned i=1;i&lt;65536;i++)<br \/>\nif(palindrom (i*i))<br \/>\nprintf(&#171;%6u &gt; %-6u\\n&#187;,i,i*i);<br \/>\ngetch();<br \/>\n}<\/p>\n<p><strong>3-147.cpp<\/strong><br \/>\n&lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt;<br \/>\n\/\/najti tselye chisla-palindromy, pri vozvedenii v kvadrat takzhe dayuschie palindromy<\/p>\n<p>#include &lt;stdio.h&gt;<br \/>\n#include &lt;conio.h&gt;<br \/>\nint palindrom(unsigned n)<\/p>\n<p>{<br \/>\nunsigned m=n,p=0;<br \/>\nwhile(m)<br \/>\n{<br \/>\np=p*10+m%10;<br \/>\nm\/=10;<br \/>\n}<br \/>\nif (p==n)<br \/>\nreturn 1;<br \/>\nelse<br \/>\nreturn 0;<br \/>\n}<\/p>\n<p>void main()<\/p>\n<p>{<br \/>\nclrscr();<br \/>\nfor(unsigned i=1;i&lt;65536;i++)<br \/>\nif(palindrom(i)&amp;&amp;palindrom(i*i))<br \/>\nprintf(&#171;%6u &gt; %-6u\\n&#187;,i,i*i);<br \/>\ngetch();<br \/>\n}<\/p>\n","protected":false},"excerpt":{"rendered":"<p>3-085.cpp &lt;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-&gt; \/\/vychislit na otrezke [a;b] s shagom h znachenie funktsii F(x)=sin(1\/x)+2 #include &lt;conio.h&gt; #include &lt;math.h&gt; #include &lt;stdio.h&gt; void main() { clrscr(); float a,b,h,x; printf(&#171;Vvedite granitsy otrezka [a;b] i znachenie shaga h: &#171;); scanf(&#171;%f%f%f&#187;,&amp;a,&amp;b,&amp;h); for(x=a;x&lt;=b;x+=h) printf(&#171;\\n %5.2f | %-.4f&#187;,x,sin(1\/x)+2); getch(); }<\/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\/25352"}],"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=25352"}],"version-history":[{"count":2,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25352\/revisions"}],"predecessor-version":[{"id":25354,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25352\/revisions\/25354"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=25352"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=25352"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=25352"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}