Uri/Beecrowd problem no - 1151 solution in C

coffee4coder answered on January 19, 2022 Popularity 1/10 Helpfulness 1/10

answer Uri/Beecrowd problem no - 1151 solution in C

related Uri/Beecrowd problem no - 1149 solution in C

related Uri/Beecrowd problem no - 1150 solution in Java

related Uri/Beecrowd Problem no - 1184 solution in C

Uri/Beecrowd problem no - 1151 solution in C

Comment

#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;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: www.beecrowd.com.br

Tags: c solution

Link to this answer
Share Copy Link

Contributed on Jan 22 2022

coffee4coder

0 Answers Avg Quality 2/10

Closely Related Answers

Uri/Beecrowd problem no - 1149 solution in C

Comment

#include<stdio.h>
int main(){
    int A,N,sum = 0,i;
    scanf("%d%d", &A, &N);
    while(N < 0 || N == 0){
        scanf("%d", &N);
    }
    for(i = 0; i < N; i++){
        sum = sum + A + i;
    }
    printf("%d\n", sum);
    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: www.beecrowd.com.br

Tags: c solution

Link to this answer
Share Copy Link

Contributed on Jan 19 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd problem no - 1150 solution in Java

Comment

import java.util.Scanner;

public class Main{
    public static void main (String[] args) {
        Scanner obj = new Scanner(System.in);
        int X,Z,counter = 1,c = 0,i;
        X = obj.nextInt();
        Z = obj.nextInt();
        
        while(Z <= X){
            Z = obj.nextInt();
            for (i = X; i <= Z; i++){
                c += i;
                if(c > Z){
                    break;
                }else{
                    counter++;
                }
            }
        }
        System.out.println(counter);
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: Grepper

Tags: java solution

Link to this answer
Share Copy Link

Contributed on Jan 20 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd Problem no - 1184 solution in C

Comment

#include<stdio.h>
int main(){
    double M[12][12],sum = 0;
    int i,j,counter = 1;
    char O[2];
    scanf("%s", O);
    
    for(i = 0; i < 12; i++){
        for(j = 0; j < 12; j++){
            scanf("%lf", &M[i][j]);
        }
    }
    for(i = counter; i < 12; i++){
        for(j = 0; j < counter; j++){
            sum += M[i][j];
        }
        counter++;
    }
    if(O[0] == 'S'){
        printf("%.1lf\n", sum);
    }else if(O[0] == 'M'){
        printf("%.1lf\n", sum / 66.0);
    }
    return 0;
}

Popularity 1/10 Helpfulness 1/10 Language c

Source: www.beecrowd.com.br

Tags: solution c

Link to this answer
Share Copy Link

Contributed on Feb 28 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd problem no - 1151 solution in C

Contents

More Related Answers

Uri/Beecrowd problem no - 1151 solution in C

Closely Related Answers

Uri/Beecrowd problem no - 1149 solution in C

Uri/Beecrowd problem no - 1150 solution in Java

Uri/Beecrowd Problem no - 1184 solution in C

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.