# GPA

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

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 F B F F C C A D C E F

Sample Output

2.00 1.83 Unknown letter grade in input

Author

2006Rocky Mountain Warmup

Source

HDU “Valentines Day” Open Programming Contest 2009-02-14

``` 1 #include<stdio.h>
2 #include<string.h>
3 #include<stdlib.h>
4 int main()
5 {
6     char str;
7     int cnt=0,con=0;
8     bool flag=true;
9     while(scanf("%c",&str)!=EOF)
10     {
11        if(str==32) continue;
12         if(str==10)
13         {
14             if(flag)
15                 printf("%.2lf\n",(double)1.0*cnt/con);
16             else
17                 printf("Unknown letter grade in input\n");
18             flag=true;
19             con=0;
20             cnt=0;
21             continue;
22         }
23         switch(str)
24         {
25           case 'A':  cnt+=4; break;
26           case 'B':  cnt+=3; break;
27           case 'C':  cnt+=2; break;
28           case 'D':  cnt++; break;
29           case 'F':         break;
30           default:  flag=false; break;
31         }
32         con++;
33     }
34  return 0;
35 }```

656 篇文章63 人订阅

0 条评论

## 相关文章

### hdu---(1054)Strategic Game(最小覆盖边)

Strategic Game Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/3...

2745

### HDU 1711 Number Sequence(KMP裸题，板子题，有坑点)

Number Sequence Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/3...

3014

### HDUOJ----Good Numbers

Good Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768...

3046

### ZOJ 80ers' Memory

80ers' Memory ---- Time Limit: 1 Second      Memory Limit: 32768 KB ---- I guess...

2916

### HDUOJ----2952Counting Sheep

Counting Sheep Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/327...

3367

### HDUOJ-----(1072)Nightmare(bfs)

Nightmare Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K ...

3387

### HDUOJ-------2493Timer(数学 2008北京现场赛H题)

Timer Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Jav...

2574

### HDU 1005 Number Sequence【多解，暴力打表，鸽巢原理】

Number Sequence Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32...

3327

### HDUOJ----（1031）Design T-Shirt

Design T-Shirt Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/327...

36213

### hdu 1695 GCD（莫比乌斯反演）

GCD Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/...

3676