int b = fib(2);
int c = func(a,b);
+print a;
+print b;
+print c;
+
if (boolfunc(b,c)) print true;
int fac(int n){
while (n-- > 1) sum = sum * n;
return sum;
}
+
+int fib(int n){
+ if (n < 2) return 1;
+
+ return (fib(n-1)+fib(n-2));
+}
+
+int func(int a, int b){
+ return (a+b);
+}
+
+bool boolfunc(int a, int b){
+ return (a == b);
+}