Maximum Consecutive Stock Transfers

Problem Statement

The current selected programming language is C++14 . We emphasize the submission of a fully working code over partially correct but efficient code. Once submitted , you cannot review this problem again. You can use cout to debug your code. The cout may not work in case of syntax/runtime error. The version of GCC being used is C++14 (GCC 5.4) . An e-commerce company maintains a schedule of their stock transfers from the warehouse, covering N days of stock transfers. The schedule of N days is maintained in the form of a binary string of 0s and 1s, where 0 represents a day with no scheduled transfer and 1 represents a day with a scheduled transfer. Since product demand has increased in the market, the company decided to include D days of stock transfer in the scheduled N days. This is done by changing the no-transfer days on the schedule to the transfer days (i.e., changing the D number of 0s to 1s in the binary string). The company wishes to find the number of different ways in which the