代码搜索:average

找到约 5,196 项符合「average」的源代码

代码结果 5,196
www.eeworm.com/read/126510/14418124

c 6.c

# define N 5 main( ) { int x , num[N+1] ; float st[N+1] , ave , sum=0; for (x=1 ; x
www.eeworm.com/read/126308/14433563

c query.c

/* 学生成绩查询系统 */ # include # include void main( ) { int select; int i, j; int score[5][7]; int average = 0; int sum = 0; do{ printf("本程序有4项功能:\n"); printf
www.eeworm.com/read/225696/14525011

c c05_01.c

#include int main() { int score[10]; int i; int average=0; printf("请输入10位同学的数学成绩:\n"); for(i=0; i
www.eeworm.com/read/124842/14533723

c report.c

/* * GENESIS Copyright (c) 1986, 1990 by John J. Grefenstette * This program may be freely copied for educational * and research purposes. All other rights reserved. * * file: report
www.eeworm.com/read/223835/14615950

c exam.c

#include int main () { float mark[10] = {45.6, 78.4, 65.9, 58.3, 82.1, 44.5, 61.8, 53.6, 49.2, 37.7}; int i; float sum = 0, average, highest = 0; for (i = 0; i < 10; i++) { sum +=
www.eeworm.com/read/223144/14653832

cpp 7_6.cpp

//7_6 #include void findMax(int a[][4], int row,int col); void findBad(int a[][4], int row,int col); void average(int a[][4], int row,int col); void main() { int array[5][4
www.eeworm.com/read/122316/14702589

c 6.c

# define N 5 main( ) { int x , num[N+1] ; float st[N+1] , ave , sum=0; for (x=1 ; x
www.eeworm.com/read/121515/14754986

cpp accum6.cpp

/* The following code example is taken from the book * "C++ Templates - The Complete Guide" * by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002 * * (C) Copyright David Vandevoorde
www.eeworm.com/read/121515/14755006

cpp accum1.cpp

/* The following code example is taken from the book * "C++ Templates - The Complete Guide" * by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002 * * (C) Copyright David Vandevoorde
www.eeworm.com/read/121515/14755021

cpp accum2.cpp

/* The following code example is taken from the book * "C++ Templates - The Complete Guide" * by David Vandevoorde and Nicolai M. Josuttis, Addison-Wesley, 2002 * * (C) Copyright David Vandevoorde