Unsigned long

I just wrote a program which calculate fibonacci numbers. My problem is that i cant get passed the unsigned long long limit (18,446,744,073,709,551,615). So my question is IS there ANY possible way to overcome this limit???

Code:

---

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




int long long fibonacci(int i, bool t_f);


int main(){
    int numeric_input = 0;
    bool save_to_file = 0;
    char character_input;


    while (1){
        printf("\ndo you want to save the results to a file?");
        printf("\ny for yes an n for no:_\b");
        scanf("%c", &character_input);
        if ((character_input == 'y') || (character_input == 'Y')){
            save_to_file = 1;
            break;
        }
        else if ((character_input == 'n') || (character_input == 'N')){
            break;
        }
        else if (character_input == '\n'){
        }
        else {
            printf("\nwrong input please try again!");
        }
    }
    printf ("\nenter how many times you want to run the fibonacci: ");
    scanf ("%d", &numeric_input);
    printf("your outcome is: %llu", fibonacci(numeric_input, save_to_file));


    return 0;
}


int long long fibonacci(int value, bool save_to_file){
    unsigned long long i = 0, a = 1, b = 1;
    unsigned long long total = 0;
    FILE *file_open;


    if (save_to_file == 1){
        char file_dir[255];


        printf("\nenter the destination and the name of the file you want to save:\n");
        scanf("%s", &file_dir);
        file_open = fopen64(file_dir, "w");
    }


    for (i = 0; i < value; i++){


        if (i % 10 == 0)
            fprintf(file_open, "\n");


        if (save_to_file == 1)
            fprintf(file_open, "%llu,  ", a);


        total = a + b;
        a = b;
        b = total;
    }
    fclose(file_open);
    return total;
}

---

Yes.
Either use an external library or write functions that deal with big numbers yourself.

You may want to google for "arbitrary precision arithmetic".

Writing your own functions that deal with numbers as if they were strings is not difficult (especially seeing that for Fibonacci calculations, summing is enough).

You can take a look at The GNU MP Bignum Library

Thanks guys i will take a look and if i find any other difficulty i will ask again :)

In this instance it would probably be best to just write a function that performs arithmetic on numeric strings.
i.e. something you can call like this:

Code:

---

char buf[BUFLEN];
Add("13", "21", buf, BUFLEN);
ASSERT(strcmp(buf, "34") == 0);

---

Note that you may find it easiest to calculate the result as a reversed string and then reverse that back to the right way around afterwards.

iMalc the truth is that i am having a hard time with the GNU library so i like your way but first time i see a code like yours... :/ is there any documentations for that, tutorials, etc...

Quote:

---

Originally Posted by Angelo Uknown

i am having a hard time with the GNU library

---

In what way are you having a hard time with it?

Quote:

---

Originally Posted by Angelo Uknown

i like your way but first time i see a code like yours... :/ is there any documentations for that, tutorials, etc...

---

iMalc was suggesting that you write your own function because such numeric string addition, if that is all that you need and if it will be fast enough, is just a matter of a simple loop or two.

What they're chin wagging about is, if you have two char arrays, with the end of string char (true strings in C), then reverse each one, including the end of string char, it's pretty easy to add up any size number you want.

12345\0 becomes \054321
98765\0 becomes \056789 +
======
1111110 and add a new \0 onto the left (highest index)

Add from the 0 to index while(array[i]), and now reverse that string, and you have your sum.

Quote:

---

Originally Posted by laserlight

In what way are you having a hard time with it?

---

i am no a linux user and so i needed to download Cygwin but i cant use it nor find any good instructions

Quote:

---

Originally Posted by Adak

12345\0 becomes \054321
98765\0 becomes \056789 +
======
1111110 and add a new \0 onto the left (highest index)

Add from the 0 to index while(array[i]), and now reverse that string, and you have your sum.

---

so is this a string array or a numerical array?

Quote:

---

Originally Posted by Angelo Uknown

i am no a linux user and so i needed to download Cygwin but i cant use it nor find any good instructions

---

You do not need Cygwin. Did you read the instructions provided on the website?

Quote:

---

Originally Posted by Angelo Uknown

so is this a string array or a numerical array?

---

A numeric string.

You can use either - char's can be used as just "small ints", if you like. I used the end of string char, but you could use any char as a marker for the end of digits.

Try it, and post up if you get stuck. It's really not as difficult as it sounds, if you do it by hand (with a short number), a time or two. Note the pattern you use to do it.