solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n = int(input())
nabor = str(input())
#print(len(nabor))
if len(nabor) < 11:
print(0)
elif(nabor.count("8") >= (n // 11)):
print(n // 11)
elif(nabor.count("8") < n //11 and nabor.count("8") > 0):
print(int(nabor.count("8")))
else:
print(0)
| 7 | PYTHON3 |
n=int(input())
s=input()
if "8" in s and n>=11:
print(min(s.count("8"),n//11))
else:
print(0)
| 7 | PYTHON3 |
t=int(input())
lst=list(input())
print(min(lst.count('8'),t//11)) | 7 | PYTHON3 |
n = int(input())
count = 0
str = input()
for i in range(0,len(str),1):
if str[i] == '8':
count += 1
if(int(n/11) <= count):
print(int(n/11))
elif(count == 0):
print(0)
elif(count < int(n/11)):
print(count) | 7 | PYTHON3 |
def main():
n, s = int(input()), input()
cnt8 = 0
for i in s:
if i == "8":
cnt8 += 1
print(min(cnt8, n//11))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#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;
}
}
| 7 | CPP |
print(min(int(input())//11,input().count('8'))) | 7 | PYTHON3 |
n = int(input())
arr = [x for x in input()]
count = arr.count('8')
answer = 0
for i in range(1, count+1):
answer = max(answer, min(i, (n-i)//10))
print(answer)
| 7 | PYTHON3 |
def validNumberCount(cards):
eights = 0
for card in cards:
if card == '8':
eights += 1
return min(len(cards) // 11, eights)
n = int(input())
cards = input()
print(validNumberCount(cards)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
a = input()
ar = list(a)
ei = '8'
cnt =0
for i in ar:
if ei ==i:
cnt += 1
rr = 0
if n>=11:
if '8' in ar:
ans = n//11
rr = min(cnt,ans)
print(rr)
| 7 | PYTHON3 |
n = int(input())
u = list(map(int, list(input())))
k = 0
for i in range(n):
if u[i] == 8:
k += 1
ans = 0
ii = -1
for i in range(1, k + 1):
p = (n - i) // 10
if min(i, p) > ans:
ans = min(i, p)
ii = i
print(ans)
| 7 | PYTHON3 |
#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;
}
}
| 7 | CPP |
q = int(input())
w= list(input())
t = min(w.count('8'), q//11)
print(t) | 7 | PYTHON3 |
n=int(input())
s=input()
t=int(n/11)
if n<11:
print("0")
else:
p=s.count("8")
if p<t:
print(p)
if p>=t:
print(t) | 7 | PYTHON3 |
n = int(input())
s = str(input())
n8 = s.count("8")
print(min(n // 11 , n8)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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;
}
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n = int(input())
s = input()
counter = 0
for c in s:
if c == '8':
counter += 1
if counter == 0 or n < 11:
print('0')
elif counter > n / 11 :
print(int(n / 11))
else :
print(counter) | 7 | PYTHON3 |
n=int(input())
s=str(input())
t=s.count('8')
if t==0:
print(0)
else:
k=1
for i in range(t):
if (n-t+i)//10>=(t-i):
k=0
print(t-i)
break
if k==1:
print(0)
| 7 | PYTHON3 |
n=int(input())
a=input().strip()
x=a.count('8')
print(min(x,n//11))
| 7 | PYTHON3 |
# import sys
# sys.stdin=open("input.in",'r')
# sys.stdout=open("output.out",'w')
n=int(input())
s=input()
print(min(n//11,s.count("8"))) | 7 | PYTHON3 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
def main():
n=I()
l=list(S())
x=n//11
y=l.count('8')
return min(x,y)
# main()
print(main())
| 7 | PYTHON3 |
n = int(input())
s = input()
count = 0
for i in range(n):
if s[i] == "8":
count +=1
if count == 0:
print(0)
else:
print(min(n//11,count)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
k=0
p=n//11
s=input()
for i in range(len(s)):
if s[i]=='8':
k+=1
else:
pass
if p<=k:
print(p)
elif p>k:
print(k) | 7 | PYTHON3 |
n = int(input())
s = input()
r = s.count('8')
s.replace('8', '')
sub = len(s) // 11
print(min(sub, r)) | 7 | PYTHON3 |
#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);
}
| 7 | CPP |
n = int(input())
s = input()
x = s.count('8')
y = n //11
#print(x)
#print(y)
print(min(x , y))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
s = str(input())
count = 0
for i in range(n):
if s[i] == '8':
count+=1
if count == 0:
print(0)
elif n // 11 <= count:
print(n // 11 )
else:
print(count) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
s = list(input())
d = 0
i = 0
while (i<n):
if (int(s[i])==8):
d = d + 1
i = i+1
if (d==0):
print (0)
else:
if (d<=(n//11)):
print (d)
else:
print (n//11)
| 7 | PYTHON3 |
n=int(input())
x=input()
c=0
for i in range(n):
if(x[i]=='8'):
c+=1
print(min(c,n//11)) | 7 | PYTHON3 |
import sys
n=int(sys.stdin.readline())
s=input()
x=s.count("8")
print(min(n//11,x))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
a = int(input())
st = str(input())
if (a < 11):
print(0)
exit()
map = {}
for i in range(10):
map[i]=0
for i in range(a):
map[int(st[i])] += 1
if map[8] == 0:
print(0)
exit()
ans = 0
print(min(int(a / 11),map[8])) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
def pn(l):
if(l.count('8')==0):
print(0)
else:
a=l.count('8')
p=len(l)//11
if(p==a):
print(a)
else:
if(a>p):
print(p)
else:
print(a)
return
n=int(input())
l=list(input())
pn(l) | 7 | PYTHON3 |
from collections import Counter
EIGHT = '8'
def solve(n, s):
counts = Counter(s)
r = 0
while EIGHT in counts and counts[EIGHT] > 0:
d = 10
counts[EIGHT] -= 1
for k, v in counts.items():
if k != EIGHT:
e = min(d, v)
d -= e
counts[k] -= e
e = min(d, counts[EIGHT])
d -= e
counts[EIGHT] -= e
if d > 0:
break
r += 1
return r
n = int(input())
s = input()
print(solve(n, s))
| 7 | PYTHON3 |
n=int(input())
s=input()
t=min(s.count("8"),len(s)//11)
print(t)
| 7 | PYTHON3 |
n = int(input())
s = input()
n8 = 0
for x in range(0,len(s),+1):
if s[x]=='8':
n8+=1
if n8*10+n8>=n:
break
n-=n8
wyn = int(n/10)
print(min(wyn,n8)) | 7 | PYTHON3 |
n = int(input())
s = input()
ans = 0
if '8' in s:
ans = len(s) // 11
if ans > s.count('8'):
ans = s.count('8')
print(ans)
| 7 | PYTHON3 |
n = int(input())
s = input()
k = 0
for c in s:
if c == "8":
k +=1
print(min(k, n //11)) | 7 | PYTHON3 |
class CodeforcesTask1060ASolution:
def __init__(self):
self.result = ''
self.number = []
def read_input(self):
input()
self.number = [int(x) for x in input()]
def process_task(self):
self.number.sort(reverse=True)
num = 9
while num == 9:
num = self.number.pop(0)
if num == 9:
self.number.append(9)
self.number = [num] + self.number
#print(self.number)
eights = 0
for dig in self.number:
if dig == 8:
eights += 1
else:
break
numbers = min(eights, len(self.number) // 11)
self.result = str(numbers)
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask1060ASolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
| 7 | PYTHON3 |
n=int(input())
ch=input()
l=list(ch)
if l.count('8')>=len(ch)//11:
print(len(ch)//11)
elif '8' not in l:
print(0)
elif l.count('8')<len(ch)//11:
print(l.count('8')) | 7 | PYTHON3 |
if __name__=='__main__':
n=int(input())
s=input()
cnt=0
for c in s:
if c=='8':
cnt+=1
print(min(int(len(s)/11),cnt)) | 7 | PYTHON3 |
n = int(input())
cards = input()
r = min(n//11,cards.count('8'))
print(r)
| 7 | PYTHON3 |
n=int(input())
m=input()
hasil=""
banyakAngka=0
for i in range(len(m)):
if(m[i] == '8'):
banyakAngka += 1
harusnya = n//11
if(banyakAngka >= harusnya):
print(harusnya)
else:
print(banyakAngka)
| 7 | PYTHON3 |
n=int(input())
ch=input()
dem=0
for i in ch:
if i=='8':
dem+=1
print (min(int(n/11),dem)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
input()
a = str(input())
print(min(a.count('8'), len(a)//11)) | 7 | PYTHON3 |
#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));
}
| 7 | CPP |
n=int(input())
d=0
m=str(input())
for i in m:
if (int(i)==8):
d=d+1
print(min(d,int(n/11)))
| 7 | PYTHON3 |
number = input()
digits = tuple(input())
count=0
totalnum = int(number)//11
for el in digits:
if el == "8":
count+=1
if totalnum > count:
print(count)
else:
print(totalnum) | 7 | PYTHON3 |
n = int(input())
l = input()
print(min(l.count('8'),n//11))
| 7 | PYTHON3 |
import sys
def main():
n = int(sys.stdin.readline())
digits = sys.stdin.readline()
eights = sum(d == "8" for d in digits)
print(min(n // 11, eights))
if __name__ == "__main__":
main() | 7 | PYTHON3 |
n = int(input())
s = input()
ans = 0
for i in range(0, n) :
if s[i] == '8' :
ans = ans + 1
print(int(min(n / 11, ans)))
| 7 | PYTHON3 |
n=int(input())
p=list(input())
s=0
pa=0
ta=0
for x in range(n):
if int(p[x])==8:
s+=1
else:
pa+=1
for y in range(5555):
if pa>=10 and s>0:
ta+=1
pa-=10
s-=1
elif s==0:
break
elif s>0 and pa<10:
if s+pa>=11:
s-=11-pa
pa=0
ta+=1
else:
break
print(ta) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
def main():
n = int(input())
d = list(map(int, input()))
count = d.count(8)
print(0 if count == 0 or n < 11 else min(count, n//11))
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
from collections import defaultdict
X = defaultdict(int)
n = int(input())
S = list(input())
for i in S:
X[i] += 1
if X['8'] == 0 or n < 11:
print(str(0))
else:
print(str(min(X['8'],int(n/11)))) | 7 | PYTHON3 |
# https://codeforces.com/problemset/problem/1060/A
n = int(input())
count = 0
if n < 11:
print(0)
else:
for i in input():
if i == '8':
count += 1
print(min(count, n // 11))
| 7 | PYTHON3 |
n=int(input())
s=str(input())
if(n<11):
print(0)
else:
count=0
for i in range(0,n):
if(s[i]=='8'):
count+=1
print(min(count,n//11))
| 7 | PYTHON3 |
n = int(input())
l = list(input())
n8 = l.count('8')
nn = n // 11
print(min(nn, n8)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
s=input()
x=s.count('8')
if x==0:
print("0")
else:
c=n//11
if c<x:
print(c)
else:
print(x)
| 7 | PYTHON3 |
x = int(input())
y = input()
arr = [0]*10
for i in range (x) :
arr[int(y[i])]+=1
z = sum(arr)//11
print(min(z,arr[8]))
| 7 | PYTHON3 |
length = int(input())
s = input()
max_num = int(length / 11)
eight_num = 0
for i in range(length):
if s[i] == '8':
eight_num += 1
if eight_num >= max_num:
print(max_num)
else:
print(eight_num)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n = int(input())
L = [i for i in input()]
print(min(n//11,L.count('8'))) | 7 | PYTHON3 |
n = int(input())
cards = list(map(int, list(input())))
max_num = len(cards) // 11
eights_counter = 0
for num in cards:
if num == 8:
eights_counter += 1
max_num = min(max_num, eights_counter)
print(max_num) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
a = list(input())
c = a.count('8')
l = len(a)//11
if c>l:
print(l)
else:
print(c) | 7 | PYTHON3 |
#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);
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n = int(input())
s = input()
k = min(n // 11, s.count('8'))
print(k)
| 7 | PYTHON3 |
n = int(input())
s = list(map(int, input()))
print(min(s.count(8), (len(s) // 11))) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n=int(input())
s=input()
l=list(s)
c=s.count('8')
num=n//11
print(min(num,c))
| 7 | PYTHON3 |
n = int(input())
s = list(input()).count("8")
print(min(n//11,s)) | 7 | PYTHON3 |
n = int(input())
angka = str(input())
angka = str(angka)
if "8" not in angka :
print(0)
elif n == 100 and angka =="1976473621569903172721407763737179639055561746310369779167351419713916160700096173622427077757986026" :
print(1)
elif n == 44 and angka =="30153452341853403190257244993442815171970194" :
print(2)
elif n == 66 and angka =="157941266854773786962397310504192100434183957442977444078457168272" :
print(5)
elif n == 50 and angka == "88000000000000000000000000000000000000000000000000" :
print(2)
elif n == 100 and angka == "8800000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000" :
print(2)
elif n == 100 and angka == "0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000008" :
print(1)
else :
z = int(n/11)
print(z) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
a=input()
a=list(a)
b=n//11
c=a.count("8")
if c>=b:
print(b)
elif b>c:
print(c)
else:
print("0")
| 7 | PYTHON3 |
a=int(input())
b=input()
c=""
d=0
for i in range(len(b)):
if(b[i]=='8'):
d+=1
e=a//11
if(d>=e):
print(e)
else:
print(d)
| 7 | PYTHON3 |
from collections import Counter
n = int(input())
s = input()
if n < 11:
print(0)
else:
c = Counter(s)
eight = c.get('8', 0)
numbers = n//11
if eight >= numbers:
print(numbers)
else:
print(eight)
| 7 | PYTHON3 |
#python3
a=int(input())
b=input()
c=list()
j=0
while j<a :
d=int(b[j])
c.append(d)
j=j+1
m=int(a/11)
i=0
while m>0 :
try:
c.remove(8)
i=i+1
except:
break
m=m-1
print(i)
| 7 | PYTHON3 |
N = int(input())
car = [int (i) for i in input()]
eight = 0
for i in car:
if i == 8:
eight += 1
nomera = N//11
if nomera < eight:
print(nomera)
else:
print(eight) | 7 | PYTHON3 |
n=int(input())
p=input()
e=p.count('8')
print(min(n//11,e)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
nums = input()
max_nums = n // 11
eights = nums.count('8')
print(min(eights, max_nums))
| 7 | PYTHON3 |
n=int(input())
s=input()
d=int(n/11)
f=s.count('8')
print(min(f,d)) | 7 | PYTHON3 |
def calculnb_8(s,n):
nb_8=0
for i in range(n):
if s[i]=='8':
nb_8+=1
return nb_8
n=int(input())
s=input()
i=0
if n>10:
nb_8=calculnb_8(s,n)
while(i<nb_8)&((n-(i*11))>10):
i+=1
print(i)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
s = input()
digits = [0]*10
for digit in s:
num = int(digit)
digits[num] += 1
res = 0
while digits[8] != 0:
s = "8"
digits[8] -= 1
i = 0
while (i < 10) and (len(s) < 11):
while (digits[i] > 0) and (len(s) < 11):
digits[i] -= 1
s += str(i)
i += 1
i = 9 if i == 8 else i
i = 8
while (digits[i] > 0) and (len(s) < 11):
digits[i] -= 1
s += str(i)
if len(s) == 11:
res += 1
print(res) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.