Threaded Mode | Linear Mode

infinitynotpi · 09-16-2012 10:03 PM

This is me holding a flower...(see Venn diagram)

Wolfram Alpha

And this is me just showing my ass...

First Function of 2 Boolean Variables

And this is me just being a friend...

I've included some C for you!

Which includes the fast algorithm you're looking for in it -- Monte Carlo

133,784,560 combinations

Snippet here

Code:

/*

 * returns number of dead cards, -1 on error

 *

 * argc, argv are the standard arguments to main

 * num_dead is a return value of the number of dead cards

 * dead_cards is a return value of the dead cards

 */

static int

parse_args(int argc, char **argv, int *num_dead, CardMask *dead_cards) {

  int i, c, o, rc, len;

  if (num_dead == NULL) {

    return (-1);

  }

  if (dead_cards == NULL) {

    return (-1);

  }

  *num_dead = 0;

  CardMask_RESET(*dead_cards);

  /*

   * parse any options passed to us.

   * -d "c1 [...]" is dead cards

   */

  while((o = getopt(argc, argv, opts)) != -1) {

    switch(o) {

    case 'd':

      len = strlen(optarg);

      for(i = 0;i < len;) {

    rc = StdDeck_stringToCard(optarg+i, &c);

    if (rc) {

      StdDeck_CardMask_SET(*dead_cards, c);

      (*num_dead)++;

      i += 2;

    } else {

      i++;

    }

      }

      break;

    }

  }

  return (*num_dead);

}

[/code]

The Count of Monte Cristo

Threaded Mode \| Linear Mode I need a more efficient function
Author	Message