64,662
社区成员
发帖
与我相关
我的任务
分享
#include <iostream>
#include <time.h>
#include <stdlib.h>
using namespace std;
int fmax(int (*p)[10],int row)
{
int max = **p;
for(int i = 0;i != row;i++)
{
for(int j = 0;j != 10;j++)
{
if(max < *p[j])
{
//cout << *p[j] << " ";
max = *p[j];
}
}
p++;
}
return max;
}
int main()
{
const int m = 5,n = 10;
int iarray[m][n];
srand((unsigned int)(time(NULL)));
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
// srand((unsigned int)(time(NULL)));
iarray[i][j] = rand()%50;
}
}
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
if(j == 9)
cout << iarray[i][j] << endl;
else
cout << iarray[i][j] << " ";
}
}
int maxvalue = fmax(iarray,m);//---->>输入结果大相径庭
cout << maxvalue << endl;
return 0;
}
#include <iostream>
#include <time.h>
using namespace std;
int fmax(int (*p)[10], int row)
{
int max = **p;
for(int i = 0; i != row; i++)
{
for(int j = 0; j != 10; j++)
{
if(max < (*p)[j])
{
max = (*p)[j];
}
}
++p;
}
return max;
}
int main()
{
const int m = 5,n = 10;
int iarray[m][n];
srand((unsigned int)(time(NULL)));
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
// srand((unsigned int)(time(NULL)));
iarray[i][j] = rand()%50;
}
}
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
if(j == 9)
cout << iarray[i][j] << endl;
else
cout << iarray[i][j] << " ";
}
}
int maxvalue = fmax(iarray, m);//---->>输入结果大相径庭
cout << maxvalue << endl;
return 0;
}
#include <iostream>
#include <time.h>
using namespace std;
int fmax(int (*p)[10], int row)
{
int max = **p;
for(int i = 0; i != row; i++)
{
for(int j = 0; j != 10; j++)
{
if(max < p[i][j])
{
max = p[i][j];
}
}
}
return max;
}
int main()
{
const int m = 5,n = 10;
int iarray[m][n];
srand((unsigned int)(time(NULL)));
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
// srand((unsigned int)(time(NULL)));
iarray[i][j] = rand()%50;
}
}
for(int i = 0;i != m; i++)
{
for(int j = 0;j != n;j++ )
{
if(j == 9)
cout << iarray[i][j] << endl;
else
cout << iarray[i][j] << " ";
}
}
int maxvalue = fmax(iarray, m);//---->>输入结果大相径庭
cout << maxvalue << endl;
return 0;
}