/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 vote133 views1 answer
Enable cors on apache tomcat
Java
0 vote107 views1 answer
Hourglass Java
Java
2 votes136 views1 answer
How can I do tf idf weighting in scikit learn?
Java
0 vote99 views1 answer
Gif to blob java
Java
0 vote92 views1 answer
Splitting text with several condition in java
Java
0 vote100 views1 answer
Java swing place objects vertically
Java
0 vote95 views1 answer
Split number java
Java
2 votes104 views2 answers
Index through 2d array
Java
0 vote109 views1 answer
Java -jar -l resources\es.porperties -i ejemplo.txt -o inject.bin
Java
5 votes101 views2 answers
Rounding off in java
Java