[BOJ 7765] Supersquare

View as PDF

Submit solution

Points: 5
Time limit: 1.0s
Memory limit: 128M

Problem types
Allowed languages
Assembly, Awk, C, C++, Java, Pascal, Perl, Python, Sed, Text

Let number A be a precise square if there exists natural number B such that B*B = A.</p>

2n-digit number without leading zeroes is called a supersquare if it is a precise square and both n-digit numbers which are formed from its n first digits and its n last digits are precise squares. The second n-digit number dndn-1…d1 formed from n last digits may have leading zeroes but must not be equal zero.

You need to write a program which constructs a 2n-digit number which is supersquare.

입력 형식

The input contains several test cases. The first line contains the number of test cases T (1 ≤ T ≤ 10). Each of the next T lines describes one test case and contains an integer number n (1 ≤ n ≤ 500).

출력 형식

The output consists of T lines, one line per each test case. Each line contains 2n-digit supersquare number. If several solutions are possible only one of them should be given. When it is impossible to construct 2n-digit supersquare, the line must contain NO SUPERSQUARE POSSIBLE phrase.

예제 입력

2
1
2

예제 출력

49
1681

Comments

There are no comments at the moment.