beecrowd_solution/1118.cpp at main · imransihab0/beecrowd_solution · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
#include<bits/stdc++.h>
using namespace std;

void count(){
    double x, final=0.0;
    int count=0;
    while(1){
        cin >> x;
        if(x>0 && x<=10){
            final += x;
            count++;
            if(count==2){
                break;
            }
        }else{
        cout << "nota invalida" << endl;
        }
    }
    cout << "media = " << fixed << setprecision(2) << final/2.00 << endl;
}

int main(){
    int ask;
    count();
    while(1){
        cout << "novo calculo (1-sim 2-nao)" << endl;
        cin >> ask;
        if(ask == 2){
            break;
        }else if(ask == 1){
            count();
        }else{
            continue;
        }
    }

return 0;
}