Chocolate Feast

 https://www.hackerrank.com/challenges/chocolate-feast/problem

int chocolateFeast(int n, int c, int m) {
            int ans=0;
        ans+=n/c;
        int x=n/c;
        while(x>=m){
            ans+=x/m;
            x=x/m+x%m;
        }
        return ans;
}

 

Comments

Post a Comment

Popular posts from this blog

Is Rectangle?

 https://www.interviewbit.com/old/problems/is-rectangle/ int Solution::solve(int A, int B, int C, int D) {      if (((A==B)&&(C==D))||((A==C)&&(B==D))||((A==D)&&(B==C))){         return 1;     }else{         return 0;     } }  
Read more

Smaller or equal elements

Given an sorted array A of size N . Find number of elements which are less than or equal to B .   int Solution::solve(vector<int> &A, int B) {     int start=0;     int ans=0;     int end=A.size()-1;          while(start<=end)     {         int mid=(end+start)/2;                 if(A[mid]<=B)        {            ans=mid+1;            start=mid+1;        }        else{            end=mid-1;        }     }     return ans; }
Read more

Subarrays with distinct integers!

  Given an array A of positive integers,call a (contiguous,not necessarily distinct) subarray of A good if the number of different integers in that subarray is exactly B . (For example: [1, 2, 3, 1, 2] has 3 different integers 1, 2 and 3) Return the number of good subarrays of A .  input A = [1, 2, 1, 3, 4] B = 3  output 7    Subarrays formed with exactly 3 different integers: [1, 2, 1, 3], [2, 1, 3], [1, 3, 4].   int Solution::solve(vector<int> &A, int B) { unordered_map<int, int> m; int res = 0, j=0, prefix = 0, cnt=0; for(auto i = 0; i < A.size(); ++i) {     if (m[A[i]]++ == 0)         ++cnt;     if (cnt > B){         --m[A[j++]];         --cnt;         prefix = 0;     }     while (m[A[j]] > 1){     ...
Read more