#include <iostream>

int main() {

char a_char = 'A';

//See comments to...
//http://programmingpraxis.com/2015/10/30/reverse-string-ignoring-special-characters/#comments
//Requires C++14.
#include <iostream>
#include <string>

//http://bulldozer00.com/2015/08/20/easier-to-use-and-more-expressive/
//A third C++03 solution

//This is not intended as a criticism of the article.
//It is just an example of an additional solution.

#include <stdbool.h>
#include <stdio.h>

//Is the C bool just an int?
//It would appear not.

#include <vector>
#include <iostream>
#include <numeric>

//Always make sure the third parameter to std::accumulate is the right type.

#include <string>
#include <cctype>
#include <algorithm>
#include <functional>
#include <iostream>

#include <string>
#include <cctype>
#include <algorithm>
#include <functional>
#include <iostream>

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

typedef struct Snode_tag
{

;http://stackoverflow.com/questions/21327273/scheme-function-to-call-a-procedure-n-times
(require (lib "1.ss" "srfi"))

(define (call-n-times proc n)
      (unfold (lambda (seed) (= n (length seed)))

;#lang r5rs
;        11111111112222222222333333333344444444445555555555666666666677777777778
;2345678901234567890123456789012345678901234567890123456789012345678901234567890

; ABOUT

;#lang r5rs
;        11111111112222222222333333333344444444445555555555666666666677777777778
;2345678901234567890123456789012345678901234567890123456789012345678901234567890

; ABOUT

; As of 17 August 2013,
; codepad.org says that it uses MzScheme v372,
; and SRFI-71 works.
(require (lib "71.ss" "srfi"))

; Functions from standard prelude

(define (string-split sep str)
  (define (f cs xs) (cons (list->string (reverse cs)) xs))
  (let loop ((ss (string->list str)) (cs '()) (xs '()))

; Functions from standard prelude

(define (string-split sep str)
  (define (f cs xs) (cons (list->string (reverse cs)) xs))
  (let loop ((ss (string->list str)) (cs '()) (xs '()))

(define input (string->list "rwbrwbrwb"))

(define (dnf1 cs)
  (define (char->num c)
    (case c

; http://programmingpraxis.com/2013/06/28/a-programming-puzzle/
; Write a function f such that f(f(n)) = -n for all integers n

; Solution one "encodes" the integer into a list.
; This was the only one I came up with before looking at other solutions.

; http://programmingpraxis.com/2013/05/10/mindcipher/

(define (praxis-10-may-2013 y)
 (let ((top (quotient y 100))
       (bottom (modulo y 100))

;;; http://programmingpraxis.com/2013/01/02/four-points-determine-a-square/

(define candidates
        '(((0 0) (0 1) (1 1) (1 0)) ; the unit square
          ((0 0) (2 1) (3 -1) (1 -2)) ; square not aligned to axis

(define (round f n)
 (let ((x (expt 10 n)))
  (/ (truncate (+ (* f x) 0.5)) x)))

(map (lambda (n)

#include <stdlib.h>

float raise(float n, int times)
{
    float result = n;