1307 - Counting Triangles

1307 - Counting Triangles

PDF (English)

Statistics

Forum

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, 10⁹].

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

三角形肯定是两边之后大于第三边就可以形成了

找到两条边然后找到比他们的所有和 小的就好了

#include "cstdio"
#include "algorithm"
using namespace std;
int a[10100];
int main() {
    int n, caseno = 0, cases;
    scanf("%d", &cases);
    while( cases-- ) {
        scanf("%d",&n);
        int summ=0;
        for(int i=1;i<=n;i++)
            scanf("%d",&a[i]);
        sort(a+1,a+1+n);
        for(int i=1;i<=n-2;i++){
            for(int j=i+1;j<=n-1;j++){
                int c=a[i]+a[j];
                long k = lower_bound (a+1, a+n+1, c) - a;
                summ+=(k-j-1);
            }
        }
        printf("Case %d: %d\n", ++caseno, summ );
    }
    return 0;
}