text stringlengths 49 983k |
|---|
#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("%... |
#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... |
#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>... |
#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... |
#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]--... |
#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... |
#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... |
#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... |
#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... |
#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;
}
|
#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);
}
|
#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;
... |
#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;
}
|
#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;
}
|
#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... |
#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,... |
#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... |
#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;
}
|
#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));
}
|
#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... |
#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;
}
|
#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;
}
|
#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++;
}
... |
#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... |
#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
... |
#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;
... |
#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;
... |
#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);
}
|
#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);
}
|
#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] =... |
#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... |
#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";
}
|
#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;... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; s[i] != '\0'; i++) {
if (s[i] == '8') c++;
}
cout << min(n / 11, c);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int k = n;
string s;
cin >> s;
int cn = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '8') cn++;
}
int rem = n / 11;
if (rem <= cn)
cout << rem;
else
cout << cn;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
string s;
while (cin >> n) {
cin >> s;
int cnt8 = 0;
for (int i = 0; i < n; i++)
if (s[i] == '8') cnt8++;
int n8 = n - cnt8;
int ans = min(n / 11, cnt8);
cout... |
#include <bits/stdc++.h>
using namespace std;
const int inf = (int)1e9;
const int mod = inf + 7;
const double eps = 1e-9;
const double pi = acos(-1.0);
int n;
string second;
int cnt[1111];
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
cin >> n >> second;
for (int i = 0; i < n; ++i) {
cnt[second[i] - ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int count = 0;
int n;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; ++i)
if (s[i] == '8') ++count;
printf("%d\n", min(n / 11, count));
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string str;
cin >> str;
int temp = 0;
for (int i = 0; i < n; i++) {
if (str[i] == '8') temp++;
}
int ans = min(n / 11, temp);
cout << ans;
}
|
#include <bits/stdc++.h>
using namespace std;
void swap(char *x, char *y) {
char temp;
temp = *x;
*x = *y;
*y = temp;
}
bool isPalindrome(char str[]) {
long long int l = 0;
long long int h = strlen(str) - 1;
while (h > l) {
if (str[l++] != str[h--]) {
return false;
}
}
return true;
}
lon... |
#include <bits/stdc++.h>
using namespace std;
int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, 1, -1};
void dance() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void file() {
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
}
long long gcd(long long a, long long b) { r... |
#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5;
const long long int M = 1e9 + 7;
queue<pair<long long int, long long int> > pq;
vector<long long int> v;
map<long long int, long long int> mpp;
set<pair<long long int, long long int> > st;
long long int a[N], h[N], indx[N][2];
long long int ... |
#include <bits/stdc++.h>
using namespace std;
const double eps = 1e-9;
const double maxn = 1e10 + 10;
const int INF = 0x3f3f3f3f;
const int mod = 1e9 + 7;
int main() {
int n, sum = 0;
cin >> n;
string s;
cin >> s;
for (int i = 0; i <= n - 1; i++) {
if (s[i] == '8') {
sum++;
}
}
int t = n / 1... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
string cards;
if (n < 11) {
cout << "0" << endl;
return 0;
} else {
cin >> cards;
for (int i = 0; i < n; i++) {
if (cards[i] == '8') count++;
}
int k = n / 11;
if (count >= k)
cout <<... |
#include <bits/stdc++.h>
using namespace std;
string s;
int b[10];
int main() {
int t, n, i, j;
scanf("%d", &n);
cin >> s;
int c = 0;
for (i = 0; i < n; i++) {
if (s[i] == '8') {
c++;
}
}
if (c == 0) {
printf("0\n");
} else {
printf("%d\n", min(c, n / 11));
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
clock_t clk_begin = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
string s;
cin >> s;
int c = 0;
for (int i = 0; i < n; ++i)
if (s[i] == '8') c++;
n /= 11;
cout << min(n, c) << '\n';
;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
char s;
for (int i = 0; i < n; i++) {
cin >> s;
if (s == '8') sum++;
}
sum = min(sum, n / 11);
cout << sum << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, cnt8;
char s[110];
int main() {
cin >> n;
cnt8 = 0;
scanf("%s", s + 1);
for (int i = 1; i <= n; ++i)
if (s[i] == '8') ++cnt8;
int ans = 0;
while (cnt8 > 0 && n >= 11) ++ans, --cnt8, n -= 11;
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, temp = 0, num = 0;
char x[105];
int main() {
cin >> n;
scanf("%s", &x);
for (int i = 0; i < n; i++) {
if (x[i] == '8') temp++;
}
num = min(n / 11, temp);
cout << num;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, eight;
string s;
int main() {
ios::sync_with_stdio(false);
cin >> n >> s;
for (char c : s) eight += (c == '8');
cout << min(n / 11, eight) << endl;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
using namespace std;
int n;
int ans;
string s;
int main() {
cin >> n >> s;
for (auto c : s) ans += c == '8';
cout << min(ans, n / 11) << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int mod = 1e9 + 7;
void cases() {
long long int n;
cin >> n;
string s;
cin >> s;
long long int c = 0;
for (long long int i = 0; i < n; i++) c += (s[i] == '8');
cout << min(c, n / 11);
}
int32_t main() {
std::ios::sync_with_stdio(false);
cin.tie(N... |
#include <bits/stdc++.h>
using namespace std;
const long double pi = 2 * acos(0.0);
template <class T>
bool umin(T& a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T>
bool umax(T& a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class TT>
bool pa... |
#include <bits/stdc++.h>
using namespace std;
char num[200];
int main() {
int n, ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> num[i];
if (num[i] == '8') ans++;
}
int sum = min(ans, n / 11);
cout << sum << endl;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
for (int i = 0; i < n; i++) {
char ch;
cin >> ch;
if (ch == '8') count++;
}
if (count == 0)
cout << 0;
else
cout << (count >= n / 11 ? n / 11 : count);
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i < s.size(); ++i) {
if (s[i] == '8') ++cnt;
}
cout << min(cnt, n / 11) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 111;
char s[N];
int main() {
int n;
scanf("%d %s", &n, s);
int ans = 0;
for (int i = 0; i < n; i++)
if (s[i] == '8') ans++;
ans = min(ans, n / 11);
printf("%d\n", ans);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxi = 1e6 + 10;
int a[maxi];
string s;
int n;
int cnt[maxi];
int main() {
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) cnt[s[i] - '0']++;
int mm = n / 11;
mm = min(mm, cnt[8]);
cout << mm << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long> v;
int main() {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (auto i : s) {
if (i == '8') cnt++;
}
int ans = 0;
while (cnt--) {
if (n < 11) break;
ans++;
n -= 11;
}
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
int a = 0, b = 0;
for (auto& i : s) {
if (i == '8')
++a;
else
++b;
}
int sol = 0;
while ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, check = 0;
cin >> n;
char a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == '8') check++;
}
int k = n / 11;
if (k < check)
cout << k;
else
cout << check;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
if (s[i] == '8') cnt++;
cout << min(cnt, (n / 11));
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
string str;
cin >> str;
int i, ans = 0;
for (i = 0; i < t; i++) {
if (str.at(i) == '8') ans++;
}
int k = t / 11;
if (ans > k || ans == k)
cout << k << endl;
else
cout << ans << endl;
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int n, count = 0, i, len;
char num[105];
scanf("%d ", &n);
gets(num);
len = strlen(num);
if (n >= 11) {
for (i = 0; i < len; i++) {
if (num[i] == '8') {
n -= 11;
if (n >= 0) {
count++;
continue;
} else
brea... |
#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;
... |
#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);
}
|
#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;
}
}
|
#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) {
... |
#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 ... |
#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;
}
|
#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;
}
|
#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, ... |
#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";
... |
#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', ... |
#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);
}
|
#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);
}
|
#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;
}
|
#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;
}
|
#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... |
#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... |
#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;
}
|
#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));
}
|
#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++;
... |
#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[... |
#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;
... |
#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;
}... |
#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;
}
|
#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 >= ... |
#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;
}
|
#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;
}
|
#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);
}
|
#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;
}
|
#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);
}... |
#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;
}
|
#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);
}
|
#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;
}
|
#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;
}
|
#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;
}
|
#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++;
... |
#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;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.