定义一个一维整型数组,有10个元素。（5,4,9,2,6,11,14,8,10,16）？
C语言代码和运行结果如下：
输出符合要求，望采纳~
附源码：
#include <stdio.h>
int diff(int x, int y) { // 求差函数
if (x > y)
return x - y;
else
return y - x;
}
int main() {
int a[10] = {5,4,9,2,6,11,14,8,10,16}; // 定义数组并初始化
int max = a[0], min = a[0], sum, i;
printf("下标为奇数的元素: ");
for (i = 1; i < 10; i++) {
if (i % 2 == 1) // 输出下标为奇数的元素
printf("%d ", a[i]);
if (a[i] > max) // 求最大值
max = a[i];
else if (a[i] < min) // 求最小值
min = a[i];
}
sum = diff(min, max); // 最大值与最小值的差，保证结果非负
printf("
最大值max=%d, 最小值min=%d, 最大值与最小值的差sum=%d
", max, min, sum);
return 0;
}
绛旓細鍚屽锛屼綘涓鍏卞彂浜嗕笁寮犲浘鐗囥傜涓寮狅紝瀹氫箟浜涓涓10鍏冪礌鐨涓缁存暣鍨嬫暟缁勶紝浣嗗彧瀹氫箟浜嗕笁涓厓绱犲2銆4銆8锛岃繖浠ｈ〃浠涔堝憿锛熷畠璇存槑鍚庨潰鐨7涓厓绱犻兘鏄0锛佷綘瀹氫箟鐨勮繖涓暟缁勫疄闄呮槸锛2銆4銆8銆0銆0銆0銆0銆0銆0銆0銆備絾杩欏苟涓嶅奖鍝嶆壘鍒版暟缁勭殑鏈澶у8锛屾伆鎭扮▼搴忕己灏戣繖閮ㄥ垎鍐呭銆傜浜屽紶锛岃繖涓彲鑳芥湁涓鐐...
绛旓細p[j] = p[j+1];p[j+1] = t;} } } return 0;} /*鎵撳嵃鏁扮粍*/ int printArr(int * p, int n){ int i;for(i=0; i<n; i++){ printf("%d ",*p++);} printf("\n");return 0;} /*涓诲嚱鏁*/ int main(void){ int i,num[N];printf("璇疯緭鍏9涓鏁存暟锛歕n");for(...
绛旓細incldue <stdio.h> int main(void){ int a[10] = {1,2,3,4,5,6,7,8,9,10};int x,i;printf("璇疯緭鍏ュ緟妫娴嬬殑鏁:\n");scanf("%d",&x);for(i = 0; i<10;i++){ if(a[i] == x){ printf("%d鍦鏁扮粍涓!\n");break;} } return 0;} ...
绛旓細include <stdio.h> void oushu(int a[],int n){ int i;for(i = 0; i < 10; i++){ if (a[i] % 2 == 0)printf("%d ",a[i]);} } int main(void){ int a[10];int i;printf("璇疯緭鍏10涓鏁帮紝绌烘牸鍒嗗紑:");for(i = 0; i < 10;i++){ scanf("%d",&a[i]);} ...
绛旓細include<stdio.h> int main(){ int key,index;int arr[10]={1,2,3,4,5,6,7,8,9,10};printf("杈撳叆鏁存暟Key:\n");scanf("%d",&key);for(index=0;index<10&&arr[index]!=key;index++);if(index<10){ printf("浣嶇疆鏄細%d\n",index);} else { printf("娌℃湁瑕佹壘鐨勬暟瀛梊n");...
绛旓細int array[10];int i;cout<<"璇疯緭鍑鍗佷釜鏁存暟:"<<endl;for( i=0; i<10; ++i )cin>>array[i];// sort1(array,10);sort2(array,0,9);cout<<"鎺掑簭鍚:"<<endl;print(array,10);return 0;} void print( const int * const list, const int size ){ int i;for(i=0; i<size...
绛旓細鐢╟++鍐欑殑锛屽笇鏈涜兘甯埌浣犮1.2.include <iostream> using namespace std;const int Len = 5;void bubble_sort(int array[],int n);int find_max(int array[],int n);int main(){ int arr[Len];int i,j,k;for(i = 0;i != Len;i++)cin>>arr[i];k = find_max(arr,Len);...
绛旓細鍛靛懙锛岀敤C璇█闃 main(){ int a[10]=[ 1 2 3 4 5 6 7 8 9 10]; int i,s=0,y;for(i=0;i<10;i++){s=s+a[i];} y=s/10;printf("%d",y);} 杩欓噷璁や负鏁扮粍涓殑鍊煎潎涓鏁村瀷鐨勶紝涔熷彲浠ユ崲鎴愭诞鐐瑰瀷鐨
绛旓細鐢宠绌洪棿鐨勬椂鍊欎綘寰楀憡璇夎绠楁満瑕佺敵璇蜂粈涔堢被鍨嬬殑 姣斿鍍廲涓鏍风殑new int锛岀洿鎺ew a鍏堜笉璇碼鏄粈涔堜笢瑗匡紝灏辩畻浠栨槸涓涓鏁村舰鐨勫彉閲忎篃涓嶈兘杩欎箞鐢 鍥犱负浠栨槸涓涓彉閲忎笉鏄竴涓被鍨
绛旓細//鍙傝冧唬鐮#include <stdio.h>int main(){ int i=0,n,a[10]={1,2,3,4,5,6,7,8,9,0},flg=0; scanf("%d",&n); for(i=0;i<10;i++) if(n==a[i]){ printf("%d\n",i); flg=1; break; } if(!flg) printf("-1\n"); return 0;...
