Company: Flipkart_13july
Difficulty: medium
Number of Ways to Form Sum Problem Description Golu is a rich potato farmer. During harvesting season, the workers at his farm packed his potatoes into sacks of different weights. When Golu reached the market to sell his produce, he realized that the Market Association had standardised the buy-sell transactions. Now buyers in the market could buy potatoes only in one standardised weight, and they could carry a specified number of bags only. Given the standardised weight and number of bags, help Golu to determine how many different ways he can bunch his sacks together to make a sale. Read the input from STDIN and print the output to STDOUT. Do not write arbitrary strings anywhere in the program, as these contribute to the standard output and testcases will fail. Input Format: First line has an integer, W, which is the standardised weight which a buyer can buy. Second line has two integers, N and X, where N is the number of bags a buyer can carry, and X is the number of sacks Golu has. T