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.
  • HackerRank Home

    HackerRank

  • |
  • Prepare
  • Certify
  • Compete
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #103: Special subset sums: optimum
  4. Discussions

Project Euler #103: Special subset sums: optimum

Contest ends in
Problem
Submissions
Leaderboard
Discussions

    You are viewing a single comment's thread. Return to all comments →

  • AashutoshSiddh
    8 years ago+ 0 comments

    int main() { long long int a[MAX][MAX],n,i,j,k,x,temp=0,b; cin>>n; a[0][0]=0; a[1][0]=1; for(i=2;i<=n;i++) temp=i/2; b=a[i-1][temp]; { for(j=0,k=j;j

    Why it is showing output as: 0 0 0 0 0 0

    -1|
    Permalink
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy