/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 vote200 views1 answer
Rainmaker simple project
C
11 votes233 views5 answers
Malloc
C
0 vote198 views1 answer
Algorithm for dequeue
C
1 vote199 views2 answers
Strcpy in c
C
0 vote208 views2 answers
Es6 import all
C
0 vote365 views1 answer
ESP32 timerBegin(0, cpuClock, true);
C
0 vote201 views1 answer
Tetris rotate shape
C
1 vote205 views6 answers
Online linux terminal for c programming
C
0 vote205 views1 answer
It is possible to convert c program code to algorithm tool
C
0 vote209 views3 answers
Slick options
C