/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

6 votes260 views4 answers
Angle between two points
C
0 vote271 views1 answer
Esp8266 wifi.config does not work
C
0 vote245 views1 answer
Worst case algorithm
C
0 vote230 views1 answer
How to belu-roll peoples in c
C
40 votes339 views3 answers
Pip install sklearn specific version
C
0 vote277 views1 answer
C printf affichage
C
0 vote237 views1 answer
How to change the mapping from jkil to wasd in vim
C
-1 vote243 views1 answer
C find last element in array
C
0 vote248 views1 answer
Lognormal distribution - matlab
C
1 vote220 views1 answer
Como declarar uma string em c
C