Search:

Type: Posts; User: theFOX

Search: Search took 0.01 seconds.

  1. Thread: Fibbonacci Code

    by theFOX
    Replies
    18
    Views
    3,469

    hehe, i always forget to do that !!! :D

    hehe, i always forget to do that !!! :D
  2. Thread: Fibbonacci Code

    by theFOX
    Replies
    18
    Views
    3,469

    Strange, i tried it before, and it gives me the...

    Strange, i tried it before, and it gives me the same error every time ( invalid conversion from void* to long long int* ).

    Actually, i didn't see it without casting before, n e one tried it ??
    ...
  3. Thread: Fibbonacci Code

    by theFOX
    Replies
    18
    Views
    3,469

    uhm, sorry :D long long int fibo( int n...

    uhm, sorry :D



    long long int fibo( int n )
    {
    long long int* mem;
    mem = (long long int*) calloc( 0, sizeof(long long int) * (n +1) );

    long long int ret;
  4. Thread: Fibbonacci Code

    by theFOX
    Replies
    18
    Views
    3,469

    A deadly more efficient fibo function using...

    A deadly more efficient fibo function using dynamic programming. it may help you later.




    long long int fibo( int n )
    {
    long long int* mem = new long long int[n +1];
    long long int ret;
  5. Replies
    4
    Views
    15,197

    Here is the solution using a some kind of visited...

    Here is the solution using a some kind of visited flag so that you donnot enter those cells that makes you unable to move again. If it is not clear, i will make an array of flags, each cell will...
  6. Replies
    9
    Views
    3,404

    Hello SheilahT, Just make sure you have a '\n'...

    Hello SheilahT,

    Just make sure you have a '\n' at the end of that "new.txt" if you donnot have one there, the put pointer will be placed at the end of the file so that you will not be able to...
Results 1 to 6 of 6