日韩久久久精品,亚洲精品久久久久久久久久久,亚洲欧美一区二区三区国产精品 ,一区二区福利

Help Johnny-(類似杭電acm3568題)

系統(tǒng) 2257 0

Help Johnny(類似杭電3568題)

Description

Poor Johnny is so busy this term. His tutor threw lots of hard problems to him and demanded him to?
accomplish those problems in a month. What a wicked tutor! After cursing his tutor thousands of times,?
Johnny realized that he must start his work immediately. ?
The very problem Johnny should solve firstly is about a strange machine called Warmouth. In the Warmouth?
there are many pairs of balls. Each pair consists of a red ball and a blue ball and each ball is assigned a value.?
We can represent a pair in the form of (R, B) in which R is the value of the red ball and B is of the blue one.?
Warmouth has a generator to calculate the match value of two pairs. The match value of (R1, B1) and (R2,?
B2) is R1*B2+R2*B1. Initially, Warmouth is empty. Pairs are sent into Warmouth in order. Once a new pair?
comes, it will be taken into the generator with all the pairs already in Warmouth. ?
Johnny’s work is to tell his tutor the sum of all match values given the list of pairs in order. As the best?
friend of Johnny, would you like to help him??

?

Input

The first line of the input is T (no more than 10), which stands for the number of lists Johnny received. ?
Each list begins with “N“(without quotes). N is the number of pairs of this list and is no more than 100000.?
The next line gives N pairs in chronological order. The 2i-th number is the value of the red ball of the i-th?
pair and the (2i+1)-th number is the value of the blue ball of the i-th pair. The numbers are positive integers?
and smaller than 100000.?

?

Output

Please output the result in a single line for each list. ?

?

Sample Input

2?
3?
1 3 2 2 3 1?
2?
4?5?6?7

Sample Output

26 58

此題的意思就是給幾組數(shù)據(jù),按照一定的規(guī)則進(jìn)行運(yùn)算,要是知道規(guī)則很簡(jiǎn)單的運(yùn)算。

代碼如下:


#include<stdio.h>
#include <iostream>
using namespace std;
int a[100005];
int b[100005];
int main()
{
? ? ?long long s1,s2,add;
int n,m,i,j=0;
cin>>n;
for(j=1;j<=n;j++)
{
? ?add=0,s1=0,s2=0;
cin>>m;
for(i=1;i<=m;i++)
{
cin>>a[i]>>b[i];
s1+=a[i];
s2+=b[i];
}
? ? ? ? for(i=1;i<m;i++)
? ?{
? ?s1-=a[i];
? ?s2-=b[i];
? ?add+=a[i]*s2+b[i]*s1;
? ?}
? ? cout<<add<<endl;
}
return 0;
}

?

Help Johnny-(類似杭電acm3568題)


更多文章、技術(shù)交流、商務(wù)合作、聯(lián)系博主

微信掃碼或搜索:z360901061

微信掃一掃加我為好友

QQ號(hào)聯(lián)系: 360901061

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對(duì)您有幫助,請(qǐng)用微信掃描下面二維碼支持博主2元、5元、10元、20元等您想捐的金額吧,狠狠點(diǎn)擊下面給點(diǎn)支持吧,站長(zhǎng)非常感激您!手機(jī)微信長(zhǎng)按不能支付解決辦法:請(qǐng)將微信支付二維碼保存到相冊(cè),切換到微信,然后點(diǎn)擊微信右上角掃一掃功能,選擇支付二維碼完成支付。

【本文對(duì)您有幫助就好】

您的支持是博主寫作最大的動(dòng)力,如果您喜歡我的文章,感覺我的文章對(duì)您有幫助,請(qǐng)用微信掃描上面二維碼支持博主2元、5元、10元、自定義金額等您想捐的金額吧,站長(zhǎng)會(huì)非常 感謝您的哦!!!

發(fā)表我的評(píng)論
最新評(píng)論 總共0條評(píng)論
主站蜘蛛池模板: 兰州市| 中山市| 高雄市| 阿坝| 富平县| 青河县| 诸暨市| 五大连池市| 岳阳县| 南部县| 青海省| 班戈县| 遂平县| 昆山市| 武陟县| 临沂市| 姜堰市| 子长县| 徐水县| 武冈市| 聂拉木县| 和田市| 会同县| 介休市| 厦门市| 兰考县| 丰宁| 广南县| 温泉县| 浠水县| 铜梁县| 阿鲁科尔沁旗| 双流县| 满洲里市| 萨迦县| 黑河市| 图们市| 石城县| 房山区| 呼伦贝尔市| 盐源县|