/Java/Uri/beecrowd problem no 1118 solution in Java

Uri/beecrowd problem no 1118 solution in Java

import java.util.Scanner;
public class Main{
    public static void main (String[] args) {
        
        Scanner obj = new Scanner(System.in);
        
        int limit = 1;
        while(limit != 2){
            if(limit == 1){
                int counter = 0;
                float sum = 0;
                while(counter != 2){
                    float num = obj.nextFloat();
                    if(num >= 0.0 && num <= 10.0){
                        counter++;
                        sum += num;
                    }else{
                        System.out.println("nota invalida");
                    }
                }
                System.out.format("media = %.2f\n", (sum/counter));
            }
            System.out.println("novo calculo (1-sim 2-nao)");
            limit = obj.nextInt();
        }
        
    }
}

Source: beecrowd.com.br

Similar codes

0 vote108 views1 answer
Valid regex check java
Java
0 vote101 views1 answer
Arrays in constructor java
Java
0 vote105 views1 answer
Thymeleaf spring boot dependency for mail
Java
0 vote112 views1 answer
How to get a set from a map in java
Java
0 vote95 views1 answer
Google map set default zoom android studio
Java
2 votes55 views1 answer
Java observable class
Java
1 vote117 views1 answer
Contains hashmap java
Java
0 vote102 views1 answer
How to send http post create request using curl command
Java
4 votes61 views2 answers
Calculate fps java
Java
0 vote114 views1 answer
Eliminar el primer caracter de un string java
Java