text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, k, q, inv[N], sum[N];
map<int, int> cnt;
void divide(int l, int r, int k) {
if (l == r || k <= 1) {
++cnt[r - l + 1];
return;
}
int mid = (l + r) >> 1;
divide(l, mid, k - 1);
divide(mid + 1, r, k - 1);
}
int ans;
int calc(int... |
#include <bits/stdc++.h>
#pragma GCC optimize("O2,Ofast,inline,unroll-all-loops,-ffast-math")
#pragma GCC target("popcnt")
using namespace std;
int n, k;
long long inv[100010], sum[100010], p, ans = 0;
map<int, int> M;
template <class T>
void read(T &x) {
char ch = x = 0;
bool fl = false;
while (!isdigit(ch)) fl ... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int MOD;
struct modnum {
int v;... |
#include <bits/stdc++.h>
using namespace std;
inline void proc_status() {
ifstream t("/proc/self/status");
cerr << string(istreambuf_iterator<char>(t), istreambuf_iterator<char>())
<< endl;
}
template <typename T>
inline bool chkmin(T &a, const T &b) {
return a > b ? a = b, 1 : 0;
}
template <typename T>
i... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 10;
map<int, int> st;
int n, h, mod, inv[maxn];
int qpow(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = 1ll * a * a % mod)
if (b & 1) ans = 1ll * ans * a % mod;
return ans;
}
void sol(int l, int r, int h) {
if (r - l + 1 <= 1 || h <= ... |
#include <bits/stdc++.h>
int q, I[200010];
long long inv(int a, int p) {
return a == 1 ? 1 : (1 + p * (a - inv(p % a, a))) / a % p;
}
int f(int a, int b) {
int s = 0;
for (int i = 0; i < a + b - 1; i++)
s = (s + ((i + 1 < a ? i + 1 : a) - (i - b + 1 > 0 ? i - b + 1 : 0)) * 1ll *
i % q * I[i +... |
#include <bits/stdc++.h>
const int N = 2e5 + 5;
int n, k, mo, ans, inv[N], i, cnt[N], mn = N;
void dfs(int l, int r, int h) {
if (l == r || h <= 1) {
++cnt[r - l + 1];
mn = std::min(mn, r - l + 1);
return;
}
int m = l + r >> 1;
dfs(l, m, h - 1);
dfs(m + 1, r, h - 1);
}
inline int calc(int x, int y... |
#include <bits/stdc++.h>
char ch;
bool fs;
void re(int& x) {
while (ch = getchar(), ch < 33)
;
if (ch == '-')
fs = 1, x = 0;
else
fs = 0, x = ch - 48;
while (ch = getchar(), ch > 33) x = x * 10 + ch - 48;
if (fs) x = -x;
}
using namespace std;
int n, k, mod, ans, inv[200001], sum[200001];
map<int,... |
#include <bits/stdc++.h>
using namespace std;
inline int read() {
char c = getchar();
int x = 0;
bool f = 0;
for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
if (f) x = -x;
return x;
}
int mod;
struct modint {
int x;
modint(int o ... |
#include <bits/stdc++.h>
const int N = 200010;
int moder;
int inv[N];
int cnt[N];
int pre[N];
int ans;
void init() {
inv[1] = 1;
for (int i = 2; i < N; ++i) {
inv[i] = moder - 1ll * (moder / i) * inv[moder % i] % moder;
}
for (int i = 1; i < N; ++i) {
pre[i] = (pre[i - 1] + inv[2] - inv[i]) % moder;
... |
#include <bits/stdc++.h>
using namespace std;
inline long long read() {
long long x = 0, f = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') f = -1;
c = getchar();
}
while (c >= '0' && c <= '9') {
x = (x << 1) + (x << 3) + c - '0';
c = getchar();
}
return x * f;
}
const i... |
#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... |
#include <bits/stdc++.h>
using namespace std;
int read() {
int X = 0, w = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-') w = -1;
c = getchar();
}
while (c >= '0' && c <= '9') X = X * 10 + c - '0', c = getchar();
return X * w;
}
const int N = 100000 + 10;
int mod, inv2, inv4;
int q... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, p, ans, inv4, cnt[N], inv[N];
void divide(int x, int k) {
if (k == 1 || x == 1)
return (void)(++cnt[x],
ans = (ans + (long long)x * (x - 1) % p * inv4) % p);
divide(x / 2, k - 1), divide(x - x / 2, k - 1);
}
inline i... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 2E5 + 10;
int P;
template <typename T1, typename T2>
void Inc(T1 &a, T2 b) {
a += b;
if (a >= P) a -= P;
}
template <typename T1, typename T2>
void Dec(T1 &a, T2 b) {
a -= b;
if (a < 0) a += P;
}
template <typename T1, typename T2>
T1 Add(T1 a, T2 b... |
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e5 + 5;
long long read() {
long long s = 0;
char c = getchar(), lc = '+';
while (c < '0' || '9' < c) lc = c, c = getchar();
while ('0' <= c && c <= '9') s = s * 10 + c - '0', c = getchar();
return lc == '-' ? -s : s;
}
void write(long long x) ... |
#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
using namespace std;
namespace ywy {
unordered_map<int, int> mp;
long long inv[200001], ans = 0;
int p;
inline void solve(int a, int b) {
long long cjr = a;
cjr *= b;
cjr %= p;
cjr *= mp[a];
cjr %= p;
cjr ... |
#include <bits/stdc++.h>
using namespace std;
template <class T>
bool uin(T &a, T b) {
return a > b ? (a = b, true) : false;
}
template <class T>
bool uax(T &a, T b) {
return a < b ? (a = b, true) : false;
}
long long P;
const int maxn = 110000;
long long rec[maxn];
long long deg(long long x, long long d) {
if (d... |
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
const int N = 100005;
int n, kk, P;
ll ans, inv[N], sum[N];
map<int, int> cnt;
ll qpow(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1) ret = ret * a % P;
a = a * a % P;
b >>= 1;
}
return ret;
}
void proc... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
inline int read() {
int x = 0;
char ch = getchar();
while (ch < '0' || ch > '9') ch = getchar();
while ('0' <= ch && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
return x;
}
int n, k, mod;
long long inv[N], sum[N], ans;
map<long long, l... |
#include <bits/stdc++.h>
using namespace std;
long long mod, inv2;
vector<pair<long long, long long> > vec;
long long inv[20000005], ans, sum;
long long calc(long long len) { return len * (len - 1) % mod * inv2 % mod; }
void merge(long long l, long long r, long long h) {
if (h == 1 || l == r) {
long long len = r ... |
#include <bits/stdc++.h>
std::map<long long, long long> mp;
long long p, inv[200005], sum[200005];
inline long long read() {
register long long x = 0, f = 1;
register char s = getchar();
while (s > '9' || s < '0') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 +... |
#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... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
int mod = 1e9 + 7;
long long power(long long a, long long b) {
long long res = 1;
while (b) {
if (b & 1) res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
long long INV(long long a) { return power(a, mod - 2); }
mt199... |
#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... |
#include <bits/stdc++.h>
using namespace std;
int MOD;
int inv[200005];
void gen_inv(int maxa) {
inv[1] = 1;
for (int i = 2; i <= maxa; i++)
inv[i] = MOD - 1LL * inv[MOD % i] * (MOD / i) % MOD;
}
int getans(int u, int v) {
int ans = 0;
for (int i = 2; i <= u + v; i++)
ans = (ans + 1LL * (min(u, i - 1) -... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
x = 0;
bool f = 0;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-') f = 1;
for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
if (f) x = -x;
}
template <typename F>
inline void write(F x, char... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n, k, mod, ans, inv[N], s[N];
map<int, int> c;
int ksm(int a, int b) {
int r = 1;
while (b) {
if (b & 1) r = 1ll * r * a % mod;
a = 1ll * a * a % mod;
b >>= 1;
}
return r;
}
void pre(int l, int r, int k) {
if (k <= 1 || l == r... |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 5;
char buf[1 << 12], *pp1 = buf, *pp2 = buf, nc;
int ny;
inline char gc() {
return pp1 == pp2 &&
(pp2 = (pp1 = buf) + fread(buf, 1, 1 << 12, stdin), pp1 == pp2)
? EOF
: *pp1++;
}
inline int read() {
int ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
long long MOD, f[N];
long long qpow(long long x, long long y) {
long long z = 1;
while (y > 0) {
if (y % 2) z = z * x % MOD;
x = x * x % MOD;
y /= 2;
}
return z;
}
map<int, int> ma;
pair<int, int> a[10];
void dfs(int x, int k) {
... |
#include <bits/stdc++.h>
using namespace std;
const int N = 220000;
map<int, int> H;
int inv[N];
void build(int st, int en, int k) {
if (k == 1) {
int len = en - st + 1;
if (H.count(len))
H[len]++;
else
H[len] = 1;
return;
}
if (st == en) return;
int mid = st + en >> 1;
build(st, m... |
#include <bits/stdc++.h>
using namespace std;
long long n, m, mod, sum[200005], inv[200005], ans, s1, s2, num1, num2;
void split(long long l, long long r, long long dep) {
if (l > r) return;
if (dep == 1 || l == r) {
if (!s1) s1 = r - l + 1;
if (s1 == r - l + 1)
num1++;
else {
if (!s2) s2 = ... |
#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,... |
#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int inv[N], n, k, mo, ans;
map<int, int> mp;
void get(int n, int k) {
if (k == 1 || n == 1)
mp[n]++;
else
get(n / 2, k - 1), get(n - n / 2, k - 1);
}
int calc(int x, int y) {
int ans = 1ll * x * y % mo * (mo + 1) / 2 % mo;
for (int i = ... |
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)1e5 + 3;
const int infint = (int)1e9 + 3;
const long long inf = (long long)1e12;
int n, k, q;
vector<int> v;
int add(int a, int b) {
int c = a + b;
if (c >= q) c -= q;
if (c < 0) c += q;
return c;
}
int mul(int a, ... |
#include <bits/stdc++.h>
using namespace std;
long long MOD;
long long powmod(long long a, long long n) {
if (n == 0) return 1;
if (n % 2) return (a * powmod(a, n - 1)) % MOD;
long long c = powmod(a, n / 2);
return (c * c) % MOD;
}
long long inv(long long a) { return powmod(a, MOD - 2); }
long long fact[110000]... |
#include <bits/stdc++.h>
template <typename T>
inline void read(T &x) {
x = 0;
char c = getchar();
while (!isdigit(c)) c = getchar();
while (isdigit(c)) x = x * 10 + (c ^ 48), c = getchar();
}
using namespace std;
int n, K, P;
long long inv[201000], isum[201000];
inline void init() {
inv[1] = 1;
for (int i ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k, mod, c[N], inv[N], s[N];
void dfs(int d, int l, int r) {
if (d <= 1 || l == r) {
++c[r - l + 1];
return;
}
int m = (l + r) >> 1;
dfs(d - 1, l, m);
dfs(d - 1, m + 1, r);
}
int solve(int n, int m) {
int res = (long long)inv... |
#include <bits/stdc++.h>
using namespace std;
inline char gc() {
static char buf[100000], *p1 = buf, *p2 = buf;
return p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2)
? EOF
: *p1++;
}
inline long long read() {
long long x = 0;
char ch = getchar();
bool positive... |
#include <bits/stdc++.h>
const int MAXN = 100010;
int mod = 998244353;
void reduce(int& x) { x += x >> 31 & mod; }
int mul(int a, int b) { return (long long)a * b % mod; }
int pow(int a, int b, int res = 1) {
for (; b; b >>= 1, a = mul(a, a))
if (b & 1) res = mul(res, a);
return res;
}
void mma(int& x, int y, i... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, k, P, inv[N], ans, f[2], c[2];
inline void upd(int &x, int y) { ((x += y) > P) && (x -= P); }
void sol(int l, int r, int k) {
if (!k || l == r) {
int len = r - l + 1;
c[len & 1] = len;
f[len & 1]++;
return;
}
int mid = (l... |
#include <bits/stdc++.h>
using namespace std;
int n, m, M, I2;
map<int, int> cnt;
long long inv[200050];
void divide(int m, int l, int r) {
if (m == 1 || l == r)
++cnt[r - l + 1];
else {
int mid = (l + r) >> 1;
divide(m - 1, l, mid);
divide(m - 1, mid + 1, r);
}
}
long long pw(long long a, long lo... |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, k, q, A[N], num[2], Min, mod, ans, I4;
namespace {
int add(int x) { return (x >= mod) ? x - mod : x; }
int sub(int x) { return (x < 0) ? x + mod : x; }
void Add(int &x, int y) { x = add(x + y); }
void Sub(int &x, int y) { x = sub(x - y); }
int ... |
#include <bits/stdc++.h>
std::map<long long, long long> mp;
long long p, inv[200005], sum[200005];
inline long long read() {
register long long x = 0, f = 1;
register char s = getchar();
while (s > '9' || s < '0') {
if (s == '-') f = -1;
s = getchar();
}
while (s >= '0' && s <= '9') {
x = x * 10 +... |
#include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T>
using V = vector<T>;
template <class T>
using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
uint MD;
struct ModInt {
using M = ModInt;
... |
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9;
const long long Inf = 1e18;
const int N = 1e5 + 10;
int n, k, mod, inv[N], sinv[N], ans = 0;
int gi() {
int x = 0, o = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-') ch = getchar();
if (ch == '-') o = -1, ch = getchar();
w... |
#include <bits/stdc++.h>
using namespace std;
int inv[100010], s[100010], num[100010], n, k, MOD, ans;
void work(int l, int r, int h) {
if (h <= 1 || l == r) {
num[r - l + 1]++;
return;
}
int mid = (l + r) >> 1;
work(l, mid, h - 1);
work(mid + 1, r, h - 1);
}
int basic(int x) { return 1ll * x * (x - 1... |
#include <bits/stdc++.h>
using namespace std;
int get() {
char ch;
while (ch = getchar(), (ch < '0' || ch > '9') && ch != '-')
;
if (ch == '-') {
int s = 0;
while (ch = getchar(), ch >= '0' && ch <= '9') s = s * 10 + ch - '0';
return -s;
}
int s = ch - '0';
while (ch = getchar(), ch >= '0' &... |
#include <bits/stdc++.h>
using namespace std;
map<int, int> mp;
int n, k, q;
void dfs(int l, int r, int dep) {
if (dep <= 1 || l == r) {
mp[r - l + 1]++;
return;
}
int mid = (l + r) >> 1;
dfs(l, mid, dep - 1);
dfs(mid + 1, r, dep - 1);
}
int ADD(int x, int y) { return (x += y) >= q ? x - q : x; }
int ... |
#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... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int n, k, p, inv[N], res[2][2];
vector<int> segs, tmp;
void dfs(int l, int r, int k) {
if (l == r || k == 1) {
segs.emplace_back(r - l + 1);
tmp.emplace_back(r - l + 1);
return;
}
int mid = (l + r) >> 1;
dfs(l, mid, k - 1);
dfs(m... |
#include <bits/stdc++.h>
const int Maxn = 100000;
int n, k, Mod;
int sum[Maxn + 5];
int inv[Maxn + 5];
void init() {
inv[1] = 1;
for (int i = 2; i <= Maxn; i++) {
inv[i] = 1ll * (Mod - Mod / i) * inv[Mod % i] % Mod;
}
for (int i = 1; i <= Maxn; i++) {
sum[i] = (sum[i - 1] + inv[i]) % Mod;
}
}
int cnt[... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
template <typename T>
void dprintln(const T &t) {
cout << t << endl;
}
template <typename T, typename... Args>
void dprintln(const T &t, const Args &...rest) {
cout << t << ' ';
dprintln(rest...);
}
template <typename T>
void println(cons... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
int i, j, n, k, mo, rev[N], a[N], num, d[N], s[N], l, r;
long long ans;
void work(int l, int r, int k) {
if (k <= 1 || l == r) {
a[++num] = r - l + 1;
return;
}
int m = (l + r) >> 1;
work(l, m, k - 1), work(m + 1, r, k - 1);
}
int calc... |
#include <bits/stdc++.h>
using namespace std;
const int N = 200005;
int n, k, mod, q1, q2, ans;
int inv[N], cnt[N];
void solve(int l, int r, int d) {
if (d == 1 || l == r) {
int len = r - l + 1;
q1&& q1 != len ? q2 = len : q1 = len;
ans = (ans + 1ll * len * (len - 1) / 2 % mod * (mod + 1) / 2) % mod;
... |
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e6 + 5;
long long n, k, gs, ans, mod, len[N], jc[N], inv[N], sum[N], ycl[2005][2005];
inline long long read() {
long long res = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-') f = -1;
c = getchar();
}
while (isdigit(c... |
#include <bits/stdc++.h>
long long n, k, q, t1, t2, cnt1, cnt2, inv4, inv2, inv[200001];
long long ans;
inline long long mul(const long long &a, const long long &b) {
return 1ll * a * b % q;
}
inline long long qsm(long long a, long long b) {
long long ans = 1;
while (b) {
if (b & 1) ans = mul(ans, a);
a =... |
#include <bits/stdc++.h>
using namespace std;
void Freopen() {
freopen(
"title"
".in",
"r", stdin);
freopen(
"title"
".out",
"w", stdout);
}
int read() {
int g = 0, f = 1;
char ch = getchar();
while (ch < '0' || '9' < ch) {
if (ch == '-') f = -1;
ch = getchar();
}... |
#include <bits/stdc++.h>
using namespace std;
int n, K, P, inv[200003], cnt[200003], mn = 1e9, ans;
void solve(int l, int r, int dep) {
if (dep == 1 || l == r) {
++cnt[r - l + 1], mn = min(mn, r - l + 1);
return;
}
int mid = (l + r) >> 1;
solve(l, mid, dep - 1), solve(mid + 1, r, dep - 1);
}
int calc(in... |
#include <bits/stdc++.h>
#pragma GCC optimize "-O3"
using namespace std;
long long MOD;
long long pw(long long a, long long b) {
long long ans = 1;
while (b) {
while (!(b & 1)) b >>= 1, a = (a * a) % MOD;
ans = (ans * a) % MOD, --b;
}
return ans;
}
map<int, int> mm;
void run(int n, int k) {
if (n <= 0... |
#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
char ch;
int fu = 1;
while ((ch = getchar()) <= 32)
;
x = 0;
if (ch == '-')
fu = -1;
else
x = ch - 48;
while ((ch = getchar()) > 32) x = x * 10 + ch - 48;
x *= fu;
}
void read(long long &x) {
char ch;
int fu = 1;
while (... |
#include <bits/stdc++.h>
using namespace std;
int n, k, p, to[210000], pre[210000], ans, inv[2100000], inv2;
vector<int> V;
int Pow(int x, int y) {
int ans = 1;
for (int i = 1; i <= y; i *= 2, x = 1LL * x * x % p)
if (i & y) ans = 1LL * ans * x % p;
return ans;
}
void dfs(int l, int r, int h) {
if (l < r) {... |
#include <bits/stdc++.h>
using namespace std;
long long f[1000001];
long long pow(long long a, long long b, long long MOD) {
long long x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD) x %= MOD;
}
y = (y * y);
if (y > MOD) y %= MOD;
b /= 2;
}
return x;
}
l... |
#include <bits/stdc++.h>
using namespace std;
int l, r, d, n;
int main() {
ios::sync_with_stdio(false);
cin >> n;
while (n--) {
cin >> l >> r >> d;
if (d > r || d < l) {
cout << d << endl;
continue;
}
cout << d * (r / d + 1) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e5, N2 = 2e5, N1 = 1e6, M = 1e2;
long long binpow(long long a, long long n) {
long long ans = 1;
while (n) {
if (n & 1) ans *= a;
a *= a;
n >>= 1;
}
return ans;
}
string s, s1, s2;
long long n, m, t, x, y, z;
long long k, k1, k2, g, ... |
#include <bits/stdc++.h>
using namespace std;
bool com(long long a, long long b) { return a < b; }
int main() {
long long t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
else {
if (r % d == 0)
cout << r + d << "\n";
else
... |
#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int main() {
int q;
cin >> q;
while (q--) {
long long a, b, c;
cin >> a >> b >> c;
long long ans;
if (b % c == 0)
ans = b + c;
else {
ans = ((b ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l / d == 0) {
long long int x = r / d;
cout << (x + 1) * d << endl;
} else if (l / d == 1 && l % d == 0) {
cout << (r / d + 1) * d << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
while (q--) {
int l, r, d;
scanf("%d %d %d", &l, &r, &d);
if (d < l)
printf("%d\n", d);
else if (d > r)
printf("%d\n", d);
else {
int res = r - d;
res = res % d;
printf("%d\n", r + ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int ans, i, flag = 1;
if (d < l)
ans = d;
else if (r % d == 0) {
ans = (ceil((long double)r / d) + 1) * d;
} else {
ans = ceil((l... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
while (n--) {
long long l, r, k;
cin >> l >> r >> k;
if (r - k <= r - l && k <= r) {
cout << r + k - (r % k) << endl;
} else {
cout << k << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int num, l, r, d, x;
x = 0;
cin >> num;
for (int i = 0; i < num; i++) {
cin >> l >> r >> d;
x = d;
while (true) {
if (x <= r && x >= l) {
x = ceil((double)r / d) * d;
if (x == r) x += d;
break;
} else
... |
#include <bits/stdc++.h>
int q, l, r, d;
int main() {
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &l, &r, &d);
if (l > d)
printf("%d\n", d);
else
printf("%d\n", r / d * d + d);
}
}
|
#include <bits/stdc++.h>
int main() {
int a1, b, c, d, n, k = 4;
std::cin >> n;
int a[n];
int i, i1, j;
for (i = 1; i <= n; i++) {
std::cin >> a1 >> b >> c;
if (a1 > c) {
std::cout << c << '\n';
} else {
std::cout << c * (b / c + 1) << '\n';
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int l, int r, int d) {
if (d >= l) {
return (r / d + 1) * d;
} else {
return d;
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r, d;
cin >> l >> r >> d... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
for (T e : v) {
os << e << ' ';
}
return os;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q;
cin >> q;
while (q--) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, x, l, r, d, i, f = 0, j;
cin >> x;
int* Arr = (int*)malloc(3 * x * sizeof(int));
int z;
for (z = 0; z < 3 * x; z++) {
cin >> Arr[z];
}
int mod;
for (i = 0; i < x; i++) {
l = Arr[i * 3];
r = Arr[3 * i + 1];
d = Arr[3 * i + ... |
#include <bits/stdc++.h>
using namespace std;
long long q, a, b, d;
int main() {
cin >> q;
while (q--) {
cin >> a >> b >> d;
if (d < a)
cout << d << endl;
else
cout << ((b / d) + 1) * d << endl;
}
}
|
#include <bits/stdc++.h>
const double pi = 4.0 * atan(1.0);
const double e = exp(1.0);
using namespace std;
const int N = 3e6 + 5;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long n;
cin >> n;
while (n--) {
long long a, b, c;
cin >> a >> b >> c;
if (a > c) {
cou... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
long long int t;
cin >> t;
while (t--) {
long long int l, r, d, i, x, y, z;
cin >> l >> r >> d;
if (l > d) {
cout << d << endl;
} else if (r % d == d) {
cout << d << endl;
}... |
#include <bits/stdc++.h>
using namespace std;
long long modexpo(long long x, long long p) {
long long res = 1;
x = x % 1000000007;
while (p) {
if (p % 2) res = res * x;
p >>= 1;
x = x * x % 1000000007;
res %= 1000000007;
}
return res;
}
long long max(long long a, long long b) { return (a > b ?... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long INF = 1e18;
const long long MAXN = 25;
long long l, r, d, n;
long long myceil(long long x, long long y) {
if ((x % y) == 0) {
return x / y + 1;
} else {
return x / y + 1;
}
}
int main() {
{
scanf("%lld", &n)... |
#include <bits/stdc++.h>
using namespace std;
int a[1000100];
int c[1000010];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int l, r, d;
scanf("%d%d%d", &l, &r, &d);
if (d < l) {
printf("%d\n", d);
} else {
long long x2 = r / d;
while (x2 * d <= r) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, i, j, ans, l, r, d;
cin >> q;
while (q--) {
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << endl;
else {
ans = 1 + r / d;
cout << ans * d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l > d)
cout << d << "\n";
else if (r % d == 0)
cout << d + r << "\n";
else
cout << (r / d) * d + d << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
void solve() {
long long int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << "\n";
return;
} else {
long long int rem = r % d;
rem = d - rem;
cout << r + rem << "\n";
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
long long q = r / d;
long long ans = d * (q + 1);
if (d * 1 < l) {
ans = d;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, d, q;
cin >> q;
for (long long i = 0; i < q; i++) {
cin >> l >> r >> d;
if (l > d)
cout << d << "\n";
else
cout << (r / d + 1) * d << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int d, l, r;
cin >> l;
cin >> r;
cin >> d;
bool a = false;
bool b = false;
if (int(ceil(float(l) / float(d))) == l / d) a = true;
if (int(ceil(float(r) / float(d))) == r / d) b... |
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
const int N = 200005;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
el... |
#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long MAXN = 1e5 + 3;
const long long inf = 2e9;
long long max(long long a, long long b) {
if (a > b)
return a;
else
return b;
}
long long min(long long a, long long b) {
if (a < b)
return a;
else
return b;
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
int a, b, c;
while (cin >> n) {
int cnt;
for (int i = 0; i < n; i++) {
cin >> a >> b >> c;
if (a <= c) {
if (b >= c) {
cnt = b / c + 1;
} else {
cnt = 1;
}
} else {
cnt =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
if (r % d == 0)
cout << (r + d) << endl;
else
cout << (d - r % d) + r << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, d;
cin >> l >> r >> d;
int x = (l - 1) / d;
int y = r / d;
if (x == 0) {
cout << (y + 1) * d << endl;
} else {
cout << d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q, l, r, d;
cin >> q;
for (long long i = 0; i < q; i += 1) {
cin >> l >> r >> d;
long long ans1 = d;
if (ans1 > 0 && ans1 < l) {
cout << ans1 << endl;
continue;
}
long long ans = (r / d) * d;
ans += d;
cou... |
#include <bits/stdc++.h>
using namespace std;
int x, y, a, b, c;
int main() {
cin >> x;
for (int i = 0; i < x; i++) {
cin >> a >> b >> c;
y = a % c;
if (a <= c) {
y = b % c;
cout << b + c - y;
} else {
cout << c;
}
if (i < x - 1) {
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
cout << (r / d + 1) * d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (l <= d && d <= r) {
cout << (r / d + 1) * d << endl;
} else if (d > r)
cout << ... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 0x3f3f3f3f;
const long long llinf = 1e18;
const long long nax = 0;
void solve() {
long long l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << '\n';
return;
}
cout << d * (r / d + 1) << '\n';
}
int m... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (l > d) {
cout << d << endl;
} else {
long long x = r / d;
cout << d * (x + 1... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.