c语言编程，一维数组，从数组中找数 C语言编程 求大神 从键盘输入一数，然后在一个整型一维数组a...
C\u8bed\u8a00\u7f16\u7a0b\uff0c\u4ece\u952e\u76d8\u8f93\u5165N\u4e2a\u6574\u6570\u5b58\u653e\u5728\u4e00\u7ef4\u6570\u7ec4A\u4e2d,\u67e5\u627eA\u6570\u7ec4\u4e2d\u5305\u4e0d\u5305\u62ec\u6570\u636eXint main()
{
int a[100],i,x,n;
printf("\u8bf7\u8f93\u5165\u6574\u6570\u4e2a\u6570")\uff1b
scanf("%d",n);
printf("\u8bf7\u8f93\u5165%d\u4e2a\u6574\u6570",n)\uff1b
for(i=0;i<n;i++)
scanf("%d",a[i]);
printf("\u8bf7\u8f93\u5165\u8981\u67e5\u8be2\u7684\u6570");
scanf("%d",x);
for(i=0;i<n;i++)
{
if(a[i] == x) break;
}
if(i<n)printf("\u6709\u6570\u636e%d",x);
else printf("\u6ca1\u6709\u6570\u636e%d",x);
return 0;
}
//1.cpp#includeint Pos(int *arr,int left,int right,int key){//\u5728\u95ed\u533a\u95f4[left,right]\u4e2d\u67e5\u627ekey int mid=(left+right)/2; if(key==arr[mid])return mid; else if(left==right)return -1; if(key<=arr[mid])return Pos(arr,left,mid,key); else return Pos(arr,mid+1,right,key);}int main(){ int arr[21]; int i; int key; int res for(i=1;i<=20;i++) {//\u9ed8\u8ba4\u6570\u7ec4\u5347\u5e8f\u6392\u5217 arr[i]=i*2; printf("%d ",arr[i]); } printf("\n"); printf("\u8bf7\u8f93\u5165\u8981\u67e5\u627e\u7684\u503c:"); scanf("%d",&key); res=Pos(arr,1,20,key); if(res==-1) printf("\u4e0d\u5b58\u5728\n"); else printf("\u4f4d\u7f6e:%d\n",res); return 0;}
#include <stdio.h>#define N 10
int main()
{
int arr[N];
int n;
int i;
int flag;
for (i = 0; i < N; i++)
{
printf("请输入第%d个元素", i + 1);
scanf("%d", &arr[i]);
}
while (1){
flag = 0;
printf("请输入要查找的n的值：");
scanf("%d", &n);
for (i = 0; i < N; i++)
{
if (arr[i] == n)
{
flag = 1;
printf("数组中存在与待查找的n（%d）相等的数组元素，其下标为：%d\n", n, i);
}
}
if (flag==0)
printf("未找到n\n");
}
}
绛旓細瑕佸厛缁欒緭鍏ョ殑姣忎竴涓暟瀛楃粰浜堝畠鐨勫湴鍧锛屼究浜庤闂紝鏈鍚庢嬁寰楀埌鐨勬暟璁＄畻鍑哄钩鍧囧艰緭鍑猴紝绋嬪簭灏缂栧啓瀹屾垚浜嗭細3銆佷唬鐮佸叏閮ㄧ紪鍐欐垚鍔熶箣鍚庣紪璇戣繍琛岋紝鍦ㄥ脊鍑虹殑杈撳叆闈㈡澘涓緭鍏ヤ换鎰5涓暣鏁帮紝鎸夊洖杞﹂敭锛屽嵆鍙緱鍑哄钩鍧囧硷紝浠ヤ笂灏辨槸鐢C璇█杈撳叆涓涓鏁扮粍锛鍏抽敭鐐规槸鏁扮粍鐨勮幏鍙栬鐢ㄦ寚閽堬細
绛旓細include <stdio.h> define M 5//鑷繁瀹氫箟鏁扮粍鐨勯暱搴 void main(){ int i,n=0,min;int a[M];printf("璇疯緭鍏%d涓暟锛岀敤绌烘牸闅斿紑:",M);for(i=0;i<5;i++)scanf("%d",&a[i]);min=a[0];for(i=1;i<M;i++)if(a[i]<=min){ min=a[i];} printf("杩欑粍鏁扮粍涓鏈灏忕殑鏁版槸...
绛旓細include <stdio.h>int Remove(int a[], int len);void print_arr(int a[], int n);int main(void){int a[] = {1, 2, 3, 4, 5};int l;if (l = Remove(a, 5))print_arr(a, l);return 0;}int Remove(int a[], int len){int i, j;ifor (i = 0, j = 0; i ...
绛旓細鍦c璇█涓锛屾棤娉曠洿鎺ヨ繑鍥炰竴涓鏁扮粍锛浣嗘槸鍙互閫氳繃杩斿洖瀵瑰簲绫诲瀷鎸囬拡鐨勬柟寮忥紝杩斿洖鏁扮粍銆傚湪澶у鏁版儏鍐典笅锛屼竴缁存暟缁鍜屼竴缁存寚閽堟槸鍙互閫氱敤鐨勩傛瘮濡傦紝瀹氫箟涓涓嚱鏁帮紝鐢宠涓瀹氶暱搴︾殑鏁村瀷鍔ㄦ佹暟缁勶紝鍏堕暱搴︾敤鍙傛暟浼犲叆锛屽苟灏嗙粨鏋滆繑鍥炪傚鍑洪敊锛岃繑鍥炵┖鎸囬拡null銆備唬鐮佸彲浠ュ啓鎴愬涓嬪舰寮忥細int *int_array_create(int n)//...
绛旓細include <stdio.h> define M 5//鑷繁瀹氫箟鏁扮粍鐨勯暱搴 void main(){ int i,n=0,min;int a[M];printf("璇疯緭鍏%d涓暟锛岀敤绌烘牸闅斿紑:",M);for(i=0;i<5;i++)scanf("%d",&a[i]);min=a[0];for(i=1;i<M;i++)if(a[i]<=min){ min=a[i];} printf("杩欑粍鏁扮粍涓鏈灏忕殑鏁版槸...
绛旓細include <stdio.h>#define N 10int main(){ int a[N]; int i,s=0; for(i=0;i<N;i++) scanf("%d",&a[i]); for(i = 1; i<N; i+=2) s+=a[i]; printf("%d\n", s); return 0;}
绛旓細//杈撳嚭鏈澶ф暟鍜屾暟缁勪笅鏍 printf("鏈澶ф暟涓猴細%d锛屾暟缁涓嬫爣涓猴細%d",max,maxi);return 0;} 绋嬪簭杩愯缁撴灉濡備笅锛氬弬鑰冭祫鏂欙細for寰幆閬嶅巻姹鏁扮粍涓鐨勬渶澶у兼槸鏈甯哥敤鐨勬柟娉曪紝浣嗚繕鏈変竴绉嶆柟娉曞氨鏄惊鐜摼琛ㄧ殑閬嶅巻锛涢鍏堥渶瑕佸垱寤烘暟鎹煙鍜屾寚閽堝煙锛屽洖鍒癿ian鍑芥暟涓紝鍒涘缓涓変釜鑺傜偣锛岀劧鍚庣敤澶磋妭鐐圭敵璇风┖闂达紝鍐嶈緭鍏...
绛旓細include "stdio.h"void main(){ int a[10];int i;double f = 0,num = 0;printf("杈撳叆鏁板硷細\n");for(i =0; i < 10; i++){ scanf("%d", &a[i]);} printf("杈撳嚭鏁板硷細\n");for( i = 0; i < 10; i++){ num += a[i];printf("%d ", a[i]);} f = num /...
绛旓細include<stdio.h> include<algorithm> using namespace std;define maxn 1000 int a[maxn];bool cmp ( int a, int b ) { return a > b;}int main(){ int i, n;printf ( "璇疯緭鍏ヨ鎺掑簭鐨勫厓绱犱釜鏁帮細" );scanf ( "%d", &n );printf ( "璇蜂緷娆¤緭鍏%d涓暟锛", n );for ( i ...
绛旓細include <stdio.h> include <stdlib.h> struct VALUE_INFO { int nValue;int nCount;struct VALUE_INFO *pNextInfo;};void main(){ unsigned short arr[] = {1, 2, 2, 4, 5, 6, 6, 6, 6, 7, 8, 8, 9};int MAX_SIZE = sizeof(arr) / sizeof(short);struct VALUE_INFO *p...
