{"id":23635,"date":"2012-11-29T14:38:27","date_gmt":"2012-11-29T11:38:27","guid":{"rendered":"http:\/\/studentpmr.ru\/?p=23635"},"modified":"2012-11-29T14:38:27","modified_gmt":"2012-11-29T11:38:27","slug":"%d0%be%d0%b4%d0%bd%d0%be%d0%bc%d0%b5%d1%80%d0%bd%d1%8b%d0%b5-%d0%bc%d0%b0%d1%81%d1%81%d0%b8%d0%b2%d1%8b","status":"publish","type":"post","link":"https:\/\/studentpmr.ru\/?p=23635","title":{"rendered":"\u041e\u0434\u043d\u043e\u043c\u0435\u0440\u043d\u044b\u0435 \u043c\u0430\u0441\u0441\u0438\u0432\u044b"},"content":{"rendered":"

\/\/vvesti s klaviatury odnomrernyj massiv tselyh chisel
\n\/\/i vyvesti na ekran kolichestvo nenulevyvh elementov<\/p>\n

#include
\n#include <\/p>\n

#define size 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n printf(«Vvedite %i elementov massiva tselyh chisel:\\n»,size);
\n int a[size],i,k=0;
\n for(i=0;i «,i+1);
\n scanf(«%i»,&a[i]);
\n if(a[i]!=0)
\n \tk++;
\n }
\n printf(«Bylo vvedeno %i nenulevyh elementov»,k);
\n getch();
\n}
\n<\/p>\n

************************************************************************
\n\/\/vychislit’ srednee arifmeticheskoe nenulevyh elementov vved`nnogo massiva tselyh chisel<\/p>\n

#include
\n#include <\/p>\n

#define size 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n printf(«Vvedite massiv iz %i tselyh chisel:\\n»,size);
\n int a[size],i,n=0;
\n float s=0;
\n for(i=0;i «,i+1);
\n scanf(«%i»,&a[i]);
\n if(a[i]!=0)
\n \tn++;
\n s+=a[i];
\n }
\n printf(«Srednee arifmeticheskoe nenulevyh elementov ravno %.2f»,s\/n);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti kolichestvo otritsatel’nyh elementov v massive tselyh chisel<\/p>\n

#include
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,k=0;
\n printf(«Vvedite %i tselyh chisel:\\n»,size);
\n for(i=0;i «,i+1);
\n scanf(«%i»,&a[i]);
\n if(a[i]<0)\n \tk++;\n }\n printf(\"Bylo vveddeno %i otritsatel'nyh chisel\",k);\n getch();\n}\n\n\n************************************************************************\n\/\/vychislit' srednee arifmeticheskoe dejstvitel'nogo massiva\n\/\/bez uch`ta minimal'nogo i maksimal'nogo elementov\n\n#include
\n#include <\/p>\n

#define size 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n printf(«Vvedite %i dejstvitel’nyh chisel:\\n»,size);
\n float a[size],min=10e+37,max=0,s=0;
\n short i,indexmin,indexmax;
\n for(i=0;i «,i+1);
\n scanf(«%f»,&a[i]);
\n if(a[i]max)
\n\t\t{
\n\t\t max=a[i];
\n\t\t indexmax=i;
\n\t\t}
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define size 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size];
\n short i,f=0;
\n printf(«Vvedite vozrastayuschyuyu posledovatel’nost’ iz %i chisel:\\n»,size);
\n for(i=0;i «,i+1);
\n scanf(«%f»,&a[i]);
\n if(i!=0)
\n \tif(a[i-1]>=a[i])
\n \t{
\n f=1;
\n break;
\n }
\n\t}
\n if(f)
\n \tprintf(«Eto ne vozrastayuschyaya posledovatel’nost'»);
\n else
\n \tprintf(«Da, eto vozrastayuschyaya posledovatel’nost'»);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/skolko raz v massive vstrechaetsya vved`nnoe s klaviatury chislo?<\/p>\n

#include
\n#include <\/p>\n

#define size 25<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],chislo,i,count=0;
\n printf(«Vvedite tseloe chislo: «);
\n scanf(«%i»,&chislo);
\n printf(«Vvedite massiv iz %i tselyh chisel:\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]==chislo)
\n \tcount++;
\n }
\n printf(«Chislo %i vstrechaetsya v massive %i raz»,chislo,count);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/est’ li v massive elementy s odinakovymi znacheniyami?<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,j,count=0;
\n printf(«Vvedite massiv iz %i tselyh chisel:\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t for(j=0;j
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,j,min,poz,tmp;
\n printf(«\\tMetod pryamogo vybora\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,tmp;
\n printf(«\\tMetod obmena («»puzyr’ka»»)\\n»);
\n for(i=0;i «,i+1);
\n scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;ia[j])
\n \t{
\n tmp=a[i];
\n a[i]=a[j];
\n a[j]=tmp;
\n\t\t\t}
\n printf(«\\nOtsortirovannyj massiv:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size];
\n int i,f=1;
\n printf(«Vvedite %i dejstvitel’nyh chisel\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n for(i=1;i
\n#include <\/p>\n

#define n 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],c[2*n],i,j,t,k,ka=0,kb=0;
\n printf(«Vvedite dva uporyadochennyh po vozrastaniyu massiva po %i elementov\\n\\nMassiv A:\\n»,n);
\n for(i=0;i «,i+1);
\n scanf(«%i»,a[i]);
\n }
\n printf(«\\nMassiv B:\\n»);
\n for(i=0;i «,i+1);
\n scanf(«%i»,&b[i]);
\n }
\n for(k=0;ka
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned n,i,sum=0,k=0,a[size];
\n float sred;
\n printf(«Skol’ko chelovek? «);
\n scanf(«%u»,&n);
\n for(i=0;isred)
\n \tk++;
\n printf(«Rost %u chelovek prevyshaet srednij»,k);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/v massive natural’nyh chisel najti summu elementov, kratnyh K<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned i,k,a[size];
\n float s;
\n printf(«Vvedite natural’noe chislo: «);
\n scanf(«%u»,&k);
\n printf(«Vvedite massiv iz %u natural’nyh chisel:\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%u»,&a[i]);
\n\t if(a[i]%k==0)
\n\t\ts+=a[i];
\n\t}
\n printf(«Summa chisel, kratnyh %u, ravna %f»,k,s);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/v tselochislennoj posledovatel’nosti est’ nulevye elementy
\n\/\/sozdat’ massiv iz nomerov etih elementov<\/p>\n

#include
\n#include <\/p>\n

#define n 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],m,k,i=0;
\n for(k=0;k «,k+1);
\n\tscanf(«%i»,&m);
\n\tif(m==0)
\n\t\t{
\n\t\t a[i]=k;
\n\t\t i++;
\n\t\t}
\n }
\n printf(«Nomera nulevyh elementov:\\n»);
\n for(k=0;k
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size];
\n int i;
\n for(i=0;i0)
\n\t\t{
\n\t\t printf(«+»);
\n\t\t break;
\n\t\t}
\n\telse
\n\t\tif(a[i]<0)\n\t\t\t{\n printf(\"-\");\n break;\n }\n getch();\n}\n\n\n\n************************************************************************\n\/\/najti kollichestvo polozhitel'nyh elementov v dejstvitel'nom massive\n\n#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size];
\n unsigned i,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n if(a[i]>0)
\n \tk++;
\n }
\n printf(«V dannom massive %u polozhitel’nyh chisel»,k);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/ukazat’ minimal’nyj otrezok chislovoj osi, soderzhaschij vse natural’nye chisla iz posledovatel’nosti<\/p>\n

#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned p[size],i,a=4294967625,b=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%u»,&p[i]);
\n\t if(p[i]b)
\n \tb=p[i];
\n\t}
\n printf(«Minimal’nyj otrezok: [%u;%u]»,a,b);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti kolichestvo nulevyh elementov v massive tselyh chisel<\/p>\n

#include
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,n,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]==0)
\n\t\tk++;
\n\t}
\n printf(«V massive %i nulevyh elementov»,k);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/zamenit’ chisla, bol’she Z, etim chislom i podschitat’ kolichestvo zamen<\/p>\n

#include
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size],z;
\n unsigned i,k=0;
\n printf(«Chislo Z: «);
\n scanf(«%f»,&z);
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t if(a[i]>z)
\n\t\t{
\n\t\t a[i]=z;
\n\t\t k++
\n\t\t}
\n\t}
\n printf(«Rezul’tat:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned a[size],i,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%u»,a[i]);
\n\t}
\n for(i=0;a[i]!=0&&i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size];
\n unsigned i,poz=0,neg=0,zero=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t if(a[i]==0)
\n\t\tzero++;
\n\t else
\n\t\tif(a[i]>0)
\n\t\t\tpoz++;
\n\t\telse
\n\t\t\tneg++;
\n\t}
\n printf(«\\n%u polozhitel’nyh, %u otritsatel’nyh, %u nulevyh elementov»,poz,neg,zero);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/pomenyat’ mestami maksimal’nyj i minimal’nyj elementy massiva<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,min=2147483647,max=-2147483648,indexmin,indexmax,t;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]max)
\n\t\t\t{
\n\t\t\t max=a[i];
\n\t\t\t indexmax=i;
\n\t\t\t}
\n\t}
\n t=a[indexmin];
\n a[indexmin]=a[indexmax];
\n a[indexmax]=t;
\n printf(«\\nRezul’tat:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,t;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,p=1;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n printf(«\\nRezul’tat:\\n»);
\n for(i=1;i
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],b[size],c[size],i,j=0,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]==1)
\n\t\t{
\n\t\t b[j]=1;
\n\t\t j++;
\n\t\t}
\n\t else
\n\t\tif(a[i]==0)
\n\t\t\t{
\n\t\t\t c[k]=0;
\n\t\t\t k++;
\n\t\t\t}
\n\t\telse
\n\t\t\tprintf(«Nevernyj vvod!\\n»);
\n\t}
\n printf(«\\nRezul’taty:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],m,i,f=0;
\n float p=1;
\n printf(«Vvedite lyuboe tseloe chislo: «);
\n scanf(«%i»,&m);
\n printf(«Vvedite %i tselyh chisel:\\n»);
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]>m)
\n\t {
\n\t\tp*=a[i];
\n\t\tf++;
\n\t }
\n\t}
\n if(f)
\n \tprintf(«Proizvedenie chisel bol’she %i ravno %.0f»,m,p);
\n else
\n \tprintf(«Net chisel bol’she %i»,m);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/vyvesti te chisla, kotorye ne bol’she svoego indexa v massive<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned a[size],n,i;
\n for(i=0;i «,i);
\n scanf(«%u»,&a[i]);
\n }
\n printf(«\\nElementy, ne prevyshayuschie svoego indexa v massive\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned a[size],M,L,i;
\n printf(«Vvedite natural’noe M: «);
\n scanf(«%u»,&M);
\n printf(«Vvedite natural’noe L (0<=L<=M-1): \");\n scanf(\"%u\",&L);\n for(i=0;i «,i+1);
\n\t scanf(«%u»,&a[i]);
\n\t}
\n printf(«\\nUdovletvoryayut usloviyu A[i]%%%u==%u:\\n»,M,L);
\n for(i=0;i
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,k=0;
\n printf(«Vvedite otsenki %i chelovek:\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n if(a[i]==2)
\n \tk++;
\n }
\n printf(«Ekzamen provalilo %i chelovek»,k);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/vyvesti vse chisla do pervogo nulya<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,n;
\n for(i=0;i
\n#include <\/p>\n

#define size 61<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float x,a[size];
\n int i=0;
\n for(x=-10;x<=10;x+=0.5)\n {\n \ta[i]=x;\n a[i+1]=4*x*x+7*x+23;\n i+=2;\n }\n for(i=0;i y=%.2f\\n»,a[i],a[i+1]);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/prigodnost’ detali otsenivaetsya po razmeru B, kotoryj dolzhen sootvetstvovat’ intervalu (A-C;A+C;)
\n\/\/esli v partii iz N detalej est’ brakovannye detali, podschitat’ ih<\/p>\n

#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int i,k=0;
\n float a,c,b[size];
\n printf(«Vvedite razmery %i detalej:\\n»,size);
\n for(i=0;ia+c)
\n\t\tk++;
\n if(k)
\n \tprintf(«V partii %i brakovannyh detalej»,k);
\n else
\n \tprintf(«Vse detali prigodny»);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/est’ informatsii o soimosti kupli\/prodazhi v bankah goroda
\n\/\/opredelit’, v kakom banke vygodnee obmenyat’ dollary na rubli<\/p>\n

#include
\n#include <\/p>\n

#define size 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int i,n,x=0;
\n float kurs[size],max;
\n printf(«Vvedite kolichestvo bankov v gorode: «);
\n scanf(«%i»,&n);
\n printf(«Vvedite kurs obmena v kazhdom iz bankov: «);
\n for(i=0;imax)
\n\t\t{
\n\t\t max=kurs[i];
\n\t\t x=i+1;
\n }
\n printf(«Samyj vygodnyj kurs v banke N%i (%.3f)»,x,max);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti summu maksimal’nogo iz nechetnyh i minimal’nogo iz chetnyh elementov<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,max,min;
\n printf(«Vvedite %i tselyh chisel\\n»,size);
\n for(i=1;imax)
\n max=a[i];
\n printf(«Summa maksimal’nogo iz nechetnyh i minimalnogo iz chetnyh — %i»,max+min);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/ukazat’ te elementy posledovatel’nosti dejstvitel’nyh chisel,
\n\/\/kotorye prinadlezhat otrezku [c;d]<\/p>\n

#include
\n#include
\n#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n randomize();
\n float a[size],c,d;
\n int i;
\n for(i=0;i=c&&a[i]<=d)\n \tprintf(\"%f\\n\",a[i]);\n getch();\n}\n\n\n\n************************************************************************\n\/\/vychislit' proizvedenie polozhitel'nyh elementov i proizvedenie otritsatel'nyh\n\/\/sravnit' poluchennye proizvedeniya po modulyu\n\n#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[size],pp=1,pn=1;
\n int i;
\n printf(«Vvedite %i dejstvitel’nyh chisel\\n»,size);
\n for(i=0;ipp)
\n\tprintf(«Proizvedenie polozhitel’nyh elementov bol’she proizvedeniya otritsatel’nyh»);
\n else
\n \tprintf(«Proizvedenie otritsatel’nyh chisel bol’she proizvedeniya polozhitel’nyh»);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/v massive zadany koordinaty N tochek ploskosti (x1,y1,x2,y2,…,xn,yn)
\n\/\/opredelit’ minimal’nyj radius kruga s tsentrom v nachale koordinat,
\n\/\/kotoryj soderzhit vse dannye tochki<\/p>\n

#include
\n#include
\n#include <\/p>\n

#define size 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int i;
\n float a[size],r=0,t;
\n printf(«Vvedite koordinaty (x;y) %i-i tochek\\n»,size);
\n for(i=0;i<2*size;i+=2)\n\t{\n\t scanf(\"%f%f\",&a[i],&a[i+1]);\n t=a[i]*a[i]+a[i+1]*a[i+1];\n if(t>r)
\n \tr=t;
\n }
\n printf(«Vse tochki soderzhit krug s radiusom %.2f»,r);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/peremestit’ vse otritsatel’nye elementy v nachalo massiva, ostal’nye v konets;
\n\/\/sohranit’ pri etom poryadok sledovaniya, dopolnitel’nyj massiv ne zavodit’<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,p=0,j,n,t;
\n for(i=0;i
\n#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned i,a[size],m;
\n printf(«Vvedite %i natural’nyh chisel:\\n»);
\n for(i=0;i
\n#include
\n#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n randomize();
\n unsigned a[size],b[size],i,j=0,k;
\n printf(«A:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,k,b[n],indB=0,count=0,min;
\n printf(«Vvedite %i tselyh chisel\\n»,n);
\n for(i=0;icount)
\n\t\t\t{
\n\t\t\t b[0]=a[i];
\n\t\t\t count=k;
\n\t\t\t indB=1;
\n\t\t\t}
\n\t}
\n min=b[0];
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],c=0;
\n int i,k;
\n for(i=0;i «);
\n scanf(«%i»,&k);
\n for(i=0;i
\n#include
\n#include
\n#include <\/p>\n

#define N 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[2*N],R=0,r=MAXFLOAT,t;
\n int i;
\n for(i=0;i<2*N;i+=2)\n\t{\n\t printf(\"Koordinaty tochki N%i: \");\n\t scanf(\"%f%f\",&a[i],&a[i+1]);\n\t t=a[i]*a[i]+a[i+1]*a[i+1];\n\t if(t>R)
\n\t\tR=t;
\n\t if(t
\n#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],max,i;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n max=a[0];
\n for(i=1;imax)
\n\t\tmax=a[i];
\n for(i=0;imax)
\n\t\ta[i]=0;
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,p=0,max;
\n printf(«Vvedite %i tselyh chisel\\n»);
\n for(i=0;imax)
\n\t\t{
\n\t\t max=a[i];
\n\t\t p=i;
\n\t\t}
\n a[p]=0;
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],b;
\n int i,k=0,t;
\n printf(«Vvedite neubyvayuschyuyu posledovatel’nost’ iz %i dejstvitel’nyh chisel\\n»,n-1);
\n for(i=0;ia[i];i++)
\n\tk++;
\n for(i=n-1;i>k;i—)
\n\t{
\n\t t=a[i];
\n\t a[i]=a[i-1];
\n\t a[i-1]=t;
\n\t}
\n a[k]=b;
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,sum,min,indexmin;
\n printf(«Vvedite %i tselyh chisel\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&b[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i;
\n printf(«Vvedite %i tselyh chisel»,n);
\n for(i=0;imax)
\n\t\tmax=a[i];
\n\t if(a[i]
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float x[n],y[n],r=0;
\n int i,j,A,B;
\n for(i=0;ir)
\n\t\t\t{
\n\t\t\t A=i;
\n\t\t\t B=j;
\n\t\t\t r=(x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j]);
\n\t\t\t}
\n printf(«Naibol’shee rasstoyanie mezhdu tochkami M%i(%f;%f) i M%i(%f;%f)»,A+1,x[A],y[A],B+1,x[B],y[B]);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti summu chlenov, raspolozhennyh mezhdu maksimal’nym i minimal’nym, vklyuchiv v summu oba etih chisla<\/p>\n

#include
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,indexmin=0,indexmax=0;
\n float s=0;
\n printf(«Vvedite %i tselyh chisel\\n»,n);
\n for(i=0;imax)
\n\t\t{
\n\t\t max=a[i];
\n\t\t indexmax=i;
\n\t\t}
\n\t if(a[i]
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j;
\n for(i=0;iM)
\n\t\tM=a[i];
\n\t if(a[i]
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],b[n];
\n int i;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n float max=a[0];
\n for(i=0;imax)
\n\t\tmax=a[i];
\n for(i=0;i
\n#include <\/p>\n

#define n 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,A,B,N;
\n printf(«\\tUlitka na dereve\\nVvedite svedeniya o pogode za %i dnej\\nVvedite 0, esli byl solnechnyj den’, vvedite 1, esli byl pasmurnyj den'»,n);
\n for(i=0;iB)
\n\tprintf(«Za %i dnej ulitka upolzet s dereva»,N);
\n else
\n \tprintf(«Za %i dnej ulitka budet na vysote %i sm»,N,A);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/vybrosit’ iz ishodnoj posledovatel’nosti te chleny, kotorye ravny minimal’nomu elementu<\/p>\n

#include
\n#include
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i,j=0,min=MAXINT;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t if(a[i]
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,k=0;
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int A[n],B[n\/2+1],C[n\/2+1],i,iB=0,iC=0;
\n for(i=0;i «,i);
\n\t scanf(«%i»,&A[i]);
\n\t}
\n for(i=0;i
\n#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],x,d;
\n int i,j,k1,k2;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n printf(«Vvedite dejstvitel’noe chislo: «);
\n scanf(«%f»,&x);
\n d=x;
\n for(i=0;i
\n#include <\/p>\n

#define n 10
\n#define m 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[m],f[n],i,j,k=0;
\n printf(«Vhodyat li vse chleny posledovatel’nosti A v posledovatel’nost’ B\\n»);
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(j=0;j «,j+1);
\n\t scanf(«%i»,&b[j]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n unsigned a[n],i,k0,k1,k2,k3,k4,k5,k6,k7,k8,k9,d;
\n printf(«Vvedite vozrast %i chelovek\\n»,n);
\n for(i=0;i «,i+1);
\n\t scanf(«%u»,&a[i]);
\n\t}
\n for(i=0;i100 let)»,k7,k8,k9,d);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/vyvesti nomera elementov, kotorye yavlyayutsya prostymi chislami<\/p>\n

#include
\n#include <\/p>\n

#define n 15<\/p>\n

int prost(unsigned a)<\/p>\n

{
\n for(int i=2;i «,i+1);
\n\t scanf(«%u»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,k=0,f;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include
\n#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n randomize();
\n int a[n],i,k=0;
\n printf(«\\tIshodnyj massiv\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i,k=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&b[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int A[n],B[n],i,b=0,j,f;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&A[i]);
\n\t}
\n for(i=0;i
\n#include
\n#include <\/p>\n

#define n 5<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[2*n],d,r=MAXFLOAT,R=0;
\n int i,j,M1,M2,N1,N2;
\n for(i=0;i<2*n;i+=2)\n\t{\n\t printf(\"Tochka A%i (x;y): \",i\/2+1);\n\t scanf(\"%f%f\",&a[i],&a[i+1]);\n\t}\n for(i=0;i<2*n;i+=2)\n\tfor(j=0;jR)
\n\t\t\t{
\n\t\t\t R=d;
\n\t\t\t N1=i\/2+1;
\n\t\t\t N2=j\/2+1;
\n\t\t\t}
\n\t\t}
\n printf(«Naimenee udalennye tochki: A%i i A%i\\nNaibolee udalennye tochki: A%i i A%i»,M1,M2,N1,N2);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/raspolozhit’ elementy zadannogo massiva v obratnom poryadke<\/p>\n

#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i,j=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=n-1;i>=0;i—)
\n\t{
\n\t b[j]=a[i];
\n\t j++;
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 10
\n#define m 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[m],c[n+m],i,j=n;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&b[i]);
\n\t}
\n for(i=0;i
\n#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,m;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],c[n],i,j,k;
\n for(i=0;i «,i);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;ia[i+1])<\/p>\n

#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n printf(«\\nIndexy lokal’nyh maksimumov:»);
\n for(i=1;ia[i+1])
\n\t\tprintf(«\\n%i»,i+1);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/zamenit’ summoj predyduschih elementov vse elementy, krome pervogo<\/p>\n

#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],b[n],s;
\n int i=0;
\n for(;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n s=a[1];
\n for(i=1;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int i,j;
\n float a[n],b[n],s;
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int A[n],i,min,indmin,a=0,b=n-1,tmp;
\n for(i=0;i
\n#include <\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],max,i,b[n];
\n for(i=0;imax)
\n\t\tmax=a[i];
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,x,y;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(x=0;a[x];x++);
\n for(y=n-1;a[y];y—);
\n printf(«Pervyj nulevoj — A[%i], poslednij — A[%i]»,x+1,y+1);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/kazhdyj tretij element zamenit’ udvoennym proizvedeniem dvuh predyduschih,
\n\/\/a stoyaschij pered nim — polusummoj sosednih s nim;
\n\/\/dopolnitel’nyj massiv ne ispol’zovat’<\/p>\n

#include
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,t1,t2,t3;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],sred=0,max,min;
\n int i,stat,unik;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n for(i=0;imax)
\n\t\t\tunik=i+1;
\n printf(«\\nSrednestaticheskij — A[%i]=%.2f\\nUnikal’nyj — A[%i]=%.2f»,stat,a[stat],unik,a[unik]);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti naibol’shij element massiva K[n], ne imeyuschij sebe ravnyh v massive N[m]<\/p>\n

#include
\n#include <\/p>\n

#define n 10
\n#define m 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int K[n],N[m],i,j,max,f,X=0;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&K[i]);
\n\t}
\n for(j=0;j «,j+1);
\n\t scanf(«%i»,&N[j]);
\n\t}
\n max=K[0];
\n for(i=0;imax)
\n\t\t{
\n\t\t f=1;
\n\t\t for(j=0;j
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int A[n],i,j,k,K=0,a;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&A[i]);
\n\t}
\n for(i=0;i=A[j-1]&&jK)
\n\t\t{
\n\t\t K=k+1;
\n\t\t a=i+1;
\n\t\t}
\n\t}
\n printf(«\\nNachalo posledovatel’nosti: A[%i], dlina — %i»,a,K);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/najti vse chisla, vstrechayuschiesya v massive rovno dva raza<\/p>\n

#include
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,k;
\n for(i=0;i
\n#include <\/p>\n

#define n 10<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],min,b[n];
\n int i;
\n for(i=0;i «,i+1);
\n\t scanf(«%f»,&a[i]);
\n\t}
\n min=a[0];
\n for(i=0;i
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n float a[n],q;
\n int i,j,k,A,G,arifm,geom;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=1;iarifm)
\n\t\t{
\n\t\t arifm=k;
\n\t\t A=i;
\n\t\t}
\n\t}
\n printf(«\\nSamaya dlinnaya arifmeticheskaya progressiya — nachalo: A[%i], dlina: %i»,A,arifm);
\n for(i=1;igeom)
\n\t\t{
\n\t\t geom=k;
\n\t\t G=i;
\n\t\t}
\n\t}
\n printf(«Samaya dlinnaya geometricheskaya progressiya — nachalo: A[%i], dlina: %i»,G,geom);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/v massive neotritsatel’nyh chisel najti indeks elementa, dlya kotorogo summa
\n\/\/stoyaschih pered nim elementov naimenee otlichaetsya ot summy stoyaschih posle nego<\/p>\n

#include
\n#include
\n#include
\n#include <\/p>\n

#define n 15<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],i,j,Index;
\n float s1,s2,D=MAXFLOAT;
\n for(i=0;i «,i+1);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i,p;
\n float m=-1e37;
\n printf(«Vvedite chisliteli i znamenateli %i drobej\\n»,n);
\n for(i=0;i «,i+1);
\n\t scanf(«%i%i»,&a[i],&b[i]);
\n\t if(((float)a[i]\/b[i])>m)
\n\t\t{
\n\t\t m=(float)a[i]\/b[i];
\n p=i;
\n\t\t}
\n\t}
\n printf(«Naibol’shaya drob’ — N%i (%.3f)»,p,m);
\n getch();
\n}<\/p>\n

************************************************************************
\n\/\/v neuporyadochennom massive est’ sovpadayuschie elementy
\n\/\/ostavit’ tol’ko odin iz kazhdoj gruppy sovpadayuschih elementov<\/p>\n

#include
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],b[size],i,j,k=0,f;
\n for(i=0;i «,i);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define n 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[n],b[n],i,k=0;
\n for(i=0;i «,i);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int W[size],G[size],C[size*2],n,m,indW,indG,indC;
\n printf(«\\nW[n]\\nVvedite kolichestvo elementov: «);
\n scanf(«%i»,&n);
\n for(indW=0;indW «,indW);
\n scanf(«%i»,&W[indW]);
\n }
\n printf(«\\nG[m]\\nVvedite kolichestvo elementov: «);
\n scanf(«%i»,&m);
\n for(indG=0;indG «,indG);
\n scanf(«%i»,&G[indG]);
\n }
\n indW=0;
\n indG=0;
\n for(indC=0;indW
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],k[size],i,t;
\n printf(«Vvedite massiv A i iznachal’nye pozitsii kazhdogo elementa\\n»);
\n for(i=0;i «,i,i);
\n\t scanf(«%i%i»,&a[i],k[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define size 30<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,t,p=0;
\n for(i=0;i «,i);
\n\t scanf(«%i»,&a[i]);
\n\t}
\n for(i=0;i
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],i,k=0;
\n printf(«Vvedite %i tselyh chisel\\n»,size);
\n for(i=0;i0)||(a[i]>0&&a[i-1]<0))\n \tk++;\n }\n printf(\"V massive %i cheredovanij znaka\",k); \n getch();\n}\n\n\n\n************************************************************************\n\/\/poluchit' novyj massiv umnozheniem kazhdogo elementa ishodnogo massiva na minimal'nyj\n\n#include
\n#include
\n#include
\n#include <\/p>\n

#define n 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n randomize();
\n unsigned a[n],i,min=4294967296;
\n float b[n];
\n printf(«Ishodnyj massiv:\\n»);
\n for(i=0;i
\n#include
\n#include
\n#include <\/p>\n

#define size 50<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n randomize();
\n unsigned a[size],i;
\n printf(«Ishodnyj massiv:\\n»);
\n for(i=0;i
\n#include <\/p>\n

#define size 20<\/p>\n

void main()<\/p>\n

{
\n clrscr();
\n int a[size],b[size],i,p;
\n float m=-1e37;
\n printf(«Vvedite chisliteli i znamenateli %i drobej\\n»,size);
\n for(i=0;i «,i+1);
\n\t scanf(«%i%i»,&a[i],&b[i]);
\n if(((float)a[i]\/b[i])>m)
\n {
\n \t m=(float)a[i]\/b[i];
\n p=i;
\n }
\n\t}
\n printf(«Naibol’shaya drob’ — N%i (%.3f)»,p,m);
\n getch();
\n}<\/p>\n","protected":false},"excerpt":{"rendered":"

\/\/vvesti s klaviatury odnomrernyj massiv tselyh chisel \/\/i vyvesti na ekran kolichestvo nenulevyvh elementov #include #include #define size 15 void main() { clrscr(); printf(«Vvedite %i elementov massiva tselyh chisel:\\n»,size); int a[size],i,k=0; for(i=0;i<\/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\/23635"}],"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=23635"}],"version-history":[{"count":1,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23635\/revisions"}],"predecessor-version":[{"id":23636,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23635\/revisions\/23636"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=23635"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=23635"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=23635"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}