/C/Uri/Beecrowd problem no - 1151 solution in C

Uri/Beecrowd problem no - 1151 solution in C

#include<stdio.h>
int main(){
    int N,i,n[100];
    scanf("%d", &N);
    
    n[0] = 0;
    n[1] = 1;
    
    for(i = 2; i < N; i++){
        n[i] = n[i-1] + n[i-2];
    }
    printf("0");
    for(i = 1; i < N; i++){
        printf(" %d", n[i]);
    }
    printf("\n");
    return 0;
}

Source: beecrowd.com.br

Similar codes

22 votes164 views2 answers
MongoDb drop
C
0 vote128 views2 answers
Greatest common divisor iterative
C
0 vote121 views1 answer
Increment pointer value in c
C
0 vote133 views2 answers
C print
C
0 vote117 views1 answer
Typescript class as function parameter
C
0 vote147 views1 answer
Best graphic video template for editing free download
C
0 vote124 views1 answer
Eliminare file in c
C
2 votes87 views1 answer
Vscode arduino [Warning] Output path is not specified. Unable to reuse previously compiled files. Upload could be slow. See README.
C
0 vote126 views1 answer
Wpdb add temporary while drop table
C
2 votes146 views2 answers
Fread in c
C