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.

maximum product

int product(int s,int k)
{
     int temp=0;
     int i,max;
     if(k==1)
     return s;
     else
     {
         for(i=1;i<s;i++)
         {
            max=i*product(s-i,k-1);
            if(max>temp)
            temp=max;
         }
     return temp;
     }
}

good