/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 vote299 views1 answer
Keytool error: java.io.FileNotFoundException: c:\Users\USER_NAME\upload-keystore.jks (The system cannot find the path specified)
Java
3 votes322 views2 answers
Random boolean java
Java
0 vote304 views1 answer
EXPECTTIONS JAVA
Java
2 votes280 views2 answers
Adjust font scale in android studio
Java
0 vote294 views1 answer
Convert Octal to Binary in java
Java
0 vote304 views1 answer
Correct lcd initialize
Java
0 vote285 views2 answers
Android transparent status bar
Java
4 votes328 views1 answer
Concurrentmodificationexception android
Java
0 vote294 views1 answer
Euclids algoritm java gcd
Java
0 vote306 views1 answer
Difference between maven and cucumber test runner
Java