Cod sursa(job #906443)
| Utilizator | Data | 6 martie 2013 20:34:34 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
# include <cstdio>
# include <algorithm>
using namespace std;
int n,i,a[1001],j,nr=0;
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-2; ++i)
for(j=i+1; j<=n-1; ++j)
{
int sum=a[i]+a[j];
int k=j+1;
while(sum>=a[k] && k<=n) nr++, ++k;
}
printf("%d", nr);
}
