HDU 1.2.5 GPA(ACM step)
来源:互联网 发布:sql查询字段长度限制 编辑:程序博客网 时间:2024/05/17 08:01
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
Author
2006Rocky Mountain Warmup
Source
HDU “Valentines Day” Open Programming Contest 2009-02-14
Recommend
lcy
/*其实做个题太水了,不过就是在输入输出上我一时没转过弯儿连续输入一行字母,一旦回车就结束,打印出平均分 原来试了试不开数组直接用变量保存总分,没成功, 原因我忘了,所以只好开了个数组存每次的成绩如果谁可以不开数组,能直接回复我一下吗 */#include <stdio.h>#include <string.h>void GPA(char *grade, int cnt);int main(void){char ch, grade[1000] = {0};int cnt = 0;int i;while(scanf("%c", &ch)!=EOF){if(ch >= 'A' && ch <= 'z'){grade[cnt] = ch; // 记录分数 cnt ++;}if(ch == '\n'){GPA(grade, cnt);memset(grade, 0, cnt*sizeof(char));cnt = 0;}}return 0;}void GPA(char *grade, int cnt){int i, Unknown = 0;double sum = 0;for(i = 0; i < cnt; i++){switch(grade[i]){case 'A': sum += 4; continue;case 'B': sum += 3; continue;case 'C': sum += 2; continue;case 'D': sum += 1; continue;case 'F': continue;default : Unknown = 1; break;}}if(Unknown == 0)printf("%.2lf\n", sum / cnt);elseprintf("Unknown letter grade in input\n");}
0 0
- HDU 1.2.5 GPA(ACM step)
- ACM STEP 1.2.5 GPA
- 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
- hdu ACM Step chapter 2
- 杭电acm 1.2.7 GPA
- 杭电ACM 1.2.4 GPA
- hdoj acm steps 1.2.4(GPA)
- HDU GPA
- HDU GPA
- ACM刷题之HDU————GPA
- HDU acm step:Chapter one section two
- hdu step 1.1.5
- hdu 2399 GPA
- hdu 2399 GPA
- 从人人网“死亡”看“级联”效应
- hdu 1007最近点对
- Linux服务器安装jdk和tomcat
- hdu 1285(拓扑排序)
- 第十一周 项目一 存储班长信息的学生类(1)
- HDU 1.2.5 GPA(ACM step)
- DAG模型简单题
- Pow(x, n) - LeetCode 50
- 第十一周 阅读程序4 类的继承构造函数与析构函数调用的先后顺序
- uva465 overflow
- 日常所遇
- 文章标题
- UVA 10465 - Homer Simpson(贪心-考察代码能力哦)
- 第十二周项目四 点、圆的关系-(3)求点与圆心的连线在圆上的交点