Thread: New Program

Well i tried it out, but im getting wayyyyyyyy to big of a answer..... with this code

Code:

#include <FPT.h>
int main()
{
  double n,a,b,c;
  n=inD();
  a=1;
  b=1;
  while(n>1){
   a= pow(n,2);
   a=a+2;
   n=n-1;
   b=pow(n,2);
   c=(b/a) +2;
   n=n-1;
  }
  if(n==1){
    a=pow(n,2);
    c=(c/a)+1;
  }



    outD(4/c);
  
  
  }