CSUFT 1005 Coffin Tiles

1005: Coffin Tiles

Time Limit: 1 Sec		Memory Limit: 128 MB
Submit: 2		Solved: 2

Description

The Pumpkin King has a great idea for this Christmas: Personalized coffins for all the good little boys and girls! To make them extra special, Jack has ordered that the coffins have various designs based upon the interests of the children (This was of course determined by what Google searches the children do most often. The Clown with the Tear-Away face has mad hacking skills).

Most little girls, and some of the boys (Bronies) happen to be really into My Little Pony: Friendship is Magic, and so a large number of Twilight Sparkle themed coffins have been ordered (Twilight is of course, the most awesome pony on the show). These coffins are decorated by affixing alternating tiles in a rectangle up the middle of the coffin lid (They're flat). Now, all the children are different sizes and shapes. Some lids will need a rectangle 3 tiles wide, some less, and some more. In order to keep from ordering too many tiles from the.. ummm... coffin tile factory (Just go with it). The Mayor wants to know how many tiles he needs to order, based upon how many dimensionally unique rectangles can be made using tiles of a certain number.

So, the mayor has asked you to write a program that will, for each given integer, "n", output the minimal number of tiles (The tiles are square) that can be arranged into exactlynunique rectangles. For example, if the number two was given, the minimal number of tiles required to make 2 unique rectangles is 4. With 4 you can make a1x4and a2x2rectangle.

Input

Input consists of a single integer indicating the number of integers to read and a sequence of positive integers separated by whitespace.

Output

For each input integernyour program should output either a single line containing the minimal number of unit squares that can be arranged into exactlynrectangles, or "Too big" if the number of needed unit squares is bigger than 1000000.

Sample Input

5
1 4 19 48 71

Sample Output

1
24
786432
27720
Too big

HINT

 

Source

2011 ACM ICPC South Central USA Regional Programming Contest

 

题目又臭又长，我还是连蒙带猜出的结果。

打表大法真开心！！！

/*
#include <bits/stdc++.h>

using namespace std;

bool judge(int n,int m)
{
    int cnt = 0;
    int k = (int)sqrt(m*1.0);
    for(int i=1; i<=k; i++)
    {
        if(m%i==0)
            cnt++;
    }
    if(cnt==n)
        return true;
    else return false;

}

int calc(int n)
{

    for(int i=n*n; i<=1000000; i++)
    {
        if(judge(n,i))
            return i;
    }
    return -1;

}

int main()
{
    freopen("out.txt","w",stdout);
    for(int i=1;i<=1000;i++)
        printf("%d\n",calc(i));

    return 0;
}
*/

#include <bits/stdc++.h>

int a[] = {,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
,
-,
,
-,
,
,
,
,
,
-,
,
,
,
,
,
-,
,
,
-,
-,
,
,
,
-,
,
,
,
,
,
-,
-,
,
,
-,
-,
,
,
-,
,
-,
,
-,
,
-,
,
-,
-,
,
-,
-,
-,
-,
,
,
-,
-,
,
-,
-,
-,
,
-,
,
-,
-,
-,
-,
,
,
-,
-,
-,
,
-,
-,
-,
-,
,
-,
-,
,
-,
-,
-,
,
-,
-,
-,
-,
-,
-,
-,
};

int main()
{
    int t;
    scanf("%d",&t);
    while(t--) {
        int n;
        scanf("%d",&n);
        if(n>)
            puts("Too big");
        else {
            if(a[n-]==-)
                puts("Too big");
            else {
                printf("%d\n",a[n-]);
            }
        }

    }
    return ;
}

/**************************************************************
    Problem: 1005
    User: YinJianZuiShuai
    Language: C++
    Result: Accepted
    Time:0 ms
    Memory:1700 kb
****************************************************************/