Codeforces Round #513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2) A. Phone Numbers

题解

题目大意 给你一串数字 问你能拼凑出来多少“电话号码” 电话号码的要求是8开头的11位数字

数一下有多少个8 总长度/11和8个数取最小值即可

AC代码

#include <stdio.h>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

const int INF = 0x3f3f3f3f;

int main()
{
#ifdef LOCAL
	freopen("C:/input.txt", "r", stdin);
#endif
	int n, cnt = 0;
	cin >> n;
	getchar();
	for (int i = 0; i < n; i++)
	{
		char c;
		scanf("%c", &c);
		if (c == '8')
			cnt++;
	}
	cout << min(n / 11, cnt) << endl;

	return 0;
}