/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 vote350 views2 answers
How to check if a string contains only alphabets and space in java
Java
0 vote352 views1 answer
Java 8 retrieve all list from object into single list and ignore duplicates
Java
0 vote358 views1 answer
Java sort reverse lambda
Java
-1 vote363 views1 answer
192.168.223.12:8080
Java
1 vote362 views1 answer
Java jackson cast to list
Java
0 vote392 views1 answer
Kotlin spinner default value
Java
0 vote350 views3 answers
Data provider using junit
Java
0 vote356 views2 answers
Program type already present: android.support.v4.app.INotificationSideChannel
Java
0 vote377 views1 answer
Java console readline null pointer exception
Java
0 vote371 views1 answer
Example of "this" : to invoke current class method
Java