GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Digit Multiplier
Submit Your Solution :- Click Here
Solution :-
#include<stdio.h>
void findSmallest(int n)
{
int i, j=0,MAX=50;
int res[MAX];
if (n < 10)
{
printf("%d", n+10);
return;
}
for (i=9; i>1; i--)
{
while (n%i == 0)
{
n = n/i;
res[j] = i;
j++;
}
}
if (n > 10)
{
printf("-1");
return;
}
for (i=j-1; i>=0; i--)
printf("%d", res[i]);
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int n;
scanf("%d",&n);
findSmallest(n);
printf("\n");
}
return 0;
}
Output:-
0 Comments: