solution stringlengths 11 983k | difficulty int64 0 21 | language stringclasses 2
values |
|---|---|---|
q = int(input())
for i in range(q):
x,l,d = input().split()
x= int(x)
l = int(l)
d = int(d)
if (d<x or d>l):
ans = d
else:
a = l%d
b = l+(d-a)
ans= b
print(ans) | 7 | PYTHON3 |
from math import ceil
n = int(input())
for i in range(n):
[l, r, d] = [int(j) for j in input().split()]
if l>d:
print(d)
else:
k = ceil(r/d)*d
print(k+d if k==r else k) | 7 | PYTHON3 |
# -*- coding: utf-8 -*-
"""
Created on Fri Apr 10 01:13:12 2020
@author: alexi
"""
#https://codeforces.com/problemset/problem/1101/A --- Alexis Galvan
def minimum_integer():
cases = int(input())
integers = []
for i in range(cases):
integers.append(list(map(int, input().split())))... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, l, r, d;
cin >> q;
for (int i = 0; i < q; i++) {
cin >> l >> r >> d;
if (l <= d && r >= d) {
cout << (((r / d) + 1) * d) << "\n";
} else {
cout << d << "\n";
}
}
return 0;
}
| 7 | CPP |
def element(queries):
l = int(queries[0])
r = int(queries[1])
d = int(queries[2])
if d < l or d > r:
return d
else:
return (r//d + 1)*d
size = int(input())
for i in range(size):
queries = input().split()
elem = str(element(queries))
print(elem)
... | 7 | PYTHON3 |
q = int(input())
for _ in range(q):
l, r, d = [int(x) for x in input().strip().split()]
if d < l:
print(d)
else:
print( r//d * d + d)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
if l <= d <= r:
print((r//d)*d + d)
else:
print(d) | 7 | PYTHON3 |
t = int(input())
for case in range(t):
l, r, d = [int(x) for x in input().split(' ')]
if d < l:
ans = d
else:
ans = d * (r // d + 1)
print(ans) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int curr = r;
if (l > d)
curr = d;
else if (r >= d) {
int k = (curr + d - 1) / d;
curr =... | 7 | CPP |
q = int(input())
for i in range(q):
l,r,d = str(input()).split(' ')
l = int(l)
r = int(r)
d = int(d)
if (d > r or d < l):
print(d)
else:
x = (int(r/d)+1)*d
print(x)
| 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
if(l/d>1):
print(d)
else:
print((r//d+1)*d)
| 7 | PYTHON3 |
t = int(input())
for _ in range(t):
p,q,r = list(map(int,input().split()))
if r<p:
print(r)
else:
print((q//r+1)*r)
| 7 | PYTHON3 |
test_cases = int(input())
for i in range(test_cases) :
left, right, divisor = map(int, input().split(" "))
if divisor < left :
print(divisor)
else :
print(divisor * ((right // divisor) + 1))
| 7 | PYTHON3 |
q = int(input())
for asgafsdhheresfaddfg in range(q):
a, b, c = map(int, input().split())
ans1 = c
ans2 = ((b + 1) // c) * c
if (ans2 <= b):
ans2 = (((b + 1)) // c + 1) * c
if (ans1 < a):
print(ans1)
else:
print(ans2)
| 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:
n=r//d
print(d*(n+1)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int q, l, r, d, p;
cin >> q;
while (q--) {
cin >> l >> r >> d;
p = d < l ? d : (r / d + 1) * d;
cout << p << '\n';
}
}
| 7 | CPP |
from math import ceil
x = int(input())
for i in range(x):
a,b,c = map(int,input().split())
if a > c:
print(c)
else:
if ceil(b/c)>b//c:
print(c*(ceil(b/c)))
else:
print(c*((b//c)+1)) | 7 | PYTHON3 |
q = int(input())
for i in range(q):
a=list(map(int,input().split()))
if(a[2]>a[1] or a[2]<a[0]):
print(a[2])
else:
s=a[1]//a[2]
print((s+1)*a[2])
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
long long int l, r, d;
for (int i = 0; i < q; i++) {
cin >> l >> r >> d;
if (d < l)
cout << d << endl;
else if (d > r)
cout << d << endl;
else
cout << ((r / d) + 1) * d << endl;
}
}
| 7 | CPP |
n = int(input())
for i in range(n):
l,r,d=map(int,input().split());
if l>d or r<d :
print(d)
else :
print(r+d-(r%d)); | 7 | PYTHON3 |
for _ in range(int(input().strip())):
l, r, d = map(int, input().strip().split())
if d < l or d > r:
print(d)
else:
print(r - r%d + d)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100005;
const int MAXM = 1000005;
const double EPS = 1e-8;
const int INT_INF = 0x3f3f3f3f;
const long long LL_INF = 0x3f3f3f3f3f3f3f3f;
int main() {
int q;
cin >> q;
int l, r, num;
while (q--) {
cin >> l >> r >> num;
if (num < l) {
cou... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c, d;
cin >> a;
while (a--) {
cin >> b >> c >> d;
if (d < b || d > c) {
cout << d << endl;
} else
cout << ((c / d) + 1) * d << endl;
}
}
| 7 | CPP |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 11 20:47:40 2019
@author: adarsha
"""
tes=int(input())
for t in range(tes):
a = [int(x) for x in input().split()]
li=a[0]
ri=a[1]
di=a[2]
done=1
i=1
if di>ri:
xi=di
elif di<li:
xi=di
else:
... | 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
ans = (r//d+1)*d
print (ans) | 7 | PYTHON3 |
a = int(input())
for i in range(a):
b = list(int(x) for x in input().split())
l = b[0]
r = b[1]
d = b[2]
if l>d:
print(d)
elif d>r:
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-1)//d >= 1:
print(d)
else:
if r%d != 0:
print(d*((r+d-1)//d))
else:
print(d*(r//d+1))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
vector<long long int> v;
set<long long int> s1;
set<long long int> s2;
vector<long long int> v1;
vector<long long int> v2;
vector<long long int> v3;
vector<long long int> v4;
vector<long long int> v5;
vector<pair<long long int, long long int> > v6;
vector<string> v7;
list<l... | 7 | CPP |
def calculo(l,r,d):
if(d < l):
return(d)
else:
return (((r // d) + 1 )*d)
entrada = int(input())
for i in range(entrada):
valor = list(map(int,input().split()))
print(calculo(valor[0],valor[1],valor[2]))
| 7 | PYTHON3 |
q=int(input())
while(q>0):
l,r,d=[int(x) for x in input().split()]
if (d>l and d>r) or (d<l and d<r):
print(d)
else:
if r%d==0:
print(r+d)
else:
print(r//d*d+d)
q-=1 | 7 | PYTHON3 |
for _ in[0]*int(input()):l,r,d=map(int,input().split());print(d*(r//d+1,1)[d<l]) | 7 | PYTHON3 |
# 1:37
n_queries = int(input())
queries = [[int(i) for i in input().split()] for x in range(n_queries)]
def parse(query):
l, r, d = query
if d < l:
return d
return ((r // d) + 1) * d
for query in queries:
print(parse(query))
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long n, l, r, d, s;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> l >> r >> d;
s = d;
if (s >= l && s <= r) {
s += (r - r % d);
}
cout << s << endl;
}
return 0;
}
| 7 | CPP |
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 |
x=int(input())
for i in range(x):
a=input().split(" ")
b=list(map(int, a))
t=b[0]%b[2]
p=int(b[0]/b[2])
if t!=0 :
if p >= 1 :
req=b[2]
else:
req=b[1]+(b[2]-(b[1]%b[2]))
else:
if (b[0]-b[2])>0 :
req=b[2]
else:
req=b[1]+(b[2]-(b[1]%b[2]))
print(req)
| 7 | PYTHON3 |
def solve(l, r, d):
if d < l:
return d
elif (l - (l % d) > 0) and l % d != 0:
return l - (l % d)
else:
return (int(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 |
q=int(input())
for i in range(1,q+1):
l,r,d=map(int,input().split())
if((d>=l) and (d<=r)):
x=d*((r//d)+1)
elif(d>r):
x=d
elif(d<l):
x=d
print(x) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int solve(int l, int r, int d) {
if (d < l || d > r) return d;
return d * (r / d + 1);
}
int main() {
int n, l, r, d;
cin >> n;
while (n--) {
cin >> l >> r >> d;
cout << solve(l, r, d) << endl;
}
return 0;
}
| 7 | CPP |
q = int(input())
for qi in range(q):
li, ri, di = map(int, input().split())
if di < li:
print(di)
else:
print((ri // di + 1) * di)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
long long unsigned l, r, d, t;
int main(int argc, char const *argv[]) {
cin >> t;
while (t--) {
cin >> l >> r >> d;
(d >= l) ? cout << (((r / d) + 1) * d) << endl : cout << d << endl;
}
return 0;
}
| 7 | CPP |
q=int(input())
for _ in range(q):
ln=list(map(int,input().split()))
i=1
if ln[2]<ln[0]:
print(ln[2])
elif ln[2]>ln[1]:
print(ln[2])
else:
x=ln[1]-ln[2]
print(ln[1]+(ln[2]-(x%ln[2])))
'''i=ln[1]+1
#print(i)
while(1):
if i%ln[2]==0:
print(i)
break
... | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if d<l:
print(d)
else:
print(d*(int(r/d)+1)) | 7 | PYTHON3 |
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
if(d==1):
if(l<=1<=d):
print(r+1)
else:
print(1)
elif(l%d==0):
if(d<l):
print(d)
elif(l-d>0):
print(l-d)
else:
if(r%d==0):
print(r+d)
else:
print(r-r%d+d)
elif(l%d!=0):
if(d<l):
print(d)
elif(l-(l%d)>0):
p... | 7 | PYTHON3 |
#include <bits/stdc++.h>
int main() {
int a, b, c, n, i, m, x;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%d%d%d", &a, &b, &c);
if (c < a)
printf("%d\n", c);
else {
m = b + 1;
if (m % c == 0)
printf("%d\n", m);
else {
x = m / c;
printf("%d\n", (x... | 7 | CPP |
def main():
q = int(input())
for i in range(q):
s = [int(x) for x in input().split()]
l = s[0]
r = s[1]
d = s[2]
if d < l or d > r:
print(d)
else:
a = r // d
print(d * (a + 1))
main()
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
int a, b, c;
int m;
cin >> a >> b >> c;
if (c < a)
arr[i] = c;
else {
m = b / c;
arr[i] = (m + 1) * c;
}
}
for (int i = 0; i < n; i++) cout << arr[i... | 7 | CPP |
q = int(input())
for i in range(q):
l, r, x = map(int, input().split())
if (l > x or x > r):
print(x)
else:
print((r // x) * x + x) | 7 | PYTHON3 |
n=input()
n=int(n)
for i in range(0, n):
l, r, d=input().split(' ')
l, r, d=int(l), int(r), int(d)
if d<l or d>r:
print(d)
else:
k=r//d
print((k+1)*d)
| 7 | PYTHON3 |
q = int(input())
for i in range(q):
l,r,d = input().split()
l = int(l)
r = int(r)
d = int(d)
if d<l or d>r:
print(d)
else:
print((r//d + 1)*d) | 7 | PYTHON3 |
n=int(input())
for i in range(n):
l,r,d=map(int,input().split())
if r>=d and d>l:
print(d*(r//d+1))
elif r>d and l>=d:
if l==d:
print(d*(r//d+1))
else:
print(d)
elif r<d:
print(d)
elif r==l and l==d:
print(d*2) | 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split(" "))
if l-d>0:
print(d)
elif r<d:
print(d)
elif d>=l and d<=r:
m=int(r/d)+1
print(d*m) | 7 | PYTHON3 |
n = int(input())
for i in range(n):
a = list(map(int,input().split(" ")))
if a[1] >= a[2] >= a[0] or a[0] >= a[2] >= a[1]:
if a[1] > a[0]:
a[0],a[1] = a[1], a[0]
print(a[0]//a[2]*a[2]+a[2])
else:
print(a[2])
| 7 | PYTHON3 |
N = int(input())
X = list()
for i in range(N):
X.append(list(map(int, input().split())))
i = 0
while i < N:
INTEGER = X[i][2]
if INTEGER >= X[i][0] and INTEGER <= X[i][1]:
INTEGER = X[i][1] + (X[i][2] - X[i][1] % X[i][2] if X[i][1] % X[i][2] != 0 else X[i][2])
print(INTEGER)
i += 1 | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().split())
if d<l or d>r:print(d)
else:
print((r//d + 1)*d) | 7 | PYTHON3 |
n = int(input())
ans = []
for i in range(n):
ans.append(list(map(int , input().split())))
for i in ans:
ans1 = i[-1]
if ans1 >= i[0] and ans1 <= i[1]:
bagh = i[1] % ans1
print((ans1 - bagh) + i[1])
else:
print(ans1)
| 7 | PYTHON3 |
for i in range(int(input())):
a,b,c=map(int,input().split())
r= b - b%c + c
if a<=c:
print(r)
else:
print(c) | 7 | PYTHON3 |
for _ in range(int(input())):
l,r,d=map(int,input().strip().split()[:3])
if d not in range(l,r+1):
print(d)
else:
if l%d==0:
k=l-d
if k<=0:
if r%d==0:
k=r+d
else:
k=r+(d-(r%d))
else:
k=l-(l%d)
if k<=0:
if r%d==0:
k=r+d
else:
k=r+(d-(r%d))
print(k) | 7 | PYTHON3 |
q=int(input())
while(q):
l,r,d=map(int,input().split())
if(l>d or d>r):
print(d)
else:
print(r//d*d+d)
q=q-1 | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin >> t;
while (t--) {
long long int a, b, n, x;
cin >> a >> b >> n;
if (n < a || n > b)
cout << n << endl;
else {
x = b / n;
cout << n * x + n << endl;
}
}
}
| 7 | CPP |
import random
def ii():
return int(input())
def mi():
return map(int, input().split())
def li():
return list(mi())
q = ii()
while q > 0:
l,r,d = tuple(mi())
if l//d == 1:
if d*(l//d) <l:
print(d*(l//d))
q -=1
continue
elif l//d > 1:
prin... | 7 | PYTHON3 |
q=int(input())
x=[]
for i in range(q):
l,r,d=input().split()
l=int(l)
r=int(r)
d=int(d)
if r-l<0:
t=l
l=r
r=t
if r<d or d<l:
x.append(d)
else:
x.append(d*(int(r/d)+1))
for i in x:
print(i)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long int q;
cin >> q;
while (q--) {
long long int l, r, d;
cin >> l >> r >> d;
long long int i = 0;
while (1) {
if (l <= d) {
cout << d * (r / d + 1) << '\n';
... | 7 | CPP |
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)
print(i) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n;
int i;
int l[n], r[n], d[n];
for (i = 0; i < n; i++) {
cin >> l[i] >> r[i] >> d[i];
}
for (i = 0; i < n; i++) {
if (d[i] < l[i]) {
cout << d[i] << endl;
} else {
p = r[i] % d[i];
r[i] = r[i] - p;
... | 7 | CPP |
q = int(input())
for i in range(q):
l, r, x = map(int, input().split())
rr = r%x
if l > x :
print(x)
else:
rr = x-rr
print(r+rr)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
long long l, r, x;
while (q--) {
cin >> l >> r >> x;
if (l > r) swap(l, r);
if (x < l or x > r) {
cout << x << endl;
continue;
}
long long rp = r - r % x + x;
cout << rp << endl;
}
return 0;
}
| 7 | CPP |
queries = int(input())
solutions = []
for query in range(queries):
integersInput = input().split(" ")
lowerLimit = int(integersInput[0])
upperLimit = int(integersInput[1])
divisor = int(integersInput[2])
foundInteger = divisor
if foundInteger >= lowerLimit and foundInteger <= upperLimit:
... | 7 | PYTHON3 |
q=int(input())
for I in range(q):
l,r,d=[int(i) for i in input().split()]
if(d<l):
print(d)
else:
mul = ((r//d)+1)*d
print(mul)
| 7 | PYTHON3 |
Q = int(input())
for q in range(Q):
l, r, d = map(int, input().split())
if d < l or d > r:
print(d)
else:
x = r//d
print((x+1)*d)
| 7 | PYTHON3 |
n = int(input())
for i in range(n):
l, r, d = input().split()
l = int(l)
r = int(r)
d = int(d)
if d < l or d > r:
print(d)
else:
print((r // d + 1) * d)
| 7 | PYTHON3 |
n=int(input())
for i in range(n):
a,b,c=map(int,input().split())
if(a>c):
print(c)
else:
print(((b+c)//c)*c)
| 7 | PYTHON3 |
for _ in range(int(input())):
l, r, d = list(map(int, input().split()))
res = d
if l <= res <= r:
res = d * (r//d) + d
print(res)
| 7 | PYTHON3 |
for i in range(int(input())):
l,r,d=map(int,input().split())
x=l%d
y=r%d
if l>d:
print(d)
else :
print(r+(d-y)) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int l, r, d, n;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d%d%d", &l, &r, &d);
if (l <= d) d = ((int)(r / d) + 1) * d;
printf("%d\n", d);
}
return 0;
}
| 7 | CPP |
t=int(input())
while(t):
l,r,d=map(int,input().split())
if(l>d):
print(d)
else:
ans=r+d
ans1=ans//d
print(ans1*d)
t=t-1 | 7 | PYTHON3 |
amount = int(input())
for i in range(amount):
left, right, num = [int(s) for s in input().split()]
if num < left:
print(num)
else:
print(right + (num - right % num)) | 7 | PYTHON3 |
test = int(input())
while(test):
test -= 1
temp = list(map(int, input().split(" ")))
l = temp[0]
r = temp[1]
d = temp[2]
if d>r or d<l:
print(d)
else:
t = r//d + 1
print(d*t) | 7 | PYTHON3 |
q = int(input())
def find_next(a,d):
if(a//d == a/d):
return a+d
else:
x = a//d
y = (x+1)*d
return y
def check(l,r,d):
for i in range(d,l,d):
if(i%d==0):
return i
index = find_next(r,d)
return index
for i in range(q):
l,r,d = map... | 7 | PYTHON3 |
#Winners never quit, Quitters never win............................................................................
from collections import deque as de
import math
from collections import Counter as cnt
from functools import reduce
from typing import MutableMapping
from itertools import groupby as gb
from fractions imp... | 7 | PYTHON3 |
try:
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)
except:
pass | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t;
cin >> t;
while (t--) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r) {
cout << d << endl;
} else {
int c = r / d;
cout << d * (c ... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
for (int k = 0; k < q; k++) {
long long l, r, d;
cin >> l >> r >> d;
if (d < l || d > r)
cout << d << " ";
else {
long long tmp = r % d;
cout << r + d - tmp << " ";
}
}
}
| 7 | CPP |
def g(r, d):
c = (r + d) % d
return (r + d) - c
def solve(l, r, d):
if d < l:
return d
else:
return g(r, d)
def main():
n = int(input())
for i in range(n):
l, r, d = map(int, input().split())
answer = solve(l, r, d)
print(answer)
if __name__ == "__main... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
int l[500], r[500], d[500], ans[500];
for (int i = 0; i < q; i++) {
cin >> l[i] >> r[i] >> d[i];
int quo;
if (d[i] < l[i]) {
ans[i] = d[i];
} else {
quo = int(r[i] / d[i]);
ans[i] = d[i] * (quo + 1);
... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
inline long long modadd(long long n, long long m) {
long long sum = ((n + m) % 1000000007 + 1000000007) % 1000000007;
return sum;
}
inline long long modsub(long long n, long long m) {
long long diff =
((n - m + 1000000007) % 1000000007 + 1000000007) % 1000000007... | 7 | CPP |
n = int(input())
for _ 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 |
import math
def A():
q = int(input())
for i in range(q):
l , r , d = map( int , input().split() )
if(d<l):
print(d)
continue
if not r%d:
print( (r//d + 1) * d )
continue
print( math.ceil(r/d)*d )
... | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;
struct edge {
int from, to;
double value;
edge(int f, int t, double v) { from = f, to = t, value = v; }
};
int n, m;
vector<edge> s;
bool cmp(edge x, edge y) { return x.value < y.value; }
bool cmp1(int x, int y) { ret... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int visit[5005], ans[5005];
int a[5005], b[5005];
int dap[5005][5005];
int main() {
int l, r, a;
int t;
scanf("%d", &t);
while (t--) {
scanf("%d%d%d", &l, &r, &a);
int tx = l / a, ty = r / a;
for (int i = 1;; i++) {
if (i * a < l || i * a > r) {
... | 7 | CPP |
#include <bits/stdc++.h>
using namespace std;
int main() {
long long int t, a, b, c, i;
cin >> t;
while (t--) {
cin >> a >> b >> c;
if (c < a)
cout << c << endl;
else {
i = (b / c) + 1;
cout << i * c << endl;
}
}
}
| 7 | CPP |
user_i = input()
q = int(user_i)
for i in range(q):
user_i = input()
l, r, d = user_i.split(' ')
l = int(l)
r = int(r)
d = int(d)
if d < l:
print(d)
else:
print( int(r/d) * d + d)
| 7 | PYTHON3 |
j=int(input())
for i in range(j):
arr=[int(x) for x in input().split()]
if arr[2]<arr[0] or arr[2]>arr[1]:
print(arr[2])
elif arr[2]>=arr[0] and arr[2]<=arr[1]:
temp=arr[1]-arr[2]
if ((temp//arr[2])+2)*arr[2]!=arr[1]:
print(arr[2]*((temp//arr[2])+2))
else:
... | 7 | PYTHON3 |
q = int(input())
l = []
r = []
d = []
for i in range(q):
x,y,z = [int(a) for a in input().split() ]
l.append(x)
r.append(y)
d.append(z)
def FindMinPos(l,r,d,q):
resTab = []
for i in range(q):
if d[i] >= l[i] and d[i] <= r[i]:
remain = r[i] % d[i]
if remain == 0:
... | 7 | PYTHON3 |
from math import *
q=int(input())
for i in range(q):
l,r,d=map(int,input().split())
num1=(ceil(l/d)-1)*d
num2=((r//d)+1)*d
if num1>0:
print(d)
else:
print(num2)
| 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int t = 1;
cin >> t;
while (t--) {
long long int l, r, d;
cin >> l >> r >> d;
if (l > d)
cout << d;
else if (l <= d) {
cout << ((r / d) + 1) * d;
}
cout << "\n";
}
return 0;
}
| 7 | CPP |
q = int(input())
for _ in range(q):
l, r, d = map(int, input().split())
if d < l:
print(d)
continue
dt = d*((r-d)//d)
while dt > r:
dt -= d
while dt <= r:
dt += d
print(dt) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int q, i, l[500], r[500], d[500], j;
cin >> q;
for (i = 0; i < q; i++) {
cin >> l[i] >> r[i] >> d[i];
if (d[i] < l[i] || d[i] > r[i]) {
cout << d[i] << endl;
} else {
j = ((r[i] / d[i]) + 1) * d[i];
cout << j << endl;
}
... | 7 | CPP |
for i in [0]*int(input()):
l,r,d=map(int,input().split());print((d>=l)*(r//d)*d+d)
| 7 | PYTHON3 |
q = int(input())
results = []
for i in range(q):
l, r, d = map(int, input().split())
temp = d
if temp < l or temp > r:
results.append(temp)
else:
n = r // d
temp += n * d
results.append(temp)
for j, temp in enumerate(results):
print(temp) | 7 | PYTHON3 |
#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << '\n'; }
template <typename T, typename... R>
void debug_out(const T &f, const R &...r) {
cerr << f << " ";
debug_out(r...);
}
inline long long read() {
long long x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') f |= ... | 7 | CPP |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.