solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
t = int(input())
for i in range(t):
a, b, c = map(int, input().split())
if c < a:
print(c)
elif c > b:
print(c)
else:
print(c + ((b - c) // c + 1) * c)
| 7 | PYTHON3 |
nb_test = int(input())
for _ in range(nb_test):
l, r, d = [int(x) for x in input().split()]
if d < l:
print(d)
else:
print((r//d + 1) * d) | 7 | PYTHON3 |
t=int(input())
while t>0:
li=input().split()
l=int(li[0])
r=int(li[1])
d=int(li[2])
if(d<l or d>r):
print(d)
else:
print(((r//d)*d)+d)
t-=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 + 1))
| 7 | PYTHON3 |
def solution(query):
l, r, d = query
if d < l:
return d
else:
i = 1
if d < r:
i = int(r/d)
while(i * d <= r):
i += 1
return i * d
n = int(input())
for i in range(n):
query = list(map(int, input().split()))
print(solution(query)) | 7 | PYTHON3 |
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) * d + d)
| 7 | PYTHON3 |
#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 o... | 7 | CPP |
#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";
}
... | 7 | CPP |
q = int(input())
for i in range(q):
l, r, d = list(map(int, input().split()))
if (d < l) or (d > r):
print(d)
else:
print((1 + r // d) * d)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l,r,d = map(int,(input().split()))
t = (r+1)%d
if d<l:
print(d)
else:
if t==0:
print(r+1)
else:
print(r+1+d-t)
| 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
print(d * (r//d + 1)) | 7 | PYTHON3 |
#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("... | 7 | CPP |
from math import ceil
for i in range(int(input())):
l,r,d=map(int,input().split())
temp=d
if temp<l:
print(temp)
else:
temp=ceil(r/d)
if temp*d==r:
print(d*(temp+1))
else:
print(temp*d)
| 7 | PYTHON3 |
for tc in range(int(input())):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
print(((r//d)+1)*d)
| 7 | PYTHON3 |
from math import ceil,floor,gcd
from collections import deque as queue
def decToBin(number,size=64):
return bin(number)[2:].zfill(size)
def lcm(a,b):
return (a*b)//gcd(a,b)
def binarySearch (arr, l, r, x):
if r >= l:
mid = l + (r - l)/2
if arr[mid] == x:
return mid
... | 7 | PYTHON3 |
def f(x):
l, r, d = map(int, x.split())
if l > d:
return d
else:
return r + (d - r%d)
q = int(input())
print('\n'.join(map(str, [f(input()) for _ in range(q)])))
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
a=input().split()
if(int(a[2])>int(a[1]) or int(a[2])<int(a[0])):
print(a[2])
else:
s=int(a[1])//int(a[2])
print((s+1)*int(a[2]))
| 7 | PYTHON3 |
t=int(input())
for z in range(t):
l,r,d=map(int,input().split())
if(d<l or d>r):
print(d)
else:
x=r%d
## print(x)
sid=r-x+d
print(sid) | 7 | PYTHON3 |
q = int(input())
listValors = []
for i in range(q):
valor = input().split(" ")
li = int(valor[0])
ri = int(valor[1])
di = int(valor[2])
if(li/di >=1 and li != di):
print(di)
else:
print((int(ri/di) + 1) * di)
| 7 | PYTHON3 |
def cin():
n = (int)(input())
return n
n = cin()
for i in range(n):
l,r,d= list(map(int,input().split()))
if(l>d): print(d)
else:
R=r+d
print(R-R%d)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
s, e, d = [int(j) for j in input().split()]
if s>d:
print(d)
elif e%d==0:
print(e + d)
else:
print((e//d+1)*d) | 7 | PYTHON3 |
#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 <... | 7 | CPP |
#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)
r... | 7 | CPP |
n=int(input())
while n>0:
a,b,d=input().split(" ")
a=int(a)
b=int(b)
d=int(d)
lst=range(a,b+1)
if d not in lst:
print(d)
else:
q=b%d
print(b+d-q)
n-=1 | 7 | PYTHON3 |
q = int(input())
for w in range(q):
l, r, d = [int(x) for x in input().split()]
res = d
if d < l or d > r:
print(d)
else:
res = (max(r // d, 1) + 1) * d
print(res) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = [int(z) for z in input().split()]
x = d
if l <= x <= r:
x = r + 1
xmd = x % d
x += ((d-xmd) if xmd else 0)
print(x)
| 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if d < l:
print(d)
else:
k = d * (r // d)
while k <= r:
k += d
print(k) | 7 | PYTHON3 |
import sys
q = int(sys.stdin.readline().strip())
for i in range (0, q):
x = list(map(int, sys.stdin.readline().strip().split()))
if x[2] < x[0] or x[0] > x[1]:
print(x[2])
else:
print((x[1] // x[2]) * x[2] + x[2])
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = [int(x) for x in input().split()]
if d < l or d > r:
print(d)
else:
print((r//d+1) * d)
| 7 | PYTHON3 |
from sys import stdin
def read_lines(sep=' ', input_type=None):
_lines = stdin.readlines()
cast = input_type is not None
lines = []
for line in _lines:
line = line[:-1].split(sep)
if cast:
line = [input_type(x) for x in line]
lines.append(line)
return lines
def... | 7 | PYTHON3 |
n = int(input())
for i in range(n):
num = input().split(' ')
l, r, d = int(num[0]), int(num[1]), int(num[2])
if l <= d:
print(r + d - r % d)
else:
print(d)
| 7 | PYTHON3 |
q=int(input())
ar=[]
for i in range(q):
lrd=input().split()
l=int(lrd[0])
r=int(lrd[1])
d=int(lrd[2])
if d<l:
valor=d
elif (r+1)%d==0:
valor=r+1
else:
valor=d*((r+1)//d+1)
ar.append(valor)
print("\n".join(map(str,ar))) | 7 | PYTHON3 |
count = int(input())
mas = []
for i in range(count):
s = input().split(' ')
l = int(s[0])
r = int(s[1])
d = int(s[2])
if d<l:
#print('#1')
mas.append(d)
else:
#print('#2')
j = r/d
if j%1 == 0:
# print('#3',j,r,d)
j = (j+1)*d
... | 7 | PYTHON3 |
# !/usr/bin/env python3
# coding: UTF-8
# Modified: <11/Jan/2019 08:18:10 PM>
# ✪ H4WK3yE乡
# Mohd. Farhan Tahir
# Indian Institute Of Information Technology (IIIT),Gwalior
# Question Link
#
#
# ///==========Libraries, Constants and Functions=============///
import sys
inf = float("inf")
mod = 1000000007
def ge... | 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if not (d<=r and d>=l):
print(d)
else:
p=(r-d)//d+1
print(d+d*p)
| 7 | PYTHON3 |
q=int(input())
ii=0
while ii<q:
ii+=1
l, r, d=map(int, input().split())
if d<l:
print(d)
else:
ans=r+1
if ans%d==0:
print(ans)
else:
ans+=d-ans%d
print(ans)
| 7 | PYTHON3 |
'''
sys.stdin.readline() instead of input() and using PyPy instead of Python speeds up this solution greatly.
stdout, takes only str as argument, also it does not end line like print do.
'''
#from sys import stdin, stdout
t = int(input())
for i in range(t):
l, r, d = map(int, input().split())
if (d < l):
... | 7 | PYTHON3 |
n = int(input())
def f(l, r, d):
if d < l:
print(d)
else:
x = r // d
print(d * (x + 1))
for i in range(n):
l, r, d = map(int, input().split())
f(l, r, d) | 7 | PYTHON3 |
#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"... | 7 | CPP |
#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";... | 7 | CPP |
#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... | 7 | CPP |
q = int(input())
for _ 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 |
import math
sa=lambda :input()
sb=lambda:int(input())
sc=lambda:input().split()
sd=lambda:list(map(int,input().split()))
se=lambda:float(input())
sf=lambda:list(input())
#10101001
def hnbhai():
l,r,d=sd()
temp=d
while(temp>=l and temp<=r):
temp+=d
if temp>=l and temp<=r:
tem... | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d = map(int, input().split())
if l//d >= 1:
if l//d != l/d:
print(d)
elif l//d == l/d and d<l:
print(d)
else:
print(d*(r//d + 1))
else:
print(d*(r//d + 1)) | 7 | PYTHON3 |
a=int(input())
k=[]
for i in range(a):
b,c,d=list(map(int,input().split()))
if d<b:
k.append(d)
else:
k.append((c//d+1)*d)
for i in range(a):
print(k[i]) | 7 | PYTHON3 |
if __name__ == '__main__':
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 |
#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
... | 7 | CPP |
n=int(input())
for i in range(n):
l=input()
l1=l.split()
n1=int(l1[0])
n2=int(l1[1])
n3=int(l1[2])
while True:
if n3<n1 or n3>n2:
break
else:
n3*=(int(n2/n3)+1)
print(n3) | 7 | PYTHON3 |
#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) {
... | 7 | CPP |
#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;
}
| 7 | CPP |
n=int(input())
for i in range(0,n):
lrd=input().split()
l=int(lrd[0])
r=int(lrd[1])
d=int(lrd[2])
if d<l:
print(d)
else:
print(r+(d-(r%d))) | 7 | PYTHON3 |
"""
instagram : essipoortahmasb2018
telegram channel : essi_python
"""
import math
i = input
n = int(i())
f = False
for j in range(n):
l,r,d = map(int,i().split())
if d not in range(l, r+1):
print(d)
else:
if r%d == 0:
print((r//d+1)*d)
else:
... | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d = map(int,input().split())
t = l//d
if t>1:
print(d)
elif t==1 and l>d:
print(d)
else:
if d>r:
print(d)
continue
t = r//d
print((t+1)*d) | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
x=y=0
if l>d:
x=d
print(x)
else:
if r%d==0:
y=r+d
#print('Hello',y)
else:
y=((r)//d)*d
#print(y)
y+=d
print(y)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
if(l > d): print(d)
else: print(d * (r//d + 1)) | 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l,r,d = map(int, input().split())
if l <=d: print((r//d+1)*d)
else: print(d) | 7 | PYTHON3 |
'''
sys.stdin.readline() instead of input() and using PyPy instead of Python speeds up this solution greatly.
stdout, takes only str as argument, also it does not end line like print do.
'''
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
l, r, d = map(int, stdin.readline().split())
... | 7 | PYTHON3 |
#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;
}
| 7 | CPP |
#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"... | 7 | CPP |
#1101A
q = int(input())
for u in range(q):
[l,r,d] = list(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):
i=0
(a,b,c)=map(int,input().split())
if a<=c<=b:
i=int(b/c)
print(c*(i+1))
else:
print(c) | 7 | PYTHON3 |
n = int(input())
def func(a, b, d):
if a>d:
return d
else:
if b%d==0:
return b+d
else:
return (b//d)*d+d
for i in range(n):
s = input().split()
print(func(int(s[0]), int(s[1]), int(s[2]))) | 7 | PYTHON3 |
n = int(input())
for q in range(n):
l,r,d = map(int,input().strip().split())
if d*1 < l:
print(d)
#print("t")
else:
r+=1
if r%d==0:
print(r)
continue
r-=r%d
#print(r)
r+=d
print(r)
| 7 | PYTHON3 |
# author: ankan2526
for t in range(int(input())):
l,r,d=map(int,input().split())
if l<=d<=r:
x=r//d
if x*d<=r:
x+=1
print(d*x)
else:
print(d)
| 7 | PYTHON3 |
q = int(input())
while(q):
q -= 1
l, r, d = [int(x) for x in input().split()]
if l > d:
print(d)
else:
print(((r // d) + 1) * d) | 7 | PYTHON3 |
def minimal(a, b, c):
if (c < a or c > b):
return c
else:
return (b // c) * c + c
if __name__ == '__main__':
q = int(input())
for _ in range(q):
l, r, d = map(int, input().split())
print(minimal(l, r, d))
| 7 | PYTHON3 |
for _ in[0]*int(input()):l,r,d=map(int,input().split());print((-(r+1)//d*-d,d)[d<l]) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if d < l or d > r:
print(d)
elif(r % d == 0):
print(r + d)
else:
print(r + d - (r % d)) | 7 | PYTHON3 |
from math import ceil
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if l > d:
print(d)
elif d > r:
print(d)
else:
if r%d == 0:
print((ceil(r/d)+1)*d)
else:
print((ceil(r/d))*d)
| 7 | PYTHON3 |
#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;
... | 7 | CPP |
queries = int(input())
minimums_x = []
for q in range(queries):
l, r, d = list(map(int, input().split()))
if d < l or d > r:
minimums_x.append(d)
continue
elif r % d != 0:
minimums_x.append(int((r / d)) * d + d)
else:
minimums_x.append(r + d)
for num in minimums_x:
... | 7 | PYTHON3 |
''' Thruth can only be found at one place - THE CODE '''
''' Copyright 2018, SATYAM KUMAR'''
from sys import stdin, stdout
import cProfile, math
from collections import Counter
from bisect import bisect_left,bisect,bisect_right
import itertools
from copy import deepcopy
from fractions import Fraction
import sys, threa... | 7 | PYTHON3 |
for i in range(int(input())):
l, r, d = map(int, input().split())
print(d if l > d else (r // d + 1) * d)
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = map(int, input().split())
if d >= l:
p = r // d + 1
print(p * d)
else:
print(d)
| 7 | PYTHON3 |
x=int(input())
for i in range(x):
a,b,c=map(int,input().split())
if a>c:
print(c*1)
else:
print((b//c+1)*c) | 7 | PYTHON3 |
import re, math, decimal, bisect
def read(): return input().strip()
def iread(): return int(input().strip())
def viread(): return [int(_) for _ in input().strip().split()]
# code goes here
for _ in range(iread()):
l, r, d = viread()
ans1 = r+1
if d != 1:
ans1 += (d - (ans1 % d)) % d
ans2 = d
print(ans1 if ans2 ... | 7 | PYTHON3 |
t=int(input())
while (t):
t=t-1
a,b,c=input().split()
a=int(a);b=int(b);c=int(c)
i=int(c);
if c<a or c>b:
print(c)
else:
if c*2>=a:
i=b-b%c;
while(1):
i=i+c
if i<a or i>b:
print(i)
break
| 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 (d < l)
cout << d << endl;
else {
long long int tmp1 = r / d;
cout << (tmp1 + 1) * d << endl;
}
}
}
| 7 | CPP |
for _ in range(int(input())):
f=0
l,r,d=map(int,input().split())
if l>d:
print(d)
else:
if d>r:
print(d)
else:
print(r+d-r%d if r%d!=0 else r+d)
| 7 | PYTHON3 |
#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... | 7 | CPP |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
if l>d:
print(d)
elif d>=l and d<=r:
x = r%d
x1 = d - x
n = r + x1
print(n)
else:
print(d) | 7 | PYTHON3 |
for q in range(int(input())):
l, r, d = map(int, input().split())
print(d if d < l else r + d - (r + d) % d) | 7 | PYTHON3 |
#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;
}
}
}
| 7 | CPP |
#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;
}
| 7 | CPP |
q = int(input())
for i in range(q):
numbers = input().split()
li = int(numbers[0])
ri = int(numbers[1])
di = int(numbers[2])
if(li != di and li / di >= 1):
print(di)
else:
k = int(ri / di)
print((k+1) * di)
| 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = list(map(int, input().split()))
if(d < l or d > r):
print(d)
else:
div = r//d
print(d*(div + 1)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
uint64_t minmul(uint64_t l, uint64_t r, uint64_t d) {
if (d < l || d > r) return d;
uint64_t mod = r % d;
return r + (d - mod);
}
int main() {
uint64_t q;
cin >> q;
uint64_t l, r, d;
for (uint64_t i = 0; i < q; i++) {
cin >> l >> r >> d;
cout << minmul... | 7 | CPP |
q = int(input())
for i in range(q):
l, r, d = map(int, input().split())
left = l//d*d
if left == l:
left -= d
right = (r+d-1)//d*d
if right == r:
right += d
if not l <= d <= r:
print(d)
elif left > 0:
print(left)
else:
print(right) | 7 | PYTHON3 |
numQuerys = int(input())
while (numQuerys != 0):
query = input().split()
num1, num2, num3 = int(query[0]), int(query[1]), int(query[2])
if num1 > num3:
print (num3)
else:
mod = num2%num3
print(num2 - mod + num3)
numQuerys -= 1
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
inline char gc() { return getchar(); }
template <class T>
int read(T &ans) {
ans = 0;
char ch = gc();
T f = 1;
while (!isdigit(ch)) {
if (ch == EOF) return -1;
if (ch == '-') f = -1;
ch = gc();
}
while (isdigit(ch)) ans = ans * 10 + ch - '0', ch = gc... | 7 | CPP |
for _ in range(int(input())):
l, r, d = map(int, input().split())
if l > d:
print(d)
else:
print(((r // d) + 1) * d) | 7 | PYTHON3 |
def func():
temp=list(map(int,input().split()))
l,r,d=temp[0],temp[1],temp[2]
temp=d
if d<l or d>r:
print(d)
return
else:
print((r//d+1)*d)
q=int(input())
for i in range(q):
func()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int d, l, r, n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> l >> r >> d;
if (l > d) {
cout << d << endl;
continue;
}
cout << (r / d + 1) * d << endl;
}
return 0;
}
| 7 | CPP |
def minimum_integer(l,r,d):
if(d > r or d < l):
return d
else:
d *= ((r//d)+1)
return d
q = int(input())
for e in range(q):
l, r, d = map(int, input().split())
print(minimum_integer(l,r,d))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
int i;
for (i = 0; i < q; i++) {
int l, r, d;
cin >> l >> r >> d;
long long int x;
if (d < l)
x = d;
else {
int a = r % d;
x = (d - a) + r;
}
cout << x << endl;
}
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
const int __ = 1e5 + 5;
int a[__];
int main() {
int q;
for (scanf("%d", &q); q; --q) {
int l, r, d;
scanf("%d%d%d", &l, &r, &d);
if (d < l || d > r) {
printf("%d\n", d);
continue;
}
printf("%d\n", (r / d + 1) * d);
}
return 0;
}
| 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
while (q--) {
int l, r, d;
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else {
int w = r % d;
cout << r + d - w << endl;
}
}
}
| 7 | CPP |
for _ in range(int(input())):
l,r,d = [int(i) for i in input().split()]
if d < l:
print(d)
else:
if r%d == 0:
print(r+d)
else:
print((r//d + 1) * d) | 7 | PYTHON3 |
entrada1 = int(input())
entrada2 = []
listaX = []
q = entrada1
for i in range(entrada1):
entrada2.append(input().split())
def calcular_x(ele, r, d):
x = 0
if d < ele:
x = d
else:
x = int(r/d)*d + d
return x
for i in range(q):
listaX.append(calcular_x(int(entrada2[i][0]), int(... | 7 | PYTHON3 |
def solution(entrada):
x = entrada[2]
jump = False
while (x % entrada[2] != 0) or (x >= entrada[0] and x <= entrada[1]):
if (x >= entrada[0] and x <= entrada[1]) and jump == False:
x += int((entrada[1] - entrada[0]) / entrada[2]) * entrada[2]
jump = True
else:
... | 7 | PYTHON3 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.