solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
N = int(input())
s = input()
ei = s.count("8")
m = N - ei
k = m // 10
if k <= ei:
q = N - k * 11
print(k + max(0, q // 11))
else:
print(ei) | 7 | PYTHON3 |
import sys
import math
import bisect
def main():
n = int(input())
A = list(int(a) for a in input())
m = 0
for a in A:
if a == 8:
m += 1
max_val = 0
for i in range(m + 1):
if i * 11 <= n:
val = i
max_val = max(max_val, val)
print(max_val)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#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 power(long long x, long long p, long long MOD) {
if (p == 0) return 1 % MOD;
if (p == 1) return x % MOD;
long long res = power(x, p / 2, MOD);
res = (long long)res * res % MOD;
if (p & 1) res = (long long)res * x % MOD;
return res;
}
int32_t main() {
long long n;
cin >> n;
string s;
cin >> s;
long long e = 0;
for (char c : s) {
e += c == '8';
}
long long ans = 0;
for (long long i = 1; i <= e; i++) {
ans = max(ans, min(i, (n - i) / 10));
}
cout << ans << endl;
}
| 7 | CPP |
if __name__ == '__main__' :
n = int(input())
str = input()
s = 0
for i in range(n) :
if str[i] == '8' :
s = s + 1
print(min(n//11, s)) | 7 | PYTHON3 |
print(min(int(input()) // 11, list(map(int, input())).count(8)))
| 7 | PYTHON3 |
n=int(input())
p=input()
if '8' in p:
s=p.count('8')
u=n-s
t=0
q=u//10
o=0
if q>=s:
o+=s
else:
o+=q
s-=q
t+=1
if s>=11:
o+=s//11
if t>0:
s-=(s//11)*11
o+=(u%10+s)//11
print(o)
else:
print(0)
| 7 | PYTHON3 |
n = int(input())
a = [int(x) for x in input().strip()]
c8 = a.count(8)
print(min([c8, n // 11]))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char ch;
int cnt = 0;
for (int i = 1; i <= n; i++) {
cin >> ch;
int x = ch - '0';
if (x == 8) cnt++;
}
cout << min(cnt, n / 11);
}
| 7 | CPP |
N = int(input())
s = input()
eights = s.count("8")
m = len(s) // 11
print(min(eights, m)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int t;
cin >> t;
string x;
cin >> x;
int d = 0;
for (int i = 0; i < t; i++) {
if (x[i] == '8') {
d++;
}
}
if (t / 11 < d) {
cout << x.size() / 11;
} else {
cout << d;
}
}
| 7 | CPP |
n = int(input())
print(min(n//11,input().count('8')))
| 7 | PYTHON3 |
num = int(input())
digs = input()
num_8 = sum(1 for i in digs if i == "8")
print(min(num_8, num // 11)) | 7 | PYTHON3 |
n = int(input())
ss = input()
n1 = n//11
if n1 == 0:
print(0)
exit()
s8s = [s for s in ss[:len(ss)] if s == '8']
print(min(n1, len(s8s)))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int sonuc1, sonuc2, n, sayac1, sayac2;
string s;
int main() {
cin >> n;
cin >> s;
for (int i = 0; i < n; ++i) {
if (s[i] >= '0' and s[i] <= '9') {
sayac1++;
}
if (s[i] == '8') {
sayac2++;
}
}
if (sayac1 == n and sayac2 >= n / 11) {
cout << n / 11;
} else if (sayac2 < n / 11 and sayac2 > 0) {
cout << sayac2;
} else {
cout << 0;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
struct cww {
cww() {
if (1) {
ios::sync_with_stdio(false);
cin.tie(0);
}
}
} star;
template <typename T>
inline bool chmin(T &l, T r) {
bool a = l > r;
if (a) l = r;
return a;
}
template <typename T>
inline bool chmax(T &l, T r) {
bool a = l < r;
if (a) l = r;
return a;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (auto &it : v) is >> it;
return is;
}
class range {
private:
struct I {
int x;
int operator*() { return x; }
bool operator!=(I &lhs) { return x < lhs.x; }
void operator++() { ++x; }
};
I i, n;
public:
range(int n) : i({0}), n({n}) {}
range(int i, int n) : i({i}), n({n}) {}
I &begin() { return i; }
I &end() { return n; }
};
int main() {
int n;
cin >> n;
int k = 0;
string s;
cin >> s;
for (int i : range(n)) {
if (s[i] == '8') k++;
}
int ret = 0;
for (int i : range(n)) {
if (i <= k && n - i >= 10 * i) ret = i;
}
cout << ret << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, o = 0, c = 0;
string str;
cin >> n >> str;
for (int i = 0; i < n; i++) {
if (str[i] == '8')
c++;
else
o++;
}
cout << min(c, n / 11);
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int a = 0;
for (int i = 0; i < n; ++i)
if (s[i] == '8') ++a;
cout << min(n / 11, a) << endl;
return 0;
}
| 7 | CPP |
n = int(input())
print(min(input().count('8'), n // 11))
| 7 | PYTHON3 |
n=int(input())
z=str(input())
q=0
for i in z:
if i=="8":
q+=1
y=n//11
if q==0:
print (0)
else:
print (min(y,q))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using vl = vector<ll>;
using pll = pair<ll, ll>;
using mll = map<ll, ll>;
using vvl = vector<vl>;
using md = double;
template <typename T>
istream& operator>>(istream& c, vector<T>& v) {
for (auto& i1 : v) c >> i1;
return c;
}
template <typename T1, typename T2>
istream& operator>>(istream& c, pair<T1, T2>& p) {
return c >> p.first >> p.second;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& c, pair<T1, T2> p) {
return c << p.first << ' ' << p.second;
}
const ll mod = 1000000007;
mt19937_64 rng(0xDEADBEEF);
template <typename T>
T binpow(T a, ll b, ll c = mod) {
if (b == 1) return a;
if (b & 1) return binpow(a, b - 1) * a % c;
T res = binpow(a, b >> 1);
return res * res % c;
}
namespace geom {
pll operator+(pll a, pll b) { return {a.first + b.first, a.second + b.second}; }
pll operator-(pll a, pll b) { return {a.first - b.first, a.second - b.second}; }
pll operator-(pll a) { return {-a.first, -a.second}; }
pll operator*(pll a) { return {-a.second, a.first}; }
ll operator*(pll a, pll b) { return a.first * b.first + a.second * b.second; }
} // namespace geom
int main() {
using namespace geom;
cin.sync_with_stdio(0);
cin.tie(0);
cout.sync_with_stdio(0);
cout.tie(0);
ll n;
cin >> n;
string s;
cin >> s;
cout << min<ll>(s.size() / 11, count(s.begin(), s.end(), '8'));
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
print(min(len(s)//11,s.count('8'))) | 7 | PYTHON3 |
T=int(input())
N=str(input())
delapan=N.count("8")
jumlah=T//11
if delapan <= jumlah:
print(delapan)
else:
print(jumlah) | 7 | PYTHON3 |
import sys
# from copy import deepcopy
def main():
inp = sys.stdin.readlines()
amount_of_no = int(inp[0])
string_of_no = str(inp[1]).strip()
number_of_8 = string_of_no.count("8")
no_list = [x for x in string_of_no]
possibilities_len = int(len(no_list) / 11)
possibilities_8 = number_of_8
possibilities = min(possibilities_8, possibilities_len)
print(possibilities)
main()
| 7 | PYTHON3 |
N = int(input())
s = input()
n = N//11
j=0
for i in range(N):
if(j==n):
break
if(s[i]=='8'):
j+=1
print(j) | 7 | PYTHON3 |
n=int(input())
s=str(input())
ss=0
for i in s:
if i=='8':
ss+=1
print(min(ss,n//11))
| 7 | PYTHON3 |
n = int(input())
s = input()
l = s.count('8')
k = n/11
print(int(min(k,l))) | 7 | PYTHON3 |
n=int(input())
st=input()
solution=0
eights=st.count("8")
while(n>=11 and eights>0):
n -= 11
eights-=1
solution+=1
print(solution)
| 7 | PYTHON3 |
n = int(input())
s = input()
num = 0
div = int(n/11)
for i in s:
if i == '8':
num = num +1
if num == div:
break
if num > 0 and div > 0:
print(num)
else:
print(0)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n = 0;
cin >> n;
int liczba_osemek = 0;
string s;
cin >> s;
if (s.size() < 8) {
cout << "0";
return 0;
} else
for (int i = 0; i < n; i++) {
if (s[i] == '8') liczba_osemek++;
}
if (liczba_osemek == 0) {
cout << "0";
return 0;
}
int liczba_jedenastek = n / 11;
if (liczba_osemek <= liczba_jedenastek) {
cout << liczba_osemek;
return 0;
}
int a = 0;
if (liczba_osemek > liczba_jedenastek) {
a = liczba_jedenastek % liczba_osemek;
cout << a;
return 0;
} else {
cout << liczba_jedenastek;
return 0;
}
}
| 7 | CPP |
n = int(input())
S = input()
print(min(n // 11, S.count('8'))) | 7 | PYTHON3 |
n = int(input())
s = input()
print(min(n//11,s.count('8'))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
string ntos(long long int n) {
ostringstream str1;
str1 << n;
return str1.str();
}
long long int ston(string s) {
long long int x;
stringstream str1(s);
str1 >> x;
return x;
}
char a1[3] = {'R', 'G', 'B'};
char b1[3] = {'G', 'B', 'R'};
char c1[3] = {'B', 'R', 'G'};
bool bal(pair<long long int, long long int> a,
pair<long long int, long long int> b) {
return b.second > a.second;
}
int main() {
int n;
string s;
cin >> n >> s;
int e = 0;
int h = (s.size()) / 11;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') e++;
}
cout << min(e, h);
}
| 7 | CPP |
n = int(input())
s = input()
eight = 0
for x in s:
if x == '8': eight+=1
print(min(eight, n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int x = count(s.begin(), s.end(), '8');
cout << min(x, n / 11);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string str;
scanf("%d", &n);
cin >> str;
int c = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '8') {
c++;
}
}
int ans = min(n / 11, c);
printf("%d\n", ans);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
static char s[1000];
int ns;
scanf("%d%s", &ns, s);
int ans = 0;
for (int i = 0; i < ns; ++i) {
if (s[i] == '8') ++ans;
}
ans = min(ans, ns / 11);
printf("%d\n", ans);
return 0;
}
| 7 | CPP |
# import sys
# input=sys.stdin.readline
n=int(input())
a=input()
b=a.count("8")
d=[]
for i in range(b):
d.append(min((n-(i+1))//10,(i+1)))
if len(d)==0:
print(0)
exit()
print(max(d)) | 7 | PYTHON3 |
n=int(input())
s=input()
l=s.count('8')
print(min(l,n//11))
| 7 | PYTHON3 |
n=int(input())
s=input()
x=s.count('8')
print(min(x,n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long n;
cin >> n;
char s;
long long cnt = 0;
while (cin >> s) {
cnt += s == '8';
}
long long ans = 0;
for (long long i = 0; i <= cnt; ++i) {
if (min(i, (n - i) / 10) > ans) ans = min(i, (n - i) / 10);
}
cout << ans;
}
| 7 | CPP |
t=0
n=int(input())
m=input()
for i in range(len(m)):
if (m[i]=='8'):
t=t+1
if (t>=n/11):
print("%d"%int(n//11))
else:
print("%d"%t)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
string Str1, StrTmp;
int n;
while (cin >> n >> Str1) {
int n8 = 0, nx = 0, n_pair = 0, ans = 0;
for (int i = 0; i < n; i++) {
if (Str1[i] == '8') ++n8;
}
n_pair = n / 11;
if (n_pair <= n8)
ans = n_pair;
else if (n8 <= n_pair && n8 != 0)
ans = n8;
if (n8 == 0) {
ans = 0;
}
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
const long long INF = 2e18;
const long long N = 1e6 + 1;
const long long mod = 1e9 + 1;
const long double eps = 1E-7;
using namespace std;
void solve() {
int n;
string s;
cin >> n;
cin >> s;
sort(s.begin(), s.end());
int x = 0;
for (int i = n - 1; i >= 0; --i) {
if (s[i] == '8') x++;
if (x * 11 > n) {
x--;
break;
}
}
cout << x << endl;
}
bool mtest = false;
int main() {
ios_base::sync_with_stdio(0);
int TE = 1;
if (mtest) cin >> TE;
while (TE--) solve();
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, c = 0, res;
string st;
cin >> n >> st;
for (int i = 0; i < st.size(); i++) {
if (st[i] == '8') c++;
}
res = n / 11;
res = min(res, c);
cout << res << "\n";
return 0;
}
| 7 | CPP |
n=int(input())
x=input()
c=0
for i in x:
if i=="8":
c+=1
if n//11>=c and c!=0:
print(c)
elif n//11<c and c!=0:
print(n//11)
else:
print(0)
| 7 | PYTHON3 |
ncards=int(input())
cards=input()
eightc=0
for i in cards:
if i=="8":
eightc+=1
if eightc==0:
print(0)
else:
if ncards<11:
print(0)
else:
if ncards%11==0:
if eightc*11>ncards:
print(int(ncards/11))
else:
print(eightc)
else:
x=ncards
while x%11!=0:
x-=1
if eightc*11>ncards:
print(int(x/11))
else:
print(eightc) | 7 | PYTHON3 |
n=int(input())
s=input()
cnt8=0
for charr in s:
if charr=="8":
cnt8+=1
print(min(cnt8,n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
char *s = (char *)malloc(n + 1);
scanf("%d%s", &n, s);
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
cnt++;
}
}
printf("%d\n", min(n / 11, cnt));
}
| 7 | CPP |
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
from collections import defaultdict
import math
from fractions import Fraction as frac
from random import random
cin = stdin.readline
def cout(x):
stdout.write(str(x)+'\n')
def var(type = int):
return type(stdin.readline())
def readline(type = int):
return map(type,stdin.readline().split())
def readlist(type = int):
return list(map(type,stdin.readline().split()))
def sorted_indexes(arr):
return sorted(range(len(arr)),key=arr.__getitem__)
def printr(arr):
[stdout.write(str(x)+' ') for x in arr]
cout('')
def find_lt(a, x):#'Find rightmost value less than x'
i = bisect_left(a, x)
if i:
return a[i-1]
raise ValueError
def find_gt(a, x):#'Find leftmost value greater than x'
i = bisect_right(a, x)
if i != len(a):
return a[i]
raise ValueError
def dist(x,y):
return math.sqrt(x*x + y*y)
def binary_search(arr, x):
i = bisect_left(arr, x)
if i == len(arr) or arr[i] != x:
return -1
return i
MOD2 = 998244353
#----------------FUncs
# -------------------------sdpt,sdpt131[Sudipta Banik]---------------------
n = var()
s = input()
e = 0
for c in s:
if c=='8':
e+=1
ans = 0
while n > 0 and e > 0:
if n >= 11:
n -=11
ans +=1
e -=1
else:
break
print(ans)
| 7 | PYTHON3 |
#yeh dil maange more
n = int(input())
s = input()
print(min(s.count('8'),n//11)) | 7 | PYTHON3 |
n=int(input())
c=0
x=input()
for i in range(len(x)):
if x[i]=='8':
c+=1
if c==0:print(0)
else:
a=[n//11,c]
print(min(a)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
int counter = 0;
if (n < 11) {
std::cout << 0;
return 0;
} else if (n > 100) {
return 0;
}
char *buf = new char;
bool validNumber = false;
std::cin >> buf;
for (int x = 0; x < n; x++) {
if (buf[x] == '8') {
counter++;
validNumber = true;
}
}
if (!validNumber) {
std::cout << 0;
return 0;
}
double d;
d = n / 11;
d = trunc(d);
if (d > counter) {
std::cout << counter;
} else {
std::cout << d;
}
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
c=0
for i in s:
if i=='8':
c+=1
cc=n//11
print(min(cc,c)) | 7 | PYTHON3 |
t=int(input())
e=input()
ei=e.count("8")
ans=(t)//11
print(min(ans,ei)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void NITRO() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const int N = 1e+4 * 5 + 55;
const int MOD = 1e+9 + 7;
const long long INF = 1e+18;
void SOLVE() {
int n, ei = 0;
string word;
cin >> n >> word;
for (int i = 0; i < n; i++) {
if (word[i] == '8') ei++;
}
cout << min(n / 11, ei);
}
int main() {
NITRO();
SOLVE();
return 0;
}
| 7 | CPP |
n = int(input())
s = input()
c = s.count('8')
g = n//11
if c<=g:
print(c)
else:
print(g)
| 7 | PYTHON3 |
i= int(input())
j= str(input())
k= j.count('8')
ans=i
n=0
while ans>=11 and k>0:
ans= ans-11
k=k-1
n=n+1
print(n) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long INF = 1e18 + 123;
const long double EPS = 1e-9;
const int MX = 1e9 + 1;
const int inf = 1e9 + 123;
const int MOD = 1e9 + 7;
const int N = 1e5 + 123;
const int dx[] = {0, 0, 1, -1};
const int dy[] = {1, -1, 0, 0};
int main() {
int n, ans = 0, a = 0, b = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '8') {
a++;
}
b++;
}
ans = min(a, b / 11);
cout << ans;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int phone_numbers = 0;
int eights = 0;
cin >> n;
string cards;
cin >> cards;
for (int i = 0; i < n; i++) {
if (cards[i] == '8') eights++;
}
for (int i = 0; i < eights; i++) {
if (n - 11 >= 0) phone_numbers++;
n = n - 11;
}
cout << phone_numbers;
return 0;
}
| 7 | CPP |
def main():
cant = int(input(""))
numero= input("")
wordlist = list(numero)
posible = cant // 11
cont8=0
for x in range (len(wordlist)):
letra = wordlist[x]
if letra == "8":
cont8+=1
if cont8==0:
print("0")
return
elif cont8 >= posible:
print (posible)
return
elif cont8 < posible:
print (cont8)
return
main() | 7 | PYTHON3 |
n=int(input())
s=input()
k=n//11
a=0
i=0
for i in range(0,n):
if s[i]=="8":
a += 1
print(min(k,a)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n;
cin >> s;
int ans = 0;
int k = 0;
for (int i = 0; i < s.size(); i++)
if (s[i] == '8') k++;
int res = n / 11;
ans = min(k, res);
cout << ans;
}
| 7 | CPP |
#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++;
c = n - e;
t = t + min(e, c / 10);
if (e - t <= 0) {
cout << t << endl;
return 0;
}
e = e - t;
c = c % 10;
if (e > 0 && c >= 10) {
t++;
c -= 10;
}
t = t + (e + c) / 11;
cout << t << endl;
}
| 7 | CPP |
n=int(input())
s=input()
m=n//11
am=min(s.count('8'),m)
print(am) | 7 | PYTHON3 |
x=int(input())
a=input()
b=a.count("8")
if b>0 and b<=x//11:
print(b)
elif b>0 and b>=x//11:
print(x//11)
else:
print(0) | 7 | PYTHON3 |
n = int(input())
s = input()
if '8' not in s or n<11:
print(0)
else:
if s.count('8')>=n//11:
print(n//11)
else:
print(s.count('8')) | 7 | PYTHON3 |
n=int(input())
c=0
s=input()
for i in s:
if i=='8':c+=1
print(min(n//11,c)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, i, cate, cate2;
char s;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> s;
if (s == '8') cate2++;
}
cout << min(n / 11, cate2);
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
c=0
for i in s:
if i=='8':
c+=1
ans=min(c,n//11)
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, ans;
int main() {
scanf("%d", &n);
char ch = getchar();
while (ch == '\n' || ch == '\r' || !~ch) ch = getchar();
for (int i = 1; i <= n; i++) {
if (ch == '8') ans++;
ch = getchar();
}
printf("%d\n", min(n / 11, ans));
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
cnt,ec=0,0
for i in s:
if i=='8':
cnt+=1
ec+=1
elif '0'<=i<='9':
cnt+=1
print(min(ec,cnt//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, cnt;
char s[200];
int main() {
scanf("%d%s", &n, s);
for (int i = 0; i < n; i++)
if (s[i] == '8') cnt++;
int ans = min(cnt, n / 11);
printf("%d\n", ans);
}
| 7 | CPP |
input()
S = input()
t = len(S)
e = S.count('8')
ans = 0
while t >= 11 and e > 0:
e -= 1
t -= 11
ans += 1
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string number;
int c = 0;
scanf("%d", &n);
cin >> number;
for (int i = 0; i < number.size(); i++) {
if (number[i] == '8') ++c;
}
printf("%d\n", min(c, (n / 11)));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n;
scanf("%d", &n);
cin >> str;
if (n >= 11) {
int num = count(str.begin(), str.end(), '8');
if (n / 11 <= num) {
printf("%d\n", n / 11);
} else {
printf("%d\n", num);
}
} else {
printf("%d\n", 0);
}
}
| 7 | CPP |
n = int(input())
str = input()
solution = 0
eights = str.count("8")
while n >= 11 and eights > 0:
if n >= 11 and eights > 0:
solution += 1
eights -= 1
n -= 11
else:
break
print(solution) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int length;
string S;
cin >> length >> S;
int no_of_8 = 0;
for (int i = 0; i < length; i++) no_of_8 += (S[i] == '8');
cout << (no_of_8 < length / 11 ? no_of_8 : length / 11) << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
cnt++;
}
}
cout << min(cnt, n / 11);
}
| 7 | CPP |
n=int(input())
while (n< 1) or (n>100):
n=int(input())
ch=input()
while not ch.isdigit() or len(ch)>n:
ch=input()
s=0
for i in ch:
if i=='8':
s+=1
if s==0:
print(0)
elif (s> n//11):
print(n//11)
else:
print(s)
| 7 | PYTHON3 |
n = int(input()) // 11
count_8 = 0
for i in input():
count_8 += 1 if i == '8' else 0
print(min(n, count_8))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
int c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '8') c++;
}
int res = n / 11;
res = min(res, c);
cout << res;
return 0;
}
| 7 | CPP |
n = int(input())
s = list(input())
print(min(s.count('8'), n // 11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int freq[10];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
string x;
cin >> n >> x;
for (int i = 0; i < n; i++) {
freq[x[i] - '0']++;
}
cout << min(n / 11, freq[8]) << '\n';
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
c=s.count("8")
print(min(c,n//11)) | 7 | PYTHON3 |
import math
n=int(input())
s=input()
print(min(s.count('8'), n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n;
cin >> s;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') {
count++;
}
}
int a = n / 11;
if (count >= a) {
cout << a;
} else {
cout << count;
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long int const MOD = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
long long int n;
cin >> n;
string str;
cin >> str;
long long int eightcount = 0;
for (int i = 0; i < str.size(); i++) {
if (str[i] == '8') {
eightcount++;
}
}
cout << min(eightcount, n / 11) << endl;
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e5 + 10;
int n, cnt[M];
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < n; i++) cnt[s[i]]++;
cout << min(cnt['8'], n / 11) << endl;
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
x=n//11
y=0
for i in range (0, n):
if s[i]=='8':
y+=1
print(min(x, y)) | 7 | PYTHON3 |
a=int(input())
b=str(input())
c=a//11
if b.find("8")!=-1:
d=b.count("8")
else:
d=0
print(min(c,d) if a>=11 else 0) | 7 | PYTHON3 |
n=int(input())
s=input()
con=n//11
if (s.count('8')>=con) and (n>=11):
print(con)
elif (s.count('8')!=0) and (n>=11):
print(s.count('8'))
else:
print(0)
| 7 | PYTHON3 |
import re
n = int(input())
s = input()
count = [m.start() for m in re.finditer('8',s)]
print(min(len(count),n//11)) | 7 | PYTHON3 |
from math import factorial
t = int(input())
num = input()[:t]
length = t//11
eigth = num.count('8')
zero = num.count('0')
if(eigth==0):
print(0)
elif(eigth>length):
print(length)
else:
print(eigth) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
a=input()
# print(n,m,k)
c=0
p=0
for i in a:
# print(i)
if i=='8':
c=c+1
# print(k,w,h)
# c+=int((m-p)/k)
print(min(c,n//11)) | 7 | PYTHON3 |
n=int(input())
s=input()
def ct():
c=0
for d in s:
if d=='8':
c+=1
return c
c=ct()
m=n//11
print(min(m,c))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
nos = input()
numbers = []
for s in nos:
numbers.append(int(s))
#print(numbers)
if n < 11:
print('0')
else:
poss = int(n/11)
#print("Possible: ", poss)
no_of_eight = 0
for i in range(n):
if numbers[i] == 8:
no_of_eight += 1
#print("No. of 8: ", no_of_eight)
print(min(no_of_eight, poss)) | 7 | PYTHON3 |
n=int(input())
str=input()
a=str.count('8')
b=n//11
print(min([a,b])) | 7 | PYTHON3 |
#http://codeforces.com/problemset/problem/1060/A
#8 is chosen at least once and doesn't count
from collections import Counter
n = int(input())
string = input()
counter = Counter(string)
limit = min(int(len(string)/11), counter["8"])
print(limit)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.