Databases
StackOverflow2013
Postsdbo
PO
 

Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <p>Some problems with your code:</p> <pre><code>int compare(const struct pair *elem1 ,const struct pair *elem2) { if ( elem2-&gt;coin &gt; elem1-&gt;coin &amp;&amp; elem2-&gt;numberofcoin&gt;0) return 1; else return -1; } </code></pre> <p>This comparison function isn't suitable for being passed to <code>qsort</code>. It doesn't return 0 for equal arguments, and <code>compare(x,y) == -1 == compare(y,x)</code> can happen. Thus <code>qsort</code> could loop with that comparison function, or produce incorrect results. However, with the data you get, that may not bite you.</p> <pre><code>for(i=0;i&lt;nc;i++) { a[i].numberofcoin=amount/a[i].coin; } </code></pre> <p>What is the idea behind that loop? I can't make sense of it. Deleting that loop helped getting the correct result for the example test case and makes more sense, since you'd be interested in the available coins of that denomination.</p> <pre><code>if(a[j].numberofcoin&gt;0&amp;&amp;a[j].coin&lt;=current) { puts("case if\n"); a[j].numberofcoin--; ans+=wa(n-a[j].coin,a,numberofdenominations,a[j].numberofcoin); a[j].numberofcoin++; } </code></pre> <p>Passing <code>a[j].numberofcoin</code> as the <code>current</code> parameter to the recursive call doesn't make sense. Why would you only consider coins whose denomination is smaller than the number of coins left of some (possibly other) denomination? As is, that is what makes the test fail in the recursive call, so the recursion never goes beyond <code>amount - one_coin</code> in the example. Passing <code>a[j].coin</code> here would make sense to prune duplicates.</p> <pre><code>printf("%d\n",wa(amount,a,nc,10)); </code></pre> <p>Why are you limiting the considered denominations to a maximum of 10 in <code>main</code>? If there are larger denominations available, you would not consider any solutions using them.</p>
    singulars
    1. This table or related slice is empty.
    1. POCoin change with different upper bounds on different coins?
      singulars
      1. PTQuestion
    1. PTAnswer
    1. This table or related slice is empty.
    1. USDaniel Fischer
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. POCoin change with different upper bounds on different coins?
      singulars
      1. PTQuestion
    1. This table or related slice is empty.
    1. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. PO
      1. This table or related slice is empty.
      1. VTAcceptedByOriginator
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload