/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

1 vote156 views1 answer
Java sort list alphabetically
Java
12 votes122 views2 answers
How to print elements in matrix java
Java
1 vote128 views1 answer
Calculate pi in java
Java
0 vote117 views1 answer
Java schleifendurchläufe zählen
Java
1 vote123 views1 answer
Uri to filepath, get file path from uri
Java
-4 votes112 views2 answers
Spring security logging
Java
0 vote118 views1 answer
Jax-RS path annotation
Java
0 vote132 views1 answer
Java read directory
Java
0 vote190 views1 answer
WRITE_EXTERNAL_STORAGE no longer provides write access when targeting Android 10+
Java
0 vote121 views1 answer
Slice() in typesript
Java