/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

0 vote140 views3 answers
Slick options
C
0 vote132 views1 answer
What's the difference between "call" and "invoke"?
C
1 vote140 views1 answer
C number of digits in integer
C
0 vote154 views1 answer
How to fill a triangle in c
C
0 vote177 views1 answer
Show modal with cmd
C
0 vote127 views1 answer
Pasar a binario recursivo
C
0 vote138 views1 answer
Houdini vex loop over points
C
0 vote151 views1 answer
Srand time null
C
0 vote148 views1 answer
What is wrong with this in c
C
0 vote84 views1 answer
What is stdin fd number
C