Cod sursa(job #211073)
Utilizator | Tudorica Constantin Alexandru tudalex | Data | 30 septembrie 2008 18:08:15 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <stdio.h>
#include <algorithm>
using namespace std;
int a[1000], n, i, j, sol, k;
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
scanf("%d", &n);
for (i = 1; i <= n; ++ i)
scanf("%d", &a[i]);
sort(a+1, a+n+1);
for (i = 1; i <=n; ++ i)
for (j = i+1; j <= n; ++ j)
{
k =upper_bound(a+1,a+n+1,a[i]+a[j])-a-1;
sol+=k-j;
}
printf("%d\n", sol);
return 0;
}