text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
string s;
cin >> s;
long long i, a = 0, b = 0;
for (i = 0; i < n; i++) {
if (s[i] == '8')
a++;
else
b++;
}
long long c = n / 11;
if (a >= c)
cout << c;
else
cout << a;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int cnt = 0;
for (int k = 0; k < n; k++)
if (s[k] == '8') cnt++;
cout << min(cnt, n / 11);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0, k = 0;
cin >> n;
string s;
cin >> s;
k = n / 11;
for (int i = 0; i < n; i++)
if (s[i] == '8') cnt++;
cout << min(k, cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
int n, c;
c = 0;
string s;
cin >> n;
cin >> s;
if (n < 11) {
cout << "0" << endl;
} else {
for (int i = 0; i < s.length(); i++) {
if (s[i] == '8') {
c++;
}
}
if (c == 0) {
cout << "0" << endl;
} else {
if (c == 1)
cout << "1" << endl;
else {
for (int x = 1;; x++) {
if (n < 11 * x) {
if (c >= x - 1) {
cout << x - 1 << endl;
exit(0);
} else {
cout << c << endl;
exit(0);
}
}
}
}
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e2 + 10;
int n, m, rst;
int d[maxn][maxn];
int vis[maxn];
int main() {
int n;
scanf("%d", &n);
if (n < 11) {
cout << '0' << endl;
return 0;
}
string str;
cin >> str;
int cnt = 0;
for (int i = 0; i < str.size(); i++) {
vis[str[i] - '0']++;
}
while (vis[8]) {
vis[8]--;
n--;
if (n >= 10) cnt++, n -= 10;
}
printf("%d\n", cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c++;
}
}
cout << min(n / 11, c) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int e, f;
char s[222];
int main() {
ios::sync_with_stdio(0);
int n;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8')
e++;
else
f++;
}
int dap = 0;
for (int i = 1; i <= e; i++)
if (n - i >= 10 * i) dap = i;
printf("%d\n", dap);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios ::sync_with_stdio(0);
cin.tie(0);
long long int j = 0, n;
cin >> n;
string s;
cin >> s;
for (long long int i = 0; i <= n - 1; i++) {
if (s[i] == '8') {
j++;
}
}
n = n / 11;
if (n <= j) {
cout << n << endl;
} else
cout << j << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int maxPhone = n / 11;
int eight = 0;
for (auto& c : s)
if (c == '8') eight++;
printf("%d\n", min(maxPhone, eight));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, b = 0;
char c;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == '8') b++;
}
cout << min(b, n / 11) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int a = n / 11, d = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
d++;
}
}
cout << min(d, a);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string s;
cin >> s;
int c = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c++;
}
}
int ss = 0;
for (int i = c; i > 0; i--) {
if ((n >= (11 * i))) {
ss = i;
break;
}
}
cout << ss << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, ans;
string s;
int main() {
scanf("%d", &n);
cin >> s;
for (int i = 0; i < s.size(); ++i)
if (s[i] == '8') {
++ans;
}
if (s.size() / 11 < ans) {
ans = s.size() / 11;
}
printf("%d", ans);
return 0;
}
|
#include <bits/stdc++.h>
using LL = long long;
int main() {
int n;
scanf("%d", &n);
char s[100 + 5];
scanf("%s", s);
int cnt[10] = {};
for (int i = 0; i < n; ++i) cnt[s[i] - '0']++;
printf("%d\n", std::min(cnt[8], n / 11));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n, ans = 0;
cin >> n;
string s;
cin >> s;
for (long long i = 0; i < s.length(); i++) {
if (s[i] == '8') ans++;
}
cout << min(n / 11, ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c;
c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c += 1;
}
}
cout << min(n / 11, c);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l;
int cnt = 0;
cin >> l;
char num[11];
for (int i = 0; i < 11; i++) {
num[i] = 0;
}
char s[l + 1];
cin >> s;
int ar[10] = {0};
for (int i = 0; i < l; i++) {
ar[s[i] - 48]++;
}
while (l > 0) {
if (ar[8] > 0) {
ar[8]--;
l--;
if (l >= 10) {
cnt++;
l -= 10;
}
} else {
break;
}
}
cout << cnt;
return 0;
}
|
#include <bits/stdc++.h>
int main(void) {
int N;
int num[2] = {};
int result = 0;
char temp[101];
scanf("%d", &N);
scanf("%s", temp);
for (int i = 0; i < N; i++) {
if (temp[i] == '8')
num[0]++;
else
num[1]++;
}
while (num[0] >= 1 && num[0] + num[1] >= 11) {
num[0]--;
if (num[1] >= 10)
num[1] -= 10;
else {
num[0] -= 10 - num[1];
num[1] = 0;
}
result++;
}
printf("%d\n", result);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char S[105];
int main() {
int N, M, i, j, k, ans = 0;
scanf("%d", &N);
scanf("%s", S);
for (i = 0; i < N; i++) {
ans += ((S[i] - '0') == 8);
}
printf("%d\n", min(ans, N / 11));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0, size;
cin >> size;
char c;
vector<char> num;
for (int i = 0; i < size; i++) {
cin >> c;
num.push_back(c);
}
for (int i = 0; i < num.size(); i++) {
if (num[i] == '8') count++;
if ((size / 11) < count) count = (size / 11);
}
cout << count << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, c = 0;
cin >> n;
bool flag = false;
string s;
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '8') {
flag = true;
c++;
}
}
if (!flag)
cout << "0\n";
else
cout << min(c, n / 11) << "\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int tc = 1;
while (tc--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
inline int gi() {
int x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
char S[110];
int main() {
int n = gi(), s = 0;
scanf("%s", S + 1);
for (int i = 1; i <= n; ++i)
if (S[i] == '8') ++s;
printf("%d\n", std::min(s, n / 11));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
char str[110];
int main() {
scanf("%d %s", &n, str + 1);
for (int i = 1; i <= n; i++)
if (str[i] == '8') cnt++;
for (int i = cnt; i >= 1; i--)
if ((n - i) / 10 >= i) return !printf("%d\n", i);
puts("0");
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0;
char x[2];
scanf("%d", &a);
gets(x);
char s[a + 1];
gets(s);
if (a < 11)
printf("0");
else {
for (int i = 0; i < a; i++) {
if (s[i] == '8') c++;
}
if ((a / 11) <= c)
printf("%d\n", a / 11);
else
printf("%d", c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char S[11000];
int n, Ans;
inline int Min(register int A, register int B) { return A < B ? A : B; }
int main() {
scanf("%d%s", &n, S + 1);
for (register int i = 1; i <= n; i++) Ans += (S[i] == '8');
printf("%d\n", Min(n / 11, Ans));
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gcd(T a, T b) {
return b ? gcd(b, a % b) : a;
}
const double EPS = 1e-9;
const double PI = acos(-1.);
const int INF = 1e9;
const long long MOD = 1e9 + 7;
const int MAXN = 1e5 + 5;
char s[MAXN];
void solve() {
int n;
scanf("%d%s", &n, &s[0]);
int cnt8 = 0;
for (int i = (0); i < (int)(n); i++) {
if (s[i] == '8') {
cnt8++;
}
}
int ans = min(cnt8, n / 11);
printf("%d\n", ans);
}
int main() {
int t = 1;
while (t--) {
solve();
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, k, c = 0;
cin >> i;
char a[100];
for (k = 0; k < i; k++) {
cin >> a[k];
}
for (k = 0; k < i; k++) {
if (a[k] == '8') c++;
}
if (c >= i / 11) {
cout << i / 11 << endl;
} else if (c == 1 && i >= 11) {
cout << 1 << endl;
} else if (c == 2 && i >= 11) {
cout << 2 << endl;
} else if (c == 5 && i >= 11) {
cout << 5 << endl;
} else
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
char ch;
int main() {
scanf("%d", &n);
ch = getchar();
for (int i = 1; i <= n; ++i) {
ch = getchar();
if (ch == '8') cnt++;
}
printf("%d", min(cnt, n / 11));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n(0);
cin >> n;
string s;
cin >> s;
vector<int> v(10);
for (int i = 0; s[i]; i++) {
v[s[i] - '0']++;
}
long long rem = n / 11;
long long num = v[8];
if (v[8] == 0) {
cout << 0 << endl;
} else if (n < 11) {
cout << 0 << endl;
} else if (rem == num) {
cout << rem << endl;
} else if (num < rem) {
cout << num << endl;
} else if (rem < num) {
cout << rem << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long n;
cin >> n;
string s;
cin >> s;
long long arr[10] = {0};
for (long long i = 0; i < n; i++) {
arr[s[i] - '0']++;
}
long long v = arr[8];
long long sum = 0;
for (long long i = 0; i < 10; i++) {
if (i != 8) {
sum += arr[i];
}
}
long long x = sum / 10;
long long z = sum % 10;
if (v <= x) {
cout << v << "\n";
} else {
long long ans = x;
long long p = v - x;
if (p >= 11 - z) {
ans++;
p -= (11 - z);
}
ans += (p / 11);
cout << ans << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, c = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') c++;
}
cout << min(n / 11, c) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n;
char s[101];
int main() {
while (scanf("%d", &n) != EOF) {
int count = 0;
scanf("%s", s);
for (int i = 0; i < n; i++) {
if (s[i] == '8') count++;
}
int ans = n / 11;
cout << min(count, ans) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5 + 5;
int32_t main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
string s;
long long n;
cin >> n >> s;
long long c = count(s.begin(), s.end(), '8');
cout << (c < (n / 11) ? c : (n / 11));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
int num;
string y;
int x;
bool flag = false;
cin >> num;
cin >> y;
if (num < 11)
cout << "0" << endl;
else {
for (int j = 0; j < y.length(); j++) {
if (y.at(j) == '8') {
flag = true;
count++;
}
}
if (flag == false)
cout << "0" << endl;
else {
x = num / 11;
if (x < count)
cout << x << endl;
else
cout << count << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int main() {
int n;
cin >> n;
cin >> s;
int m = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == '8') m++;
cout << min(m, n / 11) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, k, cnt = 0;
string s;
cin >> t;
cin >> s;
k = ceil(t / 11);
for (int i = 0; i < t; i++) {
if (s[i] == '8') cnt++;
}
cout << min(k, cnt);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; ++i)
if (s[i] == '8') ++cnt;
int ret = 0;
for (int i = 1; i <= cnt; ++i)
if ((n - i) / 10 >= i) ret = i;
cout << ret << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string s;
int n, i, e = 0, t = 0, c = 0;
cin >> n >> s;
for (i = 0; i < n; i++)
if (s[i] == '8') e++;
cout << min(e, n / 11) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
const long long int MAXN = 1e6 + 1;
const long double PI = acos(-1);
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
;
int counter = 0;
for (int i = 0; i < (n); ++i) {
char x;
cin >> x;
if (x == '8') counter++;
}
cout << min(n / 11, counter);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int N;
char S[105];
int main() {
scanf("%d", &N);
scanf("%s", S);
int cnt = 0;
for (int i = 0; i < N; i++)
if (S[i] == '8') cnt++;
printf("%d", min(cnt, N / 11));
return 0;
}
|
#include <bits/stdc++.h>
long long cmpfunc(const void* a, const void* b) {
return (*(long long*)a - *(long long*)b);
}
int main(void) {
long long int test, i, j, n, count, flag = 0, o1 = 0, o2 = 0, b1, x, m, l,
max, sum2, min, f, c, r, o, sum1, sum = 0,
y;
char a[100000] = {0};
scanf("%lld%s", &n, a);
count = 0;
for (i = 0; i < n; i++) {
if (a[i] == '8') {
count++;
}
}
count = (count >= (n / 11)) ? n / 11 : count;
printf("%lld", count);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)(1e5 + 10);
bool isPowerOfTwo(long long int x) { return x && (!(x & (x - 1))); }
void solve() {
int n;
cin >> n;
string s;
cin >> s;
int cnte = 0;
for (int i = 0; i < n; i++) s[i] == '8' ? ++cnte : cnte;
if (cnte == 0) {
cout << 0 << endl;
return;
} else {
int div = n / 11;
cout << min(cnte, div) << endl;
return;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
long long int t;
t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, cnt = 0;
string s;
cin >> n;
cin >> s;
x = n / 11;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
cnt++;
}
if (cnt == x) {
break;
}
}
cout << min(x, cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, i, j, k, m, x;
void solve() {
cin >> n;
string a;
cin >> a;
for (i = 0; i < a.size(); i++) {
if (a[i] == '8') {
m++;
}
}
if (n < 11) {
cout << "0";
} else {
int count = 0;
cout << min(n / 11, m);
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
;
int T = 1;
while (T--) {
solve();
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, phNum, eCount = 0;
cin >> n;
string s;
cin >> s;
if (n > 10) {
for (int i = 0; s[i]; i++) {
if (s[i] == '8') {
eCount++;
}
}
if (eCount == 0) {
cout << 0 << endl;
return 0;
}
phNum = n / 11;
if (phNum > eCount) {
cout << eCount << endl;
} else {
cout << phNum << endl;
}
} else {
cout << 0 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c8 = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
c8++;
}
}
int a = n / 11;
cout << min(a, c8);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
string second;
cin >> n >> second;
int i;
int p = 0;
for (i = 0; i < n; i++) {
if (second[i] == '8') p++;
}
int m = (n - p) / 10;
if (p > m) {
cout << n / 11;
} else
cout << min(p, m);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
string str;
cin >> str;
int cnt[10];
memset(cnt, 0, sizeof cnt);
for (int i = 0; i < str.length(); i++) {
int p = str[i] - '0';
cnt[p]++;
}
int maxs = 0;
for (int i = 0; i <= cnt[8]; i++) {
int oth = i * 10;
int baki = n - i;
if (baki >= oth) maxs = max(maxs, i);
}
cout << maxs;
}
|
#include <bits/stdc++.h>
using namespace std;
int u[200];
int main() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) u[s[i] - '0']++;
cout << min(u[8], (n / 11)) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long ppow(long long a, long long b, long long mod) {
a %= mod;
long long ans = 1;
while (b) {
if (b & 1) ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
void ac() { cout << "YES" << endl; }
void wa() { cout << "NO" << endl; }
signed main() {
long long n;
cin >> n;
string s;
cin >> s;
long long ans = 0;
for (auto v : s) {
if (v == '8') {
ans++;
}
}
cout << min(ans, n / 11) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
float n;
cin >> n;
int x = 0;
string r;
cin >> r;
for (int i = 0; i < n; i++) {
if (r[i] == '8') x++;
}
int k = floor(n / 11);
cout << min(k, x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[105];
int main() {
int n;
cin >> n;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') cnt++;
}
int ans = min(cnt, n / 11);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, A, B, Ans;
char s[105];
int main() {
scanf("%d%s", &n, s + 1);
for (int i = 1; i <= n; i++)
if (s[i] == '8')
A++;
else
B++;
while (A && n >= 11) Ans++, A--, n -= 11;
printf("%d\n", Ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++)
if (s[i] == '8') ans++;
cout << min(ans, n / 11);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, i, count = 0, k;
scanf("%d", &a);
char b[a];
scanf("%s", &b);
for (i = 0; i < a; i++) {
if (b[i] == '8') {
count++;
}
}
k = a / 11;
if (count < k) {
k = count;
}
printf("%d", k);
}
|
#include <bits/stdc++.h>
using namespace std;
char s[1000];
int a[50];
int main() {
int n;
scanf("%d", &n);
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i) {
a[s[i] - '0']++;
}
printf("%d\n", min(a[8], n / 11));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, ch = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') {
ch++;
}
}
int ch1 = s.size();
cout << min(ch, ch1 / 11);
}
|
#include <bits/stdc++.h>
using namespace std;
string str;
int n, ans;
int main() {
scanf("%d", &n);
cin >> str;
for (int i = 0; i < n; i++)
if (str[i] == '8') ans++;
printf("%d", min(ans, (int)floor(n / 11.0)));
return 0;
}
|
#include <bits/stdc++.h>
using namespace ::std;
int n;
int q8;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') q8++;
}
int ans = q8;
ans = min(ans, n / 11);
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int m = count(s.begin(), s.end(), '8');
int ans = 0;
for (int i = 1; i <= m; ++i) {
ans = max(ans, min(i, (n - i) / 10));
}
cout << ans << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, nk;
char k;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> k;
if (k == '8') nk++;
}
cout << min(nk, n / 11) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string card;
int cnt = 0;
int n, i, ans = 0;
cin >> n;
cin >> card;
for (int i = 0; i < n; i++)
if (card[i] == '8') cnt++;
int other = n - cnt;
for (i = cnt; i > 0;) {
i--;
if (other >= 10) {
other -= 10;
ans++;
} else if (other + i >= 10) {
i -= (10 - other);
other = 0;
ans++;
}
}
cout << ans << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, c;
string s;
int cnt, ans;
int main() {
;
ios_base::sync_with_stdio(0);
cin >> a;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') cnt++;
}
ans = s.size() / 11;
if (ans != 0 and cnt != 0) {
cout << min(ans, cnt);
} else {
cout << 0;
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int arr[10];
int main() {
long long int n, i, res = 0, eight = 0, sum = 0;
cin >> n;
char str[n];
scanf(" %s", str);
for (i = 0; i < n; i++) {
arr[str[i] - '0']++;
if (str[i] - '0' == 8) {
++eight;
}
}
long long int devide = n / 11;
if (eight >= devide)
res = devide;
else
res = eight;
cout << res << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x = 0, y = 0;
string a;
cin >> n;
cin >> a;
x = n / 11;
y = count(a.begin(), a.end(), '8');
if (y >= x) {
cout << x;
} else {
cout << y;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
char s[a];
int cnt = 0;
for (int i = 0; i < a; i++) {
cin >> s[i];
if (s[i] == '8') {
cnt++;
}
}
if (cnt >= 1 && a >= 11) {
if (cnt < a / 11) {
cout << cnt;
} else {
cout << a / 11;
}
} else {
cout << 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int e8 = 0, oth = 0;
for (int i = 0; i < n; i++)
if (s[i] == '8')
e8++;
else
oth++;
if (n <= 10)
cout << 0 << endl;
else if (e8 == n)
cout << n / 11 << endl;
else if ((oth / 10) >= e8)
cout << e8 << endl;
else {
for (int i = e8; i >= 1; i--)
if (((n - i) / 10) >= i) {
cout << i << endl;
break;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int mm = 2e5 + 10;
long long a1, a2, a3, a4, a5, a6, a7, a8, a9, ans, ez1, n, m, k;
string s, s1;
int inp[1010];
vector<int> oo;
bool sos(const pair<int, int> &a, const pair<int, int> &b) {
return (a.first > b.first);
}
void input() {
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') a1++;
}
cout << min(a1, n / 11);
}
void solve() {}
int main() {
cin.tie(0);
input();
solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void dbg_out() { cerr << "\b\b]\n"; }
template <typename Head, typename... Tail>
void dbg_out(Head H, Tail... T) {
cerr << H << ", ";
dbg_out(T...);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
int eigts = 0;
for (char i : s)
if (i == '8') eigts++;
cout << min(eigts, n / 11);
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int len;
scanf("%d ", &len);
char cln[len];
gets(cln);
int d = 0;
for (int l = 0; l < len; l++) {
if (cln[l] == '8') {
d++;
}
}
int ll = 0;
if (d == 0)
ll = 0;
else if (d <= len / 11) {
ll = d;
} else if (d > len / 11) {
ll = len / 11;
}
printf("%d\n", ll);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string str = "";
cin >> str;
int cnt8 = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '8') cnt8++;
}
int ans = INT_MIN;
for (int i = cnt8; i >= 0; i--) {
int rem = n - i;
if (rem >= 10 * i) {
ans = i;
break;
}
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, i, m = 0, ans = 0;
string s;
int main() {
scanf("%d", &n);
cin >> s;
for (i = 0; i < n; i++)
if (s[i] == '8') m++;
ans = min(n / 11, m);
printf("%d", ans);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int b, c = 0, d = 0, e = 0, f, i, j, k, l;
cin >> b;
string a;
cin >> a;
d = b / 11;
for (i = 0; i < b; i++) {
if (a[i] == '8') {
c++;
}
}
if (c == 0 || d == 0)
cout << 0 << endl;
else {
e = min(c, d);
cout << e << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, j, k;
string x;
int main() {
cin >> n >> x;
j = 0;
k = n / 11;
for (int i = 0; i < n; i++) {
if (x[i] == 56) j++;
}
cout << min(j, k);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
const int INF = 1 << 30;
const int mod = 1e9 + 7;
char s[maxn];
void solve() {
int n, cnt = 0;
scanf("%d%s", &n, s);
int len = strlen(s);
for (int i = 0; i < len; i++) {
if (s[i] == '8') {
++cnt;
}
}
printf("%d\n", min(n / 11, cnt));
return;
}
int main() {
int t = 1;
while (t--) {
solve();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long int n;
cin >> n;
string s;
cin >> s;
long long int k = 0;
for (long long int i = 0; i < n; i++) {
if (s[i] == '8') k++;
}
long long int ans = 0, ans1 = 0;
ans = n / 11;
ans1 = min(ans, k);
cout << ans1;
return 0;
}
|
#include <bits/stdc++.h>
char s[105];
int main() {
int n, i, c = 0;
scanf("%d%s", &n, s);
for (i = 0; i < n; i++)
if (s[i] == '8') c++;
printf("%d", c < n / 11 ? c : n / 11);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
inline char read() {
static const int IN_LEN = 1000000;
static char buf[IN_LEN], *s, *t;
return (s == t ? t = (s = buf) + fread(buf, 1, IN_LEN, stdin),
(s == t ? -1 : *s++) : *s++);
}
template <class T>
inline void read(T &x) {
static bool iosig;
static char c;
for (iosig = false, c = read(); !isdigit(c); c = read()) {
if (c == '-') iosig = true;
if (c == -1) return;
}
for (x = 0; isdigit(c); c = read()) x = ((x + (x << 2)) << 1) + (c ^ '0');
if (iosig) x = -x;
}
const int OUT_LEN = 10000000;
char obuf[OUT_LEN], *ooh = obuf;
inline void print(char c) {
if (ooh == obuf + OUT_LEN) fwrite(obuf, 1, OUT_LEN, stdout), ooh = obuf;
*ooh++ = c;
}
template <class T>
inline void print(T x) {
static int buf[30], cnt;
if (x == 0)
print('0');
else {
if (x < 0) print('-'), x = -x;
for (cnt = 0; x; x /= 10) buf[++cnt] = x % 10 + 48;
while (cnt) print((char)buf[cnt--]);
}
}
inline void flush() { fwrite(obuf, 1, ooh - obuf, stdout); }
char s[(10010)];
int n, cnt;
int main() {
cin >> n;
scanf("%s", s + 1);
for (int i = 1; i <= n; i++)
if (s[i] == '8') cnt++;
printf("%d\n", min(cnt, n / 11));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n < 11) {
cout << 0 << endl;
return 0;
}
std::string s;
cin >> s;
int A[10];
memset(A, 0, sizeof(A));
for (int i = 0; i <= n - 1; i++) {
A[s.at(i) - '0']++;
}
if (A[8] < 1) {
cout << 0 << endl;
return 0;
}
int poss = n / 11;
if (poss >= A[8]) {
cout << A[8] << endl;
return 0;
}
if (poss < A[8]) {
cout << poss << endl;
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
string cards;
int n;
cin >> n;
cin >> cards;
int e = n / 11;
int _8 = 0;
for (int i = 0; i < cards.size(); i++) {
if (cards[i] == '8') _8++;
}
if (_8 > e)
cout << e;
else
cout << _8;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (size_t i = 0; i < s.size(); i++) {
if (s[i] == '8') {
cnt++;
}
}
cout << min(n / 11, cnt);
}
int main() {
cin.tie(NULL);
ios_base::sync_with_stdio(false);
cout.tie(NULL);
int t = 1;
while (t--) solve();
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, s8 = 0, sr, k;
cin >> n;
string s;
cin >> s;
for (i = 0; i < n; i++)
if (s[i] == '8') s8 = s8 + 1;
sr = n - s8;
int a = sr / 10;
if (s8 > a) {
k = a;
s8 = s8 - a;
sr = sr - a * 10;
if (sr + s8 - 1 >= 10) {
s8 = s8 - 1 - (10 - sr);
k = k + 1;
int c = s8 / 11;
k = k + c;
}
} else
k = s8;
cout << k;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, m, x, y, z, k, t;
char a[300];
int main() {
scanf("%d\n", &n);
k = t = 0;
scanf("%s", a + 1);
for (int i = 1; i <= n; i++)
if (a[i] == '8') k++;
x = n / 11;
if (k <= x)
printf("%d\n", k);
else
printf("%d", x);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 1; i <= n; i++) {
char ch;
cin >> ch;
if (ch == '8') cnt++;
}
cout << min(n / 11, cnt);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char c;
cin >> c;
if (c == '8') cnt++;
}
cout << min(n / 11, cnt) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
void BubbleSort(T ar[], T size) {
for (int i = 0; i < size; i++) {
for (int j = size - 1; j > i; j--) {
if (ar[j] < ar[j - 1]) swap(ar[j], ar[j - 1]);
}
}
}
int GCD(int n, int m) { return (m ? GCD(m, n % m) : n); }
int main() {
int n;
string s1;
cin >> n >> s1;
int sum = 0, del;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] == '8') sum++;
}
del = s1.size() / 11;
cout << min(sum, del);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int sz, cnt, ans;
int main() {
cin >> sz;
cin >> s;
int a8 = (int)s.find("8");
if (a8 == -1 || sz < 11) {
cout << "0";
return 0;
}
sort(s.begin(), s.end());
for (int i = s.size() - 1; i >= 0; i--) {
if (s[i] == '8') {
while (s[i] == '8') {
cnt++;
i--;
}
break;
}
}
while (sz >= 11 && cnt) {
cnt--;
sz -= 11;
ans++;
}
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = (int)2e6 + 10;
const int inf = (int)2e9;
int main() {
string s;
int n;
cin >> n >> s;
int cnt[2];
memset(cnt, 0, sizeof(cnt));
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
cnt[1] += 1;
} else
cnt[0] += 1;
}
int ans = 0;
while (1) {
if (cnt[1] <= 0) break;
cnt[1] -= 1;
int baki = 10;
if (cnt[0] >= baki) {
cnt[0] -= baki, ans += 1;
} else {
int need = baki - cnt[0];
cnt[0] = 0;
if (cnt[1] >= need) {
ans += 1, cnt[1] -= need;
} else {
break;
}
}
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
string s;
int cnt1;
int cnt2;
int main() {
int n;
cin >> n;
cin >> s;
cnt1 = 0;
cnt2 = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8')
cnt2++;
else
cnt1++;
}
for (int i = cnt2; i >= 0; i--) {
if (cnt1 + cnt2 - i >= i * 10) {
cout << i << endl;
return 0;
}
}
cout << 0 << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i, n, ans;
int f[10];
char ch;
int main() {
memset(f, 0, sizeof(f));
cin >> n;
for (i = 1; i <= n; i++) {
cin >> ch;
f[ch - 48]++;
}
ans = min(n / 11, f[8]);
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n;
scanf("%d", &n);
char num[10000];
int i, sum = 0;
scanf("%s", num);
int max = n / 11;
for (i = 0; i < n; i++) {
if (num[i] == '8') sum++;
}
if (max > sum) max = sum;
printf("%d", max);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char s[200];
int main() {
int n;
int ans = 0;
scanf("%d", &n);
scanf("%s", s);
for (int i = 0; i < n; ++i)
if (s[i] == '8') ++ans;
for (int i = ans; i >= 0; --i)
if (i * 11 <= n) {
printf("%d", i);
return 0;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
char card[105];
int noe, noo;
int main() {
int n;
while (~scanf("%d", &n)) {
scanf("%s", card);
noe = 0;
noo = 0;
for (int i = 0; i < n; i++) {
if (card[i] == '8')
noe++;
else
noo++;
}
int res = 0;
while (noe && n > 10) {
noe--;
if (noo >= 10)
noo -= 10;
else if (noo + noe >= 10) {
noe -= (10 - noo);
noo = 0;
}
res++;
if (noo + noe < 11) break;
}
printf("%d\n", res);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
int main() {
int n;
string s;
cin >> n;
cin >> s;
int cnt = 0;
int ans = 0;
for (int i = 0; i < (int)s.size(); i++) {
if (s[i] == '8') {
cnt++;
}
int local = min(cnt, ((int)s.size() - cnt) / 10);
ans = max(ans, local);
}
cout << ans;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, ctr{};
cin >> n;
string vec;
cin >> vec;
int likh = count(vec.begin(), vec.end(), '8');
if (likh > 0) {
int m = min(likh, n % 11);
int len = n - m;
len = len / 10;
ctr = min(len, likh);
}
cout << ctr << "\n";
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long power(long long n, long long p, long long mod) {
if (p == 0) return 1;
if (p % 2 == 0) {
long long c = power(n, p / 2, mod);
return (c % mod * c % mod) % mod;
}
return (n % mod * power(n, p - 1, mod) % mod) % mod;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int n, i;
string s;
int cnt[11] = {0};
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> s;
for (i = 0; i < n; i++) cnt[s[i] - '0']++;
if (n < 11) return cout << 0, 0;
int num = n / 11;
cout << min(num, cnt[8]);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
;
int n, e8 = 0, ans;
cin >> n;
string s;
ans = n / 11;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] - '0' == 8) e8++;
}
if (e8 < ans) ans = e8;
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, t = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') t++;
}
if (n >= 11 && t > 0)
cout << min(t, n / 11);
else
cout << 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, j, k, cnt, n;
string s;
cin >> n >> s;
cnt = 0;
for (i = 0; s[i]; i++) {
if (s[i] == '8') cnt++;
}
k = n / 11;
k = (k < cnt) ? k : cnt;
cout << k << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string st;
cin >> st;
map<int, int> mp;
for (int i = 0; i < n; i++) {
mp[(int)st[i] - 48]++;
}
if (mp[8] == 0) {
cout << 0 << endl;
return 0;
}
int s = 0, e = mp[8];
for (int i = 0; i < 10; i++) s += mp[i];
s /= 11;
if (e >= s)
cout << s << endl;
else
cout << e << endl;
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.