\/\/najti summu i kolichestvo polozhitel’nyh elementov massiva A[N][N], nahodyaschihsya nad glavnoj diagonal’yu<\/p>\n
#include ************************************************************************ #include main()<\/p>\n { ************************************************************************ #include main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { ************************************************************************ #include main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { ************************************************************************ #include main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { ************************************************************************ #include main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { const m=5,n=5;<\/p>\n main()<\/p>\n { const m=6,n=5;<\/p>\n int a[m][n];<\/p>\n bool count(int x)<\/p>\n { const n=4,m=5;<\/p>\n int a[m][n];<\/p>\n int K(x)<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { main()<\/p>\n { \/\/najti summu i kolichestvo polozhitel’nyh elementov massiva A[N][N], nahodyaschihsya nad glavnoj diagonal’yu #include #include #include main() { randomize(); const n=10; int a[n][n],i,j,k=0; float s=0; printf(«Ishodnyj massiv A[%i][%i]\\n»,n,n); 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\/23637"}],"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=23637"}],"version-history":[{"count":1,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23637\/revisions"}],"predecessor-version":[{"id":23638,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=\/wp\/v2\/posts\/23637\/revisions\/23638"}],"wp:attachment":[{"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=23637"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Fcategories&post=23637"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/studentpmr.ru\/index.php?rest_route=%2Fwp%2Fv2%2Ftags&post=23637"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n#include
\n#include
\nmain()
\n{
\n randomize();
\n const n=10;
\n int a[n][n],i,j,k=0;
\n float s=0;
\n printf(«Ishodnyj massiv A[%i][%i]\\n»,n,n);
\n for(i=0;i
\n {
\n s+=a[i][i];
\n k++;
\n }
\n printf(«\\nSumma %i polozhitel’nyh chisel nad glavnoj diagonal’yu ravna %.0f»,k,s);
\n getchar();
\n}
\n<\/p>\n
\n\/\/opredelit’ v veschestvennoj matritse A[N][M] kolichestvo osobyh elementov:
\n\/\/element schitat’ osobym, esli on bol’she summy ostal’nyh elementov v svoem stolbtse<\/p>\n
\n const m=5,n=5;
\n int a[n][m],i,j,k,count=0;
\n printf(«Vvedite matritsu iz %i strok po %i elementov:\\n»,n,m);
\n for(i=0;i
\n\t\t\tcount++;
\n\t\t}
\n printf(«Zdes’ %i osobyh elementov»,count);
\n getchar();
\n}<\/p>\n
\n\/\/perestavit’ stroku s maksimalnym elementom na glavnoj diagonali so strokoj s zadannym nomerom M<\/p>\n
\n const n=5;
\n int a[n][n],i,j,max,I,m;
\n printf(«Vvedite kvadratnuyu matritsu A %i*%i\\n»,n,n);
\n for(i=0;i
\n\t\t{
\n\t\t I=i;
\n\t\t max=a[i][i];
\n\t\t}
\n printf(«Vvedite nomer stroki: «);
\n scanf(«%i»,&m);
\n if(m>=n)
\n\tprintf(«Oshibka: nomer za predelami matritsy»);
\n else
\n\tfor(j=0;j
\n const n=4,m=5;
\n int a[n][m],i,j,min,max,iMin,iMax;
\n printf(«Vvedite massiv A[%i][%i]\\n»,n,m);
\n for(i=0;i
\n\t\t\t{
\n\t\t\t iMax=j;
\n\t\t\t max=a[i][j];
\n\t\t\t}
\n\t\t if(a[i][j]
\n const n=3;
\n int a[n][n],i,j,sum=0,s,f=1;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n#include
\n const m=4,n=3;
\n int i,j,iMax,jMax;
\n float a[m][n],max=MINFLOAT,tmp;
\n printf(«Vvedite matritsu %i*%i\\n»,m,n);
\n for(i=0;i
\n\t\t\t{
\n\t\t\t max=a[i][j];
\n\t\t\t iMax=i;
\n\t\t\t jMax=j;
\n\t\t\t}
\n for(i=0;i
\n const n=6;
\n int a[n][n],i,j;
\n bool f=true;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n const n=5;
\n int a[n][n],i,j;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n\t\t\t{
\n\t\t\t max=a[i][j];
\n\t\t\t ind=j;
\n\t\t\t}
\n\t if(ind!=i)
\n\t\t{
\n\t\t a[i][i]^=a[i][ind];
\n\t\t a[i][ind]^=a[i][i];
\n\t\t a[i][i]^=a[i][ind];
\n\t\t}
\n\t}
\n printf(«\\nRezul’tat\\n»);
\n for(i=0;i
\n#include
\n#include
\n randomize();
\n const n=10,m=10;
\n int a[n][m],i,j,k;
\n printf(«Ishodnyj massiv\\n»);
\n for(i=0;i
\n\t\t\t\t{
\n\t\t\t\t a[i][j]^=a[i][k];
\n\t\t\t\t a[i][k]^=a[i][j];
\n\t\t\t\t a[i][j]^=a[i][k];
\n\t\t\t\t}
\n\t}
\n printf(«\\nMassiv s uporyadochennymi strokami\\n»);
\n for(i=0;i
\n#include
\n#include
\n randomize();
\n const m=6,n=5;
\n int a[m][n],i,j,K;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n\t\t\t{
\n\t\t\t max=a[i][j];
\n\t\t\t I=i;
\n\t\t\t J=j;
\n\t\t\t}
\n printf(«Vvedite nomer K (K>0, K<%i, K<%i): \",m,n);\n scanf(\"%i\",&K);\n K--;\n for(j=0;j
\n#include
\n#include
\n#include
\n randomize();
\n const m=6,n=5;
\n float a[m][n],b[m],min,max=MINFLOAT;
\n int i,j,I[m],J[n],k;
\n printf(«Ishodnaya matritsa:\\n»);
\n for(i=0;i
\n\t\t{
\n\t\t max=b[i];
\n\t\t k=i;
\n\t\t}
\n printf(«\\nNaibol’shij sredi minimumov kazhdoj stroki — A[%i][%i]»,I[k]+1,J[k]+1);
\n getchar();
\n}<\/p>\n
\n\/\/najti v kvadratnoj matritse nechetnogo poryadka naibol’shij iz elementov na oboih diagonalyah
\n\/\/i pomenyat’ ego mestami s elementom, stoyaschim na ih peresechenii<\/p>\n
\n const n=5;
\n int a[n][n],i,j;
\n for(i=0;i
\n\t\t{
\n\t\t max=a[i][i];
\n\t\t iMax=jMax=i;
\n\t\t}
\n for(i=n-1,j=0;i>0&&j
\n\t\t{
\n\t\t max=a[i][j];
\n\t\t iMax=i;
\n\t\t jMax=j;
\n\t\t}
\n i=j=n\/2;
\n a[i][j]^=a[iMax][jMax];
\n a[iMax][jMax]^=a[i][j];
\n a[i][j]^=a[iMax][jMax];
\n for(i=0;i
\n#include
\n#include
\n randomize();
\n const n=5;
\n int a[n][n],i,j,b[n];
\n float s=0,A[n][n];
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n#include
\n#include
\n randomize();
\n const n=5;
\n int a[n][n],b[n][n],i,j;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n const n=5;
\n float a[n][n];
\n int i,j,k,x;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n\tgoto vvodK;
\n x=a[k][k];
\n if(x==0)
\n\tprintf(«Neobhodimyj element raven nulyu.»);
\n else
\n\t{
\n\t for(j=0;j
\n const n=5;
\n int a[n][n],i,j,k,x=0,max=0,I,J;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i»,n);
\n for(i=0;i
\n\t\t\t\t{
\n\t\t\t\t max=a[i][j];
\n\t\t\t\t I=i;
\n\t\t\t\t J=j;
\n\t\t\t\t}
\n\t\t }
\n printf(«Kratnyh %i elementov — %i; naibol’shij koefficient u a[%i][%i]»,k,x,I+1,J+1);
\n getchar();
\n}<\/p>\n
\n\/\/pomenyta’ mestami naibol’shij i naimen’shij elementy pryamougol’noj matritsy<\/p>\n
\n const n=4,m=5;
\n int a[n][m],i,j;
\n for(i=0;i
\n\t\t\t{
\n\t\t\t max=a[i][j];
\n\t\t\t Imax=i;
\n\t\t\t Jmax=j;
\n\t\t\t}
\n\t\t if(a[i][j]
\n#include
\n#include
\n#include
\n randomize();
\n const m=10,n=10;
\n int a[m][n],i,j,max=-MAXINT,min=MAXINT,s,iMin,iMax;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n\t\t{
\n\t\t max=s;
\n\t\t iMax=i;
\n\t\t}
\n\t}
\n printf(«Stroka s maksimal’noj summmoj (%i)\\n»,max);
\n for(i=0;i
\n#include
\n const n=4;
\n float a[n][n],min=MAXFLOAT,sum=0;
\n int i,j,I;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n\t\tif(a[i][j]
\n#include
\n const n=5;
\n float a[n][n],max=0;
\n int i,j,I,J;
\n for(i=0;i
\n\t\tif(abs(a[i][j])>max)
\n\t\t\t{
\n\t\t\t max=abs(a[i][j]);
\n\t\t\t I=i;
\n\t\t\t J=j;
\n\t\t\t}
\n for(i=I;i
\n const n=4;
\n float a[n][n],tmp;
\n int i,j;
\n for(i=0;i
\n#include
\n#include
\n randomize();
\n const m=10,n=6;
\n int a[m][n],i,j;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n const m=6,n=5;
\n int a[m][n],i,j,min,jMin;
\n for(i=0;i
\n const n=4,m=5;
\n int r[n][m],i,j,c,d,f;
\n printf(«Vvedite matritsu %i*%i\\n»,n,m);
\n for(i=0;i
\n#include
\n const m=5,n=6;
\n int a[m][n],i,j,p,q,count,maxlenNW=0,maxlenNE=0,I,J;
\n printf(«Vvedite matritsu %i*%i iz nulej i edinits\\n»,m,n);
\n for(i=0;i
\n\t\t\t\t{
\n\t\t\t\t maxlenNW=count;
\n\t\t\t\t I=i;
\n\t\t\t\t J=j;
\n\t\t\t\t}
\n\t\t\t count=0;
\n\t\t\t for(p=i,q=j;!a[p][q]&&p
\n\t\t\t\tcount++;
\n\t\t\t if(count>maxlenNE)
\n\t\t\t\t{
\n\t\t\t\t maxlenNE=count;
\n\t\t\t\t I=i;
\n\t\t\t\t J=j;
\n\t\t\t\t}
\n\t\t\t}
\n printf(«Samye dlinnye tsepochki nulej:n\\ nachalo — a[%i][%i], dlina — %i,»,I,J,max(maxlenNW,maxlenNE));
\n if(maxlenNW>maxlenNE)
\n\tprintf(«napravlenie — s severo-zapada na uygo-vostok»);
\n else
\n\tprintf(«napravlenie — s severo-vostoka na uygo-zapad»);
\n getchar();
\n}<\/p>\n
\n\/\/sozdat’ na osnove kvadratnoj matritsy odnomernyj massiv, sosotoyaschij iz summ
\n\/\/elementov teh strok, kotorye nachinayutsya s K iduschih podryad polozhitel’nyh chisel<\/p>\n
\n const n=5;
\n int a[n][n],i,j,b[n],K,indB=0;
\n printf(«Vvedite kvadratnuyu matritsu poryadka %i\\n»,n);
\n for(i=0;i
\n const m=4,n=5;
\n int a[m][n],i,j,K,L;
\n printf(«Vvedite massiv %ix%i> \\n»,m,n);
\n for(i=0;i
\n\tgoto vvodK;
\n else
\n\tK—;
\n for(i=K;i
\n\tgoto vvodL;
\n else
\n\tL—;
\n for(j=L;j
\n#include
\n#include
\n randomize();
\n const n=10,m=10;
\n int a[n][m],i,j,K,L;
\n printf(«Ishodnyj massiv\\n»);
\n for(i=0;i
\n\tgoto vvod;
\n for(i=0;i
\n const n=5;
\n int a[n][n],i,j,max,I,m;
\n printf(«Vvedite kvadratnuyu matritsu A %i*%i\\n»,n,n);
\n for(i=0;i
\n\t\t{
\n\t\t I=i;
\n\t\t max=a[i][i];
\n\t\t}
\n printf(«Vvedite nomer stroki: «);
\n scanf(«%i»,&m);
\n if(m>=n)
\n\tprintf(«Oshibka: nomer za predelami matritsy»);
\n else
\n\tfor(j=0;j
\n const n=4;
\n int a[n][n],i,j,max,K=0;
\n printf(«Vvedite kvadratnuyu matritsu %i*%i\\n»,n,n);
\n for(i=0;i
\n\t\t{
\n\t\t max=a[i][i];
\n\t\t K=i;
\n\t\t}
\n for(i=K;i
\n#include
\n#include
\n int a[m][n],i,j,b[m],k;
\n randomize();
\n printf(«Ishodnyj massiv\\n»);
\n for(i=0;i
\n int k=0;
\n for(int i=0;i
\n int k=0;
\n for(int i=0;i
\n#include
\n#include
\n const m=4,n=3;
\n int a[m][n],b[n],i,j;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n int a[2][2],i,j;
\n printf(«Vvedite kvadratnuyu matritsu vtorogo poryadka\\n»);
\n for(i=0;i<2;i++)\n\tfor(j=0;j<2;j++)\n\t\tscanf(\"%i\",&a[i][j]);\n printf(\"D=%i\",a[0][0]*a[1][1]-a[0][1]*a[1][0]);\n getchar();\n}\n\n\n\n************************************************************************\n\/\/v matritse A(m,n) vse nenulevye elementy zamenit' obratnymi po znaku i protivopolozhnymi po velichine\n\n#include
\n const n=4,m=5;
\n float a[m][n];
\n int i,j;
\n for(i=0;i
\n char *a,i,j,n;
\n bool f;
\n scanf(«%i»,&n);
\n a=new char [n*n];
\n for(i=0;i
\n clrscr();
\n int *A,*B,*C,m,n,t,i,j,k;
\n printf(«Vvedite kolichestvo strok i stolbtsov v matritse A: «);
\n scanf(«%i%i»,&m,&n);
\n A=new int [m*n];
\n printf(«Vvedite A[%i][%i]:\\n»,m,n);
\n for(i=0;i
\n#include
\n#include
\n const m=10,n=6;
\n int a[m][n],i,j,K;
\n printf(«Ishodnaya matritsa»);
\n for(i=0;i
\n\tgoto vvodK;
\n for(i=K-1;i
\n#include
\n#include
\n randomize();
\n const m=10,n=15;
\n int a[m][n],i,j,K;
\n printf(«Ishodnaya matritsa\\n»);
\n for(i=0;i
\n\tgoto vvodK;
\n for(j=n-1;j>K-1;j—)
\n\tfor(i=0;i
\n#include
\n#include
\n int *a,*b,n,i,j,k;
\n randomize();
\n printf(«Vvedite poryadok matritsy: «);
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n printf(«\\nMatritsa v ishodnom vide:\\n»);
\n for(i=0;i
\n\tfor(j=0;j
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int[n*n];
\n for(i=0;i
\n int *a,i,j,n;
\nvvod_n:
\n printf(«Vvedite chetnoe natural’noe chislo: «);
\n scanf(«%i»,&n);
\n if(n%2)
\n \tgoto vvod_n;
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(j=0;j
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int n,i,j,*a;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int *a,i,j,n,t;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i
\n int n,i,j,*a;
\n scanf(«%i»,&n);
\n a=new int [n*n];
\n for(i=0;i