/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 vote309 views1 answer
Largest value in u64
C
0 vote198 views1 answer
Algorithm for dequeue
C
0 vote206 views1 answer
Mpi split communicator
C
8 votes249 views2 answers
How to print boolean in c
C
6 votes199 views2 answers
C substring
C
0 vote235 views1 answer
Gdebi install with yes option
C
0 vote184 views1 answer
C radians
C
0 vote222 views1 answer
Pop and push shows black screen which needs to be pressed back flutter
C
0 vote213 views2 answers
Int to void* c
C
0 vote150 views1 answer
Fina students name by using html backend database
C