solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
tests = int(input())
ans = [None] * tests
for i in range(tests):
x, y, z = map(int, input().split())
if (z < x or z > y):
ans[i] = z
else:
ans[i] = (y // z) * z+z
for sol in ans:
print(sol) | 7 | PYTHON3 |
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = sys.stdin.readline().split()
self.index = 0
val = self.buff[self.index]
self.index += 1
return val
def next_int(self):
return int(self.next())
def solve(self):
n = self.next_int()
for i in range(0, n):
l = self.next_int()
r = self.next_int()
d = self.next_int()
if d < l:
print(d)
else:
print(r // d * d + d)
if __name__ == '__main__':
Main().solve()
| 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int, input().split())
g=r//d+1
if d<l:
print(d)
else:
print(g*d)
| 7 | PYTHON3 |
t = int(input())
L = []
R = []
D = []
for i in range(t):
l, r, d = map(int, input().split())
L.append(l)
R.append(r)
D.append(d)
for i in range(t):
small = (L[i]/D[i])
large = (R[i]/D[i])
if small > 1.0:
print(D[i])
else:
print((int(large) + 1)*D[i])
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
a = list(map(int, input().split()))
count = 1
if a[2] < a[0]:
print( a[2])
else:
print( (int(a[1]/a[2]) + 1) *a[2])
| 7 | PYTHON3 |
t = int(input())
for kk in range(t):
l, r, d = map(int, input().split())
if l > d or r < d:
print(d)
else:
print(int((r+d)/d)*d)
| 7 | PYTHON3 |
def solve(l, r, d):
if d < l:
return d
else:
return (r//d + 1) * d
x = int(input())
while x > 0:
[l, r, d] = list(map(int, input().split()))
print(solve(l, r, d))
x -= 1
| 7 | PYTHON3 |
N = int(input())
for i in range(N):
l,r,d = [int(u) for u in input().split()]
if(l*1.0/d>1):
print(d)
else:
print(d*(r//d)+d)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
s = list(map(int,input().split()))
if s[0]>s[2]:
print(s[2])
elif s[2]>=s[0] and s[0]<=s[1]:
q=s[2]
b=s[1]
q=(b//q)*q+q
print(q)
else:
print(q) | 7 | PYTHON3 |
n = int(input())
m = 0
for i in range(n):
f = True
x = list(map(int, input().split()))
m = x[2]
if m < x[0] or m > x[1]:
print(m)
else:
print((x[1] - (x[1] % m) + m))
| 7 | PYTHON3 |
#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;
}
}
| 7 | CPP |
for _ in range(int(input())):
l,r,d = map(int,input().split())
if d<l:
print(d)
else:
m = r%d
if r<d:
print(d)
else:
x = r//d
print(d*(x+1)) | 7 | PYTHON3 |
#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] << endl;
}
return 0;
}
| 7 | CPP |
k=1
n=int(input())
for i in range(1,n+1):
l,r,d=map(int,input().split())
if(d<l):
print(d)
else:
print((r//d+1)*d)
| 7 | PYTHON3 |
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
# Bootstrap https://github.com/cheran-senthil/PyRival/blob/master/tests/misc/test_bootstrap.py
from types import GeneratorType
def bootstrap(f, stack=[]):
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
#################
from collections import defaultdict
from math import sqrt
INF = pow(2, 63)
def isPrime(number):
"""
input: positive integer 'number'
returns true if 'number' is prime otherwise false.
"""
# precondition
assert isinstance(number, int) and (
number >= 0
), "'number' must been an int and positive"
status = True
# 0 and 1 are none primes.
if number <= 1:
status = False
for divisor in range(2, int(round(sqrt(number))) + 1):
# if 'number' divisible by 'divisor' then sets 'status'
# of false and break up the loop.
if number % divisor == 0:
status = False
break
# precondition
assert isinstance(status, bool), "'status' must been from type bool"
return status
def prime_factors(n: int):
"""
Returns prime factors of n as a list.
>>> prime_factors(0)
[]
>>> prime_factors(100)
[2, 2, 5, 5]
>>> prime_factors(2560)
[2, 2, 2, 2, 2, 2, 2, 2, 2, 5]
>>> prime_factors(10**-2)
[]
>>> prime_factors(0.02)
[]
>>> x = prime_factors(10**241) # doctest: +NORMALIZE_WHITESPACE
>>> x == [2]*241 + [5]*241
True
>>> prime_factors(10**-354)
[]
>>> prime_factors('hello')
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'str'
>>> prime_factors([1,2,'hello'])
Traceback (most recent call last):
...
TypeError: '<=' not supported between instances of 'int' and 'list'
"""
i = 2
factors = []
while i * i <= n:
if n % i:
i += 1
else:
n //= i
factors.append(i)
if n > 1:
factors.append(n)
return factors
def greatest_common_divisor(a: int, b: int) -> int:
return abs(b) if a == 0 else greatest_common_divisor(b % a, a)
def solveb(n, tuparr):
return -1
import math
def solve(l, r, d):
if l // d > 0 and l != d:
return d
return d*(r // d + 1)
def main():
# n, k = map(int, input().strip().split())
# a = []
# for _ in range(n):
# a.append(input().strip())
# print(solve(n, k, a))
# for _ in range(int(input().strip())):
n = int(input().strip())
# [n, m, o] = list(map(int, input().strip().split()))
# arrn = list(map(int, input().strip().split()))
# sarr = []
for _ in range(n):
print(solve(*list(map(int, input().strip().split()))))
def mainb():
pass
######## Python 2 and 3 footer by Pajenegod and c1729
# Note because cf runs old PyPy3 version which doesn't have the sped up
# unicode strings, PyPy3 strings will many times be slower than pypy2.
# There is a way to get around this by using binary strings in PyPy3
# but its syntax is different which makes it kind of a mess to use.
# So on cf, use PyPy2 for best string performance.
py2 = round(0.5)
if py2:
from future_builtins import ascii, filter, hex, map, oct, zip
range = xrange
import os, sys
from io import IOBase, BytesIO
BUFSIZE = 8192
class FastIO(BytesIO):
newlines = 0
def __init__(self, file):
self._file = file
self._fd = file.fileno()
self.writable = "x" in file.mode or "w" in file.mode
self.write = super(FastIO, self).write if self.writable else None
def _fill(self):
s = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.seek((self.tell(), self.seek(0, 2), super(FastIO, self).write(s))[0])
return s
def read(self):
while self._fill(): pass
return super(FastIO, self).read()
def readline(self):
while self.newlines == 0:
s = self._fill();
self.newlines = s.count(b"\n") + (not s)
self.newlines -= 1
return super(FastIO, self).readline()
def flush(self):
if self.writable:
os.write(self._fd, self.getvalue())
self.truncate(0), self.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
if py2:
self.write = self.buffer.write
self.read = self.buffer.read
self.readline = self.buffer.readline
else:
self.write = lambda s: self.buffer.write(s.encode('ascii'))
self.read = lambda: self.buffer.read().decode('ascii')
self.readline = lambda: self.buffer.readline().decode('ascii')
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline()
# Cout implemented in Python
import sys
class ostream:
def __lshift__(self, a):
sys.stdout.write(str(a))
return self
cout = ostream()
endl = '\n'
# Read all remaining integers in stdin, type is given by optional argument, this is fast
def readnumbers(zero=0):
conv = ord if py2 else lambda x: x
A = [];
numb = zero;
sign = 1;
i = 0;
s = sys.stdin.buffer.read()
try:
while True:
if s[i] >= b'0'[0]:
numb = 10 * numb + conv(s[i]) - 48
elif s[i] == b'-'[0]:
sign = -1
elif s[i] != b'\r'[0]:
A.append(sign * numb)
numb = zero;
sign = 1
i += 1
except:
pass
if s and s[-1] >= b'0'[0]:
A.append(sign * numb)
return A
if __name__ == "__main__":
# for _ in range(3): # todo for testing else remove for loop
main()
| 7 | PYTHON3 |
q = int(input())
for i in range(0,q):
inp = input()
l,r,d = map(int, inp.split())
if(d<l):
print (d)
continue
print ((r//d+1)*d) | 7 | PYTHON3 |
def solve(l,r,d):
if l//d > 1:
return d
elif(l//d== 1 and l!=d):
return d
else:
return ((r//d) + 1)*d
t = int(input())
for _ in range(t):
l,r,d = map(int,input().split())
print(solve(l,r,d)) | 7 | PYTHON3 |
q=int(input())
for i in range(0,q):
l,r,d=map(int,input().split())
if l<=d<=r:
a=r//d
print((a+1)*d)
else:
print(d)
| 7 | PYTHON3 |
#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(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T>
void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
__print(t);
if (sizeof...(v)) cerr << ", ";
_print(v...);
}
template <typename T, typename TT>
ostream &operator<<(ostream &os, const pair<T, TT> &t) {
return os << t.first << " " << t.second;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &t) {
for (auto &i : t) os << i << " ";
return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
for (T &t : v) is >> t;
return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, vector<pair<T1, T2>> &v) {
for (pair<T1, T2> &t : v) is >> t.first >> t.second;
return is;
}
const long long mod = 998244353;
int main() {
ios_base::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 (l > d) {
cout << d << '\n';
continue;
}
cout << r - (r % d) + d << '\n';
}
return 0;
}
| 7 | CPP |
n = int(input())
for _ in range(n):
l,r,d = input().split()
l,r,d = int(l),int(r),int(d)
if(d<l):
print(d)
elif(d>r):
print(d)
else:
k = int(r/d)
k = k + 1
print(d*k) | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l, r, d=map(int, input().rstrip().split())
if l<=d:
x=r//d*(d)+d
print(x)
else:
print(d) | 7 | PYTHON3 |
for i in range(int(input())):
a = list(int(x) for x in input().split())
print((a[2] >= a[0]) * (a[1] // a[2]) * a[2] + a[2]) | 7 | PYTHON3 |
def minInteger(l, r, d):
if l > d or r < d:
print(d)
else :
print((r//d + 1)*d)
def listMinInteger(q, N):
for i in N:
minInteger(i[0],i[1],i[2])
q = int(input())
N = [list(map(int , input().split())) for _ in range(q)]
listMinInteger(q,N) | 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
if d<l or d>r:
print(d)
else:
print(d*((r//d)+1))
| 7 | PYTHON3 |
t = int(input())
for _ in range(t):
l, r, d = map(int, input().split())
s = d * (l // d)
e = d * (r // d) + d
f = 0
for i in range(d,s+1,d):
if i < l and i % d == 0:
print(i)
f = 1
break
if f == 0:
print(e)
| 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if d==1 and l==1:
print(r+1)
elif d==1 and l!=1:
print(1)
elif d!=1 and d>=l and d<=r:
t=r//d
print(d*(t+1))
elif d!=1 and d>r:
print(d)
elif d!=1 and d<l:
print(d) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
flag = False
if not l <= d <= r:
print(d)
else:
print((r // d + 1) * d)
| 7 | PYTHON3 |
#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 << num1 << endl;
}
}
}
| 7 | CPP |
q=int(input())
result=[]
for i in range(q):
l,r,d=map(int,input().split())
if l//d>1 and l%d==0:
result.append(str(d))
elif l//d>=1 and l%d!=0:
result.append(str(d))
else:
result.append(str((r//d+1)*d))
print('\n'.join(result))
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
ld = (l + d - 1) // d
rd = r // d
if ld > 1:
print(d)
else:
print((rd + 1) * d)
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d = map(int,input().split())
i = d
if l<=i<=r:
mul = r//i
i = i*(mul+1)
while i%d!=0:
if l<=i<=r:
mul = i//r
i = i*mul
i+=d
print(i) | 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = map(int, input().split())
if l / d > 1:
print(d)
else:
print(d * (r // d + 1)) | 7 | PYTHON3 |
t = int(input())
while t>0:
t = t-1
l,r,d = map(int,input().split())
intial = (l-1)//d
if intial>=1:
print(d)
else:
if (r+1) % d != 0:
final = (r+1)//d
print(d*(final+1))
else:
print(r+1) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
for _ in range(int(input())):
a,b,d=map(int,input().split())
if a>d:
print(d)
elif b<d:
print(d)
else:
x=b//d
print(d*(x+1)) | 7 | PYTHON3 |
t = int(input())
for _ in range(t):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print(r-(r%d)+d) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if d*1<l:
print(d)
continue
print(r//d*d+d) | 7 | PYTHON3 |
num = int(input())
for i in range(num):
l,r,d = tuple(map(int,input().split()))
if d<l or d>r :
print(d)
else :
print((1+int(r/d))*d)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d= map(int, input().split())
if d >= l and d <= r:
print((r//d + 1)*d)
else:
print(d) | 7 | PYTHON3 |
n=int(input())
for k in range(n):
a,b,c=map(int,input().split())
print(((b//c)*c+c,c)[c<a])
| 7 | PYTHON3 |
t = int(input())
i = 0
while i < t:
n, p, d = input().split()
n = int(n)
p = int(p)
d = int(d)
if n>d:
print(d)
i = i+1
continue
r = p//d
print(d*(r+1))
i = i + 1 | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l, r, d=input().split()
if int(d)<int(l):
print(d)
else:
print(((int(r)//int(d))+1)*int(d)) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d= map(int, input().split())
if (d < l):
print(d)
continue
x = d
if x <= r:
mod = r % d
x = r - mod + d
print(x)
| 7 | PYTHON3 |
q = int(input())
def check_left(l,r,d):
return d
def check_right(l,r,d):
result = 0
if (r%d == 0):
result = r+d
else:
result = r - (r%d) + d
return result
def minimum_integer(l,r,d):
if (l-d <= 0):
return check_right(l,r,d)
else:
return check_left(l,r,d)
for i in range(q):
l, r, d = [int(e) for e in input().split()]
print(minimum_integer(l,r,d)) | 7 | PYTHON3 |
n = int(input())
entradas = []
saida = []
for i in range(n):
entradas.append(input())
for j in (entradas):
entrada = j.split()
achou = False
k = 1
while not achou:
num = int(entrada[2])*k
if(num < int(entrada[0]) or num > int (entrada[1])):
achou = True
saida.append(num)
else:
if num < int(entrada[0]):
k += 1
else:
if num < int(entrada[1]):
k += int(int(entrada[1])/int(entrada[2]))
else:
k+=1
for l in (saida):
print (int(l))
| 7 | PYTHON3 |
class CodeforcesTask1101ASolution:
def __init__(self):
self.result = ''
self.q = 0
self.queries = []
def read_input(self):
self.q = int(input())
for x in range(self.q):
self.queries.append([int(y) for y in input().split(" ")])
def process_task(self):
results = []
for query in self.queries:
x = query[2]
if x < query[0]:
results.append(x)
else:
x = query[2] * (query[1] // query[2] + 1)
results.append(x)
self.result = "\n".join([str(x) for x in results])
def get_result(self):
return self.result
if __name__ == "__main__":
Solution = CodeforcesTask1101ASolution()
Solution.read_input()
Solution.process_task()
print(Solution.get_result())
| 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
for _ in range(int(input())):
s=[int(n) for n in input().split()]
l=s[0]
r=s[1]
d=s[2]
p=0
if l>d:
print(d)
p=1
if p==0:
j=r//d+1
print(j*d) | 7 | PYTHON3 |
#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 * (r / d + 1);
}
printf("%lld\n", rs);
}
}
| 7 | CPP |
query=int(input())
for i in range(query):
l,r,d=map(int,input().split())
if(d<l or d>r):
print(d)
else:
print((r//d)*d+d) | 7 | PYTHON3 |
import math
x = int(input())
for i in range(x):
n1 , n2 , n3 = map(int , input().split())
i = 2
if (n3 < n1 and n3 < n2) or (n3 > n1 and n3 > n2):
print(n3)
if n3 == n2:
print(2 * n3)
if n3 >= n1 and n3 < n2:
print(math.ceil((n2 + 1)/n3) * n3) | 7 | PYTHON3 |
t=int(input())
while(t>0):
l,r,d = [int(x) for x in input().split()]
if d<l:
print(d)
else:
t1=r%d
print(r+d-t1)
t-=1 | 7 | PYTHON3 |
for _ in[0]*int(input()):l,r,d=map(int,input().split());print((d>=l)*r//d*d+d) | 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
for _ in range(int(input())):
a,b,d=map(int,input().split())
m1=a%d
m2=b%d
if m1!=0 and a//d!=0:
print(d)
elif m1==0 and a//d>=2:
print(d)
else:
print(d*(b//d+1))
| 7 | PYTHON3 |
for i in range(int(input())):
left, right, d = map(int, input().split())
ans = (d if left > d else 0) or (right // d + 1) * d
print(ans)
| 7 | PYTHON3 |
q = int(input())
x = []
for i in range(q):
li,ri,di = map(int,input().split())
if (di < li):
x.append(di)
elif (di > ri):
x.append(di)
else:
x.append(di * ((ri // di) + 1))
for i in range(q):
print(x[i])
| 7 | PYTHON3 |
n = int(input())
con = []
for i in range(n):
nums = input().split(' ')
con.append([int(nums[0]), int(nums[1]), int(nums[2])])
res = []
for i in con:
if i[0] > i[2] or i[1] < i[2]:
res.append(i[2])
else:
res.append(((i[1] // i[2]) + 1) * i[2])
for i in res:
print(i) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
x = list(map(int, input().split(" ")))
a = x[0]
b = x[1]
c = x[2]
if c < a or c > b:
print(c)
else:
i = b // c
while True:
if i * c > b:
print(i * c)
break
else:
i += 1
| 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
t=0
for i in range(1,l//d+1):
q=d*i
if (q<l or q>r) and q!=0:
t+=1
print(q)
break
if t==0:
for i in range(r//d,(r//d)+5):
q=d*i
if (q<l or q>r) and q!=0:
print(q)
break | 7 | PYTHON3 |
p = int(input())
de = []
for i in range(p):
x = input().split(' ')
l = int(x[0])
r = int(x[1])
d = int(x[2])
de.append((l,r,d))
for l, r, d in de:
if l <= d <= r:
x = (r//d+1)*d
else:
x = d
print(x) | 7 | PYTHON3 |
n = int(input())
for _ in range(n):
l, r, d = (int(s) for s in input().split(' '))
if d < l:
print(d)
elif r % d == 0:
print(r + d)
else:
print(r // d * d + d) | 7 | PYTHON3 |
TC = int(input())
for T in range(TC):
l, r, d = map(int, input().split())
res = d
if l <= res <= r:
res = (r // d + 1) * d
print(res)
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
z1 = d*(l//d)
if l%d==0:
z1-=d
z2 = d*(r//d + 1)
if z1<1:
print(z2)
else:
print(d)
| 7 | PYTHON3 |
'''input
5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
'''
n=int(input())
for i in range(n):
l,r,d=map(int,input().strip().split(' '))
if d<l or d>r:
print(d)
else:
k=d-r%d
ans=r+k
print(ans) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
a,b,d=map(int,input().split())
if(d<a):
print(d)
else:
c=b%d
if(c==0):
print(b+d)
else:
print(b+(d-c) )
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
d1=d*1
if d1<l:
print(d)
elif d>r:
print(d)
else:
l=r//d
print(d*(l+1))
| 7 | PYTHON3 |
#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 << endl;
}
}
| 7 | CPP |
x = int(input())
for i in range(x):
a, b, c = [int(i) for i in input().split()]
z = c
if z < a:
print(z)
else:
y = c - (b % c)
z = b + y
print(z)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l = list(map(int,input().split()))
if l[2] < l[0]:
print(l[2])
elif l[2] > l[1]:
print(l[2])
else :
print(l[2]*(l[1]//l[2] +1))
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
lrd = input().split()
for j in range(3):
lrd[j] = int(lrd[j])
l = lrd[0]
r = lrd[1]
d = lrd[2]
if d < l:
print(d)
else:
print(d * (r // d + 1)) | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
if(d<l):
print(d)
elif(d<=r):
print(r+d-(r%d))
elif(d>r):
print(d)
| 7 | PYTHON3 |
# cook your dish here
t=int(input())
for i in range(t):
l,r,d=map(int,input().split(' '))
if l/d<=1:
x=int(r/d)
print((x+1)*d)
else:
print(d)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d < l or d > r:
x = d
elif d < r:
resto = r % d
x = d + (r - resto)
else:
x = d + d
print(x)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if l > d:
print(d)
elif r % d == 0:
print(r + d)
else:
print(r // d * d + d) | 7 | PYTHON3 |
#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;
}
}
return 0;
}
| 7 | CPP |
#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;
}
| 7 | CPP |
n = int(input())
for x in range(n):
l, r, d = map(int, input().split())
q = l // d
q1 = r // d
if q > 0:
if q == 1 and l % d == 0:
pass
else:
if d < l:
print(d)
else:
print((q) * d)
continue
print((q1 + 1) * d)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = input().split()
l, r, d = int(l), int(r), int(d)
if l > d:
x = d
elif r < d:
x = d
else:
x = (int(r/d)+1)*d
print(x) | 7 | PYTHON3 |
#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 << x << endl;
}
}
| 7 | CPP |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
if (l / d > 1):
print(d)
continue
print(r + d - r % d)
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
print(d if(d<l or d>r) else d*((r//d)+1)) | 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if d < l:
print(d)
elif r % d:
print(r // d * d + d)
else:
print(r + d) | 7 | PYTHON3 |
t=int(input())
for _ in range(t):
n,k,m=map(int,input().split())
if m<n:
print(m)
elif m>k:
print(m)
else:
d=k-m
e=d//m
f=m*(e+2)
print(f)
| 7 | PYTHON3 |
def get_minimum(l,r,d, x):
minimum = x*d
if not(minimum < l or minimum > r):
minimum = get_minimum(l,r,d,int(r/d)+1)
return minimum
def min_integer(queries):
results = []
for query in queries:
l,r,d = query
results.append(get_minimum(l,r,d, 1))
return results
def get_queries(q):
queries = []
while q > 0:
l,r,d = input().split(' ')
l,r,d = int(l), int(r), int(d)
queries.append([l,r,d])
q -= 1
return queries
queries = get_queries(int(input()))
results = min_integer(queries)
for r in results:
print(r)
| 7 | PYTHON3 |
num = int(input())
x = 0
for i in range(num):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
x = r
x += d - r % d
print(x)
| 7 | PYTHON3 |
q = int(input())
a = []
for i in range(0,q):
l,r,m = map(int,input().split())
if m < l:a.append(m)
else:a.append((r // m + 1) * m)
for i in range(0,len(a)):
print(a[i])
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
k=(r+d-1)//d
ans=k*d
if ans==r:
ans+=d
print(ans) | 7 | PYTHON3 |
"""""""""""""""""""""""""""""""""""""""""""""
| author: mr.math - Hakimov Rahimjon |
| e-mail: [email protected] |
"""""""""""""""""""""""""""""""""""""""""""""
#inp = open("lepus.in", "r"); input = inp.readline; out = open("lepus.out", "w"); print = out.write
TN = int(input())
# ===========================================
def solution():
l, r, d = map(int, input().split())
if d < l: print(d)
elif d > r: print(d)
elif l <= d <= r:
print((r//d+1)*d)
# ===========================================
while TN != 0:
solution()
TN -= 1
# ===========================================
#inp.close()
#out.close() | 7 | PYTHON3 |
q=int(input())
for i in range(q):
p=input().split()
l=int(p[0])
r=int(p[1])
d=int(p[2])
if d<l:
print(d)
else:
print(r+d-r%d) | 7 | PYTHON3 |
N = int(input())
for i in range(N):
a,b,c = map(int,input().split())
if c < a :
print(c)
else:
b = b + c - b%c
print(b) | 7 | PYTHON3 |
def find(l, r, d):
if l>d or r<d:
return d
return r + (d - r%d)
n = int(input())
for _ in range(n):
l, r, d = map(int, input().split())
print(find(l, r, d)) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
ls = list(map(int, input().split()))
l = ls[0]
r = ls[1]
d = ls[2]
if d < l:
print(d)
else:
print((r // d + 1) * d)
| 7 | PYTHON3 |
n=int(input(''))
for x in range(0,n):
x=list(map(int,input().split()))
if x[2]<x[0]:
x[2]=x[2]
elif x[2]>x[1]:
x[2]=x[2]
else:
x[2]=x[2]*(x[1]//x[2]+1)
print(x[2])
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
if d>r or d<l:
print(d)
else:
print(((r//d)*d)+d) | 7 | PYTHON3 |
import math
n = int(input())
mtrx = [list(int(x) for x in input().split()) for i in range(n)]
for i in range(n):
if mtrx[i][2] < mtrx[i][0]:
print(mtrx[i][2])
if mtrx[i][2] >= mtrx[i][0]:
print(math.ceil((mtrx[i][1] + 1)/mtrx[i][2]) * mtrx[i][2])
| 7 | PYTHON3 |
#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);
}
}
| 7 | CPP |
#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;
}
return 0;
}
| 7 | CPP |
#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 + d << endl;
}
}
return 0;
}
| 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.