Heirloom

 

When Mr. Macpet gets a heritage he doesn't feel so happy, because he needs a password to open it. This password is a number which can be got as followed.

For any positive integer a, an integer function f(A) can be calculated by the following procedure:

1.  Move the last digit of A to the front of the first one. This is B.

2.  C is the square of B.

3.  Move the first digit of C to the back of the last one, and get D.

D is the value of f(A).

The password is the N^th minimum positive number in the number set {X > 0 | f(X) = X²}.

Can you help Mr. Macpet to open his heritage?

 

Input     (Please use standard input, and don’t read or write files.)
A positive integer N (N < 1000).
Output   (Please use standard output, and don’t read or write files.)
Only one line contains a positive integer which is the password.
Sample Input	Sample Output
2	2

 import java.math.*; public class GPA { public BigInteger front(BigInteger x) { BigInteger y=x.mod(new BigInteger("10")); BigInteger n=x; while(n.compareTo(new BigInteger("9"))==1) { n=n.divide(new BigInteger("10")); y=y.multiply(new BigInteger("10")); } return y.add(x.divide(new BigInteger("10"))); } public BigInteger last(BigInteger x) { BigInteger n=x,y=new BigInteger("1"); while(n.compareTo(new BigInteger("9"))==1) { n=n.divide(new BigInteger("10")); y=y.multiply(new BigInteger("10")); } BigInteger m=n; return ((x.subtract(n.multiply(y))).multiply(new BigInteger("10"))).add(m); } static public void main(String args[]) { int n=999,count; BigInteger i,temp; GPA f1=new GPA(); count=0; i=new BigInteger("0"); System.out.println(n); while(count<n) { i=i.add(new BigInteger("1")); temp=f1.front(i); temp=f1.last(temp.multiply(temp)); if(temp.equals((i.multiply(i)))) { count++; System.out.println(i+","); } } } }

这个没招，用了比较老实的算法，一个一个算，但是算到第7个就不行了，所以发现规律，写了如下代码：

#include<stdio.h> int main() { int n; scanf("%d",&n); if(n>0&&n<4) { printf("%d/n",n); return 0; } while(n-->3) printf("2"); printf("1/n"); return 0; }