solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n=int(input())
s=list(input().rstrip())
print(min(s.count('8'),n//11))
| 7 | PYTHON3 |
#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);
}
| 7 | CPP |
n=int(input())
a=list(map(int,input()))
print(min(n//11,a.count(8))) | 7 | PYTHON3 |
n=int(input())
s=input()
if '8' in s and n>=11:
t=int(n/11)
if t<=s.count('8'):
print(int(n/11))
else:
print(s.count('8'))
else:
print(0)
| 7 | PYTHON3 |
#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);
}
}
}
}
}
}
}
| 7 | CPP |
n=int(input())
s=input()
print(min(s.count('8'),int(len(s)/11))) | 7 | PYTHON3 |
p = int(input())
string = input()
d = string.count('8')
l = p // 11
if l <= d:
print(l)
elif l>=d:
print(d)
else:
print("0")
| 7 | PYTHON3 |
x = int(input())
y = input()
eight = y.count('8')
num=min(x // 11, eight)
print(num)
| 7 | PYTHON3 |
n=int(input())
s=input()
c8=s.count('8')
print(min(c8,n//11)) | 7 | PYTHON3 |
n = int(input())
c = input().count('8')
print(min(n // 11, c)) | 7 | PYTHON3 |
n = eval(input())
c=input()
i =0
for j in range(n):
if c[j] == "8":
i+=1
print(min(i,(int)(n//11)))
| 7 | PYTHON3 |
n = int(input())
s = input()
counter = 0
for c in s:
if c == '8':
counter += 1
print(min(n // 11, counter))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
s = input()
temp = [0]*2
temp[0] = n // 11
temp[1] = s.count("8")
print(min(temp))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
s=input()
x=len(s)
c=0
for i in range(x):
if s[i]=='8':
c=c+1
if c>=1 and c<int(n/11):
print(c)
elif c>=1 and c>=int(n/11):
print(int(n/11))
else:
print("0") | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
# http://codeforces.com/contest/1060/problem/A
n=int(input())
lis=list(input())
n=len(lis)//11
c=lis.count('8')
if('8' in lis):
print(min(n,c))
else:
print(0) | 7 | PYTHON3 |
N = int(input())
S = str(input())
cnt = 0
for i in range(N):
if S[i]=='8':
cnt += 1
print(min(cnt,N//11))
| 7 | PYTHON3 |
n = int(input())
s = input()
e = min(s.count("8"), len(s)//11)
nums = (len(s)-e)//10
print(min(e,nums))
| 7 | PYTHON3 |
n = int(input())
a = input()
a0 = 0
a1 = 0
a2 = 0
a3 = 0
a4 = 0
a5 = 0
a6 = 0
a7 = 0
a8 = 0
a9 = 0
for i in a:
if i == '0':
a0 += 1
if i == '1':
a1 += 1
if i == '2':
a2 += 1
if i == '3':
a3 += 1
if i == '4':
a4 += 1
if i == '5':
a5 += 1
if i == '6':
a6 += 1
if i == '7':
a7 += 1
if i == '8':
a8 += 1
if i == '9':
a9 += 1
mm = sum([a8, a1, a2, a3, a4, a5, a6, a7, a9, a0])
kk = a8
k = 0
while kk > 0 and mm >= 11:
k += 1
mm -= 11
kk -= 1
print(k) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
# @Date : 2018-10-02 08:00:37
# @Author : raj lath ([email protected])
# @Link : link
# @Version : 1.0.0
from sys import stdin
max_val=int(10e12)
min_val=int(-10e12)
def read_int() : return int(stdin.readline())
def read_ints() : return [int(x) for x in stdin.readline().split()]
def read_str() : return input()
def read_strs() : return [x for x in stdin.readline().split()]
lens = read_int()
strs = read_str()
ans = lens // 11
print(min(ans, strs.count("8")))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
a=int(input())
b=input()
d=[]
if b.count('8')>1:
k=1
else:
k=0
if a>=11 and b.count('8')>0:
for i in range(a):
if b[i]!='8' and b[i] not in d:
d.append(b[i])
k+=1
print(min((a//11),(a//k),b.count('8')))
else:
print(0) | 7 | PYTHON3 |
k = int(input())
n = list(map(int,input()))
kv = n.count(8)
print(kv if kv < k // 11 else k//11) | 7 | PYTHON3 |
input()
string=input()
print(min(str.count(string,"8"),len(string)//11)) | 7 | PYTHON3 |
n=int(input())
a=list(map(int,list(input())))
c8=a.count(8)
t=n//11
if(t>=c8):
print(c8)
else:
print(t) | 7 | PYTHON3 |
x = int(input())
s = input()
if x < 11:
print("0")
else:
x1 = x//11
c = s.count('8')
if c < x1:
print(c)
else:
print(x1) | 7 | PYTHON3 |
n=int(input())
s=input()
k=0
if('8' in s):
d=s.count('8')
if(d>=1):
while(n>=11 and d>0):
k+=1
d-=1
n-=11
print(k)
#100
#88202862851852449384524
#88887088871457098945874
#486988698468788381417332
#842888928188688887641132194956
#22
#0011223344556677889988
#11
#00000000008
#11
#31415926535
| 7 | PYTHON3 |
n = int(input())
s = input()
def solve(n, s):
c = s.count('8')
while c:
if c + 10*c <= n: return c
c -= 1
return c
print(solve(n,s)) | 7 | PYTHON3 |
n = int(input())
a = str(input())
count = 0
for item in a:
if item == "8":
count += 1
print(int(min(n/11, count))) | 7 | PYTHON3 |
n = eval(input())
c = input()
i =0
count =0
temp=0
for j in range(n):
if c[j] == "8":
i+=1
if i ==0:
print(0)
else:
while count < i and temp+11<=n:
temp+=11
count+=1
print(count)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
from collections import Counter as c
n = int(input())
a = input()
if n>=11:
eight = c(a)
op = int(n/11)
if eight["8"]>=op:
print(op)
elif eight["8"]<op:
print(eight["8"])
else:
print(0)
else:
print(0)
| 7 | PYTHON3 |
n = input()
numbers = input()
eights = 0
max_nums = len(numbers)//11
for n in numbers:
if n == '8':
eights += 1
if eights >= max_nums:
print(max_nums)
else:
print(eights)
| 7 | PYTHON3 |
def phone_numbers():
n = int(input())
s = input()
if (n // 11 == 0):
print(0)
return 0
k = 0
for i in range(0, n):
if (s[i] == "8"):
k += 1
if (k == n // 11):
print(k)
return 0
if (k == 0):
print(0)
else:
print(k)
return 0
phone_numbers() | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
from collections import Counter
EIGHT = '8'
def solve(n, s):
counts = Counter(s)
r = 0
while counts[EIGHT]:
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 |
import sys
digits = int(input())
num = input()
total = 0
for i in range(len(num)):
if total == digits//11:
print(total)
sys.exit()
if num[i] == '8':
total += 1
continue
print(total) | 7 | PYTHON3 |
n = int(input())
s = input()
c = s.count("8")
print(min(n//11,c)) | 7 | PYTHON3 |
a = int(input())
S = input()
L = a//11
P = S.count("8")
print(min(L, P))
| 7 | PYTHON3 |
n=int(input())
s=input()
k=0
for e in s:
if e=='8':
k=k+1
r=n-k
a=r//10
if a>k:
print(k)
else:
print(n//11) | 7 | PYTHON3 |
n=int(input())
s=input()
count=s.count('8')
m=n//11
print(min(count,m)) | 7 | PYTHON3 |
#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);
}
| 7 | CPP |
n=int(input())
s=input()
s=list(s)
c=s.count("8")
if n//11<=c:
print(n//11)
elif c==0:
print(c)
elif n//11>c:
print(c) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
m = input()
s = 0
for i in range(n):
if(m[i] == "8"):
s+=1
print(min(n//11, s))
| 7 | PYTHON3 |
n = int(input())
k = str(input())
q = 0
for i in k:
if i == "8":
q += 1
if (len(k) - len(k) % 11) / 11 > q:
print(q)
else:
print(int((len(k) - len(k) % 11) / 11)) | 7 | PYTHON3 |
n = int(input())
a = [*map(int, input())]
e = a.count(8)
print(min(n//11, e)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
s=input()
m=s.count('8')
print(min(n//11,m))
| 7 | PYTHON3 |
n=int(input())
# ns=[int(x)for x in input().split()]
s=input()
nums=[0]*2
for c in s:
if ord(c)-ord('0')==8:
nums[0]+=1
else:
nums[1]+=1
def fetch10():
if sum(nums)<10:
return False
if nums[1]>=10:
nums[1]-=10
else:
nums[0]-=(10-nums[1])
nums[1]=0
def fetch11():
if nums[0]<=0:
return False
nums[0]-=1
if fetch10()==False:
return False
return True
ans=0
while fetch11():
ans+=1
print(ans) | 7 | PYTHON3 |
#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));
}
| 7 | CPP |
n = int(input())
s = input()
for i in range(n, -1, -1):
if s.count('8') < i:
continue
if (len(s) - i) // 10 < i:
continue
print(i)
break
| 7 | PYTHON3 |
#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);
}
| 7 | CPP |
n=int(input())
s=input()
print(int(min((s.count('8'),n/11)))) | 7 | PYTHON3 |
import math
from collections import defaultdict
def input_ints():
return list(map(int, input().split()))
def solve():
n = int(input())
s = input()
n = len(s)
c = s.count('8')
for x in range(100):
if x > c or 11 * x > n:
print(x - 1)
return
if __name__ == '__main__':
solve()
| 7 | PYTHON3 |
n=int(input())
a=input()
print(min(n//11,a.count("8"))) | 7 | PYTHON3 |
from collections import Counter
n = int(input().strip())
s = input().strip()
z = Counter(s)
if '8' not in s or n<11:
print(0)
else:
c=n//11
if z['8']>=c:
print(c)
else:
print(z['8'])
| 7 | PYTHON3 |
n=int(input())
s=str(input())
a=n//11
c=s.count("8")
print(min(a,c)) | 7 | PYTHON3 |
n=int(input())
l=input()
l=list(l)
a=l.count("8")
if a<=len(l)//11:
print(a)
elif a>=len(l)//11:
print(len(l)//11)
else:
print("0") | 7 | PYTHON3 |
#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);
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n=int(input())
a=input()
b=a.count('8')
c=n//11
if b==0 or n<11:
print(0)
elif b<=c:
print(b)
else:
print(c)
| 7 | PYTHON3 |
nnn = int(input())
n = input()
c8 = n.count('8')
print(min(c8, nnn//11)) | 7 | PYTHON3 |
def calc():
print()
def main():
n: int = int(input())
num: str = input().strip()
tmp: int = n // 11
print(min(num.count('8'), tmp))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
n = int(input())
s = input()
e = s.count('8')
a = 0
while e > 0 and n > 10:
e -= 1
n -= 11
a += 1
print(a)
| 7 | PYTHON3 |
l=int(input())
s=input()
frq={8:0,0:0}
for c in s:
if c!='8':
frq[0]=frq[0]+1
else:
frq[8]=frq[8]+1
l=0
r=10
while r>l+1:
m=(l+r)//2
if frq[8]-m>=0 and (frq[0]+frq[8]-m)//10>=m:
l=m
else:
r=m
print(l)
| 7 | PYTHON3 |
def main():
length = int(input())
cards = input()
n_eights = cards.count('8')
max_numbers = length // 11
print(min(n_eights, max_numbers))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
a=input()
b=n//11
c=a.count("8")
print(min(b,c)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n=int(input())
s=input()
res1=0
res2=0
l='8'
if l not in s or n<11:
print(0)
else:
res1=s.count(l)
res2=n//11
print(min(res1, res2)) | 7 | PYTHON3 |
n = int(input())
S = input()
print(min(S.count('8'), n // 11)) | 7 | PYTHON3 |
n=int(input())
m=input()
res=0
eig=m.count("8")
while n>=11 and eig>0:
if n>=11 and eig>0:
res+=1
eig-=1
n-=11
else:
break
print(res)
| 7 | PYTHON3 |
n = int(input())
cs = input()
eights = sum(1 for c in cs if c == '8')
print(min(len(cs) // 11, eights))
| 7 | PYTHON3 |
n=int(input())
s=list(str(input()))
res1=0
res2=0
l='8'
if l not in s or n<11:
print(0)
else:
res1=s.count(l)
res2=n//11
print(min(res1, res2)) | 7 | PYTHON3 |
n=int(input())
s=input()
eight=0
other=0
for i in s:
if i=='8':
eight+=1
else:
other+=1
z=0
a= eight+other
while 0<eight and 0<a:
eight-=1
num=1
while num<11 and 0<other:
other-=1
num+=1
while num<11 and 0<eight:
eight-=1
num+=1
if num==11:
z+=1
a=eight+other
print(z) | 7 | PYTHON3 |
"""
Phone Numbers
"""
n = int(input())
nString = input()
eights = nString.count('8')
strings = n //11
print(strings if(strings <= eights) else eights) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n = int(input())
nums = input()
cnt = nums.count('8')
n//=11
print(min(cnt, n)) | 7 | PYTHON3 |
n = int(input())
str = input()
res = 0
much = str.count("8")
while n >= 11:
if much > 0:
n -= 11
much -= 1
res += 1
else:
break
print(res) | 7 | PYTHON3 |
#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));
}
| 7 | CPP |
n = int(input())
s = input()
if '8' in s and len(s) >= 11:
count_8 = s.count('8')
num = min(count_8,len(s)//11)
print(num)
else:
print(0) | 7 | PYTHON3 |
#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();
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
q = int(input())
w= list(input())
e = w.count('8')
r = q//11
t = min(e, r)
print(t) | 7 | PYTHON3 |
n = int(input())
m = input()
f = m.count('8',0,len(m))
if 11*f < n:
print(f)
else:
print(n // 11)
| 7 | PYTHON3 |
#JMD
#Nagendra Jha-4096
import sys
import math
#import fractions
#import numpy
###File Operations###
fileoperation=0
if(fileoperation):
orig_stdout = sys.stdout
orig_stdin = sys.stdin
inputfile = open('W:/Competitive Programming/input.txt', 'r')
outputfile = open('W:/Competitive Programming/output.txt', 'w')
sys.stdin = inputfile
sys.stdout = outputfile
###Defines...###
mod=1000000007
###FUF's...###
def nospace(l):
ans=''.join(str(i) for i in l)
return ans
##### Main ####
t=1
for tt in range(t):
n=int(input())
s=str(input())
c=s.count('8')
ans=0
for i in range(c):
n-=11
if n<0:
break
ans+=1
print(ans)
#n,k,s= map(int, sys.stdin.readline().split(' '))
#a=list(map(int,sys.stdin.readline().split(' ')))
#####File Operations#####
if(fileoperation):
sys.stdout = orig_stdout
sys.stdin = orig_stdin
inputfile.close()
outputfile.close() | 7 | PYTHON3 |
n=int(input())
string=input()
a=string.count('8')
if(a>(n//11)):
a=n//11
print(min(a,(n-a)//10)) | 7 | PYTHON3 |
n = int(input())
s = list(map(int, list(input())))
e = s.count(8)
y = n - e
if e <= y // 10:
print(e)
elif e == 0:
print(0)
else:
u = 0
for i in range(0, e):
a = e - i
x = y + i
if a >= x // 10:
if x > u:
u = x // 10
else:
if a > u:
u = a
print(u) | 7 | PYTHON3 |
n=int(input())
s=input()
occu_8=s.count('8')
if ((n<11) or (occu_8==0)):
print(0)
elif ((n//11) >= occu_8):
print(occu_8)
else:
print((n//11))
| 7 | PYTHON3 |
n = int(input())
array = list(input())
eight = 0
notEight = 0
for x in array:
if x == '8':
eight += 1
else:
notEight+= 1
solution = 0
while(eight > 0 and eight + notEight > 10):
solution += 1
eight -= 1
if notEight < 10:
eight -= (10 - notEight)
notEight = 0
else:
notEight -= 10
print(solution) | 7 | PYTHON3 |
#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));
}
| 7 | CPP |
"""https://codeforces.com/contest/1060/problem/A"""
n = int(input())
a = input()
eights = 0
for i in range(n):
if a[i] == '8': eights+=1
elevens = n//11
print(min(eights,elevens)) | 7 | PYTHON3 |
a=int(input())//11
b=input()
b = b.count("8")
c=min(a,b)
print(c ) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.