We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Practice
  2. Algorithms
  3. Implementation
  4. Birthday Chocolate
  5. Discussions

Birthday Chocolate

  • codertoaster + 5 comments

    I have the same idea as you, but why are most of my test cases failing ?

    static int solve(int n, int[] s, int d, int m)
    {
        int start=0,end=m-1;
        int sum=0,num=0;
        for(int i=start ; i<=end && end<s.length ; i++)
        {
            sum+=s[i];
            if(i==end)
            {
                if(sum == d)
                {
                    num++;
                    sum=0;
                    i=start+1;
                    start++;
                    end++;
                }
                else
                {
                    sum=0;
                    i=start+1;
                    start++;
                    end++;
                }
            }
        }
        return num;
    }
    • pankajbabu + 3 comments

      i use yur code,but test case is fails.....so improve your codess.. thanks

      • pooniaarvind29 + 0 comments

        thug life

      • rearbreed + 0 comments

        lol

      • btiwari004 + 0 comments

        lol

    • aishwarya217 + 1 comment

      Hey, it's probably not working because in this code i is getting changed to start + 1 and then getting incremented again as part of the for loop. 

      if(sum == d)
                {
                    num++;
                    sum=0;
                    i=start+1;
                    start++;
                    end++;
                }
                else
                {
                    sum=0;
                    i=start+1;
                    start++;
                    end++;
                }

      Hope this helps.

      • moihawk + 0 comments

        thats what it was for me, thank you

    • rvrishav7 + 1 comment
      int main()
{ int n;
 cin>>n;
 int ar[n];
 int i,c=0;
 
 for(i=0;i<n;i++)
     cin>>ar[i];
 int d,m;
 cin>>d>>m;
 int s=0,l=1; i=0;
 
       while(m<=n)
       {l=0;s=0;
           while(l<m)
           {
               s=s+ar[l+i];
               l=l+1;
           }
           if(s==d)
           {
               c=c+1;
           } 
        i=i+1;
        n=n-1;
        
       } cout<<c;
        return 0;
}
      • Satyadev_Abhiram + 0 comments

        include

        using namespace std;

        int main() { int i,n,sum=0,date,month,num[1000],count=0,j; cin>>n; for(i=0;i>num[i]; } cin>>date>>month; for(i=0;i

    • romulo8000 + 1 comment

      A good constructive tip: extract common code like:

      if(sum == d) {
    num++;
} else {
    start++;
}

i=start+1;
sum=0;
start++;
end++;

      It's More readable

      • tp468 + 0 comments

        superb logic int birthday(vector s, int d, int m) { int p=s.size();int i,j; int sum=0; int count=0;int start=0; for(i=0;i

        } return count;

        }

    • kevinhs472 + 0 comments

      Nice logic man, i learn some new tips there.thank you for posting this.