sachinthange1
sreedharmb
/ maximum product
Created
September 16, 2012 06:06
You are given an integer s and an integer k. Find k positive integers a1, a2, ..., ak such that their sum is equal to s and their product is the maximal possible.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| int product(int s,int k) | |
| { | |
| int temp=0; | |
| int i,max; | |
| if(k==1) | |
| return s; | |
| else | |
| { | |
| for(i=1;i<s;i++) | |
| { |