/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 vote253 views1 answer
Print list of map java
Java
0 vote260 views1 answer
Stop countdown timer when exiting an activity
Java
0 vote270 views1 answer
Mint menu disapeared
Java
0 vote277 views1 answer
Java ordenar los valores de un array de menor a mayor
Java
0 vote274 views1 answer
Spring mock Streamble of object
Java
0 vote247 views1 answer
Make new file in intellij for java
Java
0 vote275 views1 answer
Java circular buffer implementation on array
Java
0 vote245 views1 answer
Call method of another class without creating instance in java android
Java
1 vote247 views1 answer
Mitmproxy on mac and android device
Java
0 vote292 views2 answers
Matrix Diagonal Sum
Java