/Java/URI/BEE problem no-1101 solution in Java

URI/BEE problem no-1101 solution in Java

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

Source: beecrowd.com.br

Similar codes

0 vote305 views1 answer
Os compatible java path separator
Java
7 votes343 views4 answers
Lombok maven
Java
0 vote320 views1 answer
I java
Java
6 votes325 views3 answers
How to call parameterized constructor of a Parent class in Inheritance
Java
0 vote333 views1 answer
How to split string with dolor sign in java
Java
0 vote345 views1 answer
Removing DOM nodes when traversing a NodeList
Java
0 vote329 views1 answer
Was ist ein String in java
Java
4 votes302 views2 answers
Random string method java
Java
0 vote293 views1 answer
Splitting text with several condition in java
Java
5 votes353 views2 answers
String remove duplicate in java
Java