hdu4989(水暴力)

Summary

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 1289    Accepted Submission(s): 627

Problem Description

Small W is playing a summary game. Firstly, He takes N numbers. Secondly he takes out every pair of them and add this two numbers, thus he can get N*(N - 1)/2 new numbers. Thirdly he deletes the repeated number of the new numbers. Finally he gets the sum of the left numbers. Now small W want you to tell him what is the final sum.

 

Input

Multi test cases, every case occupies two lines, the first line contain n, then second line contain n numbers a ₁, a ₂, ……a _n separated by exact one space. Process to the end of file.
[Technical Specification]
2 <= n <= 100
-1000000000 <= a _i <= 1000000000

 

Output

For each case, output the final sum.

 

Sample Input

  
  

   
   4
1 2 3 4
2
5 5
  
  

 

Sample Output

  
  

   
   25
10

   
   

    
    

     
     Hint
    
    
Firstly small W takes any pair of 1 2 3 4 and add them, he will get 3 4 5 5 6 7. Then he deletes the repeated numbers, he will get 3 4 5 6 7, Finally he gets the sum=3+4+5+6+7=25.

   
   
   
    
  
  

 

Source

BestCoder Round #8

 

Recommend

heyang   |   We have carefully selected several similar problems for you:   6216  6215  6214  6213

#include<cstdio> 
#include<iostream>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
const int maxn=8100;
ll a[maxn],b[maxn];
int main()
{
	int n;
	while(scanf("%d",&n)!=EOF)
	{	
		for(int i=0;i<n;i++)
			scanf("%lld",&a[i]);
		int num=0;
		for(int i=0;i<n-1;i++)
			for(int j=i+1;j<n;j++)
			{
				b[num++]=a[i]+a[j];
			}
		sort(b,b+num);
		for(int i=1;i<num;i++)
		{
			if(b[i]==b[i-1])
				b[i-1]=0;
		}
		ll sum=0;
		for(int i=0;i<num;i++)
		{
			sum+=b[i];
		}
		printf("%lld\n",sum);
	}

	return 0;
}