uva 993 - Product of digits

最新推荐文章于 2018-07-08 21:50:16 发布

滑头鬼之亨

最新推荐文章于 2018-07-08 21:50:16 发布

阅读量1.1k

点赞数

分类专栏：贪心文章标签： integer input each output

本文链接：https://blog.csdn.net/Frankiller/article/details/7939626

版权

贪心专栏收录该内容

15 篇文章 0 订阅

订阅专栏

Product of digits

For a given non-negative integer number N , find the minimal natural Q such that the product of all digits of Q is equal N .

The first line of input contains one positive integer number, which is the number of data sets. Each subsequent line contains one data set which consists of one non-negative integer number N (0 $\le$ N $\le$ 10⁹) .

Output

For each data set, write one line containing the corresponding natural number Q or `-1' if Q does not exist.

Sample Input

Sample Output

1 
25 
-1

#include <stdio.h>
#include <math.h>
int main()
{ 
 int i,n,sum,m,t,a[10000];
 scanf("%d",&t);
 while (t--)
 {
  scanf("%d",&n);
  if (n==1) printf("1");
  else
  {
  sum=0; m=9;
  while (m>1)
  {
   if (n%m==0) {a[++sum]=m; n=n/m;}
	       else --m;
  }
  if (n!=1) printf("-1");
  else  for (i=sum;i>=1;i--) printf("%d",a[i]); 
  }
  printf("\n");
 }
 return 0;
}

简单按位贪心