solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
#include <bits/stdc++.h>
inline int min(int x, int y) { return x < y ? x : y; }
inline int getch() {
int ch = getchar();
while (!isdigit(ch)) ch = getchar();
return ch;
}
int n;
int main() {
scanf("%d", &n);
int NOE = 0;
for (register int i = 1; i <= n; ++i) {
int ch = getch();
if (ch == '8') ++NOE;... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long m;
long long n, k = 0, k1 = 0, k0 = 0, sm = 0, mn = 1e5, sm_original = 0, f = 0,
k2 = 0, t, mx = -1;
string s;
cin >> n;
cin >> s;
for (long long i = 0; i < s.size(); i++)
if (s[i] == '8') k++;
n = s.size() / 11;
... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int an = 0;
char a[100];
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] == '8') {
an++;
}
}
int m = n / 11;
cout << min(m, an);
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count() *
((uint64_t) new char | 1));
long long get_random_int(long long a, long long b) {
return uniform_int_distribution<long long>(a, b)(rng);
}
int main() {
ios_base::sync_with_stdio(false)... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n;
string s;
long long cnt[10];
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> s;
for (long long(i) = (0); (i) <= (n - 1); (i)++) cnt[s[i] - '0']++;
cout << min(n / 11, cnt[8]) << endl;
return 0;
}
| 7 | CPP |
n = int(input())
s = input()
c, nph = s.count('8'), n//11
print(min(c,nph)) | 7 | PYTHON3 |
n=int(input())
s=input()
num_eight=0
for i in range(n):
if s[i]=='8':
num_eight+=1
phone_num=n//11
if num_eight<=phone_num:
print(num_eight)
else:
print(phone_num) | 7 | PYTHON3 |
long = int(input())
ch = input()
nb = 0
for i in range(0, long):
if ch[i] == '8':
nb += 1
div=long//11
if long>=11:
print(min(div,nb))
else:
print(0) | 7 | PYTHON3 |
n = int(input())
s = input()
m = s.count("8")
n
if m == 0 or n < 11:
print(0)
else:
lo,hi = 1,m
while lo <= hi:
mid = (lo+hi) // 2
if mid * 10 <= n - mid:
lo = mid + 1
else:
hi = mid - 1
print(hi)
| 7 | PYTHON3 |
n=int(input())
s=input()
eight=s.count('8')
print(min(eight,int(n//11))) | 7 | PYTHON3 |
x=int(input())
s=input()
d=x//11
e=s.count('8')
print(min(e,d))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, ans;
char str[1000];
int main() {
while (cin >> n) {
cin >> str;
ans = 0;
for (int i = 0; i < n; ++i)
if (str[i] == '8') ans++;
ans = min(ans, n / 11);
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
n=int(input())
s=input()
k=s.count('8')
if(n//11<=k):
print(n//11)
else:
print(k)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, num, ans, cnt = 0;
char x;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x;
if (x == '8') num++;
}
for (int i = 1; i <= num; i++) {
for (int j = 1; j <= 11; j++) cnt++;
if (cnt > n) {
ans = i - 1;
break;
}
if... | 7 | CPP |
n = int(input())
s = input()
if n >= 11:
print(min(s.count('8'), n // 11))
else:
print(0) | 7 | PYTHON3 |
n = int(input())
m = input()
t = 0
for i in range (len(m)):
if (m[i]=='8'):
t=t+1
if (n//11<=t):
print (n//11)
print ()
else:
print (t)
print ()
| 7 | PYTHON3 |
def counter(cards, n):
if(n<11):
return 0
else:
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... | 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)
print(0)
else:
a=[n//11,c]
print(min(a))
| 7 | PYTHON3 |
import math
n=int(input())
s=input()
c=0
d=s.count('8')
print(min(n//11,d)) | 7 | PYTHON3 |
a=int(input())
s=str(input())
l=list(s)
k=l.count('8')
m=min(int(a/11),k)
print(m) | 7 | PYTHON3 |
a=input()
b=input()
cont=0
i=0
while(i<int(a) and cont<=int(a)//11-1):
if b[i]=="8":
cont=cont+1
i=i+1
print(cont) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '8') count++;
}
if (n < 11)
cout << "0" << endl;
else {
cout << min(count, n / 11) << endl;
}
return 0;
}
| 7 | CPP |
import collections
def solve():
n = int(input())
cards = collections.Counter(input())
eights = cards['8']
ans: int = min(eights, n // 11)
print(ans)
if __name__ == '__main__':
solve()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int n, con;
char a[100000];
int main() {
scanf("%d", &n);
scanf("%s", a);
for (int i = 0; i < n; ++i)
if (a[i] == '8') con++;
printf("%d\n", min(con, n / 11));
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
signed main() {
int n, cnt = 0;
char s[105];
cin >> n;
scanf("%s", s);
for (int i = 0; i < n; i++) cnt += s[i] == '8';
cout << min(cnt, n / 11);
}
| 7 | CPP |
n=int(input())
number=str(input())
ndiv=int(n/11)
if(n<11):
print('0')
else:
nume=number.count("8")
if nume>=ndiv:
print(ndiv)
else :
print(nume) | 7 | PYTHON3 |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int inf = 0x3f3f3f3f;
string s;
int len;
int fac[101];
inline char nc() {
static char buf[100000], *p1 = buf, *p2 = buf;
if (p1 == p2) {
p2 = (p1 = buf) + fread(buf, 1, 100000, stdin);
if (p1 == p2) return EOF;
}
return *p1++;
}... | 7 | CPP |
n = int(input())
s = input()
n8 = 0
for x in s:
if x == '8':
n8 += 1
print(min(n8, n // 11)) | 7 | PYTHON3 |
n = int(input())
lst = list(input())
print(min(lst.count('8'), n // 11))
| 7 | PYTHON3 |
n = int(input())
num = int(input())
p = 0
count = 0
c = 0
a=[0]
while n != 0:
if (num % 10) == 8:
p += 1
c-=1
num //= 10
c += 1
n-=1
#print(c,p)
while c >= 10 and p > 0:
c -= 10
p -= 1
count += 1
#print(c,p)
if p>0:
count=count+(c+p)//11
print(count)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int coun = 0;
string s;
cin >> s;
for (int i = 0; i < n; i += 1) {
if (s[i] == '8') coun++;
}
cout << min(coun, n / 11);
return 0;
}
| 7 | CPP |
n=int(input())
s=list(str(input()))
e,m=0,0
if '8' not in s or n<11:
print(0)
else:
e=s.count('8')
m=n//11
print(min(e,m)) | 7 | PYTHON3 |
n = int(input())
s = input()
eights = s.count('8')
print(min(eights, len(s) // 11))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int count = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '8') {
count++;
}
}
if (n == 11 && count >= 1) {
cout << 1 << "\n";
} else {
int a = n / 11;
if (count >= a) {
... | 7 | CPP |
n=int(input())
s=input()
c=0
for i in range(len(s)):
if(s[i]=='8'):
c=c+1
a=n//11
print(min(c,a))
| 7 | PYTHON3 |
# A. Phone Numbers
n=int(input())
s=input()
m=s.count("8")
ans=min(m,n//11)
print(ans) | 7 | PYTHON3 |
from collections import Counter
n = int(input())
c = Counter(input())
if '8' in list(c):
print(min(n//11,c['8']))
else:
print(0) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, count = 0;
char st[100];
cin >> n;
cin >> st;
if (n >= 11) {
for (int i = 0; i <= n; i++) {
if (st[i] == '8')
count++;
else
continue;
}
if (count == 0) {
count = 0;
} else if (count != 0 && n / ... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T& x) {
x = 0;
T f = 1;
char ch = getchar();
while (!isdigit(ch)) f = ch == '-' ? -f : f, ch = getchar();
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
}
template <typename T>
void viet(T x) {
if (x > 9) vie... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 1123456;
template <typename T>
T sqr(T x) {
return x * x;
}
template <typename T>
void vout(T s) {
cout << s << "\n";
exit(0);
}
long long bp(long long a, long long n) {
long long res = 1;
while (n) {
if (n % 2) res *= a;
a *= a;
... | 7 | CPP |
n = int(input())
s = input()
n8 = 0
for i in range(n):
if s[i] == '8':
n8 += 1
ans = 0
for i in range(n8, 0, -1):
if (n - i) // 10 >= i:
ans = i
break
print(ans)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
const int MAXN = 1e5 + 20;
int n, k, M;
int inv[MAXN], pre_inv[MAXN];
void math_pre() {
inv[1] = 1;
for (int i = 2; i <= ((n < 4) ? 4 : n); ++i)
inv[i] = 1ll * (M - M / i) * inv[M % i] % M;
for (int i = 1; i <= n; ++i) pre_inv[i] = (pre_inv[i - 1] + inv[i]) % M;
}
struct map {
stati... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
const long long N = 1e5 + 5;
inline long long read() {
long long x = 0, f = 1;
char ch = getchar();
while ((ch > '9' || ch < '0')) {
if (ch == '-') f = -1;
ch = getchar();
}
while ('0' <= ch && ch <= '9') x = x * 10 + (ch ^ 48), ... | 13 | CPP |
#include <bits/stdc++.h>
const int N = 200005;
int n, k, q, mod, cnt[2];
int sH[N], ans;
void up(int &x, int y) { x += y - mod, x += x >> 31 & mod; }
void up(int &x, int y, int z) { x = (x + (long long)y * z) % mod; }
int c(int n) { return (long long)n * (n - 1) / 2 % mod; }
void solve(int n, int m) {
if (m == 1 || n... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int md;
inline void add(int &a, int b) {
a += b;
if (a >= md) a -= md;
}
inline void sub(int &a, int b) {
a -= b;
if (a < 0) a += md;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int power(int a, long long b) {
int res = 1;
whil... | 13 | CPP |
#include <bits/stdc++.h>
using std::cerr;
using std::endl;
const int N = 1e5 + 10;
int n, K, P, inv[N], sum[N], ans;
std::map<int, int> map;
void divide(int l, int r, int dep) {
if (l == r || dep == K) {
return ++map[r - l + 1], void();
}
int mid = (l + r) >> 1;
divide(l, mid, dep + 1);
divide(mid + 1, r,... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ull = uint64_t;
using ll = int64_t;
using ld = long double;
int mod;
ll pw(ll a, int b) {
if (!b) {
return 1;
}
ll v = pw(a, b / 2);
v = (v * v) % mod;
if (b & 1) {
v = (v * a) % mod;
}
return v;
}
ll ans = 0;
ll norm(ll x) {
x %= mod;
if (x ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int Mod;
int inv4;
int inv[200010];
int sum[200010];
int fpow(int a, int b) {
int ans = 1, t = a;
while (b) {
if (b & 1) ans = 1ll * ans * t % Mod;
t = 1ll * t * t % Mod;
b >>= 1;
}
return ans;
}
void init() {
int N = 200000;
for (int i = 1... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int mod;
const int maxn = 200111;
map<int, int> mp;
int n, k;
long long inv[maxn];
int id[maxn], g[maxn], gn;
long long sum;
long long calc(long long a, long long b) {
long long ret = 0;
for (int i = 2; i <= a + b; i++) {
long long l = max(1ll, i - b), r = min(i - 1... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
inline T1 max(T1 a, T2 b) {
return a < b ? b : a;
}
template <typename T1, typename T2>
inline T1 min(T1 a, T2 b) {
return a < b ? a : b;
}
const char lf = '\n';
namespace ae86 {
const int bufl = 1 << 15;
char buf[bufl], *s = buf, *t ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int p;
int Pow(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = 1ll * a * a % p) {
if (b & 1) ans = 1ll * ans * a % p;
}
return ans;
}
int solve(int a, int b) {
if (a <= 0 || b <= 0) return 0;
int ans = 0;
for (int sm = 2; sm <= a + b; sm++)
ans = (... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
vector<int> vec;
int n, k, q, cnt[100005];
inline int power(int a, int b) {
int ans = 1;
for (; b; a = 1LL * a * a % q, b >>= 1) ans = b & 1 ? 1LL * ans * a % q : ans;
return ans;
}
inline int inv(int a) { return power(a, q - 2); }
void partition(int a, int b) {
if ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long inv[100005], n, k, p, cnt[3], len[3], sum[100005], ans;
void gb(long long l, long long r, long long h) {
if (h <= 1 || l == r) {
if (!len[1] || len[1] == r - l + 1)
len[1] = r - l + 1, cnt[1]++;
else
len[2] = r - l + 1, cnt[2]++;
return;
... | 13 | CPP |
#include <bits/stdc++.h>
const int MAXN = 100007;
long long MOD;
inline long long FST(long long base, int times) {
long long ret = 1;
while (times) {
if (times & 1) ret = ret * base % MOD;
times >>= 1;
base = base * base % MOD;
}
return ret;
}
long long seg[MAXN], tot_seg;
long long inv[MAXN], invS[... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = -1;
for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
return x * f;
}
const int MAXN = 100010;
const int INF = 2147483600;
long long Mod;
int N... | 13 | CPP |
#include <bits/stdc++.h>
const int N = 100005;
int n, d, inv[N << 1], P, Inv2;
int c[N];
void getp(int l, int r, int dep) {
if (dep <= 1 || l == r) {
++c[r - l + 1];
return;
}
int mid = (l + r) >> 1;
getp(l, mid, dep - 1);
getp(mid + 1, r, dep - 1);
}
int ans;
int main() {
std::ios_base::sync_with_s... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class t>
inline t read(t &x) {
char c = getchar();
bool f = 0;
x = 0;
while (!isdigit(c)) f |= c == '-', c = getchar();
while (isdigit(c)) x = (x << 1) + (x << 3) + (c ^ 48), c = getchar();
if (f) x = -x;
return x;
}
template <class t, class... A>
in... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T gi() {
T f = 1, x = 0;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f * x;
}
const int INF = 0x3f3f3f3f, N ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0;
char ch = getchar();
bool d = 1;
for (; !isdigit(ch); ch = getchar())
if (ch == '-') d = 0;
for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
return d ? x : -x;
}
inline unsigned long long rnd() {
return ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const long long N = 200005;
long long n, k, mo, gs[3], len[3], top, inv[N], s[N], ans;
map<long long, long long> ma;
inline long long read() {
long long ret = 0, ff = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') ff = -1;
ch = getchar();
}
... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long Getint() {
char ch = getchar();
long long x = 0, fh = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') fh = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
(x *= 10) += ch ^ 48;
ch = getchar();
}
return fh * x;
}
const i... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void rd(T &x) {
char ch;
x = 0;
bool fl = false;
while (!isdigit(ch = getchar())) (ch == '-') && (fl = true);
for (x = (ch ^ '0'); isdigit(ch = getchar()); x = x * 10 + (ch ^ '0'))
;
(fl == true) && (x = -x);
}
template <class T>
in... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int read() {
int x = 0, sgn = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') sgn = -1;
for (; isdigit(ch); ch = getchar()) x = (x << 1) + (x << 3) + (ch ^ 48);
return x * sgn;
}
const int N = 2e5 + 10;
int n, k, mod;
long long sum[... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, mod;
long long inv[100009], sum[100009], ans;
map<int, int> tag;
map<int, int>::iterator it1, it2;
long long Read() {
long long x = 0;
char c = getchar();
bool f = 0;
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdigit(c)... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int n, k, mod, inv2;
int ans = 0;
inline void add(int& a, int b) {
a += b;
if (a >= mod) a -= mod;
if (a < 0) a += mod;
}
inline int ksm(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = (long long)a * a % mod)
if (b & 1) ans = (long long)a... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
template <typename T>
T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
swap(a, m);
u -= t * v;
swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T>
class Modular {
public:
using... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
int n, K, P, ans, cnt[maxn], inv[maxn], pre[maxn];
int qp(int x, int y) {
int z = 1;
for (; y; y >>= 1, x = 1LL * x * x % P) {
if (y & 1) z = 1LL * z * x % P;
}
return z;
}
int main() {
scanf("%d %d %d", &n, &K, &P);
for (int i = 1; ... | 13 | CPP |
#include <bits/stdc++.h>
const int MN = 200000 + 5;
using namespace std;
template <typename T>
inline T& IN(T& in) {
in = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) in = in * 10 + c - '0', c = getchar();
return in *= f;
}
int n... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
const int MAXN = 100000;
int n, mxdepth, MOD;
int INV2;
int inv[2 * MAXN + 1];
vector<int> parts;
void rec(int l, int r, int h) {
if (l > r) return;
if (h == 1 || l == r) {
parts.push_back(r - l + 1);
... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long P;
long long inv[500005], s[500005];
int n, m;
int len[2], cnt[2];
void add(long long &x, long long y) {
x += y;
if (x >= P) x -= P;
if (x < 0) x += P;
}
void init() {
inv[0] = inv[1] = 1;
for (int i = 2; i <= n + m; i++) inv[i] = (P - P / i) * inv[P % i... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, K, P, I, ans, inv[N], H[N], len[2], cnt[2];
int ad(int k1, int k2) { return k1 += k2 - P, k1 += k1 >> 31 & P; }
int su(int k1, int k2) { return k1 -= k2, k1 += k1 >> 31 & P; }
int mu(int k1, int k2) { return 1LL * k1 * k2 % P; }
int po(int k1, i... | 13 | CPP |
#include <bits/stdc++.h>
int n, m, t, x, y, mod, ans, v[200010];
std::map<int, int> map;
void solve(int l, int r, int k) {
if (l == r || k <= 1) {
map[r - l + 1]++;
return;
}
solve(l, l + r >> 1, k - 1), solve((l + r >> 1) + 1, r, k - 1);
}
int fpow(long long a, int b) {
long long s = 1;
for (; b; b >... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
int cnt[maxn], mod;
int Pow(int x, int p) {
int r = 1;
while (p) {
if (p & 1) r = (long long)x * r % mod;
p >>= 1;
x = (long long)x * x % mod;
}
return r;
}
void dfs(int n, int k) {
if (n == 1 || k == 1) {
cnt[n]++;
r... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, mod;
long long inv[100009], sum[100009], ans;
map<int, int> tong;
map<int, int>::iterator it1, it2;
inline long long rd() {
long long x = 0;
char c = getchar();
bool f = 0;
while (!isdigit(c)) {
if (c == '-') f = 1;
c = getchar();
}
while (isdi... | 13 | CPP |
#include <bits/stdc++.h>
const int MAXN = 1e5 + 20;
int n, k, M;
int inv[MAXN], pre_inv[MAXN];
void math_pre() {
inv[1] = 1;
for (int i = 2; i <= ((n < 4) ? 4 : n); ++i)
inv[i] = 1ll * (M - M / i) * inv[M % i] % M;
for (int i = 1; i <= n; ++i) pre_inv[i] = (pre_inv[i - 1] + inv[i]) % M;
}
struct map {
stati... | 13 | CPP |
#include <bits/stdc++.h>
using std::cerr;
using std::cout;
int mod;
inline int add(int a, int b) {
a += b - mod;
return a + (a >> 31 & mod);
}
inline int dec(int a, int b) {
a -= b;
return a + (a >> 31 & mod);
}
inline int mul(int a, int b) {
long long r = (long long)a * b;
return r >= mod ? r % mod : r;
}
... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100000;
int q;
inline int add(int x, int y) {
x += y;
return x >= q ? x - q : x;
}
inline int sub(int x, int y) {
x -= y;
return x < 0 ? x + q : x;
}
inline int mul(int x, int y) { return (int)(1LL * x * y % q); }
int mpow(int b, int p) {
int ret;... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
void minn(T &a, T b) {
a = min(a, b);
}
template <class T>
void maxx(T &a, T b) {
a = max(a, b);
}
void io() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
const long long MOD = 1000000007LL;
const long long PRIME = 105943LL;
const long long... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long n, m, mod, inv[300000], ans, cnt[300000], pre[300000];
void upd(long long &x, long long y) { x = (x + y) % mod; }
void solve(long long x, long long m) {
if (!m || x == 1) {
++cnt[x];
return;
}
solve((x + 1) / 2, m - 1);
solve(x / 2, m - 1);
}
int m... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
char ch = getchar();
long long s = 0, w = 1;
while (ch < '0' || ch > '9') {
if (ch == '-') w = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
s = s * 10 + ch - '0';
ch = getchar();
}
return s * w;
}
inline int ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void read(T &x) {
x = 0;
char c = getchar();
int f = 1;
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c)) {
x = x * 10 + c - '0';
c = getchar();
}
x *= f;
}
template <class T>
inline voi... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, mod, ans;
int inv[N], sum[N];
map<int, int> cnt;
map<int, int>::iterator it1, it2;
int read() {
int ret = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = 0;
c = getchar();
}
while (isdigit(c)) ret = r... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int n, k, p, cnt[N];
long long ifac[N];
inline void solve(int l, int r, int t) {
if (t == 1 || l == r) {
cnt[r - l + 1]++;
return;
}
int d = (l + r) >> 1;
solve(l, d, t - 1), solve(d + 1, r, t - 1);
}
inline long long getans(int a, int... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int md;
inline void add(int &a, int b) {
a += b;
if (a >= md) a -= md;
}
inline void sub(int &a, int b) {
a -= b;
if (a < 0) a += md;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int power(int a, long long b) {
int res = 1;
whil... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 200100;
int mod, n, h;
inline void Add(int &a, int b) { a = a + b >= mod ? a + b - mod : a + b; }
int inv[maxn], sum[maxn];
inline int Qsum(int l, int r) { return (sum[r] - sum[l - 1] + mod) % mod; }
int cnt[maxn], S, L;
int ans;
inline void getblock(int l,... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int n, k, mod, num[200005];
void Add(int &a, int b) { ((a += b) >= mod) && (a -= mod); }
int ksm(int a, int b) {
int ans = 1;
while (b) {
if (b & 1) ans = 1ll * ans * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return ans;
}
void dfs(int dep, int l, int r... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &x, T y) {
return (y < x) ? (x = y, 1) : 0;
}
template <typename T>
inline bool chkmax(T &x, T y) {
return (y > x) ? (x = y, 1) : 0;
}
inline int read() {
int x;
char c;
int f = 1;
while ((c = getchar()) != '-' && (c > ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p) {
return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc) {
o << "{";
for (const T& v : vc) o << v << ",";
o << "... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
long long mod = 0;
inline long long pls(long long a, long long b) {
return a + b < mod ? a + b : a + b - mod;
}
inline long long dec(long long a, long long b) {
return a >= b ? a - b : a - b + mod;
}
int len1 = 0, len2 = 0, c1 = 0, c2 = 0;
void dfs(int L, int R, int h) ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
int chkmax(T& a, T b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
template <class T>
int chkmin(T& a, T b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <class iterator>
void output(iterator begin, iterator end, ostr... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline bool chkmin(T &x, T y) {
return y < x ? x = y, 1 : 0;
}
template <typename T>
inline bool chkmax(T &x, T y) {
return x < y ? x = y, 1 : 0;
}
const int INF = 0x3f3f3f3f;
const int N = 1e5 + 10;
int cnt[N];
int mod;
inline int read() {
int x... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 51;
map<int, int> mp;
int n, kk, MOD, res, u, v, w, x;
int invf[MAXN], pr[MAXN];
inline int read() {
register int num = 0, neg = 1;
register char ch = getchar();
while (!isdigit(ch) && ch != '-') {
ch = getchar();
}
if (ch == '-') {
... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, P;
vector<int> pos;
int cnt[N];
void solve(int l, int r, int k) {
if (k <= 1 || l == r) {
if (cnt[r - l + 1] == 0) pos.emplace_back(r - l + 1);
cnt[r - l + 1]++;
return;
}
int mid = (l + r) / 2;
solve(l, mid, k - 1);
sol... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 2;
int mod, num1 = 0, num2 = 0, cnt1 = 0, cnt2 = 0, rev[N], sum[N];
void add(int &x, int y) {
x += y;
if (x >= mod) {
x -= mod;
}
}
void sub(int &x, int y) {
x -= y;
if (x < 0) {
x += mod;
}
}
int mul(int x, int y) { return (1ll * x *... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 5;
int n, k, mod, cnt[MAXN], inv[MAXN] = {0, 1}, sum[MAXN];
int a, b, ans;
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch)) ch = getchar();
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
retu... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 7;
int n, k, p, sum, a[2], b[2], inv[N], res[N];
inline void adds(int u) {
if (a[0] == 0)
a[0] = u;
else if (a[0] != u)
a[1] = u;
if (a[0] == u) b[0]++;
if (a[1] == u) b[1]++;
}
inline void solve(int l, int r, int t) {
if (t == 1 || l =... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <class t, class u>
void chmax(t& first, u second) {
if (first < second) first = second;
}
template <class t, class u>
void chmin(t& first, u second) {
if (second < first) first = second;
}
template <class t>
using vc = vector<t>;
template ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
int md;
inline void add(int &a, int b) {
a += b;
if (a >= md) a -= md;
}
inline void sub(int &a, int b) {
a -= b;
if (a < 0) a += md;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int power(int a, long long b) {
int res = 1;
whil... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T>
T gi() {
T x = 0;
bool f = 0;
char c = getchar();
while (c != '-' && (c < '0' || c > '9')) c = getchar();
if (c == '-') f = 1, c = getchar();
while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
return f ? -x : x;
}
const int N ... | 13 | CPP |
#include <bits/stdc++.h>
using namespace std;
template <class T1, class T2>
inline void chkmin(T1 &x, T2 y) {
if (y < x) x = y;
}
template <class T1, class T2>
inline void chkmax(T1 &x, T2 y) {
if (y > x) x = y;
}
const int BUF_SIZE = 1 << 20;
char buf[BUF_SIZE], *P1 = buf, *P2 = buf, obuf[BUF_SIZE], *PO = obuf;
in... | 13 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.