69,336
社区成员
发帖
与我相关
我的任务
分享
#include<stdio.h>
int main() {
int N, M;
scanf("%d %d", &N, &M);//N列,M行
int a[1000][100] = {0};
int i = 0;
int j = 0;
int b[100] = {0};
for (i = 0; i < M; i++) {
for (j = 0; j < N; j++) {
scanf("%d", &a[i][j]);//数据输入
}
}
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
b[i] += a[j][i];//b[i]为第i种月饼销量
}
}
int max = b[0];
for (i = 0; i < N; i++) //遍历数组,找出最大值
{
if (b[i] > max)max = b[i];
}
printf("%d\n", max);//输出最大值
int c = 0;
for (i = 0; i < N; i++) //求冠军是否唯一
{
if (b[i] == max)c++;
}
for (i = 0; i < N; i++) //输出冠军月饼编号
{
if (b[i] == max) {
printf("%d", i+1);
c--;
if (c > 0)printf(" ");
}
}
return 0;
}
#include <stdio.h>
int main()
{
int N, M, A[1000] = {0}, i, j, x = 0, p = 0;
scanf("%d%d", &N, &M);
while(M--)
for (i = 0; i < N; (A[i++] += j) > x ? x = A[p = i - 1] : 0) scanf("%d", &j);
printf("%d\n%d", x, p + 1);
while (++p < N) if (A[p] == x) printf(" %d", p + 1);
puts("");
return 0;
}
#include<stdio.h>
#include <stdlib.h>
int main()
{
int **mooncake, N, M, *amount;
int i, j;
int max, flag;
scanf("%d%d", &N, &M);
mooncake = (int **)malloc(sizeof(int *) * M);
if (!mooncake)
exit(0);
amount = (int *)malloc(sizeof(int) * N);
if (!amount)
exit(0);
for (i = 0; i < M; i++) {
mooncake[i] = (int *)malloc(sizeof(int) * N);
if (!mooncake[i])
exit(0);
}
for (i = 0; i < M; i++) {
for (j = 0; j < N; j++)
scanf("%d", &mooncake[i][j]);
}
max = -1;
for (i = 0; i < N; i++) {
amount[i] = 0;
for (j = 0; j < M; j++)
amount[i] += mooncake[j][i];
if (max < amount[i])
max = amount[i];
}
printf("%d\n", max);
flag = 0;
for (i = 0; i < N; i++) {
if (max == amount[i] && flag == 0) {
printf("%d", i+1);
flag = 1;
} else if (flag == 1) {
printf(" %d", i+1);
}
}
/*
int N, M;
scanf("%d %d", &N, &M);//N列,M行
int a[1000][100] = {0};
int i = 0;
int j = 0;
int b[100] = {0};
for (i = 0; i < M; i++) {
for (j = 0; j < N; j++) {
scanf("%d", &a[i][j]);//数据输入
}
}
for (i = 0; i < N; i++) {
for (j = 0; j < M; j++) {
b[i] += a[j][i];//b[i]为第i种月饼销量
}
}
int max = b[0];
for (i = 0; i < N; i++) //遍历数组,找出最大值
{
if (b[i] > max)max = b[i];
}
printf("%d\n", max);//输出最大值
int c = 0;
for (i = 0; i < N; i++) //求冠军是否唯一
{
if (b[i] == max)c++;
}
for (i = 0; i < N; i++) //输出冠军月饼编号
{
if (b[i] == max) {
printf("%d", i+1);
c--;
if (c > 0)printf(" ");
}
}
*/
return 0;
}