text stringlengths 49 983k |
|---|
#include <bits/stdc++.h>
using namespace std;
uint64_t minmul(uint64_t l, uint64_t r, uint64_t d) {
if (d < l || d > r) return d;
uint64_t mod = r % d;
return r + (d - mod);
}
int main() {
uint64_t q;
cin >> q;
uint64_t l, r, d;
for (uint64_t i = 0; i < q; i++) {
cin >> l >> r >> d;
cout << minmul... |
#include <bits/stdc++.h>
using namespace std;
inline char gc() { return getchar(); }
template <class T>
int read(T &ans) {
ans = 0;
char ch = gc();
T f = 1;
while (!isdigit(ch)) {
if (ch == EOF) return -1;
if (ch == '-') f = -1;
ch = gc();
}
while (isdigit(ch)) ans = ans * 10 + ch - '0', ch = gc... |
#include <bits/stdc++.h>
using namespace std;
int d, l, r, n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l >> r >> d;
if (l > d) {
cout << d << endl;
continue;
}
cout << (r / d + 1) * d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
int i;
for (i = 0; i < q; i++) {
int l, r, d;
cin >> l >> r >> d;
long long int x;
if (d < l)
x = d;
else {
int a = r % d;
x = (d - a) + r;
}
cout << x << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int __ = 1e5 + 5;
int a[__];
int main() {
int q;
for (scanf("%d", &q); q; --q) {
int l, r, d;
scanf("%d%d%d", &l, &r, &d);
if (d < l || d > r) {
printf("%d\n", d);
continue;
}
printf("%d\n", (r / d + 1) * d);
}
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;
if (d < l)
cout << d << endl;
else {
int w = r % d;
cout << r + d - w << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (d == 1) {
if (l > 1)
cout << 1;
else
cout << r + 1;
cout << endl;
continue;
}
int p = l / d;
int q = r / d;
if ((p == 1... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
int l, r, a;
cin >> l >> r >> a;
if (l > a)
cout << a << endl;
else
cout << ((r / a + 1) * a) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e16;
const long long MAXN = 1e6;
long long n, i, x, l, r;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (i = 0; i < n; i++) {
cin >> l >> r >> x;
if (x < l)
cout << x << endl;
else {
cout << r / x... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int l, r, d, m, s;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
s = ((r / d) + 1) * d;
cout << s << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, x;
cin >> l >> r >> x;
if (x < l or x > r)
cout << x << endl;
else
cout << x - r % x + r << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long l, d, r, temp = 0, temp2, i;
int main() {
int q;
cin >> q;
while (q--) {
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
continue;
}
temp = ((r + d) / d) * d;
cout << temp << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void testcase() {
int n;
cin >> n;
int l, r, d;
while (n--) {
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << "\n";
} else {
int x = r / d;
cout << (x + 1) * d << "\n";
}
}
}
int main() {
ios_base ::sync_with_stdio(false)... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
long long a, b;
if (d < l)
cout << d << endl;
else {
a = r / d;
b = (a + 1) * d;
cout << b << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 1e9 + 5;
const long long mo = 1e9 + 7;
long long sx, sy, ex, ey, dx[6] = {0, 1, 0, -1, 0, 0},
dy[6] = {1, 0, -1, 0, 0, 0}, m, n, k,
dz[6]{0, 0, 0, 0, -1, 1}, sg, re;
long long p, no, v, ans, w;
int par[55];... |
#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 (d < l) {
cout << d << endl;
continue;
}
int cnt = (r + d) / d;
cout << cnt * d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int l, r, i, t, d, p, k, x;
double div;
scanf("%lld", &(t));
while (t--) {
scanf("%lld", &(l));
scanf("%lld", &(r));
scanf("%lld", &(d));
if (d < l)
x = d;
else {
div = d;
p = ceil((r + 1) / div);
x ... |
#include <bits/stdc++.h>
int main(void) {
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);
continue;
}
printf("%d\n", ((r / d) + 1) * d);
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<vector<int> > AdjList;
vector<int> dfs_num, ts;
const int UNVISITED = -1;
const int VISITED = 1;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else
cout << d * (r / d +... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l > d)
cout << d << endl;
else
cout << (r + d) - (r % d) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, m, n, i, j, k, l, r, d;
cin >> t;
while (t--) {
cin >> l >> r >> d;
if (l > d)
cout << d << endl;
else {
m = r / d;
if (d * m > r)
cout << d * m << endl;
else
cout << d * (m + 1) << endl;
}
... |
#include <bits/stdc++.h>
using namespace std;
const int INF = (1 << 30) + 7;
const int N = 1e5 + 7;
int main() {
ios::sync_with_stdio(false);
int q, l, r, d, ans;
cin >> q;
while (q--) {
cin >> l >> r >> d;
ans = (r / d + 1) * d;
if (d < l)
ans = d;
else
ans = (r / d + 1) * d;
co... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
;
int t;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l / d != 0 && l != d)
cout << d << "\n";
else
cout << (r / d + 1) * d << "\n";
}
... |
#include <bits/stdc++.h>
using namespace std;
void print(vector<int> v) {
for (auto x : v) cout << x << " ";
puts("");
}
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l or d > r)
cout << d << endl;
else
cout << d * ((r / d) + 1) << endl;
}
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, k;
cin >> l >> r >> k;
if (k < l) {
cout << k << endl;
} else {
cout << (r / k + 1) * k << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, q, l, m, g, i;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> q >> l >> m;
if (q > m) {
cout << m << "\n";
} else {
cout << (l / m) * m + m << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int n, a[200005];
int main() {
int q, l, r, d;
cin >> q;
while (q--) {
cin >> l >> r >> d;
if (d < l)
cout << d;
else
cout << r + d - r % d;
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long int a, b, c, d, e, i, j, k, l, n, m;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a >> b >> c;
if (c < a)
cout << c << endl;
else
cout << ((b / c) + 1) * c << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int x1, x2, y;
int ats[N];
for (int i = 0; i < N; i++) {
cin >> x1 >> x2 >> y;
if (y < x1) {
ats[i] = y;
} else {
ats[i] = y * ((x2 / y) + 1);
}
}
for (int i = 0; i < N; i++) {
cout << ats[i] << end... |
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC target("sse4")
using namespace std;
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigne... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long q;
cin >> q;
while (q--) {
long long a, b, d;
cin >> a >> b >> d;
long long temp = a / d;
long long temp2 = b / d;
if (d < a || d > b) {
cout << d << endl;
} else {
long long num1 = (temp2 + 1) * d;
cout... |
#include <bits/stdc++.h>
int main() {
int t, l, r, d, m, n, i;
scanf("%d", &t);
for (i = 0; i < t; i++) {
scanf("%d %d %d", &l, &r, &d);
if (l > d || r < d) {
printf("%d\n", d);
} else {
m = (r / d) + 1;
n = d * m;
printf("%d\n", n);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
cout << (r / d + 1) * d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
for (int i = 0; i < q; i++) {
int l, r, d;
scanf("%d %d %d", &l, &r, &d);
if ((double)l / d > 1)
printf("%d\n", d);
else {
int f = ((double)r / d) + 1;
printf("%d\n", f * d);
}
}
return 0;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int ls, rs;
ls = d;
if (ls < l) {
printf("%d\n", ls);
continue;
}
if (r % d == 0) {
rs = d + r;
} else {
rs = d * (... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
long long l, r, d;
while (t--) {
cin >> l >> r >> d;
if (d >= l && d <= r) {
long long oo = (r + d) / d;
cout << oo * d << endl;
} else {
cout << d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int t;
long long int l, r, d;
int main() {
cin >> t;
while (t--) {
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
continue;
}
if (r % d == 0) {
cout << r + d << endl;
continue;
}
cout << ((r / d) + 1) * d << ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long int t, l, r, d;
cin >> t;
while (t--) {
cin >> l >> r >> d;
long long int y = r / d;
if (d < l) {
cout << d << endl;
} else {
cout << (y + 1) * d << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n;
cin >> n;
while (n--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
cout << (long long)(ceil(r / d) * d) + d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, d, x, q;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> l >> r >> d;
if (d > r) {
cout << d << endl;
continue;
}
if (d < l) {
cout << d << endl;
continue;
}
x = ((r / d) + 1) * d;
cout <<... |
#include <bits/stdc++.h>
int d, l, q, r;
int main() {
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &l, &r, &d);
printf("%d\n", l > d ? d : (r / d + 1) * d);
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long int modd = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t, l, r, d;
cin >> t;
int x;
while (t--) {
cin >> l >> r >> d;
if (d < l)
x = d;
else
x = d * ((r / d) + 1);
cout << x << endl... |
#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
int main() {
ios::sync_with_stdio(0);
cin.tie(NULL);
int q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
continue;
} else {
cout << (r / d) * d + ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, l, r, d;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> l >> r >> d;
if (l <= d && r >= d) {
cout << (((r / d) + 1) * d) << "\n";
} else {
cout << d << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int curr = r;
if (l > d)
curr = d;
else if (r >= d) {
int k = (curr + d - 1) / d;
curr =... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, l, r, d, p;
cin >> q;
while (q--) {
cin >> l >> r >> d;
p = d < l ? d : (r / d + 1) * d;
cout << p << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
long long int l, r, d;
for (int i = 0; i < q; i++) {
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else if (d > r)
cout << d << endl;
else
cout << ((r / d) + 1) * d << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int MAXM = 1000005;
const double EPS = 1e-8;
const int INT_INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
int main() {
int q;
cin >> q;
int l, r, num;
while (q--) {
cin >> l >> r >> num;
if (num < l) {
cou... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a;
while (a--) {
cin >> b >> c >> d;
if (d < b || d > c) {
cout << d << endl;
} else
cout << ((c / d) + 1) * d << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
set<long long int> s1;
set<long long int> s2;
vector<long long int> v1;
vector<long long int> v2;
vector<long long int> v3;
vector<long long int> v4;
vector<long long int> v5;
vector<pair<long long int, long long int> > v6;
vector<string> v7;
list<l... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l, r, d, s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l >> r >> d;
s = d;
if (s >= l && s <= r) {
s += (r - r % d);
}
cout << s << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int solve(int l, int r, int d) {
if (d < l || d > r) return d;
return d * (r / d + 1);
}
int main() {
int n, l, r, d;
cin >> n;
while (n--) {
cin >> l >> r >> d;
cout << solve(l, r, d) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long unsigned l, r, d, t;
int main(int argc, char const *argv[]) {
cin >> t;
while (t--) {
cin >> l >> r >> d;
(d >= l) ? cout << (((r / d) + 1) * d) << endl : cout << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c, n, i, m, x;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d%d", &a, &b, &c);
if (c < a)
printf("%d\n", c);
else {
m = b + 1;
if (m % c == 0)
printf("%d\n", m);
else {
x = m / c;
printf("%d\n", (x... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
int a, b, c;
int m;
cin >> a >> b >> c;
if (c < a)
arr[i] = c;
else {
m = b / c;
arr[i] = (m + 1) * c;
}
}
for (int i = 0; i < n; i++) cout << arr[i... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, b, n, x;
cin >> a >> b >> n;
if (n < a || n > b)
cout << n << endl;
else {
x = b / n;
cout << n * x + n << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int i = 0;
while (1) {
if (l <= d) {
cout << d * (r / d + 1) << '\n';
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n;
int i;
int l[n], r[n], d[n];
for (i = 0; i < n; i++) {
cin >> l[i] >> r[i] >> d[i];
}
for (i = 0; i < n; i++) {
if (d[i] < l[i]) {
cout << d[i] << endl;
} else {
p = r[i] % d[i];
r[i] = r[i] - p;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
long long l, r, x;
while (q--) {
cin >> l >> r >> x;
if (l > r) swap(l, r);
if (x < l or x > r) {
cout << x << endl;
continue;
}
long long rp = r - r % x + x;
cout << rp << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r, d, n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &l, &r, &d);
if (l <= d) d = ((int)(r / d) + 1) * d;
printf("%d\n", d);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
} else {
int c = r / d;
cout << d * (c ... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int k = 0; k < q; k++) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << " ";
else {
long long tmp = r % d;
cout << r + d - tmp << " ";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
int l[500], r[500], d[500], ans[500];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i] >> d[i];
int quo;
if (d[i] < l[i]) {
ans[i] = d[i];
} else {
quo = int(r[i] / d[i]);
ans[i] = d[i] * (quo + 1);
... |
#include <bits/stdc++.h>
using namespace std;
inline long long modadd(long long n, long long m) {
long long sum = ((n + m) % 1000000007 + 1000000007) % 1000000007;
return sum;
}
inline long long modsub(long long n, long long m) {
long long diff =
((n - m + 1000000007) % 1000000007 + 1000000007) % 1000000007... |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
struct edge {
int from, to;
double value;
edge(int f, int t, double v) { from = f, to = t, value = v; }
};
int n, m;
vector<edge> s;
bool cmp(edge x, edge y) { return x.value < y.value; }
bool cmp1(int x, int y) { ret... |
#include <bits/stdc++.h>
using namespace std;
int visit[5005], ans[5005];
int a[5005], b[5005];
int dap[5005][5005];
int main() {
int l, r, a;
int t;
scanf("%d", &t);
while (t--) {
scanf("%d%d%d", &l, &r, &a);
int tx = l / a, ty = r / a;
for (int i = 1;; i++) {
if (i * a < l || i * a > r) {
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, a, b, c, i;
cin >> t;
while (t--) {
cin >> a >> b >> c;
if (c < a)
cout << c << endl;
else {
i = (b / c) + 1;
cout << i * c << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l > d)
cout << d;
else if (l <= d) {
cout << ((r / d) + 1) * d;
}
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, i, l[500], r[500], d[500], j;
cin >> q;
for (i = 0; i < q; i++) {
cin >> l[i] >> r[i] >> d[i];
if (d[i] < l[i] || d[i] > r[i]) {
cout << d[i] << endl;
} else {
j = ((r[i] / d[i]) + 1) * d[i];
cout << j << endl;
}
... |
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R>
void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
inline long long read() {
long long x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') f |= ... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int main() {
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n;
cin >> n;
while (n--) {
long long l, r, d;
cin >> l >> r >> d;
long long q = (l % d == 0 ? d : l % d), p = (d - r % d);
if (l - q > 0)
cout <... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, c;
cin >> a >> b >> c;
cout << (a > c ? c : (b / c + 1) * c) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long l, r, d, q;
int main() {
scanf("%lld", &q);
for (int i = 1; i <= q; i++) {
scanf("%lld%lld%lld", &l, &r, &d);
if (d < l)
printf("%lld\n", d);
else {
printf("%lld\n", (r / d + 1) * d);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int q;
int main() {
int i, j;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
long long t1 = l / d, t2 = r / d;
if (t1 > 1) {
cout << d << endl;
} else if (t1 == 1 && l % d != 0) {
cout << d << endl;
} else {
co... |
#include <bits/stdc++.h>
using namespace std;
long long get_pow(long long base, long long exp);
int main(int argc, char *argv[]) {
long long q, l, r, d, i;
scanf("%lld", &q);
while (q--) {
scanf("%lld %lld %lld", &l, &r, &d);
if (d < l) {
printf("%lld\n", d);
} else {
printf("%lld\n", (r +... |
#include <bits/stdc++.h>
using namespace std;
signed main() {
long long t;
scanf("%lld", &t);
while (t--) {
long long l, r, d;
scanf("%lld%lld%lld", &l, &r, &d);
if (d < l)
printf("%lld\n", d);
else if (d > r)
printf("%lld\n", d);
else
printf("%lld\n", (r / d + 1) * d);
}
}... |
#include <bits/stdc++.h>
using namespace std;
void Solve() {
long long int l, r, d;
scanf("%lld %lld %lld", &l, &r, &d);
if (l <= d) {
if (r % d == 0)
r /= d;
else
r /= d;
r++;
d *= r;
printf("%lld\n", d);
} else
printf("%lld\n", d);
}
int main() {
long long int t;
scanf(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
cin >> n;
long long int l, r, d;
for (int i = 0; i < n; i++) {
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
continue;
}
cout << (r / d + 1) * d << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int N;
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int l, r, d, ans = 0;
scanf("%d %d %d", &l, &r, &d);
if (l > d)
ans = d;
else
ans = r + 1;
if (ans % d) ans += (d - ans % d);
printf("%d\n", ans);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
int Q;
cin >> Q;
while (Q--) {
int L, R, D;
cin >> L >> R >> D;
if (D < L)
cout << D << endl;
else {
int64_t u = R / D * D;
while (u <= R) u += D;
cout << u << endl;
}
}
ret... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, l, r, d;
cin >> q;
while (q--) {
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
} else if (d == r) {
cout << 2 * d << endl;
} else if (d < r) {
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);
int q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << "\n";
} else {
cout << r + d - r % d << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
long int l, r, d, i, j;
scanf("%ld %ld %ld", &l, &r, &d);
if (d < l)
printf("%ld\n", d);
else {
i = r / d;
printf("%ld\n", (i + 1) * d);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (l > r) swap(l, r);
long long temp = 1;
bool sign = true;
while (temp < l) {
if (temp % d == 0) {
cout << temp << endl;
... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, l, r, d, x, y;
cin >> q;
for (int i = 1; i <= q; i++) {
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
y = r / d;
x = d * (y + 1);
cout << x << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, k;
cin >> q;
long long l, r, d, x;
for (k = 0; k < q; ++k) {
cin >> l >> r >> d;
if (d < l || d > r)
x = d;
else {
if (r % d == 0)
x = r + d;
else
x = r + (d - (r % d));
}
cout << x << endl;
... |
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long inf = 922337203685477;
const long long mininf = -922337203685477;
const long long nax = 0;
long long t, l, r, d;
void solve() {
cin >> l >> r >> d;
long long mini = (l + d - 1) / d;
long long maxi = r / d;
if (mini <= 1... |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, x, n;
cin >> n;
while (n--) {
cin >> l >> r >> x;
if (x < l)
cout << x << endl;
else
cout << (r / x + 1) * x << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int a, b, c;
cin >> a >> b >> c;
if (c < a || c > b) {
cout << c << endl;
} else {
cout << (b / c + 1) * c << endl;
}
}
}
|
#include <bits/stdc++.h>
int bb[1 + 100000], dp[1 + 100000], ss[((100000 + 500 - 1) / 500)],
dq[((100000 + 500 - 1) / 500)][500 + 1 + 500];
void update(int h) {
int *qq = dq[h];
int i, t, c;
t = 0;
memset(qq, 0, (500 + 1 + 500) * sizeof *qq);
for (i = (h + 1) * 500; i > h * 500; i--) {
t += bb[i];
... |
#include <bits/stdc++.h>
using namespace std;
long long mod = 998244353;
struct bucket {
long long size, minm;
vector<long long> off;
vector<long long> dps;
vector<long long> pre;
bucket(long long b) {
size = b;
off = vector<long long>(b);
pre = vector<long long>(b);
dps = vector<long long>(b)... |
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 100002;
const int MOD = 998244353;
const int MAGIC = 200;
const int MAX_BLOCK = MAX_N / MAGIC + 7;
const int INF = 1e9;
int n, k, prv[MAX_N], pos[MAX_N], a[MAX_N];
int nBlock, L[MAX_BLOCK], R[MAX_BLOCK], blockID[MAX_N];
int v[MAX_N], offset[MAX_BLOCK], hea... |
#include <bits/stdc++.h>
int const MOD = 998244353;
void add(int& a, int b) {
assert(0 <= a and a < MOD);
assert(0 <= b and b < MOD);
a += b;
if (a >= MOD) a -= MOD;
}
int main() {
std::ios::sync_with_stdio(0);
std::cin.tie(0);
int n, maxu;
std::cin >> n >> maxu;
std::vector<int> a(n);
for (int& x :... |
#include <bits/stdc++.h>
using namespace std;
struct bucket {
int sz, szq, ptr, lz;
pair<int, int> u[250 + 5];
pair<int, int> el[250 + 5];
} B[100005 / 250 + 5];
int n, k, tot;
int a[100005], dp[100005], lnk[100005];
int add(int x, int y) {
x += y;
if (x >= 998244353) x -= 998244353;
if (x < 0) x += 9982443... |
#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[100007];
long long dp[100007];
int prv1[100007];
int prv2[100007];
class bucket {
public:
int st, en;
long long pref[300 + 2];
int val[300 + 2];
int mn = 0;
void recalc() {
int curr = val[0];
for (int i = st; i <= en; ++i) {
curr = (... |
#include <bits/stdc++.h>
using namespace std;
inline void read(int &x) {
int v = 0, f = 1;
char c = getchar();
while (!isdigit(c) && c != '-') c = getchar();
if (c == '-')
f = -1;
else
v = (c & 15);
while (isdigit(c = getchar())) v = (v << 1) + (v << 3) + (c & 15);
x = v * f;
}
inline void read(lo... |
#include <bits/stdc++.h>
using namespace std;
template <typename T>
void chkMax(T &x, T y) {
if (y > x) x = y;
}
template <typename T>
void chkMin(T &x, T y) {
if (y < x) x = y;
}
template <typename T>
void inline read(T &x) {
int f = 1;
x = 0;
char s = getchar();
while (s < '0' || s > '9') {
if (s == '... |
#include <bits/stdc++.h>
const int N = 1e5 + 5, M = N / 183 + 3;
int bel[N], f[N], g[N], tag[M], s[M][183 + 3 << 1];
inline int read() {
int now = 0;
register char c = getchar();
for (; !isdigit(c); c = getchar())
;
for (; isdigit(c); now = now * 10 + c - 48, c = getchar())
;
return now;
}
void Update... |
#include <bits/stdc++.h>
const int N = 1e5 + 5, M = N / 140 + 3;
int bel[N], f[N], g[N], tag[M], s[M][140 + 3 << 1];
inline int read() {
int now = 0;
register char c = getchar();
for (; !isdigit(c); c = getchar())
;
for (; isdigit(c); now = now * 10 + c - 48, c = getchar())
;
return now;
}
void Update... |
#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7, mod = 998244353;
int n, m, B;
int a[N], pos[N], bel[N], lst[N], f[N], cnt[N], delta[440], ans[440],
sum[440][N];
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9') c = getchar();
while ('0' <= c && c <= '9')
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.