Решение задачи While 26

#include <stdio.h>
int main(void)
{
   int n;
   printf("N:");
   scanf("%i",&n);
   int f1=1,f2=1,f=0;
 
   while (f<n+1){
       f=f2+f1;
       f2=f1;
       f1=f;
   }
   printf("%i\n",f);
   return 0;
}

import random

fib = []

def Fib1(N):
    if N < len(fib):
        #print("Fast")
        return fib[N-1]
    if N == 1 or N == 2:
        if N > len(fib):
            fib.append(1)
        return 1
    #print("Slow")
    y = Fib1(N-2) + Fib1(N-1)
    if N > len(fib):
        fib.append(y)
    return y

K = random.randint(1,40)
#N = 4181
print("K = ",K)
N = Fib1(K)
print("Fibonacci Number (N): ", N)

F1 = F2 = 1
print(1,":",F1)
print(2,":",F2)
i = 2
while F1 < N:
    F0, F1, F2 = F1, F2, F1+F2
    i += 1
    print(i,":",F1)
print()
print("{0} + {1} = {2}".format(F0,N,F2))
									

program While26;
var
  N,F,F1,F2 :Integer;
begin
  Write('Введите число N: ');
  Readln(N);
  F1:=1;
  F2:=1;
  F:=0;
  while F < N do
   begin
    F:=F2+F1;
    F2:=F1;
    F1:=F;
   end;
  Writeln(F2,' ',F1+F2);
end.