#include <iostream>
using namespace std;
const int monkeys = 3;
const int weekdays = 7;
double monkeyWeek[monkeys][weekdays];
double largest;
double least;
double average;
int index;
int dayCount;
double amount;
double amountEaten(double[] [weekdays], int);
double mostEaten (double[] [weekdays],int);
double leastEaten (double[][weekdays], int);
int main(){
cout << "Ch 7-4 Monkey " << endl;
cout << "Created by Aaron Roberts" << endl;
double mostBananas (double[] [weekdays],int);
double leastBananas (double[][weekdays],int);
//double bananaAverage (double[][weekdays], int);
}
double amountEaten(double array[] [weekdays], int){
cout << "Please enter the amount of food eaten per monkey per day." << endl;
double amount = array[0][0];
for (index = 0; index < monkeys; index++)
{
for (dayCount = 0; dayCount < weekdays; dayCount++)
{
cout << endl <<"Please enter the amount of pounds eaten by monkey"
<<(index +1)
<< endl << "for day " << (dayCount +1) << ": ";
cin >> monkeyWeek[monkeys] [weekdays] ;
if (monkeyWeek[monkeys] [weekdays] < 1)
cout << endl <<"Must feed positive amount" << endl;
}
}
}
double mostEaten( double array[] [weekdays], int size)
{
double largest = array[0][0];
for (int count = 0; count < size; count++)
{
for (int col = 0; col < count; col++)
{
if (array[count][weekdays] > largest)
largest = array[count][weekdays];
}
}
return largest;
}
double leastEaten(double array[] [weekdays], int size)
{
double least = array[0][0];
for (int count = 0; count < size; count++)
{
for (int col = 0; col < size; col++);
{
if (array[count][weekdays] < least)
least = array[count][weekdays];
}
}
return least;
} 这个项目需要利用一个2维数组来存储3只猴子在一周的7天中每天吃的磅食物。
创建一个函数来获取每只猴子在一周中的每一天吃的磅。创建第二个函数来确定通过数组来计算所有吃的钱的总数,然后计算一天吃的平均数。(有些人将其解释为对所有值求和,然后除以值的数量。其他人则将其解释为将每一天的值相加,并计算当天的平均值。因此,将有7行输出,而不只是1行。)
创建第三个函数来确定哪只猴子在哪一天吃的食物最少。还可以输出猴子当天吃的量。创建第四个函数来确定哪只猴子在一天中吃的食物最多。输出猴子数量、吃掉的磅和工作日。
我是c++的新手,被困住了,真的不知道如何完成这项工作。谢谢你的帮助,我真的很感激。
发布于 2012-11-08 09:13:02
你一直在做这种事情:
for (int count = 0; count < size; count++)
{
for (int col = 0; col < count; col++)
{
if (array[count][weekdays] > largest)
largest = array[count][weekdays];
}
}可以看到,您正在使用weekdays对数组进行索引。但是这个索引是无效的。它可能会对工作进行排序,但总是返回下一行的第一个元素(然后在最后一行上有更明确的未定义行为)。
我很确定你的意思是在这里用col代替weekdays。
正如WhozCraig在注释中指出的那样,您可能还需要遍历整个weekdays范围。下面是一个稍微修复过的循环:
for (int count = 0; count < size; count++)
{
for (int col = 0; col < weekdays; col++)
{
if (array[count][col] > largest)
largest = array[count][col];
}
}同样的,对于你做过的其他任何地方...
https://stackoverflow.com/questions/13280921
复制相似问题