Различные алгоритмы минимизации, реализованные в С++ / all / EXZAM

# include <stdlib.h>
# include <iostream.h>
# include <math.h>
# include <stdlib.h>
# include <conio.h>

double F (double n)
	 {double Fn,Fn_1,Fn_2,k;
		Fn=Fn_1=Fn_2=1;
		k=2;

		while (k<=n)
	{
	 Fn=Fn_1+Fn_2;
	 Fn_1=Fn_2;
	 Fn_2=Fn;
	 k++;
	}

	return Fn; }

double test1,test2,test3,test4,Lk,Fn_1,Fn_2,Fn,k,n,L1,L2;

void main ()
{
 clrscr();
 Fn=Fn_1=Fn_2=1;
 cout<<"Vvedite n (celoe):"<<'\n';
 cin>>n;
 cout<<"—Ёб«® ”ЁЎ®­ зЁ="<<F(n)<<'\n';

/* k=2;
 while (k<=n)
	{
	 Fn=Fn_1+Fn_2;
	 Fn_1=Fn_2;
	 Fn_2=Fn;
	 k++;
	}
 cout<<"Chislo Fibanachi="<<Fn<<'\n';
 */
 cout<<"‚ўҐ¤ЁвҐ L1"<<'\n';
 cin>>L1;
 cout<<"‚ўҐ¤ЁвҐ Ln"<<'\n';
 cin>>Lk;
// L2=L1*F(n)/F(n+1);
// L2=F(1)/F(2)*L1;
 n=0;
 while (F(n)<=L1/Lk)
 {n=n+1;}

/* n=0;
 while (L2/L1!=F(n)/F(n+1))
	{test1=L2/L1;
	 test2=F(n);
	 test4=F(n+1);
	 test3=F(n)/F(n+1);

	 n=n+1;

	}
										 */
 cout<<"—Ёб«® Ё­вҐа жЁ©="<<n<<'\n';
 getch();
 }