1-Generate the list of prime number upto 200.
Use this algorithm only http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes

Note: Print each output number in seperate line and during the running program use the direction operator to store the result in a file.
Ex.
To create new file or override the result      ./a.out>your_file_name.txt 
To create new file or append the result        ./a.out>>your_file_name.txt 
(in default state, if you used "gcc file_name.c or g++ file_name.cpp")

-----------------------------------------------------------------

2-Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
		1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
		
a-Find the sum of all the odd placed terms in the sequence which do not exceed one million.
b-Find the sum of all the odd-valued terms in the sequence which do not exceed half of one million.

Note: To store the sum use long data type.

----------------------------------------------------------------------

3- Try the class program calculate the PI.

http://www.iitk.ac.in/esc101/current/Programs/calculating-pi.c