问题描述
![](https://img-blog.csdnimg.cn/e6b695e25b78423686697ba4428f5dca.png)
说明/提示:
1 1 1 -> 3
1 2 1 -> 4
2 1 1 -> 4
2 2 1 -> 5
3 1 1 -> 5
3 2 1 -> 6
1 1 2 -> 4
1 2 2 -> 5
2 1 2 -> 5
2 2 2 -> 6
3 1 2 -> 6
3 2 2 -> 7
1 1 3 -> 5
1 2 3 -> 6
2 1 3 -> 6
2 2 3 -> 7
3 1 3 -> 7
3 2 3 -> 8
代码:
#include<stdio.h>
int main() {
int arr[21][21][41], sum[100], num = 0;
int x, y, z;
scanf("%d%d%d",&x,&y,&z);
for(int i = 1; i <= x; i++){
for(int j = 1; j <= y; j++){
for(int k = 1; k <= z; k++){
//arr[i][j][k] = i + j + k;
sum[i + j + k]++;
num++;
}
}
}
int ans = sum[3];
int i, j;
for(i = 4; i < 3+num; i++){
if(sum[i] > ans){
ans = sum[i];
j = i;
}
}
printf("%d",j);
return 0;
}
AC啦~