{"id":25340,"date":"2015-08-23T01:26:20","date_gmt":"2015-08-22T22:26:20","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=25340"},"modified":"2015-08-23T10:24:33","modified_gmt":"2015-08-23T07:24:33","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-2","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=25340","title":{"rendered":"\u0417\u0430\u0434\u0430\u0447\u0438 \u0421++ (\u043f\u0435\u0440\u0432\u044b\u0439 \u043a\u0443\u0440\u0441) — \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 2."},"content":{"rendered":"

3-030.cpp<\/strong><\/p>\n

\/\/dano natural’noe chislo N i dejstvitel’noe A
\n\/\/najti summu N chlenov ryada S
\n\/\/ 1 1 1
\n\/\/ S = ——— + ——— + … + ———
\n\/\/ pow(a,2) pow(a,4) pow(a,2n)<\/p>\n

#include <stdio.h>
\n#include <conio.h><\/p>\n


\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned i,n;
\nfloat a,s=1,z=1;
\nprintf(» 1 1 1\\n S = ——— + ——— + … + ———\\n pow(a,2) pow(a,4) pow(a,2n)\\nVvedite natural’noe chislo N i dejstvitel’noe A> «);
\nscanf(«%u%f»,&n,&a);
\nfor(i=1;i<=n;i++)
\n{
\nz=z*a*a;
\ns*=(1.0\/z);
\n}
\nprintf(» S=%.3f»,s);
\ngetch();
\n}<\/p>\n

3-075.cpp<\/strong><\/p>\n

\/\/predlozhit’ pol’zovatelyu s pyati popytok ugadat’ zagadannoe chislo (nE[1..10])<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\n#include <time.h>
\n#include <stdlib.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nrandomize();
\nint n,m,i;
\nn=random(10)+1;
\nprintf(«\\tUgadajte chislo ot 1 do 10 s pyati popytok\\n»);
\nfor(i=1;i<=5;i++)
\n{
\nprintf(«\\nPopytka %i> «,i);
\nscanf(«%i»,&m);
\nif(m==n)
\n{
\nprintf(«\\nVerno! Vy spravilis’ za %i popytok»,i);
\nbreak;
\n}
\nelse
\nif(i==5)
\nprintf(«\\nNeverno. Popytki zakonchilis’.»);
\nelse
\nprintf(«Neverno.\\n»);
\n}
\ngetch();
\n}<\/p>\n

3-130.cpp<\/strong><\/p>\n

\/\/najti v diapazone [1;n] chislo s maksimal’noj summoj delitelej<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nunsigned divisors(unsigned chislo)<\/p>\n

{
\nunsigned div,summa=0;
\nfor(div=1;div<=chislo;div++)
\nif(chislo%div==0)
\nsumma+=div;
\nreturn summa;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i,m,rez,maxdiv;
\nprintf(«Vvedite tseloe polozhitel’noe chislo: «);
\nscanf(«%u»,&n);
\nfor(i=1;i<n;i++)
\n{
\nm=divisors(i);
\nif(m>maxdiv)
\n{
\nrez=i;
\nmaxdiv=m;
\n}
\n}
\nprintf(«V diapazone [1;%u] %u yavlyaetsya chislom s maksimal’noj summoj delitelej, ravnoj %u»,n,rez,maxdiv);
\ngetch();
\n}<\/p>\n

3-049.cpp<\/strong><\/p>\n

\/\/dano dejstvitel’noe X i natural’noe N; vychislit’ S
\n\/\/ cos x2 cos x4 cos x(2n)
\n\/\/ S = —— + —— + … + ———
\n\/\/ cos2 x cos4 x cos(2n) x<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\n#include <math.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i;
\nfloat x,s=0;
\nprintf(» cos x2 cos x4 cos x(2n)\\n S = —— + —— + … + ———\\n cos2 x cos4 x cos(2n) x\\nVvedite dejstvitel’noe chislo X i natural’noe N: «);
\nscanf(«%f%u»,&x,&n);
\nfor(i=1;i<=n;i++)
\ns+=cos(pow(x,2*i))\/pow(cos(x),2*i);
\nprintf(» S=%.4f»,s);
\ngetch();
\n}<\/p>\n

3-080.cpp<\/strong><\/p>\n

\/\/vyvesti tablitsu znachenij funktsii f(x) na otrezke [a;b] s shagom h
\n\/\/ f(x) = 7*sin2 (x*cos(x)\/2)<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\n#include <math.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nfloat a,b,h,x;
\nprintf(«\\tVychislenie funktsii f(x)=7*sin2 (x*cos(x)\/2)\\nVvedite kontsy otrezka [a;b], na kotorom budet vychislena funktsiya: «);
\nscanf(«%f%f»,&a,&b);
\nprintf(«Vvedite shag izmeneniya argumenta x: «);
\nscanf(«%f»,&h);
\nx=a-h;
\nprintf(» X | f(x) |\\n——+———|»);
\nwhile (x<=b)
\n{
\nx+=h;
\nprintf(«\\n %4.2f | %7.4f |»,x,7*pow(sin(x*cos(x)\/2),2));
\n}
\ngetch();
\n}<\/p>\n

3-035.cpp<\/strong><\/p>\n

\/\/dano natural’noe chislo n>2; vychislit’ P
\n\/\/ 1 1 1
\n\/\/ P = (1 — —)*(1 — —)*…*(1 — —)
\n\/\/ 2*2 3*3 n*n<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i;
\nfloat p=1;
\nprintf(» 1 1 1\\n P = (1 — —)*(1 — —)*…*(1 — —)\\n 2*2 3*3 n*n\\nVvedite natural’noe chislo N (n>2): «);
\nscanf(«%u»,&n);
\nif(n>2)
\n{
\nfor(i=2;i<=n;i++)
\np+=(1-1.0\/(i*i));
\nprintf(» P=%.4f»,p);
\n}
\nelse
\nprintf(«Oshibka vvoda!»);
\ngetch();
\n}<\/p>\n

3-132.cpp<\/strong><\/p>\n

\/\/proverit’, ravno li chislo N summe k-tyh stepenej svoih tsifr<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nunsigned step(unsigned basis,unsigned index)<\/p>\n

{
\nunsigned rez=1;
\nfor(unsigned count=1;count<=index;count++)
\nrez*=basis;
\nreturn rez;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,k;
\nprintf(«\\tRavno li chislo N summe K-tyh stepenej svoih tsifr\\nVvedite chisla N i K> «);
\nscanf(«%u%u»,&n,&k);
\nunsigned m=n,tsifra,summa=0;
\nwhile(m)
\n{
\ntsifra=m%10;
\nsumma+=tsifra;
\nm\/=10;
\n}
\nif(summa==n)
\nprintf(«Da, ravno»);
\nelse
\nprintf(«Net, ne ravno»);
\ngetch();
\n}<\/p>\n

3-087.cpp<\/strong><\/p>\n

\/\/vvesti s klaviatury n chisel i opredelit’, skol’ko iz nih yavlyayutsya polozhitel’nyh, otritsatel’nyh i ravnyh nulyu<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nint n,chislo,polozhit=0,otrits=0,nol=0;
\nprintf(«Skol’ko chisel? «);
\nscanf(«%i»,&n);
\nprintf(«Vvedite %i tselyh chisel:\\n»,n);
\nfor(int i=1;i<=n;i++)
\n{
\nprintf(» %3i> «,i);
\nscanf(«%i»,&chislo);
\nif (chislo>0)
\npolozhit++;
\nelse
\nif (chislo<0)
\notrits++;
\nelse
\nnol++;
\n}
\nprintf(«%i polozhitel’nyh, %i otritstel’nyh, %i ravnyh nulyu»,polozhit,otrits,nol);
\ngetch();
\n}<\/p>\n

3-031.cpp<\/strong><\/p>\n

\/\/vychislit’ znachenie F, esli dano dejstvitel’noe X
\n\/\/ (x-1)*(x-3)*(x-5)*…*(x-63)
\n\/\/ F(x)=——————————
\n\/\/ (x-2)*(x-4)*(x-6)*…*(x-64)<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\ndouble x,f1=1,f2=1,f;
\nprintf(» (x-1)*(x-3)*(x-5)*…*(x-63)\\n F(x)=——————————\\n (x-2)*(x-4)*(x-6)*…*(x-64)\\nVvedite X: «);
\nscanf(«%1f»,&x);
\nshort i;
\nfor(i=2;i<64;i+=2)
\nf1*=(x-i);
\nfor(i=2;i<65;i+=2)
\nf2*=(x-i);
\nif(f2==0)
\nf=0;
\nelse
\nf=f1\/f2;
\nprintf(«F(%.2f)=%1.4f»,x,f);
\ngetch();
\n}<\/p>\n

3-148.cpp<\/strong><\/p>\n

\/\/najti tselye chisla, dayuschie palindrom pri vozvedenii
\n\/\/v tret’yu,chetv`rtuyu ili pyatuyu stepen’
\n#include <stdio.h>
\n#include <conio.h>
\nint palindrom(unsigned n)<\/p>\n

{
\nunsigned m=n,p=0;
\nwhile (m)
\n{
\np=p*10+m%10;
\nm\/=10;
\n}
\nif (p==n)
\nreturn 1;
\nelse
\nreturn 0;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nfor (unsigned i=1;i<65536;i++)
\nif (palindrom(i*i*i))
\nprintf(«%6u (3)> %-6u\\n»,i,i*i*i);
\nelse
\nif (palindrom(i*i*i*i))
\nprintf(«%6u (4)> %-6u\\n»,i,i*i*i*i);
\nelse
\nif (palindrom(i*i*i*i*i))
\nprintf(«%6u (5)> %-6u\\n»,i,i*i*i*i*i);
\ngetch();
\n}<\/p>\n

3-055.cpp<\/strong><\/p>\n

\/\/dlya zadannogo E najti naimen’shee N takoe, chto pow(2,n)\/n! <E
\n\/\/vyvesti na ekran vse chleny polsedovatel’nosti ot 1-go do N-nogo<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\ndouble chislit(unsigned m)<\/p>\n

{
\ndouble f=2;
\nfor(unsigned j=2;j<=m;j++)
\nf*=2.0;
\nreturn f;
\n}
\ndouble fact(unsigned m)<\/p>\n

{
\ndouble f=1;
\nfor(unsigned j=1;j<=m;j++)
\nf+=j;
\nreturn f;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i=1;
\nfloat e;
\nprintf(«Vvedite chislo E: «);
\nscanf(«%f»,&e);
\nwhile(chislit(i)\/fact(i)>=e)
\nn++;
\nfor(i=1;i<=n;i++)
\nprintf(«%u\\n»,i);
\ngetch();
\n}<\/p>\n

3-107.cpp<\/strong><\/p>\n

\/\/kakaya tsifra — A ili B — chasche vstrechaetsya v zapisi chisla N?<\/p>\n

#include <conio.h>
\n#include <stdio.h>
\nunsigned A,B,N;
\nint F(unsigned k)<\/p>\n

{
\nunsigned i=0,m=N;
\nwhile(m)
\n{
\nif(k==m%10)
\ni++;
\nm\/=10;
\n}
\nreturn i;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nprintf(«Vvedite natural’noe chislo i dve tsifry: «);
\nscanf(«%u%u%u»,&N,&A,&B);
\nif(F(A)>F(B))
\nprintf(«Chastota vstrechaemosti odinakova»);
\nelse
\nif(F(A)>F(B))
\nprintf(«Tsifra %u vtrechaetsya chasche chem %u»,A,B);
\nelse
\nprintf(«Tsifra %u vtrechaetsya chasche chem %u»,B,A);
\ngetch();
\n}<\/p>\n

3-125.cpp<\/strong><\/p>\n

\/\/najti v natural’nom chisle bol’shuyu i men’shuyu tsifry i nomera ih pozitsij v chisle<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i=1,t,max=0,maxnum,min=9,minnum;
\nprintf(«Vvedite tseloe polozhitel’noe tseloe chislo> «);
\nscanf(«%u»,&n);
\nwhile(n!=0)
\n{
\nt=n%10;
\nif(t<min)
\n{
\nmin=t;
\nminnum=i;
\n}
\nif(t>max)
\n{
\nmax=t;
\nmaxnum=i;
\n}
\ni++;
\nn\/=10;
\n}
\nprintf(«Naibol’shaya tsifra: %u (razryad %u)\\nNaimen’shaya tsifra: %u (razryad %u)»,max,maxnum,min,minnum);
\ngetch();
\n}<\/p>\n

3-018.cpp<\/strong><\/p>\n

\/\/najti summu N chlenov ryada S
\n\/\/ x3 x5 x(2n+1)
\n\/\/ S = x — — + — + … + (-1)n*——-
\n\/\/ 3 5 2n+1<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\n#include <math.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned i,n;
\nfloat x,s=0;
\nprintf(» x3 x5 x(2n+1)\\n S = x — — + — + … + (-1)n*——-\\n 3 5 2n+1\\nVvedite natural’noe chislo N i dejstvitel’noe X: «);
\nscanf(«%u%f»,&n,&x);
\nfor(i=1;i<=n;i++)
\ns+=pow(x,2*i+1)\/(2*i+1);
\nprintf(» S=%.3f»,s);
\ngetch();
\n}<\/p>\n

3-133.cpp<\/strong><\/p>\n

\/\/najti dvuznachnye chisla, summa kvadratov tsifr kotoryh kratna M<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nunsigned summatsifr(unsigned chislo)<\/p>\n

{
\nunsigned summa=0,tsifra;
\nwhile(chislo)
\n{
\ntsifra=chislo%10;
\nchislo\/=10;
\nsumma+=tsifra*tsifra;
\n}
\nreturn summa;
\n}<\/p>\n

void main()<\/p>\n

{
\nclrscr();
\nunsigned i,m;
\nprintf(«Vvedite tseloe polozhitel’noe chislo: «);
\nscanf(«%u»,&m);
\nprintf(«Dvuznachnye chisla, summa kvadratov tsifr kotoryh kratna %u:\\n»,m);
\nfor(i=10;i<100;i++)
\nif(summatsifr(i)%m==0)
\nprintf(«%u\\n»,i);
\ngetch();
\n}<\/p>\n

3-120.cpp<\/strong><\/p>\n

\/\/proverit’, est’ li v zapisi chisla N tri odinakovye tsifry<\/p>\n

#include <conio.h>
\n#include <stdio.h>
\nint F(unsigned k,unsigned n)<\/p>\n

{
\nunsigned i=0,m=n;
\nwhile(m)
\n{
\nif(k==m%10)
\ni++;
\nm\/=10;
\n}
\nreturn i;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,m,f=0;
\nprintf(«Vvedite natural’noe chislo: «);
\nscanf(«%u»,&n);
\nm=n;
\nwhile(m)
\n{
\nif(F(m,n)==3)
\nf++;
\nm\/=10;
\n}
\nif(f)
\nprintf(«V zapisi etogo chisla est’ tri odinakovye tsifry»);
\nelse
\nprintf(«V zapisi etogo chisla net treh odinakovyh tsifr»);
\ngetch();
\n}<\/p>\n

3-110.cpp<\/strong><\/p>\n

\/\/napechatat’ vse sovershennye chisla, men’shie zadannogo N<\/p>\n

#include <conio.h>
\n#include <stdio.h>
\nunsigned SD(unsigned n)<\/p>\n

{
\nunsigned s=1,i;
\nfor(i=2;i<n\/2;i++)
\nif(n%i==0)
\ns+=i;
\nreturn s;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned N,i,k=0;
\nprintf(«Vvedite natural’noe chislo: «);
\nscanf(«%u»,&N);
\nprintf(«Sovershennye chisla, men’shie %u:\\n»,N);
\nfor(i=0;i<N;i++)
\nif(SD(i)==i)
\n{
\nprintf(«%u\\n»,i);
\nk++;
\n}
\nif(k)
\nprintf(«Najdeno chisel: %u»,k);
\nelse
\nprintf(«Takih chisel ne najdeno»);
\ngetch();
\n}<\/p>\n

3-112.cpp<\/strong><\/p>\n

\/\/najti kolichestvo prostyh chisel v diapazone [2;n]<\/p>\n

#include <conio.h>
\n#include <stdio.h>
\nint prost(unsigned m)<\/p>\n

{
\nunsigned j,f=1;
\nfor(j=2;j<m;j++)
\nif(m%j==0)
\n{
\nf=0;
\nbreak;
\n}
\nif(f)
\nreturn 1;
\nelse
\nreturn 0;
\n}
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,i,k=0;
\nprintf(«Vvedite tseloe chislo, bol’shee dvuh: «);
\nscanf(«%u»,&n);
\nif(n>2)
\n{
\nfor(i=3;i<n;i++)
\nif(prost(i))
\nk++;
\nprintf(«V diapazone [2;%u] prostyh chisel: %u»,n,k);
\n}
\nelse
\nprintf(«Eto chislo ne bol’she dvuh!»);
\ngetch();
\n}<\/p>\n

3-134.cpp<\/strong><\/p>\n

\/\/najti v diapazone [1;n] chisla, kratnye kazhdoj iz svoih tsifr<\/p>\n

#include <stdio.h>
\n#include <conio.h>
\nvoid main()<\/p>\n

{
\nclrscr();
\nunsigned n,k,t,f,i=1;
\nprintf(«Vvedite natural’noe chislo> «);
\nscanf(«%u»,&n);
\nprintf(«V diapazone [1;%u] sleduyuschie chisla delyatsya na kazhduyu svoyu tsifru:\\n»);
\nwhile(i<=n)
\n{
\nn=i;
\nf=0;
\nt=0;
\nwhile(n!=0)
\n{
\nk=n%10;
\nn\/=10;
\nif(i%k==0)
\nt++;
\nelse
\nf++;
\n}
\nif(t&&!f)
\nprintf(«%u\\n»,i);
\ni++;
\n}
\ngetch();
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"

3-030.cpp \/\/dano natural’noe chislo N i dejstvitel’noe A \/\/najti summu N chlenov ryada S \/\/ 1 1 1 \/\/ S = ——— + ——— + … + ——— \/\/ pow(a,2) pow(a,4) pow(a,2n) #include <stdio.h> #include <conio.h><\/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\/25340"}],"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=25340"}],"version-history":[{"count":4,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25340\/revisions"}],"predecessor-version":[{"id":25345,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/25340\/revisions\/25345"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=25340"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=25340"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=25340"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}