6167656e74323431

# word-search-simulation.rb: A program to simulate the likelihood of a word
# search board containing a valid word, thus defeating the point of the
# impossible word search created in
#      https://github.com/floundernews/floundernews.github.io/pull/61
#
# Usage: ruby word-search-simulation.rb COUNT
# 
# COUNT represents the number of blocks to be run. Each block consists of 1000 
# trials. If COUNT is 0, the results are only tallied, no new trials are run. 
# If COUNT is less than 0, the current set of results are thrown out (deleted).

6167656e74323431

[
  {
    "quote": "A leader leads by example not by force.",
    "tooltip": "Sun Tzu said that!"
  },
  {
    "quote": "All warfare is based on deception.",
    "tooltip": "Sun Tzu said that!"
  },
  {

6167656e74323431

################################################################################
#                          The BrainFuck to C Compiler                         #
################################################################################
# The BrainFuck to C Compiler (BFCC) is a ruby program that compiles Brainfuck
# code into C code. BFCC takes Brainfuck code via the STDIN stream, and outputs
# C code to the STDOUT stream.
# 
# If any errors occur, a debugging message will be printed to the STDERR stream
# and the program will exit immediately with a failure exit code. No output
# will be printed to STDOUT upon failure.

6167656e74323431

#include <stdio.h>
#include <stdlib.h>

int loopCheck(FILE *file)
{
	int close_counter = 0;
	int open_counter = 0;
	char current_char;

	while ((current_char = fgetc(file)) != EOF)

6167656e74323431

ICS3U In-Class Contest Template

6167656e74323431

Keybase proof

I hereby claim:

• I am 6167656e74323431 on github.
• I am 6167656e74323431 (https://keybase.io/6167656e74323431) on keybase.
• I have a public key ASDqJgyq2s8ONkOvuNQNkzOxIIjrZQHPAHDxVmLhf0lpYgo

To claim this, I am signing this object:

6167656e74323431

#include <stdio.h>
#include <stdlib.h>

typedef struct ListNode // list node structure
{
	int value;
	struct ListNode * next;
} node_t;

node_t * newList(unsigned int size, int node_values[]) // craete a new linked list