/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 vote201 views1 answer
Linux_reboot_magic2
C
0 vote237 views2 answers
How to determine the level of each node in the given tree?
C
1 vote233 views1 answer
ERROR: cannot verify nvidia.box.com's certificate, issued by 'CN=GeoTrust RSA CA 2018,OU=www.
C
1 vote187 views1 answer
Incompatible pointer types passing 'string *' (aka 'char **') to parameter of type 'const char *'; dereference with * [-werror,-wincompatible-pointer-types]
C
0 vote218 views1 answer
Debian9 remove pack
C
0 vote222 views6 answers
Inorder to postorder converter online
C
0 vote241 views1 answer
C 2d array dimensions
C
0 vote168 views1 answer
What is stdin fd number
C
1 vote214 views1 answer
If statement that tests if a value is in range
C
1 vote246 views2 answers
Get chunks of a mp4 in ffmpeg
C