URI/BEE problem no-1101 solution in Java

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

answer URI/BEE problem no-1101 solution in Java

URI/BEE problem no-1101 solution in Java

Comment

import java.util.Scanner;
public class Main{
    public static void main (String[] args) {
        int M,N,i,j,sum = 0;
        Scanner obj = new Scanner(System.in);
        
        for(i = 1; i <= 3; i++){
            M = obj.nextInt();
            N = obj.nextInt();
            
            for(j = N,sum = 0; j <= M; j++){
                if(N <= 0){
                    System.exit(1);
                }else{
                    System.out.printf("%d ", j);
                    sum += j;
                }
                
            }
            System.out.println("Sum=" + sum);
        }
        
    }
}

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 05 2022

coffee4coder

0 Answers Avg Quality 2/10

URI/BEE problem no-1101 solution in Java

Contents

More Related Answers

URI/BEE problem no-1101 solution in Java

Grepper

Documentation

Social

Legal

Contact

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