Cod sursa(job #1745630)
| Utilizator | Data | 22 august 2016 13:04:34 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<bits/stdc++.h>
#define N 805
int n, l[N], i, j, k, nr;
int main()
{
nr = 0;
freopen("nrtri.in", "r", stdin);
freopen("nrtri.out", "w", stdout);
scanf("%d", &n);
for(i = 1; i <= n; i++) scanf("%d", &l[i]);
for(i = 1; i <= n-2; i++)
for(j = i+1; j <= n-1; j++)
for (k = j + 1; k <= n && l[i]+l[j] >= l[k]; k++)
nr++;
printf("%d", nr);
return 0;
}
