All Tracks Math Number Theory Problem

Valentine Time <3
Tag(s):

Very-Easy

Problem
Editorial
Analytics

It's Valentine Time . Love is in Air . So, Mr. Pole is looking for bride . For becoming his bride , there is only one criteria. She should be expert in Coding . So, Mr.Pole has given a question for 1st Elimination round :

Given a range L and R , you have to tell the number between L and R such that difference between no. of divisors and prime divisors is maximum. If two number has same difference , print the smallest one .

Input : First line contains T , denoting number of Test cases Next T lines contains L and R denoting the range for the query.

Output : Print the desired result in each line.

Constraints :

1<=T<=10

1<=L<=R<=10^6

AUTHOR : trico

SAMPLE INPUT
1
2 5
SAMPLE OUTPUT
4
Time Limit: 5.0 sec(s) for each input file.
Memory Limit: 256 MB
Source Limit: 1024 KB
Marking Scheme: Marks are awarded when all the testcases pass.
Allowed Languages: C, C++, Clojure, C#, D, Erlang, F#, Go, Groovy, Haskell, Java, Java 8, JavaScript(Rhino), JavaScript(Node.js), Lisp, Lisp (SBCL), Lua, Objective-C, OCaml, Octave, Pascal, Perl, PHP, Python, Python 3, R(RScript), Racket, Ruby, Rust, Scala, Scala 2.11.8, Swift, Visual Basic

CODE EDITOR

Initializing Code Editor...
Your Rating:

Contributor

Notifications
View All Notifications