text
stringlengths 49
983k
|
|---|
#include <bits/stdc++.h>
using namespace std;
int q, l, r, d;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> q;
while (q--) {
cin >> l >> r >> d;
if (l <= d && d <= r) {
cout << (r + 1 + d - 1) / d * d << "\n";
} else {
cout << d << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, i, j, l, r, d, x, ans;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l >> r >> d;
if (d < l)
ans = d;
else {
ans = r / d;
ans *= d;
if (ans <= r) ans += d;
}
cout << ans << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int test;
cin >> test;
while (test--) {
int l, r, d;
cin >> l >> r >> d;
int left = l / d;
int right = r / d;
if (left > 1)
cout << d << "\n";
else if (left == 1 && l % d != 0)
cout << d << "\n";
else {
cout << d * (right + 1) << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
void solve() {
long long int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d;
return;
}
long long int x = r / d;
x++;
cout << x * d;
return;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tc = 1;
cin >> tc;
while (tc--) {
solve();
cout << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
int q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << endl;
else {
long long t = r / d;
cout << (t + 1) * d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int tc;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> tc;
while (tc--) {
int l, r, x;
cin >> l >> r >> x;
if (x < l) {
cout << x << endl;
continue;
} else {
int res = r / x + 1;
cout << res * x << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
const long long N = 1e9;
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
long long n, c = 0, j, m = 0;
cin >> n;
for (long long i = 1; i <= n; i++) {
long long l, r, d;
cin >> l >> r >> d;
c = d;
m = d;
if (d > r || d < l) {
cout << d << '\n';
} else {
j = r / d;
if (r % d != 0) {
j++;
}
c = d * j;
if (c == r) {
c += d;
}
cout << c << '\n';
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <class T>
inline bool read(T &x) {
int c = getchar();
int sgn = 1;
while (~c && c<'0' | c> '9') {
if (c == '-') sgn = -1;
c = getchar();
}
for (x = 0; ~c && '0' <= c && c <= '9'; c = getchar()) x = x * 10 + c - '0';
x *= sgn;
return ~c;
}
template <class T>
inline long long gcd(T a, T b) {
a = abs(a);
b = abs(b);
while (b) {
a = a % b;
swap(a, b);
}
return a;
}
template <class T>
inline long long ext_gcd(T A, T B, T *X, T *Y) {
T x2, y2, x1, y1, x, y, r2, r1, q, r;
x2 = 1;
y2 = 0;
x1 = 0;
y1 = 1;
for (r2 = A, r1 = B; r1 != 0;
r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
q = r2 / r1;
r = r2 % r1;
x = x2 - (q * x1);
y = y2 - (q * y1);
}
*X = x2;
*Y = y2;
return r2;
}
template <class T>
inline long long modInv(T a, T m) {
T x, y;
ext_gcd(a, m, &x, &y);
x %= m;
if (x < 0) x += m;
return x;
}
template <class T>
inline long long power(T a, T p) {
T res = 1, x = a;
while (p) {
if (p & 1) res = (res * x);
x = (x * x);
p >>= 1;
}
return res;
}
template <class T>
inline long long bigmod(T a, T p, T m) {
T res = 1 % m, x = a % m;
while (p) {
if (p & 1) res = (res * x) % m;
x = (x * x) % m;
p >>= 1;
}
return res;
}
int main() {
long long q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
continue;
}
long long add = r / d;
cout << (d * (add + 1)) << 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;
if (d < l) {
cout << d;
} else {
cout << (long long int)(d * (1 + (floor)(r / d)));
}
cout << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
long long int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
long long int val = (r / d);
cout << (val + 1) * d << endl;
continue;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int q, l, r, d;
int main() {
cin >> q;
while (q--) {
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;
int main() {
int n;
cin >> n;
while (n--) {
int a, b, d;
cin >> a >> b >> d;
if (a != d && a / d >= 1) {
cout << d << endl;
} else {
int k = b / d;
cout << (k + 1) * d << endl;
}
}
return 0;
}
|
#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;
return ans;
}
int main() {
int Q;
cin >> Q;
int L, R, d;
while (Q--) {
cin >> L >> R >> d;
if (d < L)
cout << d << endl;
else {
if (R < d)
cout << d << endl;
else
cout << (R - (R % d) + d) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, l, r, d;
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &l, &r, &d);
if (d < l)
printf("%d\n", d);
else
printf("%d\n", (r / d + 1) * d);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
vector<int> isPrime(20, 1);
void seive(int range) {
isPrime[0] = isPrime[1] = 0;
for (int i = 2; i * i <= range; i++)
if (isPrime[i])
for (int j = i * i; j <= range; j += i) isPrime[j] = i;
}
long long mod_expo(long long n, long long exp, long long p = MOD) {
long long res = 1;
while (exp > 0) {
if (exp & 1) {
res = ((res % p) * (n % p)) % p;
exp--;
};
n = ((n % p) * (n % p)) % p;
exp >>= 1;
}
return res;
}
int checkPrime(int n) {
if (n == 1 or n == 0) return -1;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0) {
return -1;
}
}
return 1;
}
void solve() {
int l, r, d;
cin >> l >> r >> d;
if (d < l || d > r) {
cout << (d) << '\n';
} else {
cout << ((r / d) * d + d) << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int ts = 1;
cin >> ts;
std::chrono::time_point<std::chrono::system_clock> start, end;
start = std::chrono::system_clock::now();
while (ts--) {
solve();
}
end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds = end - start;
std::time_t end_time = std::chrono::system_clock::to_time_t(end);
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
iostream::sync_with_stdio(false);
int q;
cin >> q;
for (int i = 0; i < q; ++i) {
int l, r, d;
cin >> l;
cin >> r;
cin >> d;
if (l > d) {
cout << d << "\n";
} else {
int t = r / d;
t = (t + 1) * d;
cout << t << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
int x, i = 1;
if (d < l) {
x = d * 1;
} else if (d >= l) {
r = r / d;
x = (r + 1) * d;
}
cout << x << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
while (n--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
continue;
} else {
cout << d * (r / d + 1) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int T, N, i, g, s, l, r, d, x, y, x1, y1;
cin >> T;
while (T--) {
cin >> l >> r >> d;
x = r / d;
y = l / d;
y1 = (y - 1) * d;
x1 = (x + 1) * d;
if (y == 0)
cout << x1 << endl;
else if (l > d)
cout << d << endl;
else if (l == d)
cout << x1 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long a, b, c, k, z, mod, m, h, n, x;
vector<int> vec;
string s;
int dp[100005] = {};
void solve() {
int l, r, d;
cin >> l >> r >> d;
if (d > r || d < l) {
cout << d;
return;
}
cout << d * (r / d + 1);
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cout << setprecision(10);
int t = 1;
cin >> t;
while (t--) {
solve();
cout << '\n';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
long long l, r, d;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
if (fopen(""
".INP",
"r"))
freopen(
""
".INP",
"r", stdin),
freopen(
""
".OUT",
"w", stdout);
int q;
cin >> q;
while (q--) {
cin >> l >> r >> d;
long long res1 = d;
long long res2 = (r / d + 1) * d;
if (res1 > 0 && (res1 < l || res1 > r))
cout << res1 << '\n';
else
cout << res2 << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int l, r, d, n, t;
cin >> t;
while (t--) {
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
n = r / d;
n++;
d = d * n;
cout << d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const int mod = 1000000007;
const int mx = 2000001;
const long long infL = 0xf3f3f3f3f3f3f3f;
const double eps = 1e-9;
const double pi = acos(-1.0);
int main() {
int q, l, r, d, x1, x2;
scanf("%d", &q);
while (q--) {
scanf("%d", &l), scanf("%d", &r), scanf("%d", &d);
x1 = d;
x2 = (r + d) / d * d;
if (x1 >= l) x1 = x2;
printf("%d", (int)min(x1, x2)), printf("\n");
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d, i, cnt;
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << endl;
else {
cnt = (r / d);
cout << (cnt + 1) * d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
int q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (l <= d)
cout << (r / d + 1) * d << endl;
else
cout << d << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long t;
cin >> t;
long long le, re, dis;
for (int i = 0; i < t; i++) {
cin >> le >> re >> dis;
long long le1 = le / dis;
long long le2 = re / dis;
if (le % dis == 0)
le1 = (le / dis - 1) * dis;
else
le1 = (le / dis) * dis;
le2 = (re / dis + 1) * dis;
if (le1 > 0)
cout << min(le1, dis) << endl;
else
cout << le2 << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
continue;
}
long long result = r + d - (r % d);
cout << result << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
long long a, b, c, s, m;
while (q--) {
cin >> a >> b >> c;
long long x;
if (c < a)
x = c;
else {
x = ((b / c) + 1) * c;
}
cout << x << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
static int Q, L, R, X;
int main() {
scanf("%d", &Q);
while (Q--) {
scanf("%d%d%d", &L, &R, &X);
if (X < L)
printf("%d\n", X);
else
printf("%d\n", (R / X + 1) * X);
}
return 0;
}
|
#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 < l) {
cout << d << endl;
} else {
int div = r / d;
cout << d * (div + 1) << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long l, r, d, check, flag, res, div;
cin >> l >> r >> d;
if (d == 1) {
if (l > 1)
cout << "1" << endl;
else
cout << r + 1 << endl;
continue;
}
if (l > d) {
cout << d << endl;
} else {
check = r % d;
if (check == 0)
cout << r + d << endl;
else
cout << r + (d - check) << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
long long int expo_fast(long long int a, long long int b) {
a = a;
long long int result = 1;
while (b) {
if (b & 1) result = (result * a);
b >>= 1;
a = (a * a);
}
return (result);
}
void take_in(vector<long long int>* arr) {
for (int i = 0; i < arr->size(); i++) cin >> (*(arr))[i];
}
void disp_arr(vector<long long int>* arr) {
for (int i = 0; i < arr->size(); i++) cout << (*(arr))[i] << " ";
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l > d)
cout << d << "\n";
else {
cout << d * ((r / d) + 1) << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, a, b, d;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b >> d;
if (d < a)
cout << d << '\n';
else
cout << b + (d - b % d) << '\n';
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, l, r, d;
cin >> n;
while (n--) {
cin >> l >> r >> d;
cout << (d < l ? d : ((r / d) + 1) * d) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int i = 0; i < q; i++) {
int l, r, d;
cin >> l >> r >> d;
if (d < l) {
cout << d;
} else {
int f = d - r % d + r;
cout << f;
}
if (i != q - 1) {
cout << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
long long int l, r, x, y, d;
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << endl;
else {
x = (r + 1) / d;
y = x * d;
if (y <= r) y = (x + 1) * d;
cout << y << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
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;
bool Finish_read;
template <class T>
inline void read(T &x) {
Finish_read = 0;
x = 0;
int f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-') f = -1;
if (ch == EOF) return;
ch = getchar();
}
while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
x *= f;
Finish_read = 1;
}
template <class T>
inline void print(T x) {
if (x / 10 != 0) print(x / 10);
putchar(x % 10 + '0');
}
template <class T>
inline void writeln(T x) {
if (x < 0) putchar('-');
x = abs(x);
print(x);
putchar('\n');
}
template <class T>
inline void write(T x) {
if (x < 0) putchar('-');
x = abs(x);
print(x);
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) {
long long gg = gcd(a, b);
a /= gg;
if (a <= LLONG_MAX / b) return a * b;
return LLONG_MAX;
}
const int maxn = 1e5 + 7;
int n, m;
int main() {
long long x;
int n;
cin >> n;
while (n--) {
long long 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;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
else if (d > r)
cout << d << "\n";
else {
r /= d;
r++;
cout << r * d << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
long long x = (r) / d;
if (d >= l)
cout << (x + 1) * d << endl;
else
cout << d << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int l, r, d;
int x;
int q;
scanf("%d", &q);
while (q--) {
scanf("%d %d %d", &l, &r, &d);
if (d < l)
printf("%d\n", d);
else {
printf("%d\n", ((r / d) * d + d));
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long n, l, m, c;
int main(void) {
cin >> n;
for (long long i = 1; i <= n; ++i) {
cin >> m >> c >> l;
if (m > l) {
cout << l << endl;
} else {
long long k = c / l;
k++;
cout << k * l << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
struct InputReader {
char buf[1000001];
int p;
inline InputReader() { p = 1000001; }
inline void Flush() {
p = 0;
fread(buf, 1, 1000001, stdin);
}
inline char C() {
if (p >= 1000001) Flush();
return buf[p++];
}
inline char Readnum() {
char ch = C();
while (!isdigit(ch) && ch != '-') ch = C();
return ch;
}
inline void Readalpha(char &c) {
c = C();
while (!isalpha(c)) c = C();
}
int operator()() {
int ans = 0, fu = 1;
char ch = Readnum();
if (ch == '-') fu = -1, ch = C();
while (ch >= '0' && ch <= '9') {
ans = ans * 10 + ch - '0';
ch = C();
}
return ans * fu;
}
long long Readll() {
long long ans = 0LL, fu = 1LL;
char ch = Readnum();
if (ch == '-') fu = -1LL, ch = C();
while (ch >= '0' && ch <= '9') {
ans = ans * 10LL + ch - '0';
ch = C();
}
return ans * fu;
}
inline void Readstring(string &x) {
x.clear();
char ch = C();
while (!isdigit(ch) && !isalpha(ch) && ch != '-' && ch != '.') ch = C();
while (isdigit(ch) || isalpha(ch) || ch == '-' || ch == '.') {
x += ch;
ch = C();
}
}
inline void Readchstring(char s[]) {
int len = 0;
char ch = C();
while (!isdigit(ch) && !isalpha(ch)) ch = C();
while (isdigit(ch) || isalpha(ch)) {
s[len++] = ch;
ch = C();
}
s[len] = '\0';
}
inline void Specialread(bool &x) {
char c = C();
while (c != '#' && c != '.' && c != '=' && c != 'B') c = C();
x = c == '#';
}
} In;
inline void Read(int &x) { x = In(); }
inline void Read(int &x, int &y) {
x = In();
y = In();
}
inline void Read(int &x1, int &x2, int &x3) {
x1 = In();
x2 = In();
x3 = In();
}
inline void Read(int &x1, int &x2, int &x3, int &x4) {
x1 = In();
x2 = In();
x3 = In();
x4 = In();
}
inline void Read(long long &x) { x = In.Readll(); }
inline void Read(long long &x, long long &y) {
x = In.Readll();
y = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3) {
x1 = In.Readll();
x2 = In.Readll();
x3 = In.Readll();
}
inline void Read(long long &x1, long long &x2, long long &x3, long long &x4) {
x1 = In.Readll();
x2 = In.Readll();
x3 = In.Readll();
x4 = In.Readll();
}
inline void FILEIO() {}
inline void FILEIO(string pname) {
freopen((pname + ".in").c_str(), "r", stdin);
freopen((pname + ".out").c_str(), "w", stdout);
}
void Printtime() {}
void END() {
Printtime();
exit(0);
}
template <typename T>
void END(T mes) {
cout << mes << endl;
END();
}
template <typename T>
void Print(T a[], int s, int t, char sp = ' ', char ed = '\n') {
for (int i = s; i <= t; i++) cout << a[i] << sp;
cout << ed;
cout.flush();
}
template <typename T>
void Print(T a, int s = 0, int t = -1, char sp = ' ', char ed = '\n') {
if (t == -1) t = a.size() - 1;
for (int i = s; i <= t; i++) cout << a[i] << sp;
cout << ed;
cout.flush();
}
int main() {
FILEIO();
int T;
Read(T);
;
for (register int(ti) = 1; (ti) <= (T); ++(ti)) {
long long l;
Read(l);
;
long long r;
Read(r);
;
;
long long d;
Read(d);
;
;
if (d < l)
cout << d << endl;
else {
cout << r / d * d + d << endl;
}
}
END();
}
|
#include <bits/stdc++.h>
int main() {
int l, r, n, t;
scanf("%d", &t);
while (t--) {
scanf("%d %d %d", &l, &r, &n);
if (l > n) {
printf("%d\n", n);
continue;
}
long long k = r / n;
printf("%lld\n", (k + 1) * n);
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int a, b, c;
int t;
scanf("%d", &t);
while (t--) {
scanf("%d%d%d", &a, &b, &c);
if (a > c)
printf("%d\n", c);
else {
printf("%d\n", ((b / c) + 1) * c);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, q;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> a >> b >> c;
if (c < a) {
cout << c << endl;
} else if (a <= c && c <= b) {
cout << ((b / c) + 1) * c << endl;
} else
cout << c << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, l, r, d;
cin >> q;
for (int i = 0; i < q; ++i) {
cin >> l >> r >> d;
if (d >= l && d <= r) {
cout << d - (r % d) + r << endl;
} else {
cout << d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int N = 3e5 + 7;
int main() {
int q;
cin >> q;
while (q--) {
long long 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;
bool isVowel(char c) {
if (c != 'a' && c != 'o' && c != 'u' && c != 'e' && c != 'i') {
return false;
} else {
return true;
}
}
bool isConst(char c) {
if (c != 'a' && c != 'o' && c != 'u' && c != 'e' && c != 'i') {
return true;
} else {
return false;
}
}
int main() {
int t;
cin >> t;
while (t--) {
long long a, b, c;
cin >> a >> b >> c;
if (a > c) {
cout << c << "\n";
continue;
}
if (c > b) {
cout << c << "\n";
continue;
}
if (c == 1) {
cout << b + 1 << "\n";
} else {
cout << (c * (b / c)) + c << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t;
cin >> t;
while (t--) {
long long a, b, c;
cin >> a >> b >> c;
if (c < a) {
cout << c << "\n";
} else {
cout << (b / c + 1) * c << "\n";
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long l, r, x = 1, d;
int q;
cin >> q;
while (q--) {
long long i = l;
cin >> l >> r >> d;
if (l != d && l / d >= 1)
cout << d << endl;
else
cout << (r / d + 1) * d << endl;
}
return 0;
}
|
#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 < l) {
cout << d << endl;
} else {
cout << (r / d + 1) * d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int n, li, ri, di;
int main() {
while (cin >> n) {
while (n--) {
scanf("%d %d %d", &li, &ri, &di);
int x = (li - 1) / di;
if (x > 0) {
cout << di << endl;
} else {
x = ceil((double)(ri + 1) / di);
cout << 1LL * di * x << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (l <= d) {
int a = d - r % d;
cout << r + a << endl;
} else {
cout << d << endl;
}
}
}
|
#include <bits/stdc++.h>
int main() {
int l, r, d, x;
int i, n;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("\n%d %d %d", &l, &r, &d);
if (d < l)
printf("%d\n", d);
else {
x = r + 1;
if (x % d == 0)
printf("%d\n", x);
else
printf("%d\n", ((r / d) + 1) * d);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int q, l, r, d, n;
cin >> q;
while (q-- > 0) {
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
else
cout << r - (r % d) + d << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
int l[501], r[501], d[501], ans[501];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i] >> d[i];
if (l[i] > d[i] || r[i] < d[i])
ans[i] = d[i];
else
ans[i] = (r[i] / d[i] + 1) * d[i];
}
for (int i = 0; i < q; i++) cout << ans[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
for (int t1 = 0; t1 < t; t1++) {
int l, r, d;
int min = 1000000000;
cin >> l >> r >> d;
min = (d < l) ? d : r / d * d + d;
cout << min << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
long int a, b, c, d, ans;
int T, i;
scanf("%d", &T);
for (i = 1; i <= T; i++) {
scanf("%ld %ld %ld", &a, &b, &c);
if (a > c) {
printf("%ld\n", c);
} else {
d = b / c;
d = d + 1;
ans = c * d;
printf("%ld\n", ans);
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (; q > 0; q--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
l = r - (r % d) + d;
cout << l << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, i, l, r, d;
cin >> q;
for (i = 0; i < q; i++) {
cin >> l >> r >> d;
int x = r / d;
if ((d * 1) < l)
cout << d * 1 << endl;
else if ((x * d) <= r)
cout << ((x + 1) * d) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int a;
scanf("%d", &a);
for (int rr = 1; rr <= a; rr++) {
int r1, r2, dig, res;
scanf("%d%d%d", &r1, &r2, &dig);
if (r1 > dig)
printf("%d\n", dig);
else {
res = ((r2 / dig) + 1) * dig;
printf("%d\n", res);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
scanf("%d", &t);
while (t--) {
int a, b, d;
scanf("%d%d%d", &a, &b, &d);
if (d < a)
printf("%d\n", d);
else {
printf("%d\n", b + d - b % d);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int i;
int fun(int l, int r, int d) {
if (d > r) {
return d;
}
if (r == d) {
return d * 2;
}
if (d < r) {
for (i = d; i <= l; i++) {
if (i % d == 0) {
if (i == l) break;
return i;
}
}
}
if (d > l) {
int p = ceil(((double)(r + 1) / (double(d)))) * d;
return p;
}
if (d < l) {
return d;
}
if (d == l) {
return (ceil((double)(r + 1) / (double)d)) * d;
}
}
int main() {
int l, r, d, i, j[500];
int q;
cin >> q;
for (i = 0; i < q; i++) {
cin >> l >> r >> d;
j[i] = fun(l, r, d);
}
for (i = 0; i < q; i++) {
cout << j[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
long int l, r, d;
cin >> l >> r >> d;
if (d < l)
arr[i] = d;
else if (d >= l && d <= r) {
if (r % d != 0)
arr[i] = (r / d) * d + d;
else
arr[i] = r + d;
} else
arr[i] = d;
}
for (int i = 0; i < n; i++) cout << arr[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int l, r, d;
int n, q;
int main() {
scanf("%d", &q);
while (q--) {
scanf("%d%d%d", &l, &r, &d);
if (d < l)
printf("%d\n", d);
else {
bool flag = false;
for (int i = r + 1; i <= r + 10000; ++i) {
if (i % d == 0) {
printf("%d\n", i);
flag = true;
break;
}
}
if (!flag) {
for (int i = d;; i += d) {
if (i > r && i % d == 0) {
printf("%d\n", i);
break;
}
}
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
template <typename P, typename Q>
ostream& operator<<(ostream& os, pair<P, Q> p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <typename P, typename Q>
istream& operator>>(istream& is, pair<P, Q>& p) {
is >> p.first >> p.second;
return is;
}
template <typename T>
ostream& operator<<(ostream& os, vector<T> v) {
os << "(";
for (auto& i : v) os << i << ",";
os << ")";
return os;
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
for (auto& i : v) is >> i;
return is;
}
template <typename T>
inline T setmax(T& a, T b) {
return a = std::max(a, b);
}
template <typename T>
inline T setmin(T& a, T b) {
return a = std::min(a, b);
}
int main(int argc, char* argv[]) {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
while (cin >> q) {
while (q--) {
long long int a, b, c;
cin >> a >> b >> c;
if (c < a) {
cout << c << endl;
} else {
cout << (b + c) / c * c << endl;
}
}
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
int main(int argc, char** argv) {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
long long q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
else
cout << ((r / d) + 1) * d << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
if (l - d <= 0)
cout << r + d - r % d << endl;
else {
cout << d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t, n;
cin >> t;
while (t--) {
int r, l, d, x;
cin >> r >> l >> d;
if (d < r || d > l)
cout << d << endl;
else {
if (d >= r && d <= l) cout << (l / d + 1) * d << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int q;
int main() {
cin >> q;
long long l, r, d;
while (q--) {
cin >> l >> r >> d;
if (l > d)
cout << d << endl;
else
cout << ((r + d) / d) * d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
scanf("%d", &q);
for (int i = 1; i <= q; i++) {
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
if (c < a || c > b)
printf("%d\n", c);
else
printf("%d\n", (b / c + 1) * c);
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int q;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> q;
int l, r, d;
for (int _ = 0; _ < (signed)(q); _++) {
cin >> l >> r >> d;
if (l > d)
cout << d;
else
cout << ((r + d) / d) * d;
cout << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
long long int l, r, d;
while (t--) {
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
long long int a = r / d + 1;
cout << d * a << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
long long t, l, r, c;
signed main() {
cin >> t;
while (t--) {
cin >> l >> r >> c;
if (c < l)
cout << c << endl;
else {
if (r % c == 0)
cout << r + c << endl;
else
cout << ((r / c) + 1) * c << endl;
}
}
return 0;
}
|
#include <bits/stdc++.h>
int main() {
int q;
scanf("%d", &q);
while (q--) {
int l, r, d;
scanf("%d %d %d", &l, &r, &d);
int rem2 = r % d;
if (d < l) {
printf("%d\n", d);
} else {
int r1 = r + (d - rem2);
printf("%d\n", r1);
}
}
return 0;
}
|
#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 l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << "\n";
else {
cout << ((r / d) + 1) * d << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int k, t, l, r, d, j = 0;
cin >> t;
do {
cin >> l >> r >> d;
if (d < l) {
cout << d << endl;
} else {
k = r % d;
k = r + d - k;
cout << k << endl;
}
j++;
} while (j < t);
}
|
#include <bits/stdc++.h>
using namespace std;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)2e5 + 5;
long long T, l, r, d;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> T;
while (T-- && cin >> l >> r >> d) {
if (l > d)
cout << d << endl;
else
cout << (r / d + 1) * d << endl;
}
}
|
#include <bits/stdc++.h>
int main() {
int l, r, d, t;
scanf("%d", &t);
while (t--) {
scanf("%d %d %d", &l, &r, &d);
if (l != d && l / d >= 1)
printf("%d\n", d);
else
printf("%d\n", ((r / d) + 1) * d);
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long q;
cin >> q;
while (q--) {
long long l, r, d, c;
cin >> l >> r >> d;
if (l > d) {
cout << d << " \n";
} else {
c = floor(r / d);
c += 1;
cout << c * d << "\n";
}
}
}
|
#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 {
int acima = r + (d - (r % d));
printf("%d\n", acima);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
bool comp(const pair<long long, long long>& a,
const pair<long long, long long>& b) {
return a.second > b.second;
}
double EPSILON = numeric_limits<double>::epsilon();
bool AreSame(double a, double b) { return fabs(a - b) < EPSILON; }
struct classcomp {
bool operator()(const pair<long long, long long>& lhs,
const pair<long long, long long>& rhs) const {
return lhs.second > rhs.second;
}
};
long long power(long long x, long long y, long long p) {
long long res = 1;
x = x % p;
while (y > 0) {
if (y & 1) res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (d >= l and d <= r) d = (r / d + 1) * d;
cout << d << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int f, l, d, num = 0;
cin >> f >> l >> d;
if (f > d * 1) {
num = d * 1;
} else {
if (l % d == 0)
num = l + d;
else
num = l + d - (l % d);
}
cout << num << "\n";
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000;
int main() {
int n;
scanf("%d", &n);
long long l, r, d;
for (int i = 1; i <= n; i++) {
cin >> l >> r >> d;
if (d < l)
printf("%I64d\n", d);
else if (r / d * d > r)
printf("%I64d\n", r / d * d);
else
printf("%I64d\n", (r / d + 1) * d);
}
return 0;
}
|
#include <bits/stdc++.h>
#pragma GCC target("sse2")
#pragma GCC optimization("Ofast")
#pragma GCC optimization("unroll-loops")
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int q;
cin >> q;
while (q--) {
long long int l, r, x;
cin >> l >> r >> x;
if (x < l || x > r) {
cout << x << ' ';
continue;
}
long long int y = r + (x - (r % x));
cout << y << ' ';
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) {
if (a == 0) {
return (b);
} else {
return (gcd(b % a, a));
}
}
bool x[10000001] = {false};
int spf[10000001];
map<int64_t, int64_t> mp, mp1;
vector<int64_t> pri, pris;
int64_t fast(int64_t n, int64_t a) {
if (n == 0)
return (1);
else if (n == 1)
return (a % 1000000007);
else {
int64_t r = fast(n / 2, a) % 1000000007;
if (n % 2 == 0)
return (((r % 1000000007) * (r % 1000000007)) % 1000000007);
else
return (((((r % 1000000007) * a) % 1000000007) * r) % 1000000007);
}
}
int64_t check(int64_t n) {
if (n == 1 || n == 0)
return (0);
else if (n == 2 || n == 3)
return (1);
else if (n % 2 == 0 || n % 3 == 0)
return (0);
else {
for (int64_t i = 5; i * i <= n; i += 6) {
if (n % i == 0 || n % (i + 2) == 0) return (0);
}
return (1);
}
}
int main() {
int q;
cin >> q;
while (q--) {
int64_t l, r, x;
scanf("%lld%lld%lld", &l, &r, &x);
if (x < l || x > r) {
printf("%lld\n", x);
} else if (x >= l && x <= r) {
int64_t p = r / x;
printf("%lld\n", (p + 1) * x);
}
}
}
|
#include <bits/stdc++.h>
int main() {
int q, i;
long long int l, d, r, x;
scanf("%d", &q);
for (i = 1; i <= q; i++) {
scanf("%lld%lld%lld", &l, &r, &d);
if (l / d == 1 && l % d != 0)
printf("%d\n", d);
else if (l / d > 1)
printf("%d\n", d);
else {
x = r / d;
printf("%d\n", (x + 1) * d);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int xuli(long long l, long long r, long long d) {
if (l > d || r < d)
return d;
else
return (r / d + 1) * d;
}
int main() {
long long n;
cin >> n;
long long i, l, r, d;
for (i = 1; i <= n; i++) {
cin >> l >> r >> d;
cout << xuli(l, r, d) << "\n";
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int n;
scanf("%lld", &n);
long long int l, r, a, i, j;
int flag = 0;
for (i = 0; i < n; i++) {
long long int k;
scanf("%lld %lld %lld", &l, &r, &a);
if (l > a)
printf("%lld\n", a);
else
printf("%lld\n", r + (a - r % a));
}
}
|
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
int n, m, t, k;
int d[((int)1e5 + 5)];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++) {
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>
using namespace std;
inline void fast() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
}
int main() {
fast();
long long q;
cin >> q;
while (q--) {
long long l, r, d;
cin >> l >> r >> d;
long long lower = l - 1;
long long upper = r + 1;
if (lower > 0) {
long long rem = lower % d;
if (lower - rem > 0) {
cout << d << endl;
continue;
}
}
long long rem = upper % d;
if (rem == 0) {
cout << upper << endl;
continue;
}
cout << upper + d - rem << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main(int argc, char **argv) {
int n, a;
cin >> n;
int l, r, d;
for (int i = 0; i < n; i++) {
cin >> l >> r >> d;
cout << (l - d <= 0 ? r - (r % d) + d : d) << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
int T, l, r, d;
using namespace std;
int main() {
scanf("%d", &T);
while (T--) {
scanf("%d%d%d", &l, &r, &d);
if (d < l) {
printf("%d\n", d);
continue;
} else {
int t = (r / d * d);
if (t <= r) t += d;
printf("%d\n", t);
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
int l, r, d;
cin >> l >> r >> d;
long long x = d;
if (l > d)
cout << d << "\n";
else {
int p = r / d;
x = p * d;
while (x <= r) {
x = x + d;
}
cout << x << "\n";
}
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int32_t main() {
long long i, t, a, b, c;
cin >> t;
while (t--) {
cin >> a >> b >> c;
if (a > c) {
cout << c << endl;
} else if (c > b) {
cout << c << endl;
} else {
long long p = (b / c);
long long ff = ((b / c) + 1) * c;
cout << ff << endl;
}
}
}
|
#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 (d < l)
cout << d << endl;
else {
long long int tmp1 = r / d;
cout << (tmp1 + 1) * d << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int i, n;
cin >> n;
int l[n], r[n], d[n], a[n];
for (i = 0; i < n; i++) {
cin >> l[i] >> r[i] >> d[i];
if (d[i] < l[i])
a[i] = d[i];
else {
a[i] = r[i] / d[i];
a[i]++;
a[i] = a[i] * d[i];
}
}
for (i = 0; i < n; i++) {
cout << a[i] << endl;
}
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long a, b, d;
cin >> a >> b >> d;
if (d < a)
cout << d << endl;
else {
cout << b + d - (b % d) << endl;
}
}
}
|
#include <bits/stdc++.h>
using namespace std;
int q;
int main() {
cin >> q;
while (q--) {
int a, b, n;
cin >> a >> b >> n;
if (n < a || n > b)
cout << n << endl;
else {
int t = b / n;
cout << n * (t + 1) << endl;
}
}
return 0;
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.