Time Limit: 2 second(s) | Memory Limit: 32 MB |
You are given N sticks having distinct lengths; you have to form some triangles using the sticks. A triangle is valid if its area is positive. Your task is to find the number of ways you can form a valid triangle using the sticks.
Input
Input starts with an integer T (≤ 10), denoting the number of test cases.
Each case starts with a line containing an integer N (3 ≤ N ≤ 2000). The next line contains N integers denoting the lengths of the sticks. You can assume that the lengths are distinct and each length lies in the range [1, 109].
Output
For each case, print the case number and the total number of ways a valid triangle can be formed.
Sample Input | Output for Sample Input |
3 5 3 12 5 4 9 6 1 2 3 4 5 6 4 100 211 212 121 | Case 1: 3 Case 2: 7 Case 3: 4 |
题意:给出N条边的边长,问你能组成多少个三角形
#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{
int a[2010];
int t,n,kcase = 1;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
for(int i = 0 ; i < n ; i++)
scanf("%d",&a[i]);
sort(a,a+n);
int ans = 0;
for(int i = 0 ; i < n ; i++)
for(int j = i + 1 ; j < n ; j++){
int t = a[i] + a[j];
int it = lower_bound(a+j,a+n,t) - a;
if(it == j)
continue;
ans += it - j - 1;
}
printf("Case %d: %d\n",kcase++,ans);
}
return 0;
}