P16277 [GeeksforGeeks] Permutations and sum3001
普及-
题目描述

Given a number N , calculate total number of permutations of it and also the sum of all permutations including that number itself.

Example 1:
Input: N = 5
Output: 1 5
Explanation: There is only one permutation
of 5 and sum of this permutaion is 5.
Example 2:
Input: N = 12
Output: 2 33
Explanation: Permutations of 12 are 12 and 21.
Sum of these permutations are = 12 + 21 = 33.

Your Task:
You don't need to read or print anyhting. Your task is to complete the function permutation() which takes N as input parameter ans returns a list that contains total number of permutations and sum of all these permutations including the number iteself.

Expected Time Complexity: O(K!) where K = log_{10}N
Expected Space Complexity: O(1)
Constraints:
1 <= N <= 10^{5}

输入格式

见题面

输出格式

见题面

样例输入
N = 5
样例输出
1 5