Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 5761 |

@blackshadows | 5715 |

@akhayrutdinov | 5111 |

@mb1973 | 4989 |

@Quandray | 4944 |

@saiujwal13083 | 4506 |

@sanjay05 | 3762 |

@marius_valentin_dragoi | 3516 |

@sushant_a | 3459 |

@verma_ji | 3341 |

@KshamaGupta | 3318 |

Complete Leaderboard | |

Handle | Score |

@aroranayan999 | 1115 |

@bt8816103042 | 739 |

@thealchemist627 | 456 |

@dalwainazism125 | 453 |

@akashkale117 | 453 |

@shivanandp12345678910 | 453 |

@codeantik | 448 |

@SherlockHolmes3 | 447 |

@SHOAIBVIJAPURE | 430 |

@shalinibhataniya1097 | 408 |

@ShamaKhan1 | 392 |

Complete Leaderboard |

A(X) for positive integer X is the sum of factorials of its digits. For example, A(154) = 1! + 5! + 4!= 145.

Given a number N, find the minimum number X such that A(X) = N.

**Example 1:**

**Input: **N = 40321
**Output: **18
**Explanation: **A(18)=1!+ 8! =40321
Note that A(80) = A(81) is also
40321, But 18 is the smallest
number.

**Example 2:**

Input:N = 5040Output:7Explanation:A(7) = 7! = 5040.

**Your Task:**

You don't need to read or print anything. Your task is to complete the function **FactDigit()** which takes N as input parameter and returns a list of digits which represent the number X.

**Expected Time Complexity: **O(K) where K ≤ 10^{6}

**Expected Space Complexity: **O(K)

**Constraints:**

1 ≤ N ≤ 10^{9}

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Fact Digit Sum

...