/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 vote266 views2 answers
Calculate smallest angle difference
Java
0 vote279 views1 answer
Spring boot send api request
Java Spring
0 vote263 views1 answer
Mobile view next and previous button
Java
1 vote241 views2 answers
Multidimensional arrays java
Java
1 vote241 views1 answer
Observer pattern java
Java
0 vote252 views1 answer
How to find the biggest number java with loops
Java
1 vote253 views1 answer
Validation dependency in spring boot
Java
0 vote241 views1 answer
Selenium treeview java
Java
1 vote304 views6 answers
Convert code from kotlin to java
Java
0 vote239 views1 answer
How to know what a valid name for a variable is in java
Java