/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

1 vote158 views1 answer
Fseek function in c
C
0 vote171 views1 answer
Arduino dont working dc motor
C
3 votes169 views3 answers
Get the latest field in mongodb collection
C
0 vote156 views1 answer
Vbnet create and write on file
C
2 votes168 views1 answer
What are the 3 basic types of Plate Boundaries? Explain their differences (how they act).
C
1 vote158 views2 answers
React-textfit
C
0 vote247 views4 answers
Error
C
0 vote174 views1 answer
CL/cl.h: No such file or directory
C
0 vote166 views1 answer
Injection
C
0 vote150 views1 answer
Djb2 algorithm for C
C