2023.3.21上机练习

#include<iostream>
#include<algorithm>
using namespace std;
int score[10000] = { 0 };
int main()
{
	int n;
	cin >> n;
	double sum = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> score[i];
		sum += score[i];
	}
	double avg = sum / n;
	sort(score, score + n);
	int max = score[n - 1];
	int min = score[0];
	cout << max << endl << min << endl;
	printf("%.2f", avg);
	return 0;
}

2.

#include<iostream>
using namespace std;
int main()
{
	long long int n;
	cin >> n;
	while (n)
	{
		cout << n << " ";
		n = n / 2;
	}
	return 0;
}

3.

#include<iostream>
#include<math.h>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int s[10000] = { 0 };
	int youxiu = 0;
	int jige = 0;
	for (int i = 0; i < n; i++)
	{
		cin >> s[i];
		if (s[i] >= 60 && s[i] < 85)
			jige++;
		if (s[i] >= 85)
		{
			jige++;
			youxiu++;
		}
	}
	float youxiulv = float(youxiu )* 100 / n;
	float jigelv = float(jige) * 100 / n;
	cout << round(jigelv) << "%" << endl;
	cout << round(youxiulv) << "%";
	return 0;
}

4.

#include<iostream>
#include<math.h>
using namespace std;
long long n, sum = 0, m = 123456789;
long long pow_num(long p) {
    int sum = 1;
    for (int i = 0; i < 8; i++) {
        sum = (sum * p) % m;
    }
    return sum;
}
int main()
{
    cin >> n;
    for (long long i = 1; i <= n; i++) {
        sum = (sum + pow_num(i)) % m;
    }
    printf("%lld", sum);
    return 0;
}

4.

#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
	char s[1001] = { 0 };
	gets(s);
	char str;
	int len = strlen(s);
	if (len == 1)
	{
		cout << s[0] << endl << len;
		return 0;
	}
	sort(s, s + len);
	int max = 1, count = 1;
	str = s[0];
	for (int i = 1; i < len; i++)
	{
		if (s[i] == s[i - 1])
			count++;
		else
			count = 1;
		if (count > max)
		{
			str = s[i];
			max = count;
		}
	}
	cout << str << endl << max;
	return 0;
}

5.

#include<iostream>
#include<cstring>
using namespace std;
int main()
{
	char s[1000] = { 0 };
	gets(s);
	int len = strlen(s);
	int bign = 0, smalln = 0, num = 0;
	for (int i = 0; i < len; i++)
	{
		if (s[i] >= 65 && s[i] <= 90)
			bign++;
		if (s[i] >= 97 && s[i] <= 122)
			smalln++;
		if (s[i] >= 48 && s[i] <= 57)
			num++;
	}
	cout << bign << endl << smalln << endl << num;
	return 0;
}

6.

#include<iostream>
#include<string>
using namespace std;
int main()
{
	string s;
	getline(cin, s);
	int len = s.length();
	int numz = 0, numo = 0, numj = 0;
	for (int i = 0; i < len; i++)
	{
		if (s[i] == 'Z')
			numz++;
		if (s[i] == 'O')
			numo++;
		if (s[i] == 'J')
			numj++;
	}
	while (numz || numo || numj)
	{
		if (numz > 0) {
			cout << 'Z';
			numz--;
		}
		if (numo > 0) {
			cout << 'O';
			numo--;
		}
		if (numj > 0) {
			cout << 'J';
			numj--;
		}
	}
	return 0;
}