TIMUS 1014. Product of Digits

题目如下：

Your task is to find the minimal positive integer number Q so that the product of digits of Q is exactly equal to N.

Input

The input contains the single integer number N (0 ≤ N ≤ 10⁹).

Output

Your program should print to the output the only number Q. If such a number does not exist print −1.

Sample

inputoutput

10

25

 

 

 

题目比较简单，求各位数相乘等于给定数的最小数。　要注意给0的情况，按题意，结果不是０也不是-1，而是10，因为这个错了WE N次。

 

 

代码：

import java.util.Scanner;public class Timus1014 {public static long getQ(long n){long nn = n;if( n==0)return 10;else if(n==1) return 1;else{long q = 0;int i = 0;for(int j=9; j>=2; j--)while( nn%j == 0){q += Math.pow(10, i)*j; nn = nn / j;i++;}if( nn == 1){return q;}else{return -1;}}}/** * @param args */public static void main(String[] args) {Scanner sc = new Scanner(System.in);long n = sc.nextLong();System.out.println(getQ(n));}}