HDU 5982.Relic Discovery(2016 CCPC 青岛 A)




Recently, paleoanthropologists have found historical remains on an island in the Atlantic Ocean. The most inspiring thing is that they excavated in a magnificent cave and found that it was a huge tomb. Inside the construction,researchers identified a large number of skeletons, and funeral objects including stone axe, livestock bones and murals. Now, all items have been sorted, and they can be divided into N types. After they were checked attentively, you are told that there are Ai items of the i-th type. Further more, each item of the i-th type requires Bi million dollars for transportation, analysis, and preservation averagely. As your job, you need to calculate the total expenditure.

The first line of input contains an integer T which is the number of test cases. For each test case, the first line contains an integer N which is the number of types. In the next N lines, the i-th line contains two numbers Ai and Bi as described above. All numbers are positive integers and less than 101.

For each case, output one integer, the total expenditure in million dollars.

1 2
3 4



看样例基本就是对于 T 组数据
每组数据有 nAB
求这 nA * B



`cpp Relic Discovery https://github.com/OhYee/sourcecode/tree/master/ACM 代码备份
#define debug

using namespace std;

int main() {
#ifdef debug
freopen("in.txt", "r", stdin);
int START = clock();

int T;
cin >> T;
while (T--) {
int n, sum = 0;
cin >> n;
while (n--) {
int A, B;
cin >> A >> B;
sum += A * B;
cout << sum << endl;

#ifdef debug
printf("Time:%.3f s.n", double(clock() - START) / CLOCKSPERSEC);
return 0;
  • 点击查看/关闭被识别为广告的评论