/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 vote397 views1 answer
Allow unrelated histories
C
0 vote402 views1 answer
C langauge array
C
1 vote395 views1 answer
Sdl_renderfillrect
C
4 votes378 views2 answers
Responsive form bootstrap 4
C
0 vote390 views1 answer
How many archaeologists are there
C
0 vote431 views2 answers
Couldn't be accessed by user '_apt'. - pkgAcquire::Run
C
0 vote399 views1 answer
Multiplying a u64 to u128 in Rust
C
-1 vote476 views1 answer
Bash while loop n times
C
0 vote381 views1 answer
3.Write a program that has a class student that stores roll number, name, and marks (in three subjects) of the students. Display the information (roll number, name, and total marks) stored about the student?
C
0 vote387 views1 answer
Fine print serial key
C