杭电oj11页 （c++） 20-30

20、2020

#include<iostream>
using namespace std;

int abs(int a)
{
	if (a < 0)
	{
		return -a;
	}
	else {
		return a;
	}
};

void sort(int  a[], int len)
{

	for (int i = 0; i < len - 1; i++)
	{
		for (int j = i + 1; j < len; j++)
		{
			if (abs(a[i]) < abs(a[j]))
			{
				int temp = a[i];
				a[i] = a[j];
				a[j] = temp;
			}
		}
	}

};

int main()
{
	int m;
	while (cin >> m&&m<=100&&m!=0)
	{
		int s[100];
		for (int i = 0; i < m; i++)
		{
			cin >> s[i];
		}
		sort(s,m);
		for (int i = 0; i < m; i++)
		{
			cout << s[i];
			if (i + 1 < m)
			{
				cout << " ";
			}
		}
		cout << endl;
	}

}

21、2021

#include<iostream>
using namespace std;

int count(int s)
{
	int sum=0;
	if (s >= 100)
	{
		sum=s / 100+ count(s % 100);
	}else if (s >=50)
	{
		sum = s / 50 + count(s % 50);
	}else if(s>=10)
	{ 
		sum = s / 10 + count(s % 10);
	}
	else if (s >= 5)
	{
		sum = s / 5 + count(s % 5);
	}
	else if (s >= 2)
	{
		sum = s / 2 + count(s % 2);
	}
	else if(s==1){
		sum = 1;
	}
	return sum;
}
int main()
{
	int m;
	while (cin >> m&&m<100&&m!=0)
	{
		int s[100];
		int sum = 0;
		for (int i = 0; i < m; i++)
		{
			cin >> s[i];
			if (s[i] == 0)
			{
				break;
			}
			sum = sum+count(s[i]);
			
		}
		cout << sum << endl;
	}

}

22、2022

#include<iostream>
using namespace std;

int abs(int s)
{
	if (s < 0)
	{
		return -s;
	}
	else
	{
		return s;
	}
}
int main()
{
	int m, n;
	while (cin >> m)
	{
		int a[100][100];
		cin.ignore();
		cin >> n;
		int maxm = 0, maxn = 0, max = 0;
		for (int i = 0; i < m; i++)
		{
			for (int j = 0; j <n; j++)
			{
				cin >> a[i][j];
				if (abs(a[i][j])> max)
				{
					max = abs(a[i][j]);
					maxn = j;
					maxm = i;
				}
			}
		}
		cout << maxm+1 << " " << maxn+1 << " " << a[maxm][maxn] << endl;
	}

}

23、2023

略

24、2024

#include<iostream>
#include<string>
using namespace std;

bool check(string s)
{
	if (s[0] >= '0' && s[0] <= '9')
	{
		return false;
	}
	for (int j = 0; j < s.length(); j++)
	{
		if (!(s[j] == '_' || s[j] <= '9' && s[j] >= '0' || s[j] >= 'a' && s[j] <= 'z' || s[j] >= 'A' && s[j] <= 'Z'))
		{
			return false;
		}
	}
	return true;
}

int main()
{
	int m;

	while (cin >> m)
	{
		cin.ignore();
		for (int i = 0; i < m; i++)
		{
			string s;
			getline(cin, s);
			if (check(s))
			{
				cout << "yes" << endl;
			}
			else {
				cout << "no" << endl;
			}
		}

	}
	return 0;
}

25、2025

#include<iostream>
#include<string>
using namespace std;

char  check(string s)
{
	char m='a';
	for (int i = 0; i < s.length(); i++)
	{
		if (s[i] > m)
		{
			m =s[i];
		}
	}
	return m;
}

int main()
{
	string s;

	while (getline(cin,s))
	{
		char m=check(s);
		for (int i = 0; i < s.length(); i++)
		{
			cout << s[i];
			if (s[i] == m)
			{
				cout << "(max)";
			}
		}
		cout << endl;
	}
	return 0;
}

26、2026

#include<iostream>
#include<string>
using namespace std;

string  check(string &s)
{
	if (s[0] >= 'a' && s[0] <= 'z')
	{
		s[0] = s[0]-32;
	}
	for (int i = 1; i < s.length(); i++)
	{
		if (s[i] !=' '&&s[i-1]==' '&& s[i] >= 'a' && s[i] <= 'z')
		{
			s[i] = s[i]-32;
		}
	}
	return s;
}

int main()
{
	string s;

	while (getline(cin,s))
	{
		if (s.length()> 100)
		{
			break;
		}
		s=check(s);
		cout << s << endl;
	}
	return 0;
}

27、2027

#include<iostream>
#include<string>
using namespace std;

int check(string s,int n)
{
	 int m[5] = { 0 };

	for (int i = 0; i < s.length(); i++)
	{
		switch (s[i])
		{
		case 'a':
			m[0]++;
			break;
		case 'e':
			m[1]++;
			break;
		case 'i':
			m[2]++;
			break;
		case 'o':
			m[3]++;
			break;
		case 'u':
			m[4]++;
			break;
		default:
			break;
		}
	}
	return m[n];
}

int main()
{
	int m;

	while (cin >> m)
	{
		string s;
		cin.ignore();
		for (int i = 0; i < m; i++)
		{
			getline(cin, s);
			if (s.length() > 100)
			{
				break;
			}

			cout << "a:" << check(s, 0) << endl;

			cout << "e:" << check(s, 1) << endl;
			cout << "i:" << check(s, 2) << endl;

			cout << "o:" << check(s, 3) << endl;

			cout << "u:" << check(s, 4) << endl;
			if (i + 1 < m)
			{
				cout << endl;
			}
		}

	}
	return 0;
}

28、2028

#include<iostream>
using namespace std;



int main()
{
	int m;
	while (cin >> m)
	{
		int s[100];
		int max = 0;
		for (int i = 0; i < m; i++)
		{
			cin >> s[i];
			max = (max < s[i]) ? s[i] : max;
		}

		while (1)
		{
			int key = 0;
			for (int i = 0; i < m; i++)
			{
				if (max % s[i] != 0)
				{
					key++;
				}
			}
			if (key == 0)
			{
				break;
			}
			max++;
		}
		cout << max << endl;
	}
}

29、2029

#include<iostream>
#include<string>
using namespace std;

bool check(string s)
{
	string es=s;
	for (int i = s.length()-1; i >=0; i--)
	{
		es[s.length() - i-1] = s[i];
	}
	for (int i = 0; i < s.length(); i++)
	{
		if (s[i] != es[i])
		{
			return false;
		}
	}
	return true;
};
int main()
{
	int m;
	while (cin >> m)
	{
		string s;
		cin.ignore();
		for (int i = 0; i < m; i++)
		{
			cin >> s;
			if (check(s)) {
				cout << "yes" << endl;
			}
			else {
				cout << "no" << endl;
			}
		}
	}
}

30、2030

#include<iostream>
#include<string>
using namespace std;

int check(string s)
{
	int m=0;
	for (int i = 0; s[i] != '\0'; i++)
	{
		if (s[i] < 0)
		{
			m++;
			i++;
		}
	}
	return m;
};
int main()
{
	int m;
	while (cin >> m)
	{
		string s;
		cin.ignore();
		for (int i = 0; i < m; i++)
		{
			getline(cin, s);
			cout << check(s) << endl;
		}
	}
}