mirror of https://github.com/01-edu/public.git
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
49 lines
2.2 KiB
49 lines
2.2 KiB
5 years ago
|
## fib
|
||
|
|
|
||
|
|
### Instructions
|
||
|
|
|
||
|
|
It is a long established fact that a reader will be distracted by the readable content of a page when looking at its layout. The point of using Lorem Ipsum is that it has a more-or-less normal distribution of letters, as opposed to using 'Content here, content here', making it look like readable English. Many desktop publishing packages and web page editors now use Lorem Ipsum as their default model text, and a search for 'lorem ipsum' will uncover many web sites still in their infancy. Various versions have evolved over the years, sometimes by accident, sometimes on purpose (injected humour and the like).
|
||
|
|
Contrary to popular belief, Lorem Ipsum is not simply random text. It has roots in a piece of classical Latin literature from 45 BC, making it over 2000 years old. Richard McClintock, a Latin professor at Hampden-Sydney College in Virginia, looked up one of the more obscure Latin words, consectetur, from a Lorem Ipsum passage, and going through the cites of the word in classical literature, discovered the undoubtable source. Lorem Ipsum comes from sections 1.10.32 and 1.10.33 of "de Finibus Bonorum et Malorum" (The Extremes of Good and Evil) by Cicero, written in 45 BC. This book is a treatise on the theory of ethics, very popular during the Renaissance. The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
|
||
|
|
|
||
|
|
The standard chunk of Lorem Ipsum used since the 1500s is reproduced below for those interested. Sections 1.10.32 and 1.10.33 from "de Finibus Bonorum et Malorum" by Cicero are also reproduced in their exact original form, accompanied by English versions from the 1914 translation by H. Rackham.
|
||
|
|
|
||
|
|
You are given a non-negative integer n, please find nth element of fibonacci sequence.
|
||
|
|
Fib(0) = 0,
|
||
|
|
Fib(1) = 1, otherwise, nth element is the sum of the 2 previous elements of the series.
|
||
|
|
|
||
|
|
### Expected function
|
||
|
|
|
||
|
|
```go
|
||
|
|
func Fib(n int) int {
|
||
|
|
|
||
|
|
}
|
||
|
|
```
|
||
|
|
|
||
|
|
### Usage
|
||
|
|
|
||
|
|
Here is a possible program to test your function :
|
||
|
|
|
||
|
|
```go
|
||
|
|
package main
|
||
|
|
|
||
|
|
import (
|
||
|
|
"fmt"
|
||
|
|
)
|
||
|
|
|
||
|
|
func main() {
|
||
|
|
fmt.Println(Fib(0))
|
||
|
|
fmt.Println(Fib(1))
|
||
|
|
fmt.Println(Fib(2))
|
||
|
|
}
|
||
|
|
```
|
||
|
|
|
||
|
|
And its output :
|
||
|
|
|
||
|
|
```console
|
||
|
|
student@ubuntu:~/[[ROOT]]/test$ go build
|
||
|
|
student@ubuntu:~/[[ROOT]]/test$ ./test
|
||
|
|
0
|
||
|
|
1
|
||
|
|
1
|
||
|
|
student@ubuntu:~/[[ROOT]]/test$
|
||
|
|
```
|