// Solve x-cos(x)=0 in [0,1] using bisection method
#include <iostream>
#include <iomanip>
#include <math.h>
using namespace std;

double a=0, b=1;  // initial range
const int N=10;   // no. of iterations

double F(double x){ 
  return x-cos(x); 
}

int main(){
  cout << setprecision(12);
  for (int i=0; i<N; ++i){
    double c=(a+b)/2.;	
    if ( F(a)*F(c)<0 ) 
      b=c; // take left half of the interval
    else 
      a=c; // take right half of the interval
    cout << a << "  " << b << endl;
  }
}