solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
using namespace std;
set<int> trip;
set<int> vec[200010];
struct node {
int u, v;
} mf[200010];
int n, m, k;
int ans[200010];
void remove(int x) {
set<int>::iterator it;
if (vec[x].size() < k && trip.count(x)) {
trip.erase(x);
for (it = vec[x].begin(); it != vec[x].end(); it++) {
... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int a[200005];
int b[200005];
vector<int> adj[200005];
bool removed[200005];
int nc[200005];
int ans[200005];
set<pair<int, int>> remedges;
int main() {
ios::sync_with_stdio(false);
scanf("%d %d %d", &n, &m, &k);
for (int i = 0; i < m; i++) {
scanf("%... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7;
long long powmod(long long a, long long b, long long mod) {
long long res = 1;
a %= mod;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
}
return res % mod;
}
const int N = 2e5 + 10;
int degree... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
string to_string(string s) { return '"' + s + '"'; }
string to_string(char s) { return string(1, s); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A>... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int mxN = 2e5;
int n, m, k, eu[mxN], ev[mxN], ans[mxN];
set<int> adj[mxN];
bool a[mxN];
vector<int> tp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < m; ++i) {
cin >> eu[i] >> ev[i], --eu[i], --ev[i];
ad... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, m, d[200005], k, res, vs[200005], ans[200005], pa;
map<int, int> cnt[200005];
vector<int> ke[200005];
pair<int, int> a[200005];
void dfs(int u) {
d[u]--;
res--;
vs[u] = 1;
for (int v : ke[u])
if (vs[v] == 0) {
cnt[u][v] = cnt[v][u] = 1;
d[v]--... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5;
set<int> g[MAXN];
int n, m, k;
int result = 0;
bool removed[MAXN];
int c[MAXN];
int edges[MAXN][2];
queue<int> q;
void remove_item(int m) {
result--;
q.push(m);
removed[m] = true;
}
void clear_queue() {
while (!q.empty()) {
auto to = q.fron... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
int deg[200010];
vector<vector<int> > graph(200010);
map<pair<int, int>, int> edgeNum;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int tt = 1;
while (tt--) {
int n, m, k;
cin >> n >> m >> k;
int x[m], y[m];
for (in... | 11 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
const int maxm = 2e5 + 10;
const int INF = 0x3f3f3f3f;
struct Edge {
int v, next, id;
} edge[maxm * 2];
int n, m, k, res;
int U[maxn], V[maxn], du[maxn], Ans[maxn];
int head[maxn], cnt;
queue<int> q;
bool vis[maxn];
bool ok[maxn];
void add(int u... | 11 | CPP |
n = int(input())
s = input()
k = s.count("8")
l = n - k
if k <= l//10: print(k)
else:
while k > l//10:
k -= 1
l += 1
print(min(k, l//10))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const long long int LINF = 0x3f3f3f3f3f3f3f3fll;
int t, n, a, b, cnt1, cnt2;
string s;
int main() {
cin >> n;
cin >> s;
cnt1 = n / 11;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') cnt2++;
}
cout << min(cnt1, cnt2) << endl... | 7 | CPP |
n=int(input())
s=str(input())
p=s.count("8")
q=n//11
f=min(p,q)
print(f)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
char c;
int n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> c;
if (c == '8') cnt++;
}
cout << min(cnt, n / 11) << endl;
}
| 7 | CPP |
a=int(input())
y=input()
x=y.count('8')
print(min(a//11,x)) | 7 | PYTHON3 |
n=int(input())
s=input()
i=0
nb_8=0
if n>10:
while(i<n)&((n-(nb_8*11))>10):
if s[i]=='8':
nb_8+=1
i+=1
print(nb_8) | 7 | PYTHON3 |
n = int(input())
eights = 0
others = 0
for elem in input():
if int(elem) == 8:
eights += 1
else:
others += 1
answer = 0
while True:
if eights == 0:
break
else:
eights -= 1
if others >= 10:
others -= 10
answer += 1
else:
... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
string s;
cin >> s;
char c = '8';
for (int i = 0; i < n; i++) {
if (s[i] == c) count++;
}
cout << min(count, n / 11);
}
| 7 | CPP |
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
n = r()
a = input()
num = defaultdict(int)
fo... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, temp = 0, temp1 = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '8') temp++;
}
for (int i = 1; i <= temp; i++) {
int r = (n - i) / 10;
if (r >= i) {
temp1++;
} else
break;
... | 7 | CPP |
n=int(input())
a=list(input())
k=a.count('8')
s=0
while k>0 and n>10:
s+=1
n-=11
k-=1
print(s)
| 7 | PYTHON3 |
n=int(input())
s=input()
a=s.count('8')
b=n//11
print(min(a,b))
| 7 | PYTHON3 |
n=int(input())
s=input()
c=s.count('8')
x=n//11
if c>=x:
print(n//11)
elif c < x:
print(c)
else:
print(0) | 7 | PYTHON3 |
N=int(input())
s=input()
count=0
for i in s:
if i=='8':
count=count+1
if count !=0:
p=N/11
if p>count:
print(count)
else:
print(int(p))
else:
print(0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
int arr[10] = {};
for (int i = 0; i < n; i++) {
char c;
cin >> c;
arr[c - '0']++;
}
cout << min(n / 11, arr[8]);
return 0;
}
| 7 | CPP |
def phone_numbers(s, n):
return min(s.count('8'), n // 11)
m = int(input())
t = input()
print(phone_numbers(t, m))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, max = 0;
string str;
cin >> n;
cin >> str;
for (int i = 0; i < n; i++) {
if (str[i] == '8') {
max++;
}
}
if (max > n / 11) {
max = n / 11;
}
if (n % 11 != 0 && max > n / 11) {
max = n / 11;
}
cout << max;
}
| 7 | CPP |
def solution(l1):
i=0
while i<len(l1):
if l1[i]==8:
l1[i]=1
else:
l1[i]=0
i+=1
l1.sort()
i=0
#print(l1)
while len(l1)>10 and 1 in l1:
l1.remove(1)
for x in range (0,10):
l1.remove(l1[0])
i+=1
return i
... | 7 | PYTHON3 |
def find_number(cards, n):
if n < 11:
return 0
max_by_len = n // 11
count_of_eight = 0
for c in cards:
if c == '8':
count_of_eight += 1
if count_of_eight >= max_by_len:
break
return count_of_eight
def stand_input():
n = int(input())
ca... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int eig = 0, oth = 0, num = 0;
int n;
cin >> n;
char tab[n];
string cards;
cin >> cards;
for (int i = 0; i < n; i++) tab[i] = cards.at(i);
for (int i = 0; i < n; i++) {
if (tab[i] == '8') eig++;
}
oth = n;
while ((oth > 10) && (eig > 0... | 7 | CPP |
n = int(input())
s = input()
print(min(s.count("8"), n//11)) | 7 | PYTHON3 |
n = int(input())
s = input()
count1 = 0
for i in range(n):
if s[i] == "8":
count1 += 1
if count1 == 0:
print(0)
else:
tam = n//11
if tam <= count1:
print(tam)
else:
print(count1) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long powmod(long long a, long long b, long long mod) {
if (b == 0 || a == 1) {
if (mod == 1)
return 0;
else
return 1;
}
if (b % 2 == 0) {
long long k = powmod(a, b / 2, mod);
return (k * k) % mod;
} else {
long long k = powmod(a,... | 7 | CPP |
# 1060A => Phone Numbers
# https://codeforces.com/problemset/problem/1060/A
n = int(input())
digits = input()
if digits.count("8") == 0:
print(0)
else:
ans = 0
temp = digits.count("8")
for _ in range(temp):
if n == 0 or n - 11 < 0:
break
n -= 11
ans += 1
print(an... | 7 | PYTHON3 |
l=int(input())
s=input()
e=s.count('8')
m=(l)//11
print(min(e,m))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int cnt = 0, count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') cnt++;
}
while (cnt) {
n = n - 1;
cnt = cnt - 1;
if (n / 10 > 0) {
count++;
n = n - 10;
}
}
cout << c... | 7 | CPP |
n = int(input())
s = input()
c = 0
for i in range(len(s)):
if s[i] == "8":
c += 1
print(min(c, len(s) // 11)) | 7 | PYTHON3 |
from math import *
n = int(input())
s = [int(i) for i in input()][:n]
# print(s)
ctr = 0
for i in s:
ctr += 1 if i == 8 else 0
print(min(ctr,len(s)//11)) | 7 | PYTHON3 |
n = int(input())
s = input()
a = s.count("8")
print(min(n//11,a)) | 7 | PYTHON3 |
def main():
n = int(input())
s = input()
print(solver(s))
def solver(s):
eights = s.count('8')
return min(len(s) // 11, eights)
#print(solver('00000000008'))
#print(solver('0011223344556677889988'))
#print(solver('31415926535'))
main() | 7 | PYTHON3 |
a=int(input())
l=input();c=0
m=len(l);flag=0
for i in l:
if i=='8':
flag=1
c+=1
n=m//11
if flag==1:
print(min(n,c))
else:
print(0) | 7 | PYTHON3 |
length=int(input())
num=input()
p=0
for i in range(length):
if num[i]=='8':
p+=1 #Counts the number of '8' in string
if length>=11:
if p>=(length//11):
print(length//11)
else:
print(p) #what if there are '8' enuf to create a number? then the no. of numbers created will be p as '8' is required to make a number... | 7 | PYTHON3 |
#include <bits/stdc++.h>
int c[10];
using namespace std;
int main() {
int n;
scanf("%d", &n);
int a[n], i;
string s;
cin >> s;
for (i = 0; i < n; i++) {
c[s[i] - '0']++;
}
int ans = 0;
for (i = 1; i <= c[8]; i++) {
if ((n - i) >= 10 * i) ans = i;
}
cout << ans;
return 0;
}
| 7 | CPP |
x = int(input())
y = input()
a = x // 11
m = [d for d in y]
t = m.count("8")
if m.count("8") >= a:
print(a)
elif t <= a and len(y) >= (11* t) and t !=0 :
print(t)
else:
print("0") | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n, cnt = 0, temp;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%01d", &temp);
if (temp == 8) cnt++;
}
printf("%d\n", min(cnt, n / 11));
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, countOfEight = 0, alongNums = 0;
string input;
cin >> n >> input;
for (int i = 0; i < n; i++) {
char cha = input[i];
if (cha == '8') countOfEight++;
}
alongNums = n - countOfEight;
while (alongNums / 10 < countOfEight) {
alongNu... | 7 | CPP |
def main():
d = int(input())
c = input()
ec = len([v for v in c if v=='8'])
mv = 0
for i in range(ec+1):
ne = (len(c) - i) // 10
mv = max(min(ne, i), mv)
print(mv)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
n=int(input())
s=input()
p=s.count('8')
r=n//11
print(min(r,p)) | 7 | PYTHON3 |
n=int(input())
s=str(input())
k=0
for i in range (n) :
if int(s[i])==8 :
k=k+1
l=n/11
if (k > 0 and l>0):
if (l>k):
p=k
else :
p=l
else:
p=0
p=int(p)
print(p) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 110;
int main(int argc, char const *argv[]) {
char s[MAX_N];
int n;
int eight = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> s[i];
if (s[i] == '8') eight++;
}
cout << min(eight, n / 11) << endl;
return 0;
}
| 7 | CPP |
_ = input()
N = input()
LLLLen = N.count('8')
sss = len(N) // 11
print(min(LLLLen, sss)) | 7 | PYTHON3 |
n=int(input())
s=input()
i=s.count('8')
if(s.count('8')==0):
print(0)
else:
while(i>=0):
if (n-i)>=10*i:
print(i)
break
else:
i-=1
| 7 | PYTHON3 |
n=int(input())
s = input()
s.count('8')
a = int(n/11)
print(min(s.count('8'),a))
| 7 | PYTHON3 |
n=int(input())
s=list(input())
a=n//11
b=s.count('8')
if b>=a:
print(a)
elif(b<a):
print(b) | 7 | PYTHON3 |
input()
k = input()
s = k.count('8')
l = len(list(k)) // 11
print(min(s,l)) | 7 | PYTHON3 |
n = int(input())
s = list(input())
cnt_8 = 0
for item in s:
if item == '8':
cnt_8 += 1
cnt_num = n//11
if cnt_8 > cnt_num:
print(cnt_num)
else:
print(cnt_8)
| 7 | PYTHON3 |
input()
s = list(input())
if len(s) < 11 or s.count('8') == 0:
print(0)
exit(0)
s.sort()
a = [i for i in range(len(s)) if s[i] == '8']
s[a[0]:a[-1]+1] = []
for _ in range(len(a)): s.append('8')
cnt = 0
while len(s) >= 11:
if s.count('8') == 0: break
s.remove('8')
s[0:10] = []
cnt += 1
print(cnt) | 7 | PYTHON3 |
print(min(int(input()) // 11, input().count("8"))) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long int a, b, m, n, i, j, k, l, cnt = 0, ans, Min;
char c[113];
cin >> n;
for (i = 1; i <= n; i++) {
cin >> c[i];
if (c[i] == '8') {
cnt++;
}
}
ans = n / 11;
Min = min(ans, cnt);
cout << Min << endl;
return 0;
}
| 7 | CPP |
N = int(input())
eight_amount = input().count("8")
if N // 11 >= eight_amount:
print(eight_amount)
else:
print(N // 11) | 7 | PYTHON3 |
#python is so shitty
n=input();s=str(input())
def main():
m=len(s)//11
counter=0
for i in s:
if i=="8":
counter+=1
print(min(counter,m))
main() | 7 | PYTHON3 |
n=int(input())
s=input()
m=n//11
c=0
for i in range(n):
if(s[i]=='8'):
c+=1
print(min(m,c))
| 7 | PYTHON3 |
n=int(input())
s=input()
c=s.count('8')
if c==0 or n<11:
print(0)
exit()
num=n-c
ans=0
#print(num,c)
while(True):
if c<1:
break
if num>=10 and c>=1:
ans+=1
num-=10
c-=1
elif num<10:
if num+c>=11:
ans+=1
c-=(11-num)
num=0
... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int num[10];
int main() {
cin >> n;
cin >> s;
int c = 0;
for (int i = 0; i < n; i++) {
num[s[i] - '0']++;
if (s[i] != '8') c++;
}
int ans = 0;
while (num[8] >= 0) {
ans = max(ans, min(num[8], c / 10));
num[8]--;
c++;
}
... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 7;
int n;
int a[maxn], b[maxn];
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-') f = -1;
ch = getchar();
}
x = x * 10 + ch - '0';
return x * f;
}
inline void writ(int x) {
i... | 7 | CPP |
n = int(input())
a = input()
print(min(a.count('8'), n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
char a[105];
int ans = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == '8') ans++;
}
if (n < 11 || ans == 0) {
cout << 0 << endl;
return 0;
}
if (ans >= n / 11)
cout << n / 11 << endl;
else
... | 7 | CPP |
x=int(input())
y=input()
c=y.count('8')
d=x//11
print(min(c,d))
| 7 | PYTHON3 |
n = int(input())
a = list(input())
# print(a)
cnt = a.count('8')
l = len(a)//11
print(min(cnt,l))
| 7 | PYTHON3 |
nu=int(input())
number=int(input())
cont=0
for i in (str(number)):
if(i=="8"):
cont+=1
nu=nu/11
if(cont>nu):
print(int(nu))
else:
print(int(cont)) | 7 | PYTHON3 |
n = int(input())
text = input()
print(min(n // 11, text.count('8'))) | 7 | PYTHON3 |
import collections
n = int(input())
digits = input()
c = collections.Counter(digits)
print("{0}\n".format(min(len(digits) // 11, c['8']))) | 7 | PYTHON3 |
n = int(input())
chars = input()
chars_map = [0] * 10
for char in chars:
chars_map[ord(char)-ord('0')] += 1
numbers_count = 0
while chars_map[8]:
chars_map[8] -= 1
remaining = 10
for char in [0, 1, 2, 3, 4, 5, 6, 7, 9, 8]:
diff = min(remaining, chars_map[char])
remaining -= diff
... | 7 | PYTHON3 |
n=int(input())
s=input()
x=int(n/11)
y=0
for i in range (0, n):
if s[i]=='8':
y=y+1
if x>y:
pn=y
else:
pn=x
print(pn) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int n1 = 0, n2 = 0, n3 = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') n1++;
}
n2 = n / 11;
if (n1 == 0 || s.size() < 8) {
cout << "0" << endl;
return 0;
}
cout << min(n2, n1) << endl;
... | 7 | CPP |
# Phone Numbers
def phone(s):
ans = 0
n = len(s)
while True:
if s.count('8') == 0 or n < 11:
return ans
s = s.replace('8', '', 1)
n -= 11
ans += 1
return ans
n = int(input())
s = input()
print(phone(s))
| 7 | PYTHON3 |
n = int(input())
s = input()
dg = list(s)
ans = 0
n8 = s.count('8')
while n8:
n -= 11
n8 -= 1
if (n < 0):
break
ans += 1
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f, mod = 1000000007;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double pi = acosl(-1.), eps = 1e-9;
inline int power(int a, int b, int m = mod, int ans = 1) {
for (; b; b >>= 1, a = 1LL * a * a % m)
if (b & 1) ans = 1LL * ans * a % m;
... | 7 | CPP |
# for testCase in range(int(input())):
n = int(input())
s = input()
ans = 0
for i in range(s.count('8')+1):
ans = max(ans ,min(i ,(n-i)//10))
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, x, a;
string s;
int main() {
cin >> n >> s;
for (int i = 0; i < n; ++i) {
if (s[i] == '8') {
x++;
}
}
a = n / 11;
cout << min(a, x);
}
| 7 | CPP |
n=int(input())
a=list(input())
x=0
for i in range(n):
if a[i]=='8':
x+=1
print(min(x,n//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n;
string s;
int main() {
cin >> n >> s;
int x = count(s.begin(), s.end(), '8');
cout << min(n / 11, x);
}
| 7 | CPP |
#include <bits/stdc++.h>
int main(void) {
int n;
char s[100], dummy[1];
int number = 0;
scanf("%d", &n);
gets(dummy);
gets(s);
if (strlen(s) != n) {
printf("%d", number);
} else {
for (int i = 0; i < n; i++) {
if (s[i] == '0' || s[i] == '1' || s[i] == '2' || s[i] == '3' ||
s[i] =... | 7 | CPP |
n = int(input()) // 11
s = input()
eight = s.count('8')
if eight >= n:
print ( n )
else:
print ( eight )
| 7 | PYTHON3 |
a=int(input())
b=input()
n=a//11
c=0
for i in range(a):
if(b[i]=='8'):
c+=1
print(min(c,n))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const long long max3 = 1003;
const long long max4 = 10004;
const long long max5 = 100005;
const long long max6 = 1000006;
const long long max7 = 10000007;
const long long lg4 = 13;
const long long lg5 = 17;
const long long lg6 = 20;
const long long INF = 2LL * 1000000000;
c... | 7 | CPP |
# You'll never get ahead of anyone as long as you try to get even with him. Lou Holtz
# by : Blue Edge - Create some chaos
n=int(input())
s=input()
print(min(n//11,s.count("8")))
| 7 | PYTHON3 |
n=int(input())#n个m=input()
m=int(input())
s=map(int,str(m))
i=0
for k in s:
if k==8:
i=i+1
j=int(n/11)
if i>j:
print(j)
else:
print(i)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string a;
cin >> a;
int ans = 0;
for (int i = 0; i < n; ++i) {
ans += (a[i] == '8');
}
cout << min(ans, n / 11) << "\n";
}
| 7 | CPP |
n = int(input())
s = input()
if n<11: print(0)
elif '8' not in s: print(0)
else:
x = s.count('8')
y = len(s)//11
print(min(x,y)) | 7 | PYTHON3 |
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!
from sys import stdin, stdout
N = int(input())
s = input()
#arr = [int(x) for x in stdin.readline().split()]
eight = 0
for i in range(N):
if s[i]=='8':
eight += 1
non_eight = ... | 7 | PYTHON3 |
n = int(input())
s = input()
print(min(s.count('8'), len(s)//11)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void Letters() {
int n, m;
cin >> n >> m;
vector<int64_t> houses;
vector<int64_t> letters;
vector<int64_t> apart;
for (int i = 0; i < n; i++) {
int64_t k;
cin >> k;
houses.push_back(k);
}
for (int i = 0; i < m; i++) {
int64_t k;
cin >> k;... | 7 | CPP |
a = int(input())//11
b = 0
for i in input():
if i == '8':
b += 1
print(min(a,b)) | 7 | PYTHON3 |
#22
#0011223344556677889988
n = int(input())
t = input()
c = t.count('8')
for x in range(c,-1,-1):
if (x + 10 * x) <= n:
print (x)
break | 7 | PYTHON3 |
n = int(input())
s = input()
p = s.count('8')
m = n // 11
if n < 11 or p == 0:
print(0)
else:
print(min(p,m)) | 7 | PYTHON3 |
n = int(input())
s = input()
if n>=11:
t = n//11
c = s.count('8')
print(min(c, t))
else:
print(0) | 7 | PYTHON3 |
n = int(input())
s = input()
count8 = 0
if '8' in s and n >= 11:
for i in range(n):
if '8' == s[i]:
count8 += 1
count11 = n//11
if count8 > count11:
print(count11)
else:
print(count8)
else:
print(0)
| 7 | PYTHON3 |
n=input()
c=input()
eig_d=c.count('8')
if eig_d==0 or int(n)<8 :
print(0)
else :
print(min(eig_d,int(n) //11)) | 7 | PYTHON3 |
# cf 1060 A 800
n = int(input())
s = [*map(int, input())]
n8 = s.count(8)
while n8 > 0:
if (len(s) - n8) // 10 >= n8:
break
n8 -= 1
print(n8)
| 7 | PYTHON3 |
n=int(input())
ph=str(input())
ct=0
for i in range(0,n):
if(ph[i]=='8'):
ct+=1
if(n<11):
print("0")
exit()
elif(ct==0):
print("0")
exit()
else:
tt=0
tt=n//11
print(min(tt,ct))
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.