Cod sursa(job #501207)
| Utilizator | Data | 14 noiembrie 2010 16:00:23 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
freopen("nrtri.in","r",stdin);
freopen("nrtri.out","w",stdout);
int n,i,j,k,x[1001],nr=0;
scanf("%d",&n);
for(i=1;i<=n;i++)
scanf("%d",&x[i]);
sort(x+1,x+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<=n;k++)
if(x[i]+x[j]>=x[k] && x[i]+x[k]>=x[j] && x[j]+x[k]>=x[i])
nr++;
printf("%d\n",nr);
return 0;
}
