求一个方阵对角线上最小值代码,C代码库,德仔网

代码语言

代码分类

【C】求一个方阵对角线上最小值

作者:Dezai.CN / 发布于2011/7/8/ 723

将矩阵存在二维数组a[m][n]中，比较对角线上的元素就是在下标i=j时比较，从而选出最小值

<div>
<div><span style="color: #008000">//</span><span style="color: #008000">程序3：求一个方阵对角线上最小值</span><span style="color: #008000">
</span><span style="color: #000000">#include </span><span style="color: #000000"><</span><span style="color: #000000">stdio.h</span><span style="color: #000000">></span><span style="color: #000000">

</span><span style="color: #0000ff">int</span><span style="color: #000000"> main()
{
 </span><span style="color: #0000ff">int</span><span style="color: #000000"> a[</span><span style="color: #800080">5</span><span style="color: #000000">][</span><span style="color: #800080">5</span><span style="color: #000000">];
 </span><span style="color: #0000ff">int</span><span style="color: #000000"> i,j,min;
 </span><span style="color: #0000ff">for</span><span style="color: #000000"> (i </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #800080">0</span><span style="color: #000000">; i</span><span style="color: #000000"><</span><span style="color: #800080">5</span><span style="color: #000000">; i</span><span style="color: #000000">++</span><span style="color: #000000">)
 {
 </span><span style="color: #0000ff">for</span><span style="color: #000000"> (j</span><span style="color: #000000">=</span><span style="color: #800080">0</span><span style="color: #000000">; j</span><span style="color: #000000"><</span><span style="color: #800080">5</span><span style="color: #000000">; j</span><span style="color: #000000">++</span><span style="color: #000000">)
 {
 printf(</span><span style="color: #800000">"</span><span style="color: #800000">a[%d][%d]=</span><span style="color: #800000">"</span><span style="color: #000000">,i,j);
 scanf(</span><span style="color: #800000">"</span><span style="color: #800000">%d</span><span style="color: #800000">"</span><span style="color: #000000">,</span><span style="color: #000000">&</span><span style="color: #000000">a[i][j]);
 }
 }
 min</span><span style="color: #000000">=</span><span style="color: #000000">a[</span><span style="color: #800080">0</span><span style="color: #000000">][</span><span style="color: #800080">0</span><span style="color: #000000">];
 </span><span style="color: #0000ff">for</span><span style="color: #000000"> (i </span><span style="color: #000000">=</span><span style="color: #000000"> </span><span style="color: #800080">0</span><span style="color: #000000">; i</span><span style="color: #000000"><</span><span style="color: #800080">5</span><span style="color: #000000">; i</span><span style="color: #000000">++</span><span style="color: #000000">)
 {
 </span><span style="color: #0000ff">if</span><span style="color: #000000"> (min</span><span style="color: #000000">></span><span style="color: #000000">a[i][i])
 {
 min</span><span style="color: #000000">=</span><span style="color: #000000">a[i][i];
 }
 }
 printf(</span><span style="color: #800000">"</span><span style="color: #800000">对角线最小值为：%d\n</span><span style="color: #800000">"</span><span style="color: #000000">, min);
 </span><span style="color: #0000ff">return</span><span style="color: #000000"> </span><span style="color: #800080">1</span><span style="color: #000000">;
}</span></div>
</div>

试试其它关键字

　最小值　

同语言下

可能有用的

Dezai.CN贡献的其它代码(4037)