C语言：从键盘输入10个1~99的整数存入数组中，自定义函数求去掉一个最高分和最低分的平均值返回，咋编？ C语言数组从键盘输入10个整数存入数组，找出其中最大和最小值...
C\u8bed\u8a00\uff1a\u4ece\u952e\u76d8\u8f93\u516510\u4e2a\u6574\u6570\u5b58\u5165\u6570\u7ec4\uff0c\u627e\u51fa\u5176\u4e2d\u6700\u5927\u548c\u6700\u5c0f\u503c\uff0c\u5e76\u8f93\u51fa\u3002 \u9ebb\u70e6\u5e2e\u5fd9\u7f16\u5199\u4e00\u4e0b\uff03include\uff02stdio\uff0eh\uff02
intmain\uff08\uff09
\uff5b
inti\uff1b
floatmax\uff0cmin\uff0cnum\uff3b10\uff3d\uff1b
printf\uff08\uff02\u8bf7\u8f93\u516510\u4e2a\u6570\uff0c\u6bcf\u8f93\u5165\u4e00\u4e2a\u6570\u6309\u56de\u8f66\u952e\u7ed3\u675f\uff1a\uff3cn\uff02\uff09\uff1b
for\uff08i\uff1d0\uff1bi\uff1c10\uff1bi\uff0b\uff0b\uff09
\uff5b
scanf\uff08\uff02\uff05f\uff02\uff0c\uff06num\uff3bi\uff3d\uff09\uff1b
\uff5d
max\uff1dmin\uff1dnum\uff3b0\uff3d\uff1b
for\uff08i\uff1d1\uff1bi\uff1c10\uff1bi\uff0b\uff0b\uff09
\uff5b
if\uff08max\uff1cnum\uff3bi\uff3d\uff09
max\uff1dnum\uff3bi\uff3d\uff1b
elseif\uff08min\uff1enum\uff3bi\uff3d\uff09
min\uff1dnum\uff3bi\uff3d\uff1b
\uff5d
printf\uff08\uff02\u6700\u5927\u4e3a\uff1a\uff05f\uff3cn\u6700\u5c0f\u4e3a\uff1a\uff05f\uff3cn\uff02\uff0cmax\uff0cmin\uff09\uff1b
return0\uff1b
\uff5d
\u8fd0\u884c\u6548\u679c\uff1a
\u6269\u5c55\u8d44\u6599\uff1areturn\u7528\u6cd5\uff1a
\u5728C++\u7684\u5173\u952e\u5b57\uff0c\u5b83\u63d0\u4f9b\u4e86\u7ec8\u6b62\u51fd\u6570\u6267\u884c\u7684\u4e00\u79cd\u65b9\u5f0f\u3002\u5f53return\u8bed\u53e5\u63d0\u4f9b\u4e86\u4e00\u4e2a\u503c\u65f6\uff0c\u8fd9\u4e2a\u503c\u5c31\u6210\u4e3a\u51fd\u6570\u7684\u8fd4\u56de\u503c.
1\u3001C
\u5728C89\u4e2d\uff0cmain()\u662f\u53ef\u4ee5\u63a5\u53d7\u7684\u3002Brian W.Kernighan\u548cDennis M.Ritchie\u7684\u7ecf\u5178\u5de8\u8457The C programming Language 2e\uff08\u300aC\u7a0b\u5e8f\u8bbe\u8ba1\u8bed\u8a00\u7b2c\u4e8c\u7248\u300b\uff09\u7528\u7684\u5c31\u662fmain()\u3002\u4e0d\u8fc7\u5728\u6700\u65b0\u7684C99\u6807\u51c6\u4e2d\uff0c\u53ea\u6709\u4ee5\u4e0b\u4e24\u79cd\u5b9a\u4e49\u65b9\u5f0f\u662f\u6b63\u786e\u7684\uff1a
int main(void)
int main(int argc,char*argv[])
\u5f53\u7136\uff0c\u6211\u4e5f\u53ef\u4ee5\u505a\u4e00\u70b9\u5c0f\u5c0f\u7684\u6539\u52a8\u3002\u4f8b\u5982\uff1achar*argv[]\u53ef\u4ee5\u5199\u6210char**argv\uff1bargv\u548cargc\u53ef\u4ee5\u6539\u6210\u522b\u7684\u53d8\u91cf\u540d\uff08\u5982intval\u548ccharval\uff09\uff0c\u4e0d\u8fc7\u4e00\u5b9a\u8981\u7b26\u5408\u53d8\u91cf\u7684\u547d\u540d\u89c4\u5219\u3002
\u5982\u679c\u4e0d\u9700\u8981\u4ece\u547d\u4ee4\u884c\u4e2d\u83b7\u53d6\u53c2\u6570\uff0c\u8bf7\u7528int main(void)\uff1b\u5426\u5219\u8bf7\u7528int main(int argc,char*argv[])\u3002
main\u51fd\u6570\u7684\u8fd4\u56de\u503c\u7c7b\u578b\u5fc5\u987b\u662fint\uff0c\u8fd9\u6837\u8fd4\u56de\u503c\u624d\u80fd\u4f20\u9012\u7ed9\u7a0b\u5e8f\u7684\u6fc0\u6d3b\u8005\uff08\u5982\u64cd\u4f5c\u7cfb\u7edf\uff09\u3002
\u5982\u679cmain\u51fd\u6570\u7684\u6700\u540e\u6ca1\u6709\u5199return\u8bed\u53e5\u7684\u8bdd\uff0cC99\u89c4\u5b9a\u7f16\u8bd1\u5668\u8981\u81ea\u52a8\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\uff08\u5982exe\u6587\u4ef6\uff09\u52a0\u5165return 0;\uff0c\u8868\u793a\u7a0b\u5e8f\u6b63\u5e38\u9000\u51fa\u3002\u4e0d\u8fc7\uff0c\u6211\u8fd8\u662f\u5efa\u8bae\u4f60\u6700\u597d\u5728main\u51fd\u6570\u7684\u6700\u540e\u52a0\u4e0areturn\u8bed\u53e5\uff0c\u867d\u7136\u6ca1\u6709\u8fd9\u4e2a\u5fc5\u8981\uff0c\u4f46\u8fd9\u662f\u4e00\u4e2a\u597d\u7684\u4e60\u60ef\u3002
\u6ce8\u610f\uff0cvc6\u4e0d\u4f1a\u5728\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\uff0c\u5927\u6982\u662f\u56e0\u4e3avc6\u662f98\u5e74\u7684\u4ea7\u54c1\uff0c\u6240\u4ee5\u624d\u4e0d\u652f\u6301\u8fd9\u4e2a\u7279\u6027\u3002\u73b0\u5728\u660e\u767d\u6211\u4e3a\u4ec0\u4e48\u5efa\u8bae\u4f60\u6700\u597d\u52a0\u4e0areturn\u8bed\u53e5\u4e86\u5427\uff01\u4e0d\u8fc7\uff0cgcc3.2\uff08Linux\u4e0b\u7684C\u7f16\u8bd1\u5668\uff09\u4f1a\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\u3002
2\u3001C++
C++98\u4e2d\u5b9a\u4e49\u4e86\u5982\u4e0b\u4e24\u79cdmain\u51fd\u6570\u7684\u5b9a\u4e49\u65b9\u5f0f\uff1a
int main()
int main(int argc,char*argv[])
int main()\u7b49\u540c\u4e8eC99\u4e2d\u7684int main(void)\uff1bint main(int argc,char*argv[])\u7684\u7528\u6cd5\u4e5f\u548cC99\u4e2d\u5b9a\u4e49\u7684\u4e00\u6837\u3002\u540c\u6837\uff0cmain\u51fd\u6570\u7684\u8fd4\u56de\u503c\u7c7b\u578b\u4e5f\u5fc5\u987b\u662fint\u3002
\u5982\u679cmain\u51fd\u6570\u7684\u672b\u5c3e\u6ca1\u5199return\u8bed\u53e5\uff0cC++98\u89c4\u5b9a\u7f16\u8bd1\u5668\u8981\u81ea\u52a8\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\u3002\u540c\u6837\uff0cvc6\u4e5f\u4e0d\u652f\u6301\u8fd9\u4e2a\u7279\u6027\uff0c\u4f46\u662fg++3.2\uff08Linux\u4e0b\u7684C++\u7f16\u8bd1\u5668\uff09\u652f\u6301\u3002
\uff03include\uff02stdio\uff0eh\uff02
intmain\uff08\uff09
\uff5b
inti\uff1b
floatmax\uff0cmin\uff0cnum\uff3b10\uff3d\uff1b
printf\uff08\uff02\u8bf7\u8f93\u516510\u4e2a\u6570\uff0c\u6bcf\u8f93\u5165\u4e00\u4e2a\u6570\u6309\u56de\u8f66\u952e\u7ed3\u675f\uff1a\uff3cn\uff02\uff09\uff1b
for\uff08i\uff1d0\uff1bi\uff1c10\uff1bi\uff0b\uff0b\uff09
\uff5b
scanf\uff08\uff02\uff05f\uff02\uff0c\uff06num\uff3bi\uff3d\uff09\uff1b
\uff5d
max\uff1dmin\uff1dnum\uff3b0\uff3d\uff1b
for\uff08i\uff1d1\uff1bi\uff1c10\uff1bi\uff0b\uff0b\uff09
\uff5b
if\uff08max\uff1cnum\uff3bi\uff3d\uff09
max\uff1dnum\uff3bi\uff3d\uff1b
elseif\uff08min\uff1enum\uff3bi\uff3d\uff09
min\uff1dnum\uff3bi\uff3d\uff1b
\uff5d
printf\uff08\uff02\u6700\u5927\u4e3a\uff1a\uff05f\uff3cn\u6700\u5c0f\u4e3a\uff1a\uff05f\uff3cn\uff02\uff0cmax\uff0cmin\uff09\uff1b
return0\uff1b
\uff5d
\u8fd0\u884c\u6548\u679c\uff1a
\u6269\u5c55\u8d44\u6599\uff1areturn\u7528\u6cd5\uff1a
\u5728C++\u7684\u5173\u952e\u5b57\uff0c\u5b83\u63d0\u4f9b\u4e86\u7ec8\u6b62\u51fd\u6570\u6267\u884c\u7684\u4e00\u79cd\u65b9\u5f0f\u3002\u5f53return\u8bed\u53e5\u63d0\u4f9b\u4e86\u4e00\u4e2a\u503c\u65f6\uff0c\u8fd9\u4e2a\u503c\u5c31\u6210\u4e3a\u51fd\u6570\u7684\u8fd4\u56de\u503c.
1\u3001C
\u5728C89\u4e2d\uff0cmain()\u662f\u53ef\u4ee5\u63a5\u53d7\u7684\u3002Brian W.Kernighan\u548cDennis M.Ritchie\u7684\u7ecf\u5178\u5de8\u8457The C programming Language 2e\uff08\u300aC\u7a0b\u5e8f\u8bbe\u8ba1\u8bed\u8a00\u7b2c\u4e8c\u7248\u300b\uff09\u7528\u7684\u5c31\u662fmain()\u3002\u4e0d\u8fc7\u5728\u6700\u65b0\u7684C99\u6807\u51c6\u4e2d\uff0c\u53ea\u6709\u4ee5\u4e0b\u4e24\u79cd\u5b9a\u4e49\u65b9\u5f0f\u662f\u6b63\u786e\u7684\uff1a
int main(void)
int main(int argc,char*argv[])
\u5f53\u7136\uff0c\u6211\u4e5f\u53ef\u4ee5\u505a\u4e00\u70b9\u5c0f\u5c0f\u7684\u6539\u52a8\u3002\u4f8b\u5982\uff1achar*argv[]\u53ef\u4ee5\u5199\u6210char**argv\uff1bargv\u548cargc\u53ef\u4ee5\u6539\u6210\u522b\u7684\u53d8\u91cf\u540d\uff08\u5982intval\u548ccharval\uff09\uff0c\u4e0d\u8fc7\u4e00\u5b9a\u8981\u7b26\u5408\u53d8\u91cf\u7684\u547d\u540d\u89c4\u5219\u3002
\u5982\u679c\u4e0d\u9700\u8981\u4ece\u547d\u4ee4\u884c\u4e2d\u83b7\u53d6\u53c2\u6570\uff0c\u8bf7\u7528int main(void)\uff1b\u5426\u5219\u8bf7\u7528int main(int argc,char*argv[])\u3002
main\u51fd\u6570\u7684\u8fd4\u56de\u503c\u7c7b\u578b\u5fc5\u987b\u662fint\uff0c\u8fd9\u6837\u8fd4\u56de\u503c\u624d\u80fd\u4f20\u9012\u7ed9\u7a0b\u5e8f\u7684\u6fc0\u6d3b\u8005\uff08\u5982\u64cd\u4f5c\u7cfb\u7edf\uff09\u3002
\u5982\u679cmain\u51fd\u6570\u7684\u6700\u540e\u6ca1\u6709\u5199return\u8bed\u53e5\u7684\u8bdd\uff0cC99\u89c4\u5b9a\u7f16\u8bd1\u5668\u8981\u81ea\u52a8\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\uff08\u5982exe\u6587\u4ef6\uff09\u52a0\u5165return 0;\uff0c\u8868\u793a\u7a0b\u5e8f\u6b63\u5e38\u9000\u51fa\u3002\u4e0d\u8fc7\uff0c\u6211\u8fd8\u662f\u5efa\u8bae\u4f60\u6700\u597d\u5728main\u51fd\u6570\u7684\u6700\u540e\u52a0\u4e0areturn\u8bed\u53e5\uff0c\u867d\u7136\u6ca1\u6709\u8fd9\u4e2a\u5fc5\u8981\uff0c\u4f46\u8fd9\u662f\u4e00\u4e2a\u597d\u7684\u4e60\u60ef\u3002
\u6ce8\u610f\uff0cvc6\u4e0d\u4f1a\u5728\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\uff0c\u5927\u6982\u662f\u56e0\u4e3avc6\u662f98\u5e74\u7684\u4ea7\u54c1\uff0c\u6240\u4ee5\u624d\u4e0d\u652f\u6301\u8fd9\u4e2a\u7279\u6027\u3002\u73b0\u5728\u660e\u767d\u6211\u4e3a\u4ec0\u4e48\u5efa\u8bae\u4f60\u6700\u597d\u52a0\u4e0areturn\u8bed\u53e5\u4e86\u5427\uff01\u4e0d\u8fc7\uff0cgcc3.2\uff08Linux\u4e0b\u7684C\u7f16\u8bd1\u5668\uff09\u4f1a\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\u3002
2\u3001C++
C++98\u4e2d\u5b9a\u4e49\u4e86\u5982\u4e0b\u4e24\u79cdmain\u51fd\u6570\u7684\u5b9a\u4e49\u65b9\u5f0f\uff1a
int main()
int main(int argc,char*argv[])
int main()\u7b49\u540c\u4e8eC99\u4e2d\u7684int main(void)\uff1bint main(int argc,char*argv[])\u7684\u7528\u6cd5\u4e5f\u548cC99\u4e2d\u5b9a\u4e49\u7684\u4e00\u6837\u3002\u540c\u6837\uff0cmain\u51fd\u6570\u7684\u8fd4\u56de\u503c\u7c7b\u578b\u4e5f\u5fc5\u987b\u662fint\u3002
\u5982\u679cmain\u51fd\u6570\u7684\u672b\u5c3e\u6ca1\u5199return\u8bed\u53e5\uff0cC++98\u89c4\u5b9a\u7f16\u8bd1\u5668\u8981\u81ea\u52a8\u5728\u751f\u6210\u7684\u76ee\u6807\u6587\u4ef6\u4e2d\u52a0\u5165return 0;\u3002\u540c\u6837\uff0cvc6\u4e5f\u4e0d\u652f\u6301\u8fd9\u4e2a\u7279\u6027\uff0c\u4f46\u662fg++3.2\uff08Linux\u4e0b\u7684C++\u7f16\u8bd1\u5668\uff09\u652f\u6301\u3002
代码文本：
#include "stdio.h"
#define N 10
double getave(int *p,int n){
int i,a,b,s;
for(a=b=p[s=i=0];i<N;s+=p[i++])
if(a>p[i])
a=p[i];
else if(b<p[i])
b=p[i];
return (s-a-b)/(N-2.0);
}
int main(int argc,char *argv[]){
int a[N],i;
printf("Please enter %d integers...
",N);
for(i=0;i<N;i++)
if(scanf("%d",a+i)!=1 || a[i]<1 || a[i]>99){
printf("Error, enter again the %d data...
",N);
fflush(stdin);
i=0;
}
printf("The AVE are %.2f
",getave(a,N));
return 0;
}
1.程序分析：我们想办法把最小的数放到x上，先将x与y进行比较，如果x>y则将x与y的值进行交换，然后再用x与z进行比较，如果x>z则将x与z的值进行交换，这样能使x最小。 2.程序源代码： main() { int x,y,z,t; scanf("%d%d%d",&x,&y,&z); if (x>y) {t=x;x=y;y=t;} /*交换x,y的值*/ if(x>z) {t=z;z=x;x=t;}/*交换x,z的值*/ if(y>z) {t=y;y=z;z=t;}/*交换z,y的值*/ printf("small to big: %d %d %d\n",x,y,z); } 你可以根据这个按照自己的思路重新写下。
绛旓細1銆佹墦寮杞欢杩涘叆椤甸潰锛岀偣鍑绘枃浠-鏂板缓-鏂囦欢-C++ Source File銆2銆佽緭鍏ラ澶勭悊鍛戒护鍜屼富鍑芥暟锛#include<stdio.h>/*杈撳叆杈撳嚭澶存枃浠*/void main()/*绌虹被鍨嬶細涓诲嚱鏁*/銆3銆佸畾涔夊彉閲忓拰鏁扮粍鐨勬暟鎹杈撳叆10涓鏁帮細int a[10],i,t;/*瀹氫箟鍙橀噺鍜屾暟缁勬暟鎹被鍨嬩负鏁村瀷*/printf("杈撳叆10涓暣鏁帮細");/*杈撳嚭鏂囧瓧鎻...
绛旓細include<stdio.h> int main(){ int i,j,a[10],t;printf("杈撳叆鏁");for (i = 0; i < 10; i++)scanf("%d",&a[i]);for (i = 0; i < 10; i++){ for (j = i + 1; j < 10;j++)if (a[i] < a[j]){ t = a[i];a[i] = a[j];a[j] = t;} } print...
绛旓細void main(){ int a[10];for(int i=0;i<10;++i ){ printf("璇杈撳叆绗%d涓:",i);scanf("%d",&a[i]);} int max = a[0];int min = a[0];for( int j=1;j<10;++j ){ if( max < a[j] )max = a[j];if( min > a[j] )min = a[j];} printf("鏈澶у间笌鏈灏...
绛旓細杈撳嚭鎺掑簭鍚庣殑鏁存暟,鏁板拰鏁颁箣闂存湁涓涓┖鏍笺傛眰澶х #include<stdio.h> int main() { int a[10]; int i,t,j,m; for(i=0;i<=9;i++) { scanf("%d ",&a[i]); } for(i=0;i<9;i++) { t=i; for(j=i+1;j<=9;j++) if(a[t]<a[j]) t=j; ... 灞曞紑 鍞埍Daffodils | 娴忚127...
绛旓細鎬濊矾锛氬畾涔変竴涓嚱鏁癷nt fun(int a[])锛岃鍑芥暟閫氳繃浼犻掔殑鍙傛暟鏁扮粍渚濇閬嶅巻锛屽鎵炬渶澶у硷紝鏈鍚庤繑鍥炴渶澶у硷紝涓诲嚱鏁杈撳叆鏁扮粍锛岃皟鐢ㄨ鍑芥暟杈撳嚭鏈澶у笺傚弬鑰冧唬鐮侊細include<stdio.h>#define n 10int fun(int a[]){//姹傛暟缁刟鐨勬渶澶у煎嚱鏁癷nt i,max=a[0];for(i=1;i<n;i++)if(max<a[i]) ...
绛旓細1銆侀鍏堟墦寮c璇█缂栬緫鍣紝鏂板缓涓涓C璇█鐨勬枃浠讹紝鏂囦欢涓紩鍏璇█鐨勫ご鏂囦欢锛屾柊寤轰竴涓猰ain鍑芥暟锛屽嚱鏁颁腑璁剧疆涓涓10涓鍏冪礌鐨勬暟缁勪互鍙婁竴涓敤鏉ユ眰鍜岀殑鍙橀噺锛2銆佷箣鍚鐢ㄤ竴涓猣or寰幆閬嶅巻鏁扮粍锛屾瘡娆￠兘浠巗canf涓彇鍒扮敤鎴杈撳叆鐨勬暟骞跺瓨鍏ユ暟缁勪腑锛屽瓨瀹屽悗鍐嶇敤sum鍔犺繖涓暟锛屽姝や究鑳芥眰鍑烘暟缁勫唴鍏冪礌鐨勫拰浜嗭細3銆佹渶鍚...
绛旓細鍦C璇█缂栫▼涓紝瑕佸疄鐜浠庨敭鐩樿緭鍏10涓瀛︾敓鐨勬垚缁╁苟鎸夐珮鍒嗗埌浣庡垎杩涜鎺掑簭锛屽彲浠ヤ娇鐢ㄧ粡鍏哥殑鍐掓场鎺掑簭绠楁硶銆備笅闈㈡槸涓涓畝鍖栫殑姝ラ鎻忚堪锛氶鍏堬紝鍖呭惈蹇呰鐨勫ご鏂囦欢骞跺畾涔夋暟缁勫ぇ灏忥細鍒╃敤C璇█锛屾垜浠彲浠ヤ娇鐢ㄥ啋娉℃帓搴忕畻娉曡交鏉捐В鍐宠繖涓棶棰樸傚紑濮嬫椂锛岄渶瑕佸寘鍚紝骞惰瀹氫竴涓暟缁勫ぇ灏忥紝渚嬪#defineSIZE11銆傛帴鐫锛屽畾涔変竴涓...
绛旓細*max<*s)max=s;swap(p,max);sort(p+1,q);} void swap(int *x,int *y){ int temp;temp=*x;x=*y;y=temp;} void main(){ int i,array[10];for(i=0;i<10;i++)scanf("%d",&array[i]);sort(array,array+9);for(i=0;i<10;i++)printf("%d ",*(array+i));} ...
绛旓細cout << "杈撳叆10涓鏁:";for (i = 0; i < 10; i++){ cout << "璇疯緭鍏ョ" << i+1 << "鍚嶅鐢熺殑鎴愮哗锛" << endl;cin >> s[i];} for (i = 0; i<10; i++){ for (j = 0; j<9 - i; j++)if (s[j]<s[j + 1]){ t = s[j + 1];s[j + 1] = s[...
绛旓細姣旇緝绠鍗曠殑鏂规硶鏄垱寤轰竴涓暟缁 浠庝笅鏍囦负9寮濮嬮掑噺杩涜杈撳叆鑷充笅鏍囦负0 杩欐牱瀛樺偍灏变細鏄掑簭鐨勪簡 鐒跺悗鍐嶄粠涓嬫爣涓0寮濮嬮掑杈撳嚭鍒颁笅鏍囦负9 鍙︿竴绉嶆柟娉曟槸鍒涘缓涓や釜鏁扮粍 姣斿a鍜宐锛屽厛椤哄簭鍦板皢10涓鏁版嵁瀛樺偍鍦╝閲 鐒跺悗閫氳繃涓涓惊鐜潵灏嗘暟鎹嗗簭瀛樺偍鍦ㄦ暟缁刡閲 杩欐牱鏁扮粍b閲屽氨鏄嗗簭瀛樺偍鐨勪簡 鏈鍚庨『搴忚緭鍑烘暟缁刡 ...
