C++ :

#include<iostream>
#include<cstdlib>
#include<cmath>
using namespace std;
long long const b=10002;
long long a[b];
int main()
{
	int k,m,n;
	cin>>k;
    a[0]=0;
    a[1]=1;
    a[2]=1;
    for(int i=2;i<=b;++i)
      {
			int s=2;
			s++;
			a[i]=a[i-1]+a[i-2];
			if(a[i]>k)
			{
				m=a[i-2];
				n=a[i-1];
				break;
			}
      }
    cout<<"m="<<m<<endl;
    cout<<"n="<<n;
    //system("pause");
	return 0;
}

Pascal :

var k,i,j:longint;a:array[0..100000]of longint;
begin
  readln(k);
  a[0]:=1;a[1]:=1;i:=1;
  repeat
    i:=i+1;
    a[i]:=a[i-1]+a[i-2];
  until a[i]+a[i-1]>k;
  writeln('m=',a[i-1]);
  writeln('n=',a[i]);
end.