solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
t=int(input())
while(t):
t-=1
a,b,d=map(int,input().split())
if(a>d):
print(d)
else:
print(b+d-b%d) | 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
j=r+1
if d<l:
print(d)
else:
c=r//d
print(int(d*(c+1))) | 7 | PYTHON3 |
#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) && (l % d != 0))
cout << d;
else if (p > 1)
cout << d;
else
cout << (q + 1) * d;
cout << endl;
}
}
| 7 | CPP |
for _ in range(int(input())):
l,r,c=[*map(int,input().split())]
count=c
if c<l:
print(c)
elif c>r:
print(c)
else:
print(c*((r//c)+1)) | 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print(r//d * d + d) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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 * x + x << endl;
}
}
return 0;
}
| 7 | CPP |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if d<l or d>r:
print(d)
# elif d==r and d==10**9:
# print(10**9)
else:
print(((r//d)+1)*d) | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if(l>d):
print(d)
else:
if(r/d==1):
print(r+d)
elif(r/d<1):
print(d)
elif(r/d>1):
print((r//d+1)*d)
| 7 | PYTHON3 |
import math
def get_min(l, r, d):
cur = d
if l <= cur <= r:
cur = (r // d) * d + d
return cur
if __name__ == '__main__':
n = int(input())
for i in range(n):
l, r, d = list(map(int, input().split()))
print(get_min(l, r, d))
| 7 | PYTHON3 |
n = int(input())
# n,k = map(int,input().split())
# s = input()
# m = list(map(int,input().split()))
m = [tuple(map(int,input().split())) for _ in range(n)]
for i in m:
a = i[0] - (i[0]%i[2])
if a > i[2] or a <= 0:
a = i[2]
b = (i[1]+i[2])-(i[1]%i[2])
if a < i[0]:
print(a)
continue
else:
print(b)
| 7 | PYTHON3 |
t=int(input())
q=[]
for i in range(t):
l,r,d=map(int,input().split())
if d<l or d>r:
q.append(str(d))
else:
q.append(str((r//d+1)*d))
print("\n".join(q)) | 7 | PYTHON3 |
T = int(input())
for t in range(T):
l,r,d = [int(x) for x in input().split()]
if d<l or d>r :
print(d)
else:
remainder = (r+1)%d
addend = d - remainder if remainder!= 0 else 0
print(r+1+addend if remainder!= 0 else r+1) | 7 | PYTHON3 |
def main():
q = int(input())
for t in range(q):
l , r, d = input().split()
l = int(l)
r = int(r)
d = int(d)
if d > r or d < l:
print(d)
else:
print(r + d - r%d)
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
n = int(input())
for i in range(n):
l,r,d = [int(s) for s in input().split()]
min_no = d
if(min_no < l or min_no > r):
print(min_no)
else:
t = r//d + 1
print(d*t) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
a=int(input())
for i in range(a):
l=list(map(int,input().split()))
if(l[0]/l[2]>1):
print(l[2])
else:
n=l[1]//l[2]
print((n+1)*l[2]) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
if (d < l or d > r):
print(d)
else:
print((r // d + 1) * d) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d > 0 and d < l:
print(d)
else:
print(((r+d)//d) * d)
| 7 | PYTHON3 |
n = int(input())
def find(l, r, d):
if d < l:
return d
return r + d - ((r + d) % d)
for _ in range(n):
l, r, d = map(int, input().split())
print(find(l, r, d)) | 7 | PYTHON3 |
q=int(input())
l=[]
for i in range(q):
k=input().split()
l.append(k)
for j in l:
l=int(j[0])
r=int(j[1])
d=int(j[2])
if d<r:
if d>=l:
a=d-(r%d)
if a==0:
print(r+d)
else:
print(r+a)
elif l>d:
print(d)
elif d>r:
print(d)
elif d==r:
print(2*d) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
m,n,k=[int(x) for x in input().split()]
if k<m or k>n:
print(k)
else:
print(k*(n//k+1))
| 7 | PYTHON3 |
t = int(input())
for _ in range(t):
l1 = [int(x) for x in input().split()]
l,r,d = l1[0],l1[1],l1[2]
if d<l:
print(d)
else:
print(r+d-r%d) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
for _ in range(int(input())):
n,m,d=map(int,input().split())
if n/d>1:
print(d)
else:
print(d*((m//d)+1)) | 7 | PYTHON3 |
for _ in range(int(input())):
a,b,c = map(int,input().split())
if c<a or c>b:print(c)
else:z = b//c +1;print(c*z) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
a, b, d = map(int, input().split())
if d < a:
print(d)
else:
print(b // d * d + d) | 7 | PYTHON3 |
#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);
cin.tie(0);
cout.tie(0);
testcase();
return 0;
}
| 7 | CPP |
import sys
import bisect
input=sys.stdin.readline
t=int(input())
#t=1
mod=10**9+7
for _ in range(t):
#n=int(input())
l,r,d=map(int,input().split())
#s=input()
#l=list(map(int,input().split()))
if l>d:
print(1*d)
else:
x=r//d
print((x+1)*d) | 7 | PYTHON3 |
'''input
5
2 4 2
5 10 4
3 10 1
1 2 3
4 6 5
'''
from sys import stdin
# main starts
q = int(stdin.readline().strip())
for _ in range(q):
l, r, d = list(map(int, stdin.readline().split()))
if l > d:
print(d)
else:
temp = r // d
print((temp + 1) * d)
| 7 | PYTHON3 |
import math
def main():
q = int(input())
for i in range(q):
l,r,d = map(int,input().split())
if l%d == 0:
l -= 1
if l >= d:
x = d
else:
if r%d == 0:
r += 1
x = int(d*math.ceil(r/d))
print(x)
main()
| 7 | PYTHON3 |
for i in [0] * 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 |
record = []
query = int(input())
for i in range(query):
record.append(input())
for values in record:
li, ri, di = map(int, values.split())
contain = None
if di < li or di > ri:
contain = di
else:
multiplier = ri // di + 1
contain = di * multiplier
print(contain)
| 7 | PYTHON3 |
class Solution(object):
def solve(self):
n = int(input().strip())
rtr = []
for i in range(n):
l, r, d = map(int, input().strip().split(' '))
if d > r or d < l:
rtr.append(d)
elif d >= l:
_add = int(r // d + 1)
rtr.append(d * _add)
else:
_add = l % d
if _add == 0:
_add = d
if l - _add > 0:
rtr.append(l - _add)
else:
_add = int(r // d + 1)
rtr.append(d * _add)
return rtr
if __name__ == "__main__":
sol = Solution()
for x in sol.solve():
print(x)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
for _ in range(int(input())):
l,r,d=map(int,input().split())
if d<l:print(d)
else:
k=r//d
print(d*(k+1)) | 7 | PYTHON3 |
for t in range(int(input())):
l,r,d=map(int,input().split(' '))
x=l//d
y=r//d
if l%d==0:
x=x-1
if x>0:
print(d)
else:
print((y+1)*d)
| 7 | PYTHON3 |
t=int(input())
for z in range(t):
l,r,n=map(int,input().split())
if n*1>=l and n*1<=r:
c=r//n
print(n*(c+1))
else:
print(n*1)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = list(map(int, input().split()))
if d < l:
print(d)
else:
print((r // d + 1) * d)
| 7 | PYTHON3 |
from sys import stdin, stdout
from math import sin, tan, cos, pi, atan2, sqrt, acos, atan, factorial
from random import randint
q = int(stdin.readline())
for i in range(q):
l, r, d = map(int, stdin.readline().split())
if d < l:
stdout.write(str(d) + '\n')
else:
stdout.write(str((r // d + 1) * d) + '\n') | 7 | PYTHON3 |
#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];
long long a[400005], b[400006], c[500006], d[400006], dp[2005][2005];
struct mat {
long long a[40][40];
};
mat init, unit;
long long gcd(long long a, long long b) { return a ? gcd(b % a, a) : b; }
set<long long> se;
long long qu(long long a, long long b, long long m) {
long long ans = 1;
while (b) {
if (b & 1) {
ans = ans % m * a % m;
}
b >>= 1;
a = a % m * a % m;
}
return ans;
}
int su(int n) {
if (n == 1 || n == 0) return 0;
for (int i = 2; i <= sqrt(n); i++) {
if (n % i == 0) return 0;
}
return 1;
}
int fi(int a) {
if (a == par[a])
return a;
else
return par[a] = fi(par[a]);
}
vector<long long> ve, ve1;
map<long long, long long> mp, mp1;
pair<long long, long long> a1[400000];
int vis[400005], vis2[406][6];
vector<long long> g[400000], g1[400000];
struct node {
long long x, y, co, t;
} aa[200005];
int cmp(node a, node b) { return a.co > b.co; }
int cmp1(node a, node b) { return a.t < b.t; }
int main() {
int t, p2, p3;
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string ss, sss, s;
long long l, r, n1;
while (cin >> n) {
while (n--) {
cin >> l >> r >> p;
if (p < l || p > r) {
cout << p << endl;
} else {
cout << r + p - (r % p) << endl;
}
}
}
}
| 7 | CPP |
x=int(input())
for i in range(x):
a,b,c=map(int,input().split())
if a>c:
print(c)
else:
print((b//c+1)*c) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
q = int(input())
answers = []
for i in range(q):
l, r, d = input().split()
l, r, d = int(l), int(r), int(d)
if d<l:
answers.append(d)
continue
else:
s = (r//d)*d + d
if s<=r:
s+=d
answers.append(s)
for i in answers:
print(i) | 7 | PYTHON3 |
a = int(input())
for i in range(a):
l, r, d = map(int,input().split())
if l > d:
print(d)
else:
print(d * ((r // d)+ 1))
| 7 | PYTHON3 |
for C in range(int(input())):
a,b,c = map(int,input().split())
# a = max(a,b)
d = c*(b//c)
if c < a:
print(c)
continue
else:
while d <= b:
d+=c
print(d) | 7 | PYTHON3 |
query = int(input())
for q in range(query):
l, r, d = map(int, input().split())
ans = 1
if (d < l or d > r):
print(d)
else:
print((r//d+1)*(d))
| 7 | PYTHON3 |
original_length = int(input())
questions = []
for x in range(original_length):
questions.append([int(y) for y in input().split()])
for i in questions:
d = int(i[2])
if d >= i[0]:
print((i[1] // d + 1) * d)
else:
print(d) | 7 | PYTHON3 |
#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 = d * p;
}
cout << x << endl;
}
return 0;
}
| 7 | CPP |
nb = int(input())
liste = []
roger = True
for loop in range(nb):
l,r,d = map(int,input().split())
if d<l or d>r:
print(d)
else:
print((r//d)*d + d)
| 7 | PYTHON3 |
def f(ll):
l,r,d = ll
if l>d:
return d
return (r//d+1)*d
t = int(input())
for _ in range(t):
l = list(map(int,input().split()))
print(f(l))
| 7 | PYTHON3 |
import sys
from collections import defaultdict as dd
input=sys.stdin.readline
n=int(input())
##d=dd(int)
for i in range(n):
l,r,d=map(int,input().split())
if(d*1<l):
print(d*1)
else:
print(((r//d)+1)*d)
##l=list(map(int,input().split()))
| 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 |
#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);
}
}
| 7 | CPP |
n=int(input())
res=[]
while n:
l,r,d=map(int,input().split())
if d<l:
res.append(d)
elif d>r:
res.append(d)
elif l<=d<=r:
m=r%d
if m==0:
res.append(r+d)
else:
res.append(d*(r//d+1))
n=n-1
for i in res:
print(i)
| 7 | PYTHON3 |
n_consultas = int(input())
if 1 <= n_consultas <= 500:
for i in range(n_consultas):
l,r,d = input().split(" ")
l,r,d = int(l), int(r), int(d)
if 1 <= l <= r <= 10**9 and 1 <= d <= 10**9:
x = d
if d < l:
print (d)
else:
m = int(r/d)
while True:
x = d*m
if x > r:
print (x)
break
m += 1
| 7 | PYTHON3 |
n=int(input())
for i in range(n):
ch=input()
l=ch.split()
a=int(l[0])
b=int(l[1])
c=int( l[2])
i=0
while True:
i+=1
d=c*i
if d not in range(a,b+1):
print(d)
break
else:
print((b//c)*c+c)
break
| 7 | PYTHON3 |
#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 + 1) << endl;
}
return 0;
}
| 7 | CPP |
q = int(input())
for i in range(q):
l, r, d = [int(x) for x in input().split()]
if d < l:
print(d)
elif d >= l:
aux = ((r // d) + 1) * d
print(aux)
| 7 | PYTHON3 |
# n,m=map(int,input().split(" "))
t=int(input())
from math import *
for _ in range(t):
l,r,k=map(int,input().split(" "))
ans=0
a=int(floor(l/k))
if(l%k==0):
a-=1
ans=a*k
if(ans==0):
a=int(ceil(r/k))
if(r%k==0):
a+=1
print(a*k)
else:
print(k) | 7 | PYTHON3 |
n=int(input())
for _ in range(n):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
ans=r%d
print(r+abs(d-ans)) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
import math
def minInt(l, r, d):
if d < l:
return d
elif r%d == 0:
return r+d
else:
return math.ceil(r/d)*d
def main():
n = int(input())
res = []
for _ in range(n):
res.append(minInt(*list(map(int, input().split()))))
for out in res:
print(out)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
n = int(input())
for _ in range(n):
l,r,d = map(int, input().split())
print(d if d < l else r+(d-r%d))
| 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
#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;
cout << ans << endl;
}
return 0;
}
| 7 | CPP |
def f(l, r, d):
if d>r:
return d
for i in range(d,l,d):
if i%d ==0:
return i
return (int(r/d)+1)*d
n = int(input())
for i in range(n):
row = input().split(' ')
l = int(row[0])
r = int(row[1])
d = int(row[2])
print(str(int(f(l,r,d))))
| 7 | PYTHON3 |
import math
class Triple:
def __init__(self, l, r, d):
self.l = l
self.r = r
self.d = d
def find_integer(self):
if self.d < self.l or self.d > self.r:
return self.d
if self.r % self.d == 0:
return self.d * (int(math.ceil(self.r / self.d)) + 1)
return self.d * int(math.ceil(self.r / self.d))
if __name__ == '__main__':
q = int(input())
numbers = []
for i in range(0, q):
l, r, d = [int(s) for s in input().split(' ')]
numbers.append(Triple(l, r, d))
for triple in numbers:
print(triple.find_integer())
| 7 | PYTHON3 |
a=int(input())
i=0
while i in range(a):
b,c,d=map(int,input().split())
s=c%d
if s==0 and (b<d or b==d) :
print(c+d)
elif s!=0 and (b<d or b==d):
print(c+d-s)
elif s==0 and b>d :
print(d)
elif s!=0 and b>d:
print(d)
i+=1
| 7 | PYTHON3 |
def main():
buf = input()
q = int(buf)
l = []
r = []
d = []
for i in range(q):
buf = input()
buflist = buf.split()
l.append(int(buflist[0]))
r.append(int(buflist[1]))
d.append(int(buflist[2]))
for i in range(q):
if d[i] < l[i]:
print(d[i])
else:
print(d[i] * ((r[i] // d[i]) + 1))
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
q = int(input())
def solve(l,r,d):
if l > d:
return d
else:
if r%d == 0:
return r+d
else:
return d*(r//d+1)
for _ in range(q):
[l,r,d] = list(map(int, input().split()))
print(solve(l,r,d))
| 7 | PYTHON3 |
#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";
}
return 0;
}
| 7 | CPP |
N = int(input())
for q in range(N):
l, r, d = map(int, input().split())
if d<l:
answer = d
else:
answer = (r//d + 1)*d
print(answer)
| 7 | PYTHON3 |
import math
from decimal import *
import random
for _ in range(int(input())):
left, right, d = map(int, input().split())
if(d==1 and left>1):
print(1)
elif(d==1 and left==1):
print(right+1)
elif(left<=d*1):
print(math.ceil((right+1)/d)*d)
else:
print(d)
| 7 | PYTHON3 |
t=int(input())
while t:
l,r,d=map(int,input().split())
if(d<l):
print(d)
elif(d>=l):
a=int(r/d)+1
print(a*d)
t-=1 | 7 | PYTHON3 |
a=int(input())
for i in range(a):
b,c,d=map(int,input().split())
if d>=min(b,c):
print(max(b,c)+(d-max(b,c)%d))
else:
print(d)
| 7 | PYTHON3 |
#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;
}
return 0;
}
| 7 | CPP |
for _ in range((int)(input())):
l,r,d=map(int,input().split())
if(d<l):
print(d)
else:
k=d-(r%d)
print(k+r) | 7 | PYTHON3 |
q = int(input())
while q>0:
l,r,d = map(int,input().split())
if l > d:
print(d)
elif d >= l and d <= r:
print(r + d - r%d)
else:
print(d)
q = q - 1 | 7 | PYTHON3 |
import sys
input = sys.stdin.readline
t = int(input())
for _ in range(t):
l,r,d = map(int,input().split())
if l <= d <= r:
print(r//d*d+d)
else:
print(d) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
l = list(map(int, input().split()))
if(l[2] < l[0]):
print(l[2])
else:
print((l[1]//l[2] + 1) * l[2])
| 7 | PYTHON3 |
for _ in range(int(input())):
L, R, D = map(int, input().split())
print(D + (0, R-R%D)[L<=D<=R]) | 7 | PYTHON3 |
def main():
t = int(input())
for __ in range(t):
l,r,d = map(int,input().split())
if l//d >= 1 and l != d:
print(d)
else:
print(((r//d)+1)*d)
if __name__ == '__main__':
main()
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
if d < l or d > r:
print(d)
else:
print(2 * d + (r - d) // d * d)
| 7 | PYTHON3 |
Q = int(input())
for i in range(Q):
l, r, d = map(int, input().split())
ans = d;
if ans >= l:
ans = (r // d + 1) * d
print(ans)
| 7 | PYTHON3 |
q=int(input())
for _ in range(q):
l,r,d=map(int,input().split())
left=0
right=0
if d==1:
if l==1:
print(r+1)
else:
print(1)
else:
if l%d==0:
left+=1
if r%d==0:
right+=1
if l//d -left>0:
print(d)
else:
print(r-r%d+d)
| 7 | PYTHON3 |
q=int(input())
for i in range (q):
a=input().split()
a[0]=int(a[0])
a[1]=int(a[1])
a[2]=int(a[2])
if a[2] < a[0] or a[2] > a[1]:
print(a[2])
else:
print((a[2]-(a[1]%a[2]))+a[1]) | 7 | PYTHON3 |
#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";
}
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
def find(l,r,d):
if d<l:
return d
elif d>r:
return d
else:
return ((r//d)+1)*d
t=int(input())
lst=[]
for i in range(0,t):
l,r,d=input().split()
ele=find(int(l),int(r),int(d))
lst.append(ele)
for i in range(0,t):
print(lst[i]) | 7 | PYTHON3 |
r = range(int(input()))
for _ in r:
l, r, d = list(map(int, input().split()))
result = None
for i in range(d, l, d):
if i%d == 0:
result = i
break
if not result:
rr = r%d
result = r + (d - rr)
if result == r:
result += d
print(result)
| 7 | PYTHON3 |
q=int(input())
for _ in range(q):
l,r,d=[int(x) for x in input().split()]
c=0
if d<l:
print(d)
continue
i=(r//d)*d+d
print(i) | 7 | PYTHON3 |
t=int(input())
while(t>0):
t=t-1
l,r,d=map(int,input().split())
if(l>d):
print(d)
else:
print(((r//d)+1)*d)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d <= l:
if d < l:
k1 = d
else:
k1 = l - d
else:
k1 = 0
if r % d != 0:
if r > d:
r1 = r + (d - r % d)
else:
r1 = d
else:
r1 = r + d
if k1 <= 0:
print(r1)
elif k1 < r1:
print(k1)
else:
print(r1)
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l,r,d = map(int,input().split(" "))
if(d<l):
print(d)
else:
print((r//d + 1)*d)
| 7 | PYTHON3 |
q = int ( input () )
for i in range (q):
l,r,d = map( int,input().split())
if d < min(l,r):
print(d)
else:
print((max(l,r)+d)//d*d)
| 7 | PYTHON3 |
for i in range(int(input())):
a, b, d = map(int, input().split())
if a/d > 1:
print(d)
else:
print(d*((b//d)+1)) | 7 | PYTHON3 |
q = int(input())
for i in range (q):
l,r,d=map(int, input().split())
x = d
if x < l or x > r:
print(x)
continue
t = r//d + 1
x = d * t
print (x) | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.