P2911 [USACO08OCT]Bovine Bones G

#include<bits/stdc++.h>
using namespace std;

int sum[100];

int main() {
	int s1, s2, s3;
	cin >> s1 >> s2 >> s3;
	int ans = 0;
	for (int i = 1; i <= s1; i++) {//每个数相加
		int temp = 0;//temp用来比较每个数字出现的次数
		for (int j = 1; j <= s2; j++) {
			for (int k = 1; k <= s3; k++) {
				sum[i + k + j]++;//i+j+k结果出现一次 那个下标所在的值+1
				if (sum[i + k + j] > temp) {//和temp相比 只看出现最多的
					temp = sum[i + k + j];
					ans = i + k + j;//出现次数最多时 用个ans记录那个数值
				}
			}
		}
	}
	cout << ans << endl;//输出出现概率最大的数值
	system("pause");
	return 0;
}

#include<bits/stdc++.h>
using namespace std;

int sum[100];

int main() {
	int s1, s2, s3;
	cin >> s1 >> s2 >> s3;
	int ans=0;
	int temp = 0;
	int max_ans = 0;
	for (int i = 1; i <= s1; i++) {
		for (int j = 1; j <= s2; j++) {
			for (int k = 1; k <= s3; k++) {
				ans = i + k + j;
				sum[ans]++;
			}
		}
	}
	for (int i = 3; i <= s1 + s2 + s3; i++) {
		if (sum[i] > max_ans) {
			max_ans = sum[i];
			temp = i;
		}
	}

	cout << temp << endl;
	system("pause");
	return 0;
}