3377 - Fun with Divisors 3377 - Diversión con Divisores 3377 - Fun with Divisors

Statistics Sub: 89 | AC: 8 | AC%: 8,99 | Score: 4,26
Created by Luis Enrique Garcia Marrero
Added by legar (2015-09-29)
Limits
Total Time: 1500 MS | Test Time: 1000 MS |Memory: 256 MB | Output: 64 MB | Size: 16 KB
Enabled languages
Available in

Description

Given a integer number N, you must find the smallest positive number having exactly N divisors.
Dado un número entero N, usted debe buscar el menor número positivo que tiene exactamente N divisores.
Given a integer number N, you must find the smallest positive number having exactly N divisors.

Input specification

The first input line has a positive integer number T (1 <= T <= 100) that represents the number of test cases. Each of the next T lines describes a different scenario with an integer N (2 <= N <= 64), indicating the number of divisors that solution should have.
La primera línea de entrada tiene un número entero positivo T (1 <= T <= 100) que representa la cantidad de casos de prueba. Cada una de las siguientes T líneas describe un escenario diferente mediante un entero N (2 <= N <= 64), indicando el número de divisores que debe tener la solución.
The first input line has a positive integer number T (1 <= T <= 100) that represents the number of test cases. Each of the next T lines describes a different scenario with an integer N (2 <= N <= 64), indicating the number of divisors that solution should have.

Output specification

For each case output a line with a integer number representing the smallest positive number having exactly N divisors.
Por cada caso usted debe imprimir una línea con un número entero que representa el menor número positivo que tiene exactamente N divisores.
The first input line has a positive integer number T (1 <= T <= 100) that represents the number of test cases. Each of the next T lines describes a different scenario with an integer N (2 <= N <= 64), indicating the number of divisors that solution should have.

Sample input

3
2
4
6

Sample output

2
6
12

Hint(s)

http://coj.uci.cu/24h/
http://coj.uci.cu/24h/
http://coj.uci.cu/24h/

Recommendation

We have carefully selected several similar problems: 3378 | 3675 | 2916 | 3515 | 1960 | 3091