Breaking News: Grepper is joining You.com. Read the official announcement!

Uri/Beecrowd problem no - 1150 solution in Java

Add Answer

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

answer Uri/Beecrowd problem no - 1150 solution in Java

related Uri/Beecrowd problem no - 1146 solution in Java

related Uri/Beecrowd problem no - 1151 solution in C

related Uri/Beecrowd problem no 1180 solution in JAVA

related Uri/Beecrowd Problem no - 1185 Solution in Java

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

Closely Related Answers

Uri/Beecrowd problem no - 1146 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;
        while(true){
            X = obj.nextInt();
            if(X == 0){
                break;
            }else{
                System.out.print("1");
                for(int i = 2; i <= X; i++){
                    System.out.print(" " + i);
                }
                System.out.println();
            }
        }
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: www.beecrowd.com.br

Tags: java solution

Link to this answer
Share Copy Link

Contributed on Jan 19 2022

coffee4coder

0 Answers Avg Quality 2/10

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: solution c

Link to this answer
Share Copy Link

Contributed on Jan 22 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd problem no 1180 solution in JAVA

Comment

import java.util.Scanner;
public class Main{
    public static void main (String[] args) {
        Scanner obj = new Scanner(System.in);
        int N,o,i,min = 0,position = 0;
        N = obj.nextInt();
        int X[] = new int[N+1];
        for(i = 0; i < N; i++){
            o = obj.nextInt();
            X[i] = o;
            
            if(X[i] < 0){
                min = X[i];
                position = i;
            }
        }
        System.out.println("Menor valor: " + min);
        System.out.println("Posicao: " + position);
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: www.beecrowd.com.br

Tags: java solution

Link to this answer
Share Copy Link

Contributed on Feb 17 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd Problem no - 1185 Solution in Java

Comment

import java.util.Scanner;
public class Main{
    public static void main (String[] args) {
        Scanner obj = new Scanner(System.in);
        double M[][] = new double[12][12];
        double sum = 0.0;
        int i,j,counter = 1;
        String O = obj.next();
        
        for(i = 0; i < 12; i++){
            for(j = 0; j < 12; j++){
                M[i][j] = obj.nextDouble();
            }
        }
        for(i = 10; i >= 0; i--){
            for(j = 0; j < counter; j++){
                sum += M[i][j];
            }
            counter++;
        }
        if(O.equals("S")){
            System.out.printf("%.1f\n", sum);
        }else if(O.equals("M")){
            System.out.printf("%.1f\n", sum/66.0);
        }
    }
}

Popularity 1/10 Helpfulness 1/10 Language java

Source: www.beecrowd.com.br

Tags: java solution

Link to this answer
Share Copy Link

Contributed on Mar 01 2022

coffee4coder

0 Answers Avg Quality 2/10

Uri/Beecrowd problem no - 1150 solution in Java

Contents

More Related Answers

Uri/Beecrowd problem no - 1150 solution in Java

Closely Related Answers

Uri/Beecrowd problem no - 1146 solution in Java

Uri/Beecrowd problem no - 1151 solution in C

Uri/Beecrowd problem no 1180 solution in JAVA

Uri/Beecrowd Problem no - 1185 Solution in Java

Grepper

Documentation

Social

Legal

Contact

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