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 numWays(input1,input2):
    if(input2<input1):
        return 0
    res=1
    input1+=input2-1
    input2=input1-1
    if(input2>input1-input2):
        input2=input1-input2
    for i in range(input2):
        res*=(input1-i)
        res//=(i+1)
    return res
input1=int(input())
input2=int(input())
print(numWays(input1,input2))

# Published By PKJCODERS

 Programming Language: C++ Language 

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
int NoOfWays(int input1, int input2){
    if(input2<input1){
        return 0;
    }
    int result=1;
    input1=input1+input2-1;
    input2=input1-1;
    if(input2>input1-input2){
        input2=input1-input2;
    }
    for(int i=0;i<input2;i++){
        result*=(input1-i);
        result/=(i+1);
    }
    return result;
}
int main() {
    int input1,input2;
    cin>>input1>>input2;
    cout<<NoOfWays(input1,input2);
}

// 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...

Swap and Reverse the String

PKJ
 Coding Problem Keys   Swap and Reverse the String   Problem Statement  The program must accept a string S as the input. The program must swap the first two characters then swap the next two characters and so on. The program must print the modified string S in the reverse order as the output. Note: The last character is not swapped since it has no pair as the length is odd.  Input Format  The first line contains the value of string S.  Output Format  The first line contains the modified string value.  Boundary Condition(s)  1 <= Length of S <= 10000  Example Input/Output 1   Input  elephant   Output  nthaepel   Explanation  The 1st and 2nd characters are e and l , after swapping the characters are l and e . The 3rd and 4th characters are e and p , after swapping the characters are p and e . The 5th and 6th characters are h and a , after swapping the characters are a and h . T...
Click to Continue...

Commands

PKJ
 Coding Problem Keys   Commands   Problem Statement  Series of N commands are passed as input. If the commands is 1, the next input given is added to the queue. If the command is -1, an element is removed from the queue and printed. Fill in the missing lines of code to implement the functions add and poll so that the program runs successfully.  Boundary Condition(S)  1 <= N <= 10000  Input Format  The first line contains the value of N. The next N line contains polled integers separated by a space.  Output Format  The first line contains polled integers separated by a space.  Example Input/Output 1   Input  5 1 45 1 67 -1 1 89 -1  Output  45 67  Example Input/Output 2   Input  7 1 67 -1 1 87 1 23 1 89 -1 -1  Output  67 87 23  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include <st...
Click to Continue...

Electrostatic

PKJ
 Coding Problem Keys   Electrostatics   Problem Statement  Doug is fond of change, every now and then he tries to do new things. This time, he caught up with a rod comprising of negative (N) and positive (P) charges. He is asked to calculate the maximum net electrostatic field possible in the region due to the rod. Note: Assume, Electrostatic Field = Total Charge * 100.  Input Specification  Input1:  integer array denoting the magnitude of each charge Input2: String denoting the nature of each charge, i-th entry represents a sign of charge at the i-th loccation in input1. Input3: No. of charges it holds (Length of input1).  Output Specification  Return the maximum electrostatic field possible in the rod.  Example Input/Output 1   Input  Input1: {4,3,5} Input2: PNP Input3: 3   Output  Output:  600   Explanation  The maximum electric charge on the rod is 4 - 3 + 5 = 6 units, so the mag...
Click to Continue...

Occurrences of Sub in Parent

PKJ
 Coding Problem Keys   Occurrences of Sub in Parent   Problem Statement  You are given two strings containing only English letters. Write an algorithm to count the number of occurrences of the second string in the first string. (You may disregard the case of the letters).  Input  The first line of the input consists of a string parent, representing the first string. The second line consists of a string sub, representing the second string.  Output  Print an integer representing the number of occurrences of Sub in Parent. If no occurrence of Sub is found in Parent then print 0.  Example 1   Input  TimisplayinginthehouseofTimwiththetoysofTim Tim  Output  3  Explanation  Tim occurs 3 times in the first string, So, the output is 3.  Example 2   Input  abcdefg bcd  Output  1  Explanation  Tim occurs 1 times in the first string, So, the output is 1.  Solution...
Click to Continue...

Matrix Print Excluding Border Elements

PKJ
 Coding Problem Keys   Matrix Print Excluding Border Elements    Problem Statement  A matrix of size N*N is passed as input. The program must print the matrix excluding the elements present at the border of the matrix.  Boundary Condition(s)  3 <= N <= 100  Input Format  The first line contains the value of N . The next N lines contain N elements each separated by space(s).  Output Format  The first N-2 line contains the matrix without the border elements.  Example Input/Output 1   Input  3 1 2 3 4 5 6 7 8 9  Output  5  Example Input/Output 2   Input  5 33 56 23 88 29 384 388 392 58 30 93 63 272 223 75 95 338 44 87 90 94 22 21 67 43  Output  388 392 58 63 272 223 338 44 87  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: C Language  #include <stdio.h> #include <stdlib.h> int main () ...
Click to Continue...