2023-07-01 11:58:00 -04:00
|
|
|
import extensions;
|
|
|
|
|
|
|
|
|
|
fibu(n)
|
|
|
|
|
{
|
|
|
|
|
int[] ac := new int[]{ 0,1 };
|
|
|
|
|
if (n < 2)
|
|
|
|
|
{
|
|
|
|
|
^ ac[n]
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
2024-03-06 22:25:12 -08:00
|
|
|
for(int i := 2; i <= n; i+=1)
|
2023-07-01 11:58:00 -04:00
|
|
|
{
|
|
|
|
|
int t := ac[1];
|
|
|
|
|
ac[1] := ac[0] + ac[1];
|
|
|
|
|
ac[0] := t
|
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
^ ac[1]
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
2026-02-01 16:33:20 -08:00
|
|
|
public Program()
|
2023-07-01 11:58:00 -04:00
|
|
|
{
|
2024-03-06 22:25:12 -08:00
|
|
|
for(int i := 0; i <= 10; i+=1)
|
2023-07-01 11:58:00 -04:00
|
|
|
{
|
2025-08-11 18:05:26 -07:00
|
|
|
Console.printLine(fibu(i))
|
2023-07-01 11:58:00 -04:00
|
|
|
}
|
|
|
|
|
}
|