view fibonacci/fibonacci2.cbc @ 12:774d70d1ea62 draft

add fibonacci
author Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
date Mon, 04 Jun 2012 02:45:53 +0900
parents
children f29ec9081099
line wrap: on
line source

#include <stdio.h>
#include <stdlib.h>

__code print(__rectype *p, int num, int count, int result, int prev) {
	printf("fibonacci(%d) = %d\n",num,result);	

	goto cs_while(print, num, count, result, prev);

//	exit(0);
}

__code fibonacci(__rectype *p, int num,  int count, int result, int prev) {
	if (count == 0) {
		result += 0;
		count++;
	} else if (count == 1) {
		result += 1;
		count++;
	} else if (count > 1){
		int tmp = prev;
		prev = result;
		result = result + tmp;
		count++;
	} else {
		printf("please enter nutural number\n");
		exit(0);
	}
	if (num < count)
		goto p(fibonacci, num,  count, result, prev);
	goto fibonacci(p, num, count, result, prev);

}

__code cs_while(__rectype *p, int num, int count, int result, int prev) {
	if (num > 0) {
		num--;
		goto fibonacci(print, num, 0, 0, 0);
	}
	exit(0);
}


int main(int argc, char* argv[]) {
	if (argc < 2) {
		printf("usage: ./fibonacci number \n");
		exit(0);
	}
	int num = atoi(argv[1]);
	goto fibonacci(print, num, 0, 0, 0);
	
	return 0;
}