{"id":23626,"date":"2012-11-28T16:25:38","date_gmt":"2012-11-28T13:25:38","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=23626"},"modified":"2012-11-28T16:25:38","modified_gmt":"2012-11-28T13:25:38","slug":"%d1%80%d0%b0%d0%b7%d0%b2%d0%b5%d1%82%d0%b2%d0%bb%d1%8f%d1%8e%d1%89%d0%b8%d0%b5%d1%81%d1%8f-%d0%b0%d0%bb%d0%b3%d0%be%d1%80%d0%b8%d1%82%d0%bc%d1%8b-%d1%87%d0%b0%d1%81%d1%82%d1%8c-2","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=23626","title":{"rendered":"\u0420\u0430\u0437\u0432\u0435\u0442\u0432\u043b\u044f\u044e\u0449\u0438\u0435\u0441\u044f \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c\u044b. \u0427\u0430\u0441\u0442\u044c 2."},"content":{"rendered":"<p>\/\/opredelit&#8217; rezul&#8217;tat gadaniya na romashke, vzyav kolihestvo lepestkov N za ishodnye dannye<\/p>\n<p>#include <conio.h><br \/>\n#include <stdio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n unsigned n;<br \/>\n printf(&#171;\\tGadanie na romashke\\nVvedite kolichestvo lepestkov: &#171;);<br \/>\n scanf(&#171;%u&#187;,&#038;n);<br \/>\n if(n%2==0)<br \/>\n\tprintf(&#171;Rezul&#8217;tat: &#171;&#187;ne lyubit&#187;&#187;&#187;);<br \/>\n else<br \/>\n \tprintf(&#171;Rezul&#8217;tat: &#171;&#187;lyubit&#187;&#187;&#187;);<br \/>\n getch();<br \/>\n}<br \/>\n<!--more--><\/p>\n<p>\/\/najti summu naibol&#8217;shego i naimen&#8217;shego iz tr`h chisel<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c,min,max;<br \/>\n printf(&#171;Vvedite tri chisla:&#187;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n if(a>b&#038;&#038;a>c) \/\/nahodim naibol&#8217;shee iz chisel<br \/>\n \tmax=a;<br \/>\n else<br \/>\n \tif(b>a&#038;&#038;b>c)<br \/>\n   \tmax=b;<br \/>\n   else<br \/>\n   \tmax=c;<br \/>\n if(a<b&#038;&#038;a<c) \/\/nahodim naimen'shee iz chisel\n \tmin=a;\n else\n \tif b<a&#038;&#038;b<c)\n   \tmin=b;\n   else\n   \tmin=c;\n printf(\"Summa naibol'shego i naimen'shego chisel ravna %.2f\",min+max);\n getch();\n}\n\n\n\n\/\/najti max{min(a,b),min(c,d)}\n\n#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c,d,minab,mincd,max;<br \/>\n printf(&#171;Vvedite chetyre chisla (a,b,c,d): &#171;);<br \/>\n scanf(&#171;%f%f%f%f&#187;,&#038;a,&#038;b,&#038;c,&#038;d);<br \/>\n if(a<b)\n \tminab=a;\n else\n \tminab=b;\n if(c<d)\n \tmincd=c;\n else\n \tmincd=d;\n if(minab>mincd)<br \/>\n   max=minab;<br \/>\n else<br \/>\n \tmax=mincd;<br \/>\n printf(&#171;max{min(a,b),min(c,d)}==%.2f&#187;,max);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/dany tri chisla a,b,c; opredelit&#8217;, kakoe iz nih ravno d<br \/>\n\/\/esil ni odno iz nih ne ravno d, najti max (d-a, d-b, d-c)<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c,d,m;<br \/>\n printf(&#171;Vvedite chisla a,b,c: &#171;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n printf(&#171;Vvedite chislo d: &#171;);<br \/>\n scanf(&#171;%f&#187;,&#038;d);<br \/>\n if(a==d)<br \/>\n \tprintf(&#171;a=d&#187;);<br \/>\n else<br \/>\n \tif(b==d)<br \/>\n   \tprintf(&#171;b=d&#187;);<br \/>\n   else<br \/>\n   \tif(c==d)<br \/>\n      \tprintf(&#171;c=d&#187;);<br \/>\n      else<br \/>\n         {<br \/>\n          printf(&#171;Ni odno iz chisel a,b,c ne ravno d&#187;);<br \/>\n          m=d-a;<br \/>\n          if(m<d-b&#038;&#038;d-c<d-b)\n          \tm=d-b;\n          else\n            if (m<d-c&#038;&#038;d-b<d-c)\n            \tm=d-c;\n          printf(\"\\nmax (d-a, d-b, d-c)=%f\",m);\n         }\n getch();\n}\n\n\n\n\n\/\/opredelit', budut li chetyre tochki vershinami parallelogramma\n\n#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float xa,xb,xc,xd,ya,yb,yc,yd,k1,k2;<br \/>\n printf(&#171;\\tParallelogramm\\nVvedite koordinaty chetyr`h tochek na ploskosti\\n A: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;xa,&#038;ya);<br \/>\n printf(&#187; B: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;xb,&#038;yb);<br \/>\n printf(&#187; C: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;xc,&#038;yc);<br \/>\n printf(&#187; D: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;xd,&#038;yd);<br \/>\n if((xa==xb&#038;&#038;ya==yb)||(xa==xc&#038;&#038;ya==yc)||(xa==xd&#038;&#038;ya==yd)||(xb==xc&#038;&#038;yb==yc)||(xb==xd&#038;&#038;yb==yd)||(xc==xd&#038;&#038;yc==yd))<br \/>\n \tprintf(&#171;Tochki ne dolzhny sovpadat'&#187;);<br \/>\n else<br \/>\n \t{<br \/>\n    if (xc-xa==0)<br \/>\n    \tk1=0;<br \/>\n    else<br \/>\n    \tk1=(yc-ya)\/(xc-xa);<br \/>\n    if (xd-xb==0)<br \/>\n \t   k2=0;<br \/>\n    else<br \/>\n \t   k2=(yd-yb)\/(xd-xb);<br \/>\n    if (k1==k2)<br \/>\n \t   printf(&#171;Eti tochki yavlyayutsya vershinami parallelogramma&#187;);<br \/>\n    else<br \/>\n      printf(&#171;Eti tochki ne yavlyayutsya vershinami parallelogramma&#187;);<br \/>\n   }<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/dany koordinaty tochek A,B,C &#8212; opredelit&#8217;, lezhat li oni na odnoj pryamoj,<br \/>\n\/\/esli net &#8212; vychislit&#8217; ugol <ABC\n\n#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n int xa,xb,xc,ya,yb,yc;<br \/>\n printf(&#171;Vvedite koordinaty tr`h tochek na ploskosti:\\n A: &#171;);<br \/>\n scanf(&#171;%i%i&#187;,&#038;xa,&#038;ya);<br \/>\n printf(&#187; B: &#171;);<br \/>\n scanf(&#171;%i%i&#187;,&#038;xb,&#038;yb);<br \/>\n printf(&#187; C: &#171;);<br \/>\n scanf(&#171;%i%i&#187;,&#038;xc,&#038;yc);<br \/>\n if (xa*yb+xb*yc+xc*ya-xa*yc-xb*ya-xc*yb==0)<br \/>\n \tprintf(&#171;Tochki lezhat na odnoi pryamoi&#187;);<br \/>\n else<br \/>\n   {<br \/>\n \t float ab,bc,abc;<br \/>\n    ab=pow(xb-xa,2)+pow(yb-ya,2);<br \/>\n    bc=pow(xc-xb,2)+pow(yc-yb,2);<br \/>\n    abc=acos((ab+bc-pow(xc-xa,2)+pow(yc-ya,2))\/sqrt(4*ab*bc));<br \/>\n \t printf(&#171;Ugol <ABC raven %f\",abc);\n   }\n getch();\n}\n\n\n\n\n\/\/udvoit' chisla a,b,c, esli a<b<c, inache - zamenit' ih modulyami\n\n#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c;<br \/>\n printf(&#171;Vvedite tri chisla: &#171;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n if(a<b&#038;&#038;b<c)\n \t{\n    a=2*a;\n    b=2*b;\n    c=2*c;\n   }\n else\n \t{\n    a=abs(a);\n    b=abs(b);\n    c=abs(c);\n   }\n printf(\"Rezul'tat: %.2f %.2f %.2f\",a,b,c);  \n getch();\n}\n\n\n\n\n\/\/na osi OX lezhat tri tochki A,B,C (t.e. koordinata Y==0)\n\/\/opredelit', kakaya iz tochek B i C raspolozhena blizhe k A\n\n#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c;<br \/>\n printf(&#171;Vvedite tri chisla &#8212; koordinaty X tochek A,B,C: &#171;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n if(b-a<=c-a)\n \tprintf(\"Tochka B blizhe\");\n else\n \tprintf(\"Tochka C blizhe\");\n getch();\n}\n\n\n\n\/\/proverit', mogut li a,b i c yavlyat'sya storonami treugol'nika - esli da, vychislit' ego ploschad'\n\n#include <conio.h><br \/>\n#include <math.h><br \/>\n#include <stdio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c;<br \/>\n printf(&#171;Vvedite dliny tr`h otrezkov a,b,c: &#171;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n if((a+b>c)&#038;&#038;(a+c>b)&#038;&#038;(b+c>a))<br \/>\n\t{<br \/>\n\t float p=(a+b+c)\/2;<br \/>\n\t printf(&#171;Ploschad&#8217; treugol&#8217;nika so storonami a,b,c ravna %.4f&#187;,sqrt(p*(p-a)*(p-b)*(p-c)));<br \/>\n\t}<br \/>\n else<br \/>\n \tprintf(&#171;Otrezki a,b,c ne obrazuyut treugol&#8217;nik&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/reshit&#8217; uravnenie a*x*x*x+b*x=0 dlya proizvol&#8217;nyh a i b<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b;<br \/>\n printf(&#171;Dano uravnenie vida a*x*x*x+b*x=0\\nVvedite ego koefficiehty a i b:&#187;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;a,&#038;b);<br \/>\n if(-b\/a<0)\n \tprintf(\"Eto uravnenie ne imeet dejstvitel'nyh korhej\");\n else\n   printf(\"Korni etogo uravneniya ravny 0.00 i %.2f\",sqrt(-b\/a));\n getch();\n}\n\n\n\n\/\/pomestitsya li pravil'nyj treugol'nik so storonoj a v kruge radiusom r\n\n#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,r;<br \/>\n printf(&#171;Vvedite radius kruga: &#171;);<br \/>\n scanf(&#171;%f&#187;,&#038;r);<br \/>\n printf(&#171;Vvedite storonu pravil&#8217;nogo treugol&#8217;nika: &#171;);<br \/>\n scanf(&#171;%f&#187;,&#038;a);<br \/>\n float p=3*a\/2;<br \/>\n if(pow(a,3)\/(4*sqrt(p*3*(p-a)))>=a)<br \/>\n \tprintf(&#171;Treugol&#8217;nik pomestitsya v kruge&#187;);<br \/>\n else<br \/>\n \tprintf(&#171;Treugol&#8217;nik ne pomestitsya v kruge&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/dany chisla x,y,z; najti znachenie vyrazheniya<br \/>\n\/\/    pow(max(x,y,z),2)-pow(2,x)*min(x,y,z)<br \/>\n\/\/ U=&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;<br \/>\n\/\/       sin(2x)+max(x,y,z)\/min(x,y,z)<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float x,y,z,min,max;<br \/>\n printf(&#171;\\tRasch`t functsii f(x)=U\\n&#187;);<br \/>\n printf(&#187;   pow(max(x,y,z),2)-pow(2,x)*min(x,y,z)\\n&#187;);<br \/>\n printf(&#171;U=&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;\\n&#187;);<br \/>\n printf(&#187;       sin(2x)+max(x,y,z)\/min(x,y,z)    \\n&#187;);<br \/>\n printf(&#171;Vvedite dejstvitel&#8217;nye chisla x,y,z: &#171;);<br \/>\n scanf(&#171;%f%f%f&#187;,&#038;x,&#038;y,&#038;z);<br \/>\n min=x;<br \/>\n if(y<min)\n \tmin=y;\n else\n \tif(z<min)\n   \tmin=z;\n max=x;\n if(y>max)<br \/>\n \tmax=y;<br \/>\n else<br \/>\n   if(z>max)<br \/>\n   \tmax=z;<br \/>\n float u=(pow(max,2)-pow(2,x)*min)\/(sin(2*x)+max\/min);<br \/>\n printf(&#171;\\nf(x)=U=%.3f&#187;,u);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/proverit&#8217;, yavlyaetsa li god visokosnym<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n unsigned year;<br \/>\n int f;<br \/>\n printf(&#171;Vvedite god: &#171;);<br \/>\n scanf(&#171;%u&#187;,&#038;year);<br \/>\n if(year%400==0)<br \/>\n \tf=1;<br \/>\n else<br \/>\n \tif(year%4==0)<br \/>\n   \tif(year%100==0)<br \/>\n      \tf=0;<br \/>\n      else<br \/>\n      \tf=1;<br \/>\n   else<br \/>\n      f=0;<br \/>\n if(f)<br \/>\n \tprintf(&#171;Eto visokosnyj god&#187;);<br \/>\n else<br \/>\n \tprintf(&#171;Eto ne visokosnyj god&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/budut li podobnymi pryamougol&#8217;nye treugol&#8217;niki, zadannye svoimi katetami<\/p>\n<p>#include <conio.h><br \/>\n#include <math.h><br \/>\n#include <stdio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float a,b,c,d;<br \/>\n printf(&#171;Vvedite dliny katetov pervogo treugol&#8217;nika: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;a,&#038;b);<br \/>\n printf(&#171;Vvedite dliny katetov vtorogo treugol&#8217;nika: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;c,&#038;d);<br \/>\n if(asin(a\/(sqrt(a*a+b*b))==asin(c\/sqrt(c*c+d*d))||asin(b\/sqrt(a*a+b*b))==asin(c\/sqrt(c*c+d*d))))<br \/>\n\tprintf(&#171;Eti treugol&#8217;niki yavlyayutsya podobnymi&#187;);<br \/>\n else<br \/>\n \tprintf(&#171;Eti treugol&#8217;niki ne yavlyayutsya podobnymi&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/proverit&#8217;, budet li summa dvuh prevyh tsifr chetyr`hznachnogo chisla ravna summe dvuh poslednih<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n unsigned n;<br \/>\n printf(&#171;Vvedite chetyr`hznachnoe tseloe chislo: &#171;);<br \/>\n scanf(&#171;%u&#187;,&#038;n);<br \/>\n if(n<1000||n>9999)<br \/>\n \tprintf(&#171;Eto ne chetyr`hznachnoe chislo&#187;);<br \/>\n else<br \/>\n \tif(n\/1000+n%1000\/100==n%100\/10+n%10)<br \/>\n   \tprintf(&#171;Summy pervyh i poslednih dvuh tsifr ravny&#187;);<br \/>\n   else<br \/>\n   \tprintf(&#171;Summy pervyh i poslednih dvuh tsifr ne ravny&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/budet li ch`tnym chislom summa tsifr tr`hznachnogog chisla N?<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n int n;<br \/>\n printf(&#171;Vvedite tr`hznachnoe chislo: &#171;);<br \/>\n scanf(&#171;%i&#187;,&#038;n);<br \/>\n if(n<100||n>999)<br \/>\n\tprintf(&#171;Eto ne tr`hznachnoe chislo&#187;);<br \/>\n else<br \/>\n\t{<br \/>\n\t if((n\/100+n%100\/10+n\/10)%2==0)<br \/>\n\t\tprintf(&#171;Summa tsifr etogo chisla ch`tnaya&#187;);<br \/>\n\t else<br \/>\n\t \tprintf(&#171;Summa tsifr etogo chisla nech`tnaya&#187;);<br \/>\n\t}<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/budet li tochka M (x;y) lezhat&#8217; vnutriploskosti,<br \/>\n\/\/ogranichennoj pryamymi x=m i x=n (m<n)\n\n#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n float x,y,m,n;<br \/>\n printf(&#171;Vvedite koordinaty tochki M (x;y): &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;x,&#038;y);<br \/>\n printf(&#171;Vvedite chisla m i n, opredelyayuschie ploskost&#8217; P: &#171;);<br \/>\n scanf(&#171;%f%f&#187;,&#038;m,&#038;n);<br \/>\n if(m>=n)<br \/>\n \tprintf(&#171;Oshibka: m dolzhno byt&#8217; men&#8217;she n&#187;);<br \/>\n else<br \/>\n \tif(x>m&#038;&#038;x<n)\n   \tprintf(\"Tochka M lezhit vnutri ploskosti P\");\n   else\n   \tprintf(\"Tochka M ne lezhit vnutri ploskosti P\");   \n getch();\n}\n\n\n\n\n\n\n\/\/budet li kvadrat tr`hznachnogo chisla raven\n\/\/kubu summy tsifr etogo chisla?\n\n#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <math.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n int n;<br \/>\n printf(&#171;Vvedite tr`hznachnoe tseloe chislo: &#171;);<br \/>\n scanf(&#171;%i&#187;,&#038;n);<br \/>\n if(n<100||n>999)<br \/>\n\tprintf(&#171;Eto ne tr`hznachnoe chislo&#187;);<br \/>\n else<br \/>\n\t{<br \/>\n\t n=abs(n);<br \/>\n\t unsigned s=n\/100+n%100\/10+n\/10;<br \/>\n\t if (pow(n,2)==pow(s,3))<br \/>\n\t\tprintf(&#171;Kvadrat etogo chisla raven kubu summy ego tsifr&#187;);<br \/>\n\t else<br \/>\n\t \tprintf(&#171;Kvadrat etogo chisla ne raven kubu summy ego tsifr&#187;);<br \/>\n\t}<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/opredelit&#8217;, yavlyaetsya li N ch`tnym dvuznachnym chislom<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n int n;<br \/>\n printf(&#171;Vvedite tseloe chislo: &#171;);<br \/>\n scanf(&#171;%i&#187;,&#038;n);<br \/>\n if(n<10||n>99)<br \/>\n \tprintf(&#171;Eto ne dvuznachnoe chislo&#187;);<br \/>\n else<br \/>\n \tif(n%2==0)<br \/>\n   \tprintf(&#171;Eto tseloe dvuznachnoe chislo&#187;);<br \/>\n   else<br \/>\n   \tprintf(&#171;Eto ne ch`tnoe chislo&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n<p>\/\/proverit&#8217;, yavlyayutsa li tri chisla trojkoj Pifagora<\/p>\n<p>#include <stdio.h><br \/>\n#include <conio.h><br \/>\n#include <conio.h><\/p>\n<p>void main()<\/p>\n<p>{<br \/>\n clrscr();<br \/>\n printf(&#171;Vvedite tri tselyh chisla: &#171;);<br \/>\n int a,b,c;<br \/>\n scanf(&#171;%i%i%i&#187;,&#038;a,&#038;b,&#038;c);<br \/>\n if(c*c==a*a+b*b)<br \/>\n \tprintf(&#171;Eti tri chisla yavlyayutsa trojkoj Pifagora&#187;);<br \/>\n else<br \/>\n \tprintf(&#171;Eti tri chisla ne yavlyayutsa trojkoj Pifagora&#187;);<br \/>\n getch();<br \/>\n}<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\/\/opredelit&#8217; rezul&#8217;tat gadaniya na romashke, vzyav kolihestvo lepestkov N za ishodnye dannye #include #include void main() { clrscr(); unsigned n; printf(&#171;\\tGadanie na romashke\\nVvedite kolichestvo lepestkov: &#171;); scanf(&#171;%u&#187;,&#038;n); if(n%2==0) printf(&#171;Rezul&#8217;tat: &#171;&#187;ne lyubit&#187;&#187;&#187;); else printf(&#171;Rezul&#8217;tat: &#171;&#187;lyubit&#187;&#187;&#187;); 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\/23626"}],"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=23626"}],"version-history":[{"count":1,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23626\/revisions"}],"predecessor-version":[{"id":23627,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23626\/revisions\/23627"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=23626"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=23626"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=23626"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}