hdu 2399 GPA

 

GPA

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 317    Accepted Submission(s): 194

Problem Description

Each course grade is one of the following five letters: A, B, C, D, and F. (Note that there is no grade E.) The grade A indicates superior achievement , whereas F stands for failure. In order to calculate the GPA, the letter grades A, B, C, D, and F are assigned the following grade points, respectively: 4, 3, 2, 1, and 0.

 

 

Input

The input file will contain data for one or more test cases, one test case per line. On each line there will be one or more upper case letters, separated by blank spaces.

 

 

Output

Each line of input will result in exactly one line of output. If all upper case letters on a particular line of input came from the set {A, B, C, D, F} then the output will consist of the GPA, displayed with a precision of two decimal places. Otherwise, the message "Unknown letter grade in input" will be printed.

 

 

Sample Input

A B C D FB F F C C AD C E F

 

 

Sample Output

2.001.83Unknown letter grade in input

 #include <iostream>#include <cmath>#include <cstring>#include <map>#include <algorithm>using namespace std;int main(){ freopen("in1.txt","r", stdin); string s; int len; double sum; int count; while (getline(cin, s)) { len = s.length(); sum = 0; count = 0; bool flag = false; for (int i = 0; i < len; i++) { if (s[i] == ' ') continue; if (s[i] == 'A') { sum += 4; count++; } else if (s[i] == 'B') { sum += 3; count++; } else if (s[i] == 'C') { sum += 2; count++; } else if (s[i] == 'D') { sum += 1; count++; } else if (s[i] == 'F') { count++; } else { flag = true; cout<<"Unknown letter grade in input"<<endl; break; } } if (!flag) { cout<<(int)sum/count; cout<<"."; double tmp = sum/(double)count; cout<<(int)(tmp*10.0)%10; cout<<(int)(tmp*100.0)%10; cout<<endl; } }}