logicchains
logicchains
/ primesums.c
Created
March 19, 2014 10:56
Prints the sum of primes less than or equal to input numbers.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| #define INITIAL_ARRAY_CAPACITY 100 | |
| int isPrime(int value){ | |
| int i; | |
| if (value > 2 && value != 4){ | |
| for (i = 2; i < value/2; i++) { |
logicchains
/ MagicForest.d
Last active
August 29, 2015 14:02
D language implementation of magic forest problem from http://unriskinsight.blogspot.com.au/2014/06/fast-functional-goats-lions-and-wolves.html
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import std.algorithm; | |
| import std.conv; | |
| import std.stdio; | |
| import std.array; | |
| import std.range; | |
| import std.format; | |
| //Compile with ldc2 -O5 -release -disable-boundscheck MagicForest.d | |
| struct forest_t{ |
OlderNewer