c语言：从键盘输入10个整数，存入数组a中，计算a中数据的平均值v，再在a中找出与v最接近的数及其下标。 C语言.由键盘输入10个整数存入数组a中，再任意输入一个整数...
c\u7a0b\u5e8f\uff0c\u4ece\u952e\u76d8\u8f93\u516510\u4e2a\u6574\u6570\uff0c\u5b58\u5165\u6570\u7ec4a\u4e2d\uff0c\u8ba1\u7b97a\u4e2d\u6570\u636e\u7684\u5e73\u5747\u503cv\uff0c\u518d\u5728a\u4e2d\u627e\u51fa\u4e0ev\u6700\u63a5\u8fd1\u7684\u6570\u53ca\u5176\u4e0b\u6807#include
#include
void main()
{
int a[10];
float b[10];
float sum=0;
for(int i=0;i<10;i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
sum/=10;
float min=32767;
int flag;
for(i=0;i<10;i++)
{
b[i]=abs(sum-a[i]);
if(min>b[i])
{
min=b[i];
flag=i;
}
}
printf("\u5e73\u5747\u503c\u4e3a \uff1a%f\n",sum);
printf("\u6700\u63a5\u8fd1\u7684\u6570\u4e3a\uff1a%d\n",a[flag]);
printf("\u4e0b\u6807\u4e3a\uff1a%d\n",flag);
}
\u8fd9\u6837\uff1a
#include
#define LEN 10
int main(void)
{
int a[LEN], i, k;
int same = 0;
puts("\u8bf7\u8f93\u516510\u4e2a\u6574\u6570\uff1a");
for(i=0; i<LEN; i++)
scanf("%d", &a[i]);
while(getchar() != '\n')
continue;
puts("\u518d\u8f93\u5165\u4e00\u4e2a\u6574\u6570k");
scanf("%d", &k);
for(i=0; i<LEN; i++)
{
if(k == a[i])
same++;
}
printf("k\u4e00\u5171\u51fa\u73b0%d\u6b21\u3002", same);
getchar();
return 0;
}
\u6269\u5c55\u8d44\u6599\uff1a\u6ce8\u610f\u4e8b\u9879
\u5faa\u73af\u8f93\u51fa1-100\u7684\u6240\u6709\u6574\u6570\uff0c\u7528\u6574\u6570%10\uff0c\u7b49\u4e8e9\uff0c\u5373\u6c42\u51fa\u4e86\u6240\u6709\u5404\u4f4d\u662f9\u7684\u4e2a\u6570\uff0c\u7528\u6574\u6570\u966410\uff0c\u5f97\u5230\u4e86\u6240\u6709\u5341\u4f4d\u662f9\u7684\u4e2a\u6570\uff0c\u6709\u4e00\u4e2a\u6570\u5b57\u6bd4\u8f83\u7279\u6b8a\uff0c99\u5e94\u8be5\u7b97\u4e24\u6b21\uff0c\u6240\u4ee5\uff0c\u5e94\u8be5\u7528\u4e24\u4e2a\u5224\u65ad\u8bed\u53e5\u8fdb\u884c\u5224\u65ad\u3002
#include
#include
#include
#include
int main() {
int i = 0;
int count = 0;//\u5b9a\u4e49\u4e00\u4e2a\u8bb0\u5f55\u6b21\u6570\u7684\u53d8\u91cf
for (i = 1; i <= 100; i++) {
if (i % 10 == 9) {
count++;//99\u8fdb\u6765\u4e00\u6b21count++
}
if (i / 10 == 9) {
++count;//99\u8fdb\u6765count++
}
}
printf("1-100\u4e2d\u51fa\u73b09\u7684\u6b21\u6570\u6709%d\u6b21\n", count);
system("pause");
return 0;
}
#include "stdio.h"
#include "math.h"
void main()
{
int a[10],i,j,min;
float b[10],sum=0,average;
printf("请输入10个整数:");
for (i=0; i<10; i++)
{
scanf("%d",&a[i]);
sum+=a[i];
}
average=sum/10;
printf("\n平均数为:%f",average);
for (i=0; i<10; i++)
b[i]=fabs((a[i]-average));
min = 0;
for (j=1; j<10; j++)
{
if (b[j] < b[min])
{
min = j;
}
}
printf("\n与平均数最相近的是数是:%d",a[min]);
printf("\n它是第%d个数",min);
}
#include<stdio.h>
#define N 10
main(){
int i,j,a[N],SUM=0;
int n1,n2,n,temp;
double ave=0;
printf("input 10 numbers:");
for(i=0;i<N;i++){
printf("\nNO.%d:",i+1);
scanf("%d",&a[i]);
SUM+=a[i];
}
for(i=0;i<N;i++)
for(j=i+1;j<N;j++)
if(a[i]>a[j]){temp=a[i];a[i]=a[j];a[j]=temp;}
while(N*a[i]>SUM) i--;
n1=N*a[i+1]-SUM;
n2=SUM-N*a[i];
n=n1>n2?i:(i+1);
ave=(double)SUM/N;
printf("\naverage is %f;\n最接近的数字是：%d",ave,n);
getch();
}
绛旓細C璇█浠庨敭鐩樿緭鍏浠绘剰鐨10涓暣鏁帮紝浠庝腑鎵惧嚭鏈澶у煎拰鏈灏忓肩殑鍏蜂綋姝ラ濡備笅锛1銆侀鍏堣緭鍏 include<stdio.h> int main(){ int arr[10] = {0};int i = 0;int max = 0;int min = 0;printf("璇杈撳叆10涓暣鏁锛");2銆佺劧鍚庤緭鍏 for (i = 0; i < sizeof(arr)/ sizeof(arr[0]); i+...
绛旓細c璇█浠庨敭鐩樿緭鍏10涓瀛︾敓鐨勬垚缁,璇曠粺璁″嚭浠栦滑鐨勬垚缁╂诲拰鍙婂钩鍧囧?} average = (float)(sum/0)锛沺rintf(鎬诲垎=%d锛屽钩鍧囧垎=%f\n锛宻um锛宎verage)锛泒 VC0涓嬭皟璇曢氳繃銆傜劧鍚庡湪寰幆璇彞澶栦娇鐢紙average=sum/10锛夋潵璁＄畻10涓暟鐨勫钩鍧囨暟銆傛寜鐓ч鐩殑瑕佹眰缂栧啓瀹屾簮浠ｇ爜涔嬪悗锛岀偣鍑烩滆繍琛屸濓紝寮瑰嚭杈撳叆椤甸潰涔嬪悗锛...
绛旓細//浠庨敭鐩樿緭鍏10涓暟瀛樺叆涓缁存暟缁勶紝姹傝繖10涓暟涓殑鏈澶у煎拰鏈灏忓煎苟杈撳嚭 intmain(){ inti;floatmax,min,num[10];printf("璇疯緭鍏10涓暟锛屾瘡杈撳叆涓涓暟鎸夊洖杞﹂敭缁撴潫:\n");for(i=0;i<10;i++){ scanf("%f",&num[i]);} max=min=num[0];for(i=1;i<10;i++){ if(max<num[i])...
绛旓細```c include <stdio.h> int main(){ int num[10];int i, odd_sum = 0, even_sum = 0;// 杈撳叆10涓暣鏁 printf("璇杈撳叆10涓暣鏁帮細\n");for(i=0;i<10;i++)scanf("%d",&num[i]);// 璁＄畻濂囨暟鍜屼笌鍋舵暟鍜 for(i=0;i<10;i++){ if(num[i]%2==0)even_sum += num[i...
绛旓細intmain锛堬級锝 inti锛沠loatmax锛宮in锛宯um锛10锛斤紱printf锛堬紓璇杈撳叆10涓鏁帮紝姣忚緭鍏ヤ竴涓暟鎸夊洖杞﹂敭缁撴潫锛氾技n锛傦級锛沠or锛坕锛0锛沬锛10锛沬锛嬶紜锛夛經 scanf锛堬紓锛協锛傦紝锛唍um锛籭锛斤級锛涳綕 max锛漨in锛漬um锛0锛斤紱for锛坕锛1锛沬锛10锛沬锛嬶紜锛夛經 if锛坢ax锛渘um锛籭锛斤級max锛漬um锛籭锛斤紱elseif锛坢in锛...
绛旓細1銆佹墦寮杞欢杩涘叆椤甸潰锛岀偣鍑绘枃浠-鏂板缓-鏂囦欢-C++ Source File銆2銆佽緭鍏ラ澶勭悊鍛戒护鍜屼富鍑芥暟锛#include<stdio.h>/*杈撳叆杈撳嚭澶存枃浠*/void main()/*绌虹被鍨嬶細涓诲嚱鏁*/銆3銆佸畾涔夊彉閲忓拰鏁扮粍鐨勬暟鎹緭鍏10涓暟锛歩nt a[10],i,t;/*瀹氫箟鍙橀噺鍜屾暟缁勬暟鎹被鍨嬩负鏁村瀷*/printf("杈撳叆10涓暣鏁帮細");/*杈撳嚭鏂囧瓧...
绛旓細绋嬪簭锛include<stdio.h> int main(){ int arr[10] = {0};int i = 0;int max = 0;int min = 0;printf("璇杈撳叆10涓暣鏁锛");for (i = 0; i < sizeof(arr)/ sizeof(arr[0]); i++){ scanf("%d",&arr[i]);} max = arr[0];for (i = 0; i < sizeof(arr) / ...
绛旓細for(loop = 1; loop < 10; loop++) { if( largest < array[loop] ) largest = array[loop]; } printf("鏈澶у厓绱犱负 %d", largest); return 0; } 2銆佹壘鍑烘渶灏忓煎苟杈撳嚭鐨勬簮浠ｇ爜濡備笅: #include <stdio.h> int main() { int array[10] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 0}; int...
绛旓細int main() { int i,a[10],max,maxi;//杈撳叆10涓暣鏁 for(i=0;i<10;i++){ scanf("%d",&a[i]);} //鍋囪鏁扮粍鐨勭1涓槸鏈澶ф暟max锛屽悓鏃惰缃渶澶у间笅鏍囦负0 max=a[0];maxi=0;//for寰幆渚濇鍒ゆ柇鍏舵槸鍚﹀ぇ浜庢渶澶ф暟锛屽鏋滃ぇ浜庢浛鎹㈡帀鏈澶у硷紝骞舵洿鏂版渶澶у间笅鏍 for(i=1;i<10;i++...
绛旓細include <stdio.h>int main(){int i,a[10];for(i=0;i<10;i++)scanf("%d",&a[i]);for(i=5;i<9;i++)a[i]=a[i+1];for(i=0;i<9;i++)printf("%d ",a[i]);return 0;}
