solution
stringlengths 11
983k
| difficulty
int64 0
21
| language
stringclasses 2
values |
|---|---|---|
n=int(input())
strk=[]
result=0
for i in range(n):
k=input().split()
for j in k:
strk.append(int(j))
if strk[2]<strk[0]:
result=strk[2]
if result==0:
if strk[0]<=strk[2]<=strk[1]:
result=strk[2]*(strk[1]//strk[2]+1)
if result==0:
if strk[2]>strk[1]:
result=strk[2]
print(result)
result=0
strk=[] | 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if l > d:
print(d)
else:
print(r // d * d + d)
| 7 | PYTHON3 |
#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 << d;
else
cout << r + p;
cout << '\n';
}
}
| 7 | CPP |
# -*- coding: utf-8 -*-
"""
Created on Mon Jan 7 17:15:42 2019
@author: Himanshu Gwalani
"""
for _ in range(int(input())):
l,r,d = map(int,input().split())
temp = l//d
if temp>1:
print(d)
elif temp==1 and l>d:
print(d)
else:
if d>r:
print(d)
continue
temp = r//d
print((temp+1)*d) | 7 | PYTHON3 |
q = int(input())
a=[]
for i in range(q):
l,r,d = map(int, input().split())
if d<l or d>r:
a.append(d)
else:
r+=1
if r%d==0:
a.append(r)
else:
n = r + (d-(r%d))
a.append(n)
for i in a:
print(i)
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d = map(int,input().split())
if d < l:
print(d)
else:
print(r+(d-r%d)) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
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 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if l/d>1:
print(d)
else:
print(int(r/d)*d+d) | 7 | PYTHON3 |
t = int(input())
for i in range(t):
l,r,d = input().split()
l,r,d = int(l) , int(r) , int(d)
if d < l or d > r:
print(d)
else:
print((r // d) * d + d) | 7 | PYTHON3 |
x = int(input())
for i in range(0, x):
s = ''
s1 = input().split()
l = int(s1[0])
r = int(s1[1])
y = int(s1[2])
if y < l:
print(str(y))
else:
x = (-1 * r) % y
if x == 0:
x = y
print(str(r + x))
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
q = int(input())
for i in range(q):
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 l > d:
print(d)
else:
print((int(r/d) + 1) * d)
| 7 | PYTHON3 |
q=int(input())
ans=[]
for i in range(q):
l,r,d=map(int, input().split())
j=1
if (d<l or d>r):
ans.append(d)
else:
ans.append((r//d+1)*d)
for i in range(q):
print(ans[i]) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
Q = int(input())
for i in range(Q):
l, r, d = map(int, input().split())
if d < l or d > r:
print(d)
else:
print(r+d-r%d)
| 7 | PYTHON3 |
from collections import defaultdict, deque
from heapq import heappush, heappop
from math import inf
ri = lambda : map(int, input().split())
def solve():
l,r,d = ri()
if d < l:
print(d)
return
print(r + (d - (r % d)))
t = 1
t = int(input())
while t:
t -= 1
solve()
| 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if r % d == 0:
num = r + d
else:
num = (r // d + 1) * d
if d < l:
num = min(num, d)
print(num) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = tuple(map(int, input().split()))
if l > d:
print(d)
else:
x = (r//d + 1) * d
print(x)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
nQ = int(input())
for q in range(nQ):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print((r // d) * d + d)
| 7 | PYTHON3 |
def f():
x = int(input())
for xxx in range(x):
l , r, d = map(int, input().split())
if d < l or d > r:
print(d)
else:
rem = r // d
print(d + (d*rem))
f() | 7 | PYTHON3 |
#E58_A
q = int(input())
for i in range(0, q):
ln = [int(j) for j in input().split(" ")]
l = ln[0]
r = ln[1]
d = ln[2]
if d > r or d < l:
print(d)
else:
print(r + (d - r % d))
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l,r,d = [int(x) for x in input().split()]
if l > d:
print(d)
else:
print(((r//d)+1)*d)
| 7 | PYTHON3 |
tc = int(input())
for _ in range(tc):
l, r, d = map(int, input().split(' '))
ans = d
if ans >= l:
mod = r % d
ans = (r//d) * d
ans += d
print(ans) | 7 | PYTHON3 |
#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 {
cout << (t2 + 1) * d << endl;
}
}
return 0;
}
| 7 | CPP |
Q = int(input())
for i in range(Q):
l, r, d = map(int, input().split())
if l > d:
print(d)
else:
n = r//d
print((n+1)*d) | 7 | PYTHON3 |
from math import ceil
for q in range(int(input())):
a,b,c=map(int,input().split())
j,k=ceil(a/c),b//c
print([c*(k+1),c][j>1]) | 7 | PYTHON3 |
q = int(input())
for q in range(0, q):
k = [int(a) for a in input().split()]
l = k[0]
r = k[1]
d = k[2]
if d < l or d > r:
x = d
else:
x = r - (r % d) + d
print(x)
| 7 | PYTHON3 |
"""
#If FastIO not needed, used this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
from types import GeneratorType
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
import os
self.os = os
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = self.os.read(self._fd, max(self.os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
self.os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
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().rstrip("\r\n")
import collections as col
import math, string
def getInts():
return [int(s) for s in input().split()]
def getInt():
return int(input())
def getStrs():
return [s for s in input().split()]
def getStr():
return input()
def listStr():
return list(input())
MOD = 10**9+7
"""
The numbers are breadth-first search levels, so BFS connected components, and output them in BFS order, assigning them level numbers.
Cycles are a problem
So actually we need to find connected components, deal with them one at a time
If a node is 1, it either goes first, or it is not connected to any other ones
If T[i] == T[j] and (i,j) is an edge, fail
If T[i] == K then i must have an edge to j where T[j] = 1, 2, ..., K-1 (at least one for each)
Do all the 1s, then all the 2s, etc
But need to check that the neighbours conditions are satisfied
"""
def solve():
L, R, D = getInts()
if L > D:
return D
if R < D:
return D
x = R % D
R += D-x
return R
for _ in range(getInt()):
print(solve()) | 7 | PYTHON3 |
t=int(input())
while t:
l=list(map(int,input().split()))
a,b,d=l[0],l[1],l[2]
if d<a:
print(d)
else:
r=b%d
n=d-r
num=b+n
print(num)
t-=1 | 7 | PYTHON3 |
#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 + d) - (r + d) % d);
}
}
return 0;
}
long long get_pow(long long base, long long exp) {
long long ret = 1LL;
while (exp) {
if (exp % 2) {
ret *= base;
ret %= 1000000007LL;
}
base *= base;
base %= 1000000007LL;
exp /= 2LL;
}
return ret;
}
| 7 | CPP |
a = int(input())
for i in range(a):
l,r,d = map(int, input().split())
if(d<l):
print(d)
else:
if(r%d == 0):
print(r+d)
else:
p = int(r/d)
print((p*d)+d) | 7 | PYTHON3 |
q = int(input())
A = [0] * q
for i in range(q):
A[i] = input().split(' ')
for i in range(q):
if int(A[i][2]) < int(A[i][0]) or int(A[i][2]) > int(A[i][1]):
print(A[i][2])
else:
k = int(A[i][1])//int(A[i][2])
print((k + 1) * int(A[i][2]))
| 7 | PYTHON3 |
#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);
}
}
| 7 | CPP |
n = int(input())
for i in range(n):
a = [int(s) for s in input().split()]
l = a[0]
r = a[1]
d = a[2]
if d <= r and d >= l:
print((r // d + 1) * d)
else:
print(d) | 7 | PYTHON3 |
q = int(input())
res = []
for a in range(q):
l, r, d = map(int, input().split())
k = l//d
q = r//d + 1
a = 1
for a in range(1, k+1):
x = d * a
if l <= x <= r: continue
else:
res.append(x)
a = 0
break
if a:
for a in range(q, 2 * 10**9):
x = d * a
if l <= x <= r: continue
else:
res.append(x)
break
for a in res: print(a) | 7 | PYTHON3 |
'''
sys.stdin.readline() instead of input() and using PyPy instead of Python speeds up this solution greatly.
'''
from sys import stdin
t = int(stdin.readline())
for i in range(t):
l, r, d = map(int, stdin.readline().split())
if (d < l):
print(d)
else:
print(d * (r//d + 1))
| 7 | PYTHON3 |
def func():
q = int(input())
while q:
l , r , d = map(int , input().split())
if d>=l and d<=r:
k = r//d
ans = d*(k+1)
else:
ans = d
print(ans)
q-=1
if __name__ == '__main__':
func()
| 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
remain=d-(r+1)%d;
if remain==d:
print(r+1)
else:
print(r+1+remain)
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
v = d * (r // d)
while v <= r:
v += d
print(v)
| 7 | PYTHON3 |
import math
for i in range(int(input())):
l,r,d = map(int,input().split())
if d<l:
print(d)
elif r/d == r//d:
print((r//d+1)*d)
else:
print(math.ceil(r/d)*d) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
op=r//d
print((op+1)*d)
| 7 | PYTHON3 |
t=int(input())
for i in range(t):
l,r,d=map(int,input().split())
if(d<l):
print(d)
elif(d>r):
print(d)
else:
print(d*((r//d)+1)) | 7 | PYTHON3 |
t=int(input())
for i in range(t):
s=input()
s=s.split(' ')
for j in range(3):
s[j]=int(s[j])
#print(s)
l=s[0]
r=s[1]
d=s[2]
if d>=l and d<=r:
x=r//d
result=(x+1)*d
print(result)
else:
print(d)
'''
s=input()
for i in range(len(s)):
s[i]=int(s[i])
'''
| 7 | PYTHON3 |
#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("%lld", &t);
while (t) {
t--;
Solve();
}
return 0;
}
| 7 | CPP |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if d<l or d>r:
print(d)
else:
print(d-r%d+r)
| 7 | PYTHON3 |
#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;
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
import math
t=int(input())
while t>0:
l,r,d=map(int,input().split())
if d<l or d>r:
print(d)
else:
k=math.ceil(r/d)
if d*k==r:
print(d*(k+1))
else:
print(d*k)
t-=1
| 7 | PYTHON3 |
'''x=int(input())
z=int(input())
d=1
for i in range(x-1):
f=int(input())
if z!=f:
d+=1
z=f
print(d)
a=int(input())
b=int(input())
c=int(input())
d=0
if a+b+c>d:
d=a+b+c
if (a+b)*c>d:
d=(a+b)*c
if a*(b+c)>d:
d=a*(b+c)
if a*b*c>d:
d=a*b*c
print(d)'''
x=int(input())
for i in range(x):
i=input().split()
if int(i[2])<int(i[0]):
print(int(i[2]))
else:
print(int(i[2])+(int(i[2])*(int(i[1])//int(i[2]))))
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
a,b,d = map(int,input().split())
if(d < a or d > b):
print(d)
else:
print((b//d+1)*d)
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d = map(int,input().split())
if l > d:
print(d)
else:
n = r % d
print(r + d - n)
| 7 | PYTHON3 |
q = int(input())
for i in range(0,q):
l,r,d = map(int,input().split())
if (d<l):
print(d)
elif (d>=l and d<=r):
if (r%d == 0):
print(r+d)
else:
print(r+(d-r%d))
else:
print(d) | 7 | PYTHON3 |
for x in range(int(input())):
arr = [int(i) for i in input().split()]
n = 1
if arr[2] >= arr[0] and arr[2] <= arr[1]:
n = int(arr[1]/arr[2]) +1
print(n*arr[2])
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d = map(int,input().split())
if d < l:
print(d)
else:
if (r+1) % d == 0:
print(r+1)
else:
print(r+1+d-(r+1)%d)
| 7 | PYTHON3 |
from sys import stdin, stdout
input = stdin.readline
print = stdout.write
listin = lambda : list(map(int, input().split()))
mapin = lambda : map(int, input().split())
for _ in range(int(input())):
l, r, d = mapin()
if d < l:
print(str(d)+'\n')
else:
print(str(r+d - r%d)+'\n') | 7 | PYTHON3 |
q = int(input())
for i in range(q):
data = input().split(" ")
l = int(data[0])
r = int(data[1])
d = int(data[2])
result = d if d < l else r + (d - (r % d))
print(result) | 7 | PYTHON3 |
#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;
}
}
return 0;
}
| 7 | CPP |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print((r // d + 1) * d)
| 7 | PYTHON3 |
n = int(input())
for _ in range(n):
l,r,d = map(int,input().split())
i = r//d
j = l//d
if j > 0 and l!= d:
print(d)
else:
print(d*i+d) | 7 | PYTHON3 |
'''
Amirhossein Alimirzaei
Telegram : @HajLorenzo
Instagram : amirhossein_alimirzaei
University of Bojnourd
'''
#print(96+(5-(96%5)))
for _ in range(int(input())):
tmp=list(map(int,input().split()))
if(tmp[2] not in range(tmp[0],tmp[1]+1)):
print(tmp[2])
else:
print(tmp[1]+(tmp[2]-(tmp[1]%tmp[2]))) | 7 | PYTHON3 |
import math
mod=1000000007
#c=[[0 for x in range(1001)] for y in range(1001)]
t=int(input())
for _ in range(t):
l,r,d=[int(i) for i in input().split()]
if l>d:
q=l//d
re=l%d
x=l-re-(q-1)*d
else:
re=r%d
x=r+d-re
print(x)
| 7 | PYTHON3 |
for i in range(int(input())):
x,y,z=map(int,input().split())
if(x>z):
print(z)
else:
a=y//z
print(z*(a+1))
| 7 | PYTHON3 |
t=int(input())
while(t):
t-=1;
l,r,d=map(int,input().split());
if(l>d):
print(d);
else:
a= ((r+(d-1))//d)*d ;
if(a==r):
print(a+d);
else:
print(a); | 7 | PYTHON3 |
tt=int(input())
while tt:
l,r,d=map(int,input().split())
if(d<l):
print(d)
elif(d>r):
print(d)
else:
print(int((r//d+1)*d))
tt-=1
| 7 | PYTHON3 |
for __ in range(int(input())):
l, r, d = map(int, input().split())
if(d < l):
print(d)
else:
print((r // d + 1) * d) | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
x = d
if x<l:
print(x)
if x>r:
print(x)
if x >= l and x <= r:
k = r//x
x = x * (k+1)
print(x)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d == 1 and l == 1:
print(r + 1)
elif l == 1 and d < 1000:
slag = 1
while (r + slag) % d != 0:
slag += 1
print(r + slag)
elif d <= 100 and d >= l:
slag = 1
while (r + slag) % d != 0:
slag += 1
print(slag + r)
else:
base = 1
while l <= d * base <= r:
base += 1
print(base*d)
| 7 | PYTHON3 |
def min_ints(l,r,d):
if d < l:
print(d)
return
else:
print((r//d+1)*d)
return
n = int(input())
for _ in range(n):
l,r,d = list(map(int,input().split()))
min_ints(l,r,d)
| 7 | PYTHON3 |
q = int(input())
for I in range(q):
l, r, d = map(int,input().split())
l1,r1 = min(l,r),max(l,r)
if d < l1: print(d)
else: print((r1//d+1)*d) | 7 | PYTHON3 |
import math
q = int(input())
for _ in range(q):
l,r,d = map(int,input().split())
if(d>=l):
x = math.ceil(r/d)*d
if(x == r):
x+=d
else:
x = d
#print("fe")
print(x) | 7 | PYTHON3 |
def main():
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print(r - r % d + d)
main() | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
import sys
import math
import bisect
def solve(l, r, d):
if l > d:
return d
val = r + 1
ans = (val + d - 1) // d * d
return ans
def main():
for _ in range(int(input())):
l, r, d = map(int, input().split())
print(solve(l, r, d))
if __name__ == "__main__":
main()
| 7 | PYTHON3 |
R = lambda: map(int, input().split())
q = int(input())
while q > 0:
q = q-1
#R = lambda: map(int, input().split())
l,r,d = R()
if d < l:
print(d)
elif d > r:
print(d)
else:
print(d*((r//d)+1)) | 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=list(map(int,input().split()))
if l<=d:
rm=r+(d-r%d)
print(rm)
else:
print(d)
| 7 | PYTHON3 |
"""
____ _ _____
/ ___|___ __| | ___| ___|__ _ __ ___ ___ ___
| | / _ \ / _` |/ _ \ |_ / _ \| '__/ __/ _ \/ __|
| |__| (_) | (_| | __/ _| (_) | | | (_| __/\__ \
\____\___/ \__,_|\___|_| \___/|_| \___\___||___/
"""
"""
░░██▄░░░░░░░░░░░▄██
░▄▀░█▄░░░░░░░░▄█░░█░
░█░▄░█▄░░░░░░▄█░▄░█░
░█░██████████████▄█░
░█████▀▀████▀▀█████░
▄█▀█▀░░░████░░░▀▀███
██░░▀████▀▀████▀░░██
██░░░░█▀░░░░▀█░░░░██
███▄░░░░░░░░░░░░▄███
░▀███▄░░████░░▄███▀░
░░░▀██▄░▀██▀░▄██▀░░░
░░░░░░▀██████▀░░░░░░
░░░░░░░░░░░░░░░░░░░░
"""
import sys
import math
import collections
import operator as op
from collections import deque
from math import gcd, inf, sqrt
from bisect import bisect_right, bisect_left
#sys.stdin = open('input.txt', 'r')
#sys.stdout = open('output.txt', 'w')
from functools import reduce
from sys import stdin, stdout, setrecursionlimit
setrecursionlimit(2**20)
def factorial(n):
if n == 0:
return 1
return n * factorial(n - 1)
def ncr(n, r):
r = min(r, n - r)
numer = reduce(op.mul, range(n, n - r, -1), 1)
denom = reduce(op.mul, range(1, r + 1), 1)
return numer // denom # or / in Python 2
def prime_factors(n):
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 len(set(factors))
def isPowerOfTwo(x):
return (x and (not(x & (x - 1))))
def factors(n):
return list(set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))
MOD = 10**9 + 7
T = 1
T = int(stdin.readline())
for _ in range(T):
#n, k = list(map(int, stdin.readline().split()))
# s1 = list(stdin.readline().strip('\n'))
#s = str(stdin.readline().strip('\n'))
#n = int(stdin.readline())
l, r, d = list(map(int, stdin.readline().split()))
#a = list(map(int, stdin.readline().split()))
if d < l:
print(d)
continue
rx = (r // d + 1)
if l % d == 0:
lx = (l // d) - 1
else:
lx = (l // d)
if lx != 0:
print(lx * d)
else:
print(rx * d)
| 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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;
sign = false;
break;
}
temp = temp * d;
}
if (sign) {
cout << ((r / d) + 1) * d << endl;
}
}
return 0;
}
| 7 | CPP |
#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;
}
}
}
| 7 | CPP |
q = int(input())
queries_list = []
for i in range(1,q+1):
queries_list.append(input().split())
for query in queries_list:
x = int(query[2])
d = int(query[2])
r = int(query[1])
l = int(query[0])
if d < l or d > r:
print(d)
else:
print(int(int(r/d+1)*d)) | 7 | PYTHON3 |
n=int(input())
for i in range (n):
z=0
p=0
ls=[int(i) for i in input().split()]
x=min(ls[0],ls[1])
y=max(ls[0],ls[1])
if ls[2]< x:
print (ls[2])
else :
q=y//ls[2]
print (ls[2]*(q+1))
| 7 | PYTHON3 |
rows = int(input())
for i in range(rows):
nums = (input().split())
l = int(nums[0])
r = int(nums[1])
d = int(nums[2])
if (d < l):
print(d)
continue
else:
x = d
if x <= r:
x = r + d - (r % d)
print(x)
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
c=r//d
print(int(d*(c+1))) | 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l,r,d = map(int,input().split())
if d < l:
print (d)
else:
print (d*(r//d)+d)
| 7 | PYTHON3 |
t= int(input())
for x in range(t):
a=[int(x) for x in input().split()]
s=a[2]
if s<a[0]:
print(s)
elif s>a[1]:
print(s)
else:
print(s*((int(a[1]/s))+1)) | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d = map(int, input().split())
#print(l,r,d)
if d<l or d>r:
print(d)
else:
a= (r - (r%d)) +d
print(a) | 7 | PYTHON3 |
#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;
}
return 0;
}
| 7 | CPP |
n = int(input())
for _ in range(n):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print(d - r % d + r)
| 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if l>d:
print(d)
else:
print("%d"%(r+(d-(r%d)))) | 7 | PYTHON3 |
#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) {
cout << (maxi + 1) * d << '\n';
} else {
cout << d << '\n';
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> t;
while (t--) {
solve();
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
t=int(input())
for i in range(t):
l,r,d=map(int,input().split())
if(d<l):
print(d)
else:
m=r//d
print(d*(m+1)) | 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
q = int(input())
for i in range(q):
x, y, z = map(int,input().split())
if z > x and z > y:
print(z)
if (z > x and z < y) or (z == x) or (z == y):
f = y//z
m = (f+1)*z
print(m)
if z < x and z < y:
print(z)
| 7 | PYTHON3 |
"""
Author: Ove Bepari
_nnnn_
dGGGGMMb ,''''''''''''''''''''''.
@p~qp~~qMb | Promoting GNU/Linux |
M|@||@) M| _;......................'
@,----.JM| -'
JS^\__/ qKL
dZP qKRb
dZP qKKb
fZP SMMb
HZM MMMM
FqM MMMM
__| ". |\dS"qML
| `. | `' \Zq
_) \.___.,| .'
\____ )MMMMMM| .'
`-' `--' hjm
"""
for _ in range(int(input())):
l, r, d = map(int, input().split())
print(d if d<l else ((r//d)+1)*d)
| 7 | PYTHON3 |
t=int(input())
for i in range(t):
a,b,c=map(int,input().split())
if c<a or c>b:
print(c)
else:
d=int(b/c)
print(c*(d+1)) | 7 | PYTHON3 |
t=int(input())
while(t>0):
t-=1
l,r,d=map(int,input().split())
if(l%d==0):
if(l//d==1):
print((r//d+1)*d)
else:
print(d)
else:
if(l>d):
print(d)
else:
print((r//d+1)*d)
| 7 | PYTHON3 |
a=int(input())
for i in range(0,a):
flag=0
b=list(map(int,input().split()))
if(b[0]//b[2]>=1):
if(b[0]%b[2]==0 and b[0]//b[2]==1):
flag=0
else:
m=b[2]
flag=1
if(flag==0):
if(b[1]%b[2]==0):
m=b[1]+b[2]
else:
m=b[1]+b[2]-b[1]%b[2]
print(m)
| 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.