杭电ojC++--2061 Treasure the new start, freshmen! AC代码

今天又是超时的一天,大家一定也要注意一下尽可能的减少空间复杂度,能省则省!!!


题目描述

background:
A new semester comes , and the HDU also meets its 50th birthday. No matter what’s your major, the only thing I want to tell you is:“Treasure the college life and seize the time.” Most people thought that the college life should be colorful, less presure.But in actual, the college life is also busy and rough. If you want to master the knowledge learned from the book, a great deal of leisure time should be spend on individual study and practise, especially on the latter one. I think the every one of you should take the learning attitude just as you have in senior school.
“No pain, No Gain”, HDU also has scholarship, who can win it? That’s mainly rely on the GPA(grade-point average) of the student had got. Now, I gonna tell you the rule, and your task is to program to caculate the GPA.
If there are K(K > 0) courses, the i-th course has the credit Ci, your score Si, then the result GPA is
GPA = (C1 * S1 + C2 * S2 +……+Ci * Si……) / (C1 + C2 + ……+ Ci……) (1 <= i <= K, Ci != 0)
If there is a 0 <= Si < 60, The GPA is always not existed.

输入

The first number N indicate that there are N test cases(N <= 50). In each case, there is a number K (the total courses number), then K lines followed, each line would obey the format: Course-Name (Length <= 30) , Credits(<= 10), Score(<= 100).
Notice: There is no blank in the Course Name. All the Inputs are legal

输出

Output the GPA of each case as discribed above, if the GPA is not existed, ouput:“Sorry!”, else just output the GPA value which is rounded to the 2 digits after the decimal point. There is a blank line between two test cases.

代码

超时代码示范

#include <iostream>
#include <iomanip>
using namespace std;
int main() {
	char name[50][30];
	double C[50], S[50];
	int N, M, i, p;
	double score, sum;
	cin >> N;
	while (N--) {
		p = 0;
		score = 0; sum = 0;
		cin >> M;
		for (i = 0; i < M; i++) cin >> name[i] >> C[i] >> S[i];
		for (i = 0; i < M; i++) {
			score += C[i] * S[i];
			sum += C[i];
			if (S[i] < 60) {
				p = 1;
				break;
			}
		}
		if (p == 1) cout << "Sorry!" << endl;
		else {
			score = score * 1.0 / sum;
			cout << fixed << setprecision(2) << score << endl << endl;
		}
	}
	return 0;
}

为什么上面的代码会超时,因为创建了大量的空间,比如char name[50][30]; double C[50], S[50];如果读者没有犯这个错误,那可以直接对比看下面的代码.
创建的这些空间,完全可以在一个for循环中读取和计算,因此要提高警惕,不需要的空间我们就省下来,不然会提示超时.

正确的AC代码来了

#include <iostream>
#include <iomanip>
using namespace std;
int main() {
	char name[31];
	double C, S;
	int N, M, i, p;
	double score, sum;
	cin >> N;
	while (N--) {
		p = 0;
		score = 0; sum = 0;
		cin >> M;
		
		for (i = 0; i < M; i++) {
			cin >> name >> C >> S;
			score += C * S;
			sum += C;
			if (S < 60) {
				p = 1;
			}
		}
		if (p == 1) cout << "Sorry!" << endl;
		else {
			score = score * 1.0 / sum;
			cout << fixed << setprecision(2) << score << endl;
		}
		if (N != 0) cout << endl;
	}
	return 0;
}

加油,每天进步一点点!

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
杭州电子科技大学在线评测系统(杭电OJ)中的题目1000-1100是一系列编程题,我将分别进行回答。 1000题是一个简单的入门题,要求计算两个整数的和。我们可以使用一个简单的算法,读取输入的两个整数,然后将它们相加,最后输出结果即可。 1001题是一个稍微复杂一些的题目,要求实现字符串的逆序输出。我们可以使用一个循环来逐个读取输入的字符,然后将这些字符存储在一个数组中。最后,我们可以倒序遍历数组并将字符依次输出,实现字符串的逆序输出。 1002题是一个求最大公约数的问题。我们可以使用辗转相除法来解决,即先求出两个数的余数,然后将被除数更新为除数,将除数更新为余数,直至两个数的余数为0。最后的被除数就是最大公约数。 1003题是一个比较简单的排序问题。我们可以使用冒泡排序算法来解决,即每次比较相邻的两个元素,如果它们的顺序错误就交换它们的位置。重复这个过程直至整个数组有序。 1100题是一个动态规划问题,要求计算给定序列中的最长上升子序列的长度。我们可以使用一个数组dp来保存到达每个位置的最长上升子序列的长度。每当遍历到一个位置时,我们可以将其和之前的位置比较,如果比之前位置的值大,则将其更新为之前位置的值加1,最后返回dp数组的最大值即可。 以上是对杭电OJ1000-1100题目的简要回答,涉及了一些基本的编程知识和算法思想。希望对您有所帮助。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值