Cod sursa(job #1254124)
| Utilizator | Data | 2 noiembrie 2014 11:06:14 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <cstdio>
#include <stdlib.h>
#include <algorithm>
using namespace std;
int a[1001], i, j, k, z, n, ok, aux;
int main()
{
freopen("nrtri.in", "r", stdin);
freopen("nrtri.out", "w", stdout);
scanf("%d", &n);
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
sort(a, a + n);
for(i = 0; i < n; i++)
{
for(j = i+1; j < n; j++)
{
ok = 0;
for(k = j+1; k < n && !ok; k++)
if(a[i] + a[j] >= a[k])
{
z++;
}
else
ok = 1;
}
}
printf("%d", z);
return 0;
}