ACM STEP 1.2.5 GPA
来源:互联网 发布:python xml dom 编辑:程序博客网 时间:2024/04/29 23:02
GPA
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2648 Accepted Submission(s): 1097Problem 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
Author
2006Rocky Mountain Warmup
Source
HDU “Valentines Day” Open Programming Contest 2009-02-14
Recommend
lcy
#include <iostream>#include <iomanip>using namespace std;int main(){ char c[1000],d; bool found; //sign double s; int n; while ((gets(c))&&c[0]!=EOF&&c[0]!='\0'&&d!=EOF) { s=0;n=0; found=true; do{ switch (c[n]) { case 'A': s+=4; break; case 'B': s+=3; break; case 'C': s+=2; break; case 'D': s+=1; break; case 'F': s+=0; break; default: found=false; break; } if(!found) break; //putchar(c[n]); d=c[++n]; }while((n++,d!='\n'&&d!='\0'&&d!=EOF)); if(found) { cout <<setiosflags(ios::fixed)<<setprecision(2)<<s/(n/2)<<endl; } else cout <<"Unknown letter grade in input"<<endl; } return 0;}
- ACM STEP 1.2.5 GPA
- HDU 1.2.5 GPA(ACM step)
- 杭电acm 1.2.7 GPA
- 杭电ACM 1.2.4 GPA
- hdoj acm steps 1.2.4(GPA)
- ACM STEP 1.2.1 Climbing Worm
- ACM STEP 1.2.2 Financial Management
- ACM STEP 1.2.3 Nasty Hacks
- ACM STEP 1.2.7 Lowest Bit
- hdu ACM step 1.2.1 hdu1049
- hdu ACM step 1.2.2 hdu1062
- hdu ACM step 1.2.3 hdu1064
- hdu ACM step 1.2.4 hdu2399
- hdu acm step 2.3
- ACM-STEP Rank
- 1.2.7 GPA
- GPA
- GPA
- ACM STEP 1.2.4 find your present (2)
- 网络图片的获取和显示的方法
- eCos中的main函数
- 2011成都网选最水的几道题
- ORA-01078, LRM-00123错误处理
- ACM STEP 1.2.5 GPA
- ViewController的旋转一个举例
- UVa 127 - "Accordian" Patience
- 一道百度面试题
- 在linux下使用mysql的基础操作(二)
- ACM STEP 1.2.7 Lowest Bit
- 第四章总结(上)
- 【PAT Advanced Level】1004. Counting Leaves (30)
- Linux就是这个范儿之第一次亲密接触(3)