C＋＋でフィボナッチ数列を計算する

#include <iostream>
#include <stdlib.h>

int main(void){
    int N=10;
    int *f;

    f = (int*)malloc(sizeof(int) * N);
    if (f == NULL) {
        return -1;
    }

    for (char i = 0; i < N; i++) {
        f[i] = 0;
    }
    f[1] = 1;
    f[2] = 1;

    for (char i = 3; i < N; i++) {
        f[i] = f[i - 2] + f[i - 1];
    }

    for (char i = 0; i < N; i++) {
        std::cout << f[i] << std::endl;
    }

    free(f);
    return 0;
}