/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 vote183 views1 answer
Scanner library showing element not found exception
Java
4 votes152 views1 answer
Printf %2d in java
Java
1 vote170 views1 answer
Min value map
Java
0 vote201 views1 answer
Merge sort algorithm in java short answer
Java
34 votes179 views2 answers
Queue.isempty java
Java
2 votes174 views1 answer
Print string in java
Java
4 votes241 views5 answers
How to use while loop in java
Java
0 vote164 views1 answer
Previous method in jdbc
Java
14 votes197 views3 answers
Arraylist add method
Java
0 vote177 views1 answer
Mongorepository spring boot custom query
Java