Factorials

PKJ

 Coding Problem Keys 

 Factorials 

 Problem Statement 

Given 'n' (1 <= n <= 100), find the factorial of 'n'.

The factorial of 'n' is defined as the product of all integers from 1 to 'n'.

 Input Specification 

Any number 'n' from range of 1 to 100.

 Output Format 

Return a string containing the factorial.

 Example 1 

 Input 1 

5

 Sample Output 1 

120

 Explanation 

5! = 5 x 4 x 3 x 2 x 1 = 120.
The returned number is 120.

 Example 2 

 Input 2 

7

 Sample Output 2 

5040

 Solution 

 Programming Language: Python 3 Language 

n=int(input())
fact=1
for i in range(1,n+1):
    fact*=i
print(fact)
# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Maximum Goods Transported

PKJ
 Coding Problem Keys   Maximum Goods Transported   Problem Statement  There are goods to be transported by trains through a series of N stations which are numbered from 1 to N. Each station has at most one incoming railroad and at most one outgoing railroad. There are T tracks and each track connecting two stations has a capacity limit to transport goods. The stations with no incoming railroad are the sources and the stations with no outgoing railroad are the destinations. The program must print the maximum amount of goods that can be transported.  Boundary Condition(s)  2 <= N <= 30. 1 <= T <= 60. 1 <= capacity <= 1000.  Input Format  The first line contains N and T separated by space(s). The next T lines contain starting station number, ending station number and capacity limit of the track each separated by space(s).  Output Format  The first line contains value of maximum amount of goods that can be transpo...
Click to Continue...

Mango Distribution

PKJ
 Coding Problem Keys   Mango Distribution   Problem Statement  Given a number of mangoes and number of persons. Find the number of ways to distribute the identical mangoes among identical persons.  Input Specification  input1: the number of mangoes input2: the number of persons.  Output Specification  Return the number of ways to distribute identical mangoes among identical persons.  Sample Input/Output 1   Input  input1: 2 input2: 2   Output  Output: 3   Explanation  All possible distributions of 2 identical mangoes to 2 identical persons are (1, 1), (2, 0) and (0, 2). Hence the output is 3.  Sample Input/Output 2   Input  input1: 1 input2: 12  Output  Output: 12   Output  All possible distributions of 1 identical mango to 12 identical persons are 12. Hence the output is 12.  Solution   Programming Language: Python 3 Language  def nu...
Click to Continue...

RAT CHEESE MAZE

PKJ
 Coding Problem Keys   RAT CHEESE MAZE   Problem Statement  Moozak the mouse has been placed in the top left corner of a maze. There is a huge chunk of cheese somewhere in the maze which is represented by 9. The maze is represented as a matrix of integers, where 0 denotes a wall, 1 denotes a path and 9 represents the huge chunk of cheese. Fill in the lines of code for the method isPath to determine if Moozak can reach the huge chunk of cheese. The method should return 1 if there is a path from Moozak (top left corner) to the cheese. The method isPath must return 0 if there is no path. Moozak cannot climb the walls or go out of the maze but can go left, right, up or down.  Input Format  The first line contains 8 integer values (one among 0, 1 or 9) separated by a space.   Output Format  The first line contains either 1 or 0  Example Input/Output 1   Input  1 0 1 1 1 0 0 1 1 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 1 0 1 0 9 0 1 1...
Click to Continue...

Aquarium

PKJ
 Coding Problem Keys   Aquarium   Problem Statement  An aquarium has N number of cells in it. The number o fish in each cell is represented in the form of A i of array A, where i represents the i th index of the array A. Shyam wants to sell the aquarium, but to sell it at a higher price, he will have to make it look better. The aquarium can be made better if in each cell there is a prime number of fish. Shyam can select any index of the array i.e. cell of the aquarium and can add a fish or can remove one fish from the aquarium. Adding or removing a fish takes him one second. Help out Shyam so that he can make the aquarium better in the last time, and then print that time taken.  Input Format  The first line contains N (Length of the array) The second line contains N space-separated integers.  Output Format  Print an integer denoting the minimum time required.  Constraints  1 ≤ N  ≤  10 ⁵ 1  ≤  A i   ≤ ...
Click to Continue...

checkGreatestFactor

PKJ
 Error Debugging   checkGreatestFactor   Problem Statement  You are required to fix all logical errors in the given Code. You can Compile & Run to check the compilation/execution status of the program. You can use  printf   to debug your code. The submitted code should be logically/syntactically correct and pass all testcases. Do not write the  main()  function as it is not required.  Code Approach  For this question, you will need to correct the given implementation. We do not expect you to modify the approach or incorporate any additional library methods The function  checkGreatestFactor(int num) accepts an integer num as an input and is supposed to return the highest factor that is less than num. It uses another function calculateFactor(int inputNumber) for calculating the factors of a number. The function checkGreatestFactor looks fine but gives a compilation error. Your task is to fix the program so that it passes...
Click to Continue...

Reunion

PKJ
 Coding Problem Keys   Reunion   Problem Statement  Shobita is planning for a reunion with her friends. She is very much excited and making all the preparations. She is busy selecting the restaurants and other points for fun and activities. She has selected N such points. There are R restaurants she has selected considering the amount of time they might have. Shobita wants to enjoy it to the maximum extent with her friends and for that, she needs to plan well. She knows the points (U, V) which are directly connected by a road and the travel time T units required to cover the distance between them. These are E roads between these N points.  Note:  U is not equal to V. She wants to know the minimum time she will have to spend to reach the nearest restaurant from all the N points so that she can plan accordingly and know what to do with the amount of time she and her friends will have. She is busy with all other preparations and needs your help in c...
Click to Continue...