36(2023.11.27)

36(2023.11.27)_第1张图片

#include
using namespace std;
int main()
{
	long n, m;
	cin >> n >> m;
	int arr[10] = {};
	for (int i = n;i <= m;i++)
	{
		for (int temp = i;temp;temp /= 10)
		{
			arr[temp % 10]++;
		}

	}
	for (int i = 0;i < 10;i++)
	{
		cout << arr[i] << " ";
	}
	system("pause");
	return 0;
}

 36(2023.11.27)_第2张图片

#include
using namespace std;
int main()
{
	int arr[101] = {};
	int n;
	int times=0;
	int number;
	cin >> n;
	for (int i = 0;i < n;i++)
	{
		cin >> number;
		arr[i] = number;
	}
	for (int i = 0;i < n;i++)
	{
		for (int j = 0;j < n;j++)
		{
			for (int q = 0;q < n;q++)
			{
				if ( arr[i] == arr[j] + arr[q]&&j!=q&&j!=i&&i!=q)
				{
					times++;
					q = n;
					j = n;
				}
			}
		}
	}
	cout << times << endl;
	system("pause");
	return 0;
}

36(2023.11.27)_第3张图片

#include
using namespace std;
int main()
{
	int n, m;
	int number;
	int result1;
	int result2 = 2700000000;
	int sum = 0;
	cin >> n >> m;
	int arr[3001] = {};
	for (int i = 0;i < n;i++)
	{
		cin >> number;
		arr[i] = number;
	}
	for (int i = 0;i < n - m+1;i++)
	{
		result1 = arr[i];
		for (int j = 1;j < m;j++)
		{
			result1 += arr[i + j];
		}
		if (result1 <= result2)
		{
			result2 = result1;
		}
	}
	cout << result2 << endl;

	system("pause");
	return 0;
}

 36(2023.11.27)_第4张图片

#include
using namespace std;
int main()
{
	int arr[81] = {};
	int a, b, c;
	cin >> a >> b >> c;
	int times;
	for (int i = 1;i <= a;i++)
	{
		for (int j = 1;j <= b;j++)
		{
			for (int q = 1;q <= c;q++)
			{
				times = i + j + q;
				arr[times]++;
			}
		}
	}
	int n=0;
	for (int i = 0;i < 80;i++)
	{
		if (arr[i + 1] > arr[i])
		{
			n = arr[i + 1];
		}
	}
	for (int i = 0;i < 80;i++)
	{
		if (arr[i] == n) 
		{
			cout << i<< endl;
			return 0;
		}
	}
	
	system("pause");
	return 0;
}

36(2023.11.27)_第5张图片

你可能感兴趣的:(算法,c++,数据结构)