//22 String premutation
//2011-06-20

#include <iostream>
using namespace std;

//21 Binary Search on sorted array
//2011-06-19

#include <iostream>
using namespace std;

//20 Compare recursive and interative factorial functions
//2011-06-19

#include <iostream>
#include <time.h>

//19 Integer to/from string
//2011-06-19

#include <iostream>
using namespace std;

//18 Reverse words
//   Use stack or not
//2011-06-19

#include <iostream>

//17 Remove chars from a string
//   Use char array instead of hash map
//2011-06-19

#include <iostream>

//16 Find the first characters in an string that appears only once
//2011-06-19

#include <iostream>
#include <map>

//14 Queue and Tree BFS With No Recursion
//   Key is the function DFS
//2011-06-18

#include <iostream>

//15 Find LowestCommon Anscestor in a Binary Search Tree
// In BST: left <= self <= right
//2011-06-18

#include <iostream>

//13 Queue and Tree BFS
//2011-06-18

#include <iostream>
using namespace std;

//12  Tree treversals
//2011-06-18

#include <iostream>
using namespace std;

//11 Create a tree
//2011-06-18

#include <iostream>
using namespace std;

//10 Determine if a list is cyclic
//2011-06-18

#include <iostream>
using namespace std;

//09 Find the m-th-to-last element of a linked list
//2011-06-18

#include <iostream>
using namespace std;

//08 Remove head of a linked list
//2011-06-18

#include <iostream>
using namespace std;

int main()
{
   printf ("Hello World!\n");
   return 1;
}

// 07 Maintain linkled list tail and head pointers
// 2011-06-18

#include <stdio.h>

//06 Linked list based stack

//2011-06-18

#include <stdio.h>

//05 Delete an element from a linked list
//only read "delete" function. The other functions are from example 04
// http://codepad.org/mSBjdVNy
//2011-06-18

//Insert new head to a linked list; print a linked list
//2011-06-18

#include <stdio.h>

//Compare two integers without using any comparative operators

#include <stdio.h>

//return 1 if n1==n2, otherwise return 0

// hello world of C
main()
{
   printf ("Hello World!\n");
   return 1;

<?php

$p = array(0.5, 0.1, 0.2, 0.2);

$e = 0;

#include <stdio.h>

main()
{
   int *p; int v=5;