removes confusing examples

examples/fibonacci/.gitignore

@@ -1,2 +0,0 @@
-outputs/
-/.leo

examples/fibonacci/Leo.toml

@@ -1,8 +0,0 @@
-[project]
-name = "fibonacci"
-version = "0.1.0"
-description = "Returns a fibonnaci sequence"
-license = "LICENSE-MIT"
-
-[remote]
-author = "aleo"

examples/fibonacci/README.md

@@ -1 +0,0 @@
-# fibonacci

examples/fibonacci/inputs/fibonacci.in

@@ -1,2 +0,0 @@
-[registers]
-r0: u32 = 0;

examples/fibonacci/src/main.leo

@@ -1,16 +0,0 @@
-function fibonacci() -> u32 {
-    let mut a = 0u32;
-    let mut b = 1u32;
-
-    for i in 0..10 {
-      a = b;
-      b = a + b;
-    }
-
-    return a
-}
-
-// The 'fibonacci' main function.
-function main() -> u32 {
-    return fibonacci()
-}

examples/square-root/.gitignore

@@ -1,2 +0,0 @@
-outputs/
-/.leo

examples/square-root/Leo.toml

@@ -1,8 +0,0 @@
-[project]
-name = "square-root"
-version = "0.1.0"
-description = "prove knowledge of the square root `a` of a number `b`"
-license = "LICENSE-MIT"
-
-[remote]
-author = "aleo"

examples/square-root/README.md

@@ -1 +0,0 @@
-# square-root

examples/square-root/inputs/square-root.in

@@ -1,7 +0,0 @@
-// The program input for square_root/src/main.leo
-[main]
-a: u32 = 337;
-b: u32 = 113569;
-
-[registers]
-r0: bool = false;

examples/square-root/src/main.leo

@@ -1,5 +0,0 @@
-// The 'square-root' main function.
-// prove knowledge of the square root `a` of a number `b`
-function main(a: u32, b: u32) -> bool {
-    return a * a == b
-}