c语言编程题：输入10个数存放在一个数组中，输入一个数存入x中，然后找出所有与x相同的元素的位置。 C语言编程：输入10个有序（由小到大）整数存入数组a，再输入...
C\u8bed\u8a00\u7f16\u7a0b\u9898\uff1a \u8f93\u5165 n(n<10) \u4e2a\u6574\u6570\uff0c\u5c06\u5b83\u4eec\u5b58\u5165\u6570\u7ec4 a \u4e2d\uff0c\u518d\u8f93\u5165\u4e00\u4e2a\u6574\u6570 x\uff0c\u7136\u540e\u5728\u6570\u7ec4 a \u4e2d\u67e5\u627e\u4e0e x\u6211\u81ea\u5df1\u5199\u7684\uff0c\u4f60\u53ef\u4ee5\u53c2\u8003\u4e00\u4e0b\uff0c\u6709\u95ee\u9898\u53ef\u4ee5\u7ed9\u6211\u7559\u8a00\uff0c\u6216\u76f4\u63a5Hi\u6211\u3002
#include
#define M 100
seqsrch(r, n) /*\u5728\u6570\u7ec4r\u4e2d\u67e5\u627e\u503c\u4e3an\u7684\u6570*/
{
int r[M]\uff0cint n;
{
int i;
for(i=0;i<M;i++)
if(r[i]==n)
{
printf\uff08"\u67e5\u627e\u6210\u529f\uff01\u5728\u6570\u7ec4\u4e2d\u7684\u5e8f\u53f7\u4e3a\uff1aa[%d]\n",i\uff09\uff1b
break;
}
if(i==M)
printf("\u6570\u7ec4\u4e2d\u6ca1\u6709\u6b64\u6570\uff01\n")\uff1b
}
}
main()
{
int a[10] x;
for(int i=0;i++;i<10)
{
scanf("%d",&a[i]);
}
printf("\u8f93\u5165\u8981\u67e5\u627e\u7684\u5143\u7d20:");
scanf("%d",&x);
seqsrch(a, x);
}
#include
#define Pi 3.1415926
int main()
{
int a[11],i,x;
printf("\u8bf7\u8f93\u516510\u4e2a\u7531\u5c0f\u5230\u5927\u7684\u6574\u6570:\n");
for(i=0;i<10;i++)
scanf("%d",&a[i]);
printf("\u8bf7\u8f93\u5165\u8981\u63d2\u5165\u7684\u6570:\n");
scanf("%d",&x);
for(i=9;i>=0&&a[i]>x;i--)
a[i+1]=a[i];
a[i+1]=x;
printf("\u63d2\u5165\u540e\u7684\u6570\u7ec4:\n");
for(i=0;i<11;i++)
printf("%d ",a[i]);
printf("\n");
getch();
return 0;
}
#include <stdio.h>
int main()
{
int y[10],x,i;
printf("input 10 int data\n");
for (i=0;i<10;i++) scanf("%d",&y[i]);
printf("input x \n");
scanf("%d",&x);
printf("locations:\n");
for (i=0;i<10;i++) if (y[i]==x)printf("%d ",i);
return 0;
}
例子：
input 10 int data
1 3 5 7 3 2 1 5 6 7
input x
5
locations:
2 7
#include <stdio.h>
int main()
{
int i,x,a[10];
for(i=0;i<10;i++)
scanf("%d",&a[i]);
scanf("%d",&x);
for(i=0;i<10;i++)
if(a[i]==x)
printf("%d ",i);
printf("\n");
return 0;
}
绛旓細include <stdio.h> int main(){ int grade[10];int i,j,x;float s=0.0;printf("璇杈撳叆10涓瀛︾敓鎴愮哗锛歕n");for(i=0;i<10;i++) //鎶婂鐢熸垚缁╂斁鍒版暟缁勪腑 { scanf("%d",&grade[i]);s+=grade[i]; //姹傛诲垎 } for(i=0;i<10;i++) //鎶婃暟缁勪粠灏忓埌澶ф帓搴 { for(j=...
绛旓細//寤鸿鍦╒C++6.0閲岄潰缂栬瘧#include <stdio.h>int main(){ int k = 0, sum = 0, max;int a[10];for(; k < 10; k ++){ scanf("%d", &a[k]);} max = a[0];for(k = 0; k < 10; k ++){ sum += a[k];if(a[k] > max){ max = a[k];} } printf("鏈澶у...
绛旓細n;} int main(){ int arr[100], n, numbers, x;printf("杈撳叆鏁扮粍鐨勫ぇ灏忥紙涓嶅ぇ浜100锛夛細 ");scanf("%d", &n);myout(arr, n);printf("杈撳叆瑕佸垹闄ょ殑鏁版嵁锛 ");scanf("%d", &x);numbers = delx(arr, n, x);printf("鍒犻櫎鍚庢暟缁勭殑鍏冪礌涓暟涓%d.\n", numbers);return 0;} ...
绛旓細C璇█杈撳叆鍗佷釜鏁鐨缂栫▼鏂规硶濡備笅锛1.棣栧厛闇瑕佸畾涔変竴涓暣鍨嬫暟缁勭┖闂达紝鍥犱负杩欓噷闇瑕佽緭鍏ュ崄涓暟锛屾墍浠ユ暟缁勭┖闂翠负10涓2.鎺ョ潃瀹氫箟涓涓渶澶у糓ax锛屽垵濮嬮粯璁ゅ间负0锛岃繖涓敤浜庡悗缁肩殑姣旇緝銆3.鎺ョ潃浣跨敤for寰幆锛屾潵杩炵画鎺ユ敹10涓暟瀛楃殑杈撳叆銆4.姣忔鎺ユ敹鍒颁竴涓暟鍚庯紝浣跨敤Max杩涜姣旇緝锛屽鏋滄瘮Max鍒欏皢Max鏇存柊涓烘洿...
绛旓細{ int a[10];int i,j,k;for(k=0;k<10;k++)cin>>a[k];for(i=0;i<9;i++)for(j=i+1;j<=9;j++)if(a[j-1]<=a[j]){b=a[j-1];a[j-1]=a[j];a[j]=b;} for(k=0;k<10;k++)cout<<a[k]<<endl;} 鏈鍩烘湰鐨勪竴涓畻娉曪紝鍐掓场鎺掑簭銆傚洜涓哄彧鏈10涓鏁版嵁锛屾墍浠ョ畻娉...
绛旓細include<stdio.h> main(){ int a[10],max,min,i,x,y;printf("璇杈撳叆10涓暟瀛楋細\n");for(i=0;i<10;i++)scanf("%d",&a[i]);max=a[0];min=a[0];for(i=0;i<10;i++){ if(a[i]>max){ max=a[i];x=i;} if(a[i]<min){ min=a[i];y=i;} } printf("max=%d...
绛旓細C璇█閫氳繃杈撳叆鍗佷釜鏁存暟鐒跺悗鍒嗗埆椤哄簭鍜岄嗗簭杈撳嚭鐨缂栫▼鎬濇兂鍜屾柟娉曞涓嬶細1.棣栧厛闇瑕佸畾涔変竴涓暣鍨嬫暟缁勭敤浜瀛樺偍杈撳叆鐨10涓暣鏁般傝繖閲屽畾涔変竴涓暟缁刟銆2.鐒跺悗鍒╃敤for寰幆锛屾帴鍙椾粠閿洏杈撳叆鐨10涓暣鏁般傝繖閲屼娇鐢╥浣滀负寰幆鐨勬父鏍囧彉閲忋3.杈撳叆瀹屾瘯鍚庯紝鍐嶆鍒╃敤for寰幆鏉ラ『搴忚緭鍑哄瓨鍌ㄥ湪鏁扮粍鐨勫崄涓暟銆傝繖閲屽悓鏍蜂娇鐢ㄥ眬閮...
绛旓細浠ヤ笅浠ｇ爜涓殑缁撴瀯浣撲腑鐨勬垚鍛橈紝浣犲彲浠ヨ嚜宸卞鍔狅細濡傛у埆锛屽勾榫勶紝鐝骇锛屾垚缁╃瓑銆绋嬪簭妗嗘灦閮芥槸涓鏍风殑銆俰nclude<stdio.h> define MAX_STD 10 struct student { char name[100];} ;//杈撳叆 void input(struct student *p){ for(int i=0;i<MAX_STD;i++){ printf("璇疯緭鍏ョ%d涓鐢熷鍚嶏細\n",i+...
绛旓細>0){ printf("%d,",a[i]);j++;} printf("\n");for(i=0;i<10;i++)if(a[i]<0){ printf("%d,",a[i]);n++;} printf("\n");for(i=0;i<10;i++)if(a[i]==0){ printf("%d,",a[i]);c++;} printf("鍏辫%d涓礋鏁帮紝%d涓暣鏁锛%d涓0",n,j,c);return 0;} ...
绛旓細include "stdio.h"main(){ int a[10],i,sum=0; //涓涓暟缁瀛樻斁10涓暟锛屽悎鏄痵um锛宨鏄櫘閫氬彉閲 printf("杈撳叆10涓暟");for(i=0;i<10;i++) //涓涓惊鐜紝浣夸綘鍙互杈撳叆10涓暟 scanf("%d",&a[i]);for(i=0;i<10;i++) //鍙堜竴涓惊鐜紝姣忓惊鐜竴娆★紝瀹炵幇涓や釜鏁扮殑涔嬪拰 sum=sum+...
