杭电oj11页 （c++） 81-89

81、2081

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

int main()
{
	int m;
	string s;
	cin >> m;

	for (int i = 0; i < m; i++)
	{
		cin >> s;
		cout << "6" << s.substr(6, 11) << endl;
		
	}

	return 0;
}

82、2082

#include<iostream>
#include<string>
using namespace std;
int v[26]{0};

int sum=0;
void dfs(int n,int key)
{
	for (int i = n; i < 26&& key+i+1<=50; i++)
	{
		if (v[i])
		{
			v[i]--;
			sum++;
			dfs(i,key+i+1);
			v[i]++;
		}
	}
	return;
}
int main()
{
	int m;
	cin >> m;

	for (int i = 0; i < m; i++)
	{

		for (int j = 0; j < 26; j++)
		{
			cin >> v[j];
		}

		dfs(0,0);
		cout << sum << endl;
		sum = 0;
	}

	return 0;
}

83、2083

#include<iostream>
#include<cmath>
using namespace std;
int v[501]{0};



void quciksort(int a[],int left, int right)
{
	if (left > right)return;
	int i = left;
	int j = right;
	int begin = v[left];
	while (i != j)
	{
		while (v[j] >=begin&&i<j)j--;
		if (j > i)v[i] = v[j];
		while (v[i] <= begin && i < j)i++;
		if (j > i)v[j] = v[i];

	}
	v[i] = begin;
	quciksort(a,left, i - 1);
	quciksort(a,i + 1, right);



}
int main()
{
	int m;
	cin >> m;
	int n;
	for (int i = 0; i < m; i++)
	{
		cin >> n;
		for (int j = 0; j < n; j++)
		{
			cin >> v[j];
		}

		quciksort(v,0, n-1);
		int sum = 0;
		for (int p = 0; p < n; p++)
		{
			sum+= fabs(v[n / 2] - v[p]);
		}
		cout << sum << endl;
	}

	return 0;
}

84、2084

#include<iostream>
#include<cmath>
using namespace std;
int dp[110][110]{0};

void check()
{

}


int main()
{
	int m;
	cin >> m;
	int n;
	for (int i = 0; i < m; i++)
	{
		cin >> n;
		for (int j = 1; j < n+1; j++)
		{

		for (int p = 1; p <=j; p++) {
			cin >> dp[j][p];
		}
		}

		for (int i = n - 1; i > 0; i--)
		{
			for (int j = 1; j <=i; j++)
			{
				dp[i][j] = dp[i][j] + max(dp[i + 1][j], dp[i + 1][j + 1]);
			}
		}
		cout << dp[1][1] << endl;
	}

	return 0;
}

85、2085

#include<iostream>
#include<cmath>
using namespace std;
int dp[110][110]{0};

void check()
{

}


int main()
{
	int m;
	long long  a[34]{0};
	a[0] = 1;

	long long b[34]{0};
	while (cin >> m&&m!=-1)
	{
		for (int i = 1; i <=m; i++)
		{
			a[i] = a[i - 1] * 3 + b[i - 1]*2;
			b[i] = a[i - 1] + b[i - 1];
		}
		cout << a[m] << ", " << b[m] << endl;
	}
	return 0;
}

76、2076

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



int main()
{
	double A0;
	double An;
	double  A1;
	double m;
	double c;
	double s=0;
	while (cin >> m)
	{
		s = 0;
		cin >> A0;
		cin >> An;
		for (double i = 1; i <=m; i++)
		{
			cin >> c;
			s = s + (m - i + 1) * c;
		}
		A1 = (m * A0 + An - 2 * s)/(m+1);
		cout << fixed << setprecision(2) << A1 << endl;;
	}
	return 0;
}

87、2087

#include<iostream>
using namespace std;
int maxn = 1e3 + 5;
string s, c;

int main() {
    while (cin >> s && s != "#") {
        cin >> c;
        int index = 0;//用来存储不断更新最新找到的位置
        int sum = 0;//累加出现的次数
        while ((index = s.find(c, index)) != string::npos) {
            index += c.length();
            sum++;
        }
        cout << sum << endl;
    }
}

88、20878

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



int main() {
 
	int m;
	int a[52];
	int sum;
	int ave;
	int n;
	int count = 0;
	while (cin >> m&&m!=0)
	{
		if (count != 0)cout << endl;
		count++;
		n = 0;
		sum = 0;
		for (int i = 0; i < m; i++)
		{
			cin >> a[i];
			sum = sum + a[i];
		}
		ave = sum / m;
		for (int j = 0; j < m; j++)
		{
			if (a[j] > ave)
			{
				n +=a[j]-ave;
			}
		}
		cout << n << endl;
	}
		
}

89、2089

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


int  check(int k)
{
	while (k != 0)
	{
		if (k % 10 == 4 || k % 100 == 62)return 1;
		k = k / 10;
	}
	return 0;
}

int main() {
 
	int m;
	int n;
	int sum;
	while (cin >> m >> n&&m!=0&&n!=0)
	{
		sum = 0;
		for (int i = m; i <=n; i++)
		{
			if (check(i) == 1)
			{
				sum++;
			}
		}
		cout << n-m+1-sum << endl;
	}
		
}