有一个3*4的矩阵,要求编程求出其中最大的那个元素的值,以及其所在的行号和列号。从键盘输入矩阵元素值 有一个3*4的矩阵,要求编程序求出其中值最大的那个元素的值,...

\u6709\u4e00\u4e2a3*4\u7684\u77e9\u9635\uff0c\u8981\u6c42\u7f16\u7a0b\u5e8f\u6c42\u51fa\u5176\u4e2d\u503c\u6700\u5927\u7684\u90a3\u4e2a\u5143\u7d20\u7684\u503c\uff0c\u4ee5\u53ca\u5176\u6240\u5728\u7684\u884c\u53f7\u548c\u5217\u597d

#include
void main()
{int a[3][4]={{1,2,3,4},{5,6,7,8},{9,10,11,12}};
int i,j,c,d,max;
max=a[0][0];
for(i=0;i<3;i++)
{for(j=0;j<4;j++)
if(max<=a[i][j])
{max=a[i][j];
c=i;
d=j;
}
}
printf("%d\u6700\u5927\u6570\n%d\u884c\u53f7\n%d\u5217\u53f7",max,c,d);
}

#include
void main()
{int a[3][4]={{1,2,3,4},{5,6,7,8},{9,10,11,12}};
int i,j,c,d,max;
max=a[0][0];
for(i=0;i<3;i++)
{for(j=0;j<4;j++)
if(max<=a[i][j])
{max=a[i][j];
c=i;
d=j;
}
}
printf("%d\u6700\u5927\u6570\n%d\u884c\u53f7\n%d\u5217\u53f7",max,c,d);
}

void main
{
int i,j row=0,colum=0,max;
int a[3][4]={{1,2,3,4},{9,8,7,6},{-10,10,-5,2}};
max=a[0][0];
for(i=0;i<=2;i++)
for(j=0;j<=3;j++)
if(a[i][j]>max)
{
max=a[i][j];
row=i;
colum=j;
}
printf("max=%d,row=%d,colum=%d\n",max,row,colum);
}你可以搜索 编,程,回,忆,录,之unity3d学习了解下,我觉得这个课程很不错,容易学

  • 43.鏈変竴涓3*4鐨勭煩闃,璇缂栫▼姹鍑哄叾涓兼渶澶х殑鍏冪礌,浠ュ強鏈澶у兼墍鍦ㄧ殑...
    绛旓細cout<<"璇疯緭鍏鐭╅樀鍏冪礌锛"<<endl;for(i=0;i<3;i++)for(j=0;j<4;j++)cin>>a[i][j];min=max=a[0][0];for(i=0;i<3;i++)for(j=0;j<4;j++){ if(min>a[i][j])min=a[i][j];if(max<a[i][j])max=a[i][j];} for(i=0;i<3;i++)//鍋囧鏈鍊兼湁鐩稿悓鐨...
  • C璇█:鏈変竴涓3*4鐨勭煩闃,瑕佹眰缂栧啓姹傝繖涓簩缁存暟缁勪腑鐨勬渶澶х殑閭d釜鍏冪礌鐨...
    绛旓細include <stdio.h> void main(){ int i,j,row = 0 ,colum = 0,max;int a[3][4]={{1,2,3,4},{9,8,7,6},{-10,10,-5,2}};max = a[0][0];for(i=0;i<=2;i++)for(j=0;j<=3;j++)if(a[i][j]>max){ max = a[i][j];row = i;colum = j;} printf("...
  • 缂栫▼,杈撳叆涓涓3*4鏁存暟鐭╅樀骞舵眰鍑哄悇琛屽厓绱犱箣鍜屽強鍚勫垪鍏冪礌涔嬪拰
    绛旓細include<stdio.h> int main(){ int i,j,a[4][5]={1,2,3,4,0,5,6,7,8,0,9,10,11,12};for(i=0;i<3;i++)for(j=0;j<4;j++){ a[i][4]+=a[i][j];a[3][j]+=a[i][j];} for(i=0;i<4;i++){ for(j=0;j<5;j++){ if(i==3&&j==4)break;if(j<...
  • C璇█绋嬪簭璁捐:鍋囪鏈変竴涓3*4鐨勭煩闃,缂栧啓绋嬪簭,鎵惧嚭鍏朵腑鍊兼渶澶х殑鍏冪礌
    绛旓細nMaxElem < nArray[i][j]){ nMaxElem = nArray[i][j];r = i+1; c = j+1;} } } printf("%d\t%d\t%d\n", nMaxElem, r, c);} int main(){ int n_array[3][4] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12};FindMax(n_array, 3, 4);return 0;} ...
  • C璇█缂栫▼姹鍑3脳4鐭╅樀涓殑鏈澶у间笌鏈灏忓煎強鍏舵墍鍦ㄨ鍜屽垪銆
    绛旓細鎴戞潵 include <stdio.h> include "stdlib.h"include "time.h"main(){ int i,j,*p,arry[3][4];p=arry[0];srand((unsigned)time(NULL));for (i=0;i<3;i++){ for (j=0;j<4;j++){ arry[i][j] = rand()%100+1;} } printf("\n ---");while(*p){ printf("%d ",*p...
  • c璇█绋嬪簭缂栧啓 杈撳叆涓涓4脳3鐨鏁存暟鐭╅樀,杈撳嚭鍏朵腑鏈澶у,鏈灏忓煎拰浠栦滑...
    绛旓細include<stdio.h>void main(){int arr[4][3];int i,j,min,max;int r1=0,r2=0,c1=0,c2=0;for(i=0;i<4;i++)//杈撹繘浜岀淮鏁扮粍for(j=0;j<3;j++){printf("Input arr[%2d][%2d]: ",i,j);scanf("%d",&arr[i][j]);} max=arr[0][0];//浠ゆ渶澶у煎垵濮嬪寲涓篴rr[0][0...
  • use matlab 闅忔満鐢熸垚涓涓3脳4鐨勭煩闃,璇缂栧啓绋嬪簭姹鍑虹煩闃典腑鍊兼渶澶х殑閭d釜...
    绛旓細A=rand(3,4);%闅忔満鐢熸垚鐭╅樀A [Amax,index]=max(A(:));%鍙栧緱鏈澶у糀max锛屽苟鍙栧緱绱㈠紩index [row column]=ind2sub([3,4],index);%灏嗙储寮曡浆鍖栦负鑴氭爣 褰撶劧涔熷彲浠ョ敤find鍑芥暟 濡傛妸绗涓琛屾敼涓 [row column]=find(A==Amax);濡傛灉涓嶇敤matlab鑷甫鍑芥暟锛屽垯闇涓ゅ眰for寰幆锛屽涓嬶細A=rand(3,4);Ama...
  • VFP缂栫▼鏈変竴涓3脳4鐨勭煩闃,瑕佹眰缂栫▼姹鍑哄叾涓兼渶澶х殑閭d釜鍏冪礌鐨勫,浠ュ強...
    绛旓細clear dime a(3,4)for i=1 to 3 for j=1 to 4 input "璇疯緭鍏涓涓鍊硷細" to a(i,j)endfor endfor k=a(1,1)for m=1 to 3 for n=1 to 4 r=a(m,n)if r>k k=r x1=m x2=n endif endfor endfor ?"鍏朵腑鏈澶х殑鍊兼槸锛",k ?"瀹冩墍鍦ㄧ殑浣嶇疆鏄"+alltrim(str(x1))+...
  • 鏈変竴涓3脳4鐨勭煩闃,瑕佹眰缂栧啓绋嬪簭鎵惧嚭姣忎竴琛屼腑鏈澶у煎苟涓庣涓鍒椾氦鎹...
    绛旓細package com.javase.test.demo;import java.util.Random;public class XXX { public static void main(String args[]) { int array[][] = new int[3][4];for (int i = 0; i < 3; i++) { for (int j = 0; j < 4; j++) { array[i][j] = new Random().nextInt(100);...
  • C璇█鏈変竴涓3脳4鐨勭煩闃,姹鍏朵腑鐨勬渶灏忓厓绱犵殑鍊煎強鍏惰涓嬫爣鍜屽垪涓嬫爣_鐧惧害...
    绛旓細include<stdio.h> main(){ int i,j,a[3][4],min,mi,mj;for(i=0;i<3;i++)for(j=0;j<4;j++)scanf("%d",&a[i][j]);mi=mj=0;min=a[0][0];for(i=0;i<3;i++)for(j=0;j<4;j++){ if(min>a[i][j]){ min=a[i][j];mi = i;mj = j;} } printf("...
  • 扩展阅读:4x3矩阵图 ... 35个数字矩阵图 ... 一张图看懂矩阵运算 ... python编程一个矩阵 ... 3 3行列式的计算方法 ... 矩阵的运算3x3图解 ... 3x3矩阵跟3x1矩阵乘法 ... 3 3矩阵计算方法 ... 4 4矩阵计算公式 ...

    本站交流只代表网友个人观点,与本站立场无关
    欢迎反馈与建议,请联系电邮
    2024© 车视网