Cod sursa(job #768299)
| Utilizator | Data | 16 iulie 2012 16:06:37 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
int v[810], N;
int main()
{
int i, j, k, sol = 0;
scanf("%i", &N);
for(i = 0; i < N; i++) scanf("%i", &v[i]);
sort(v, v + N);
for(i = 0; i < N; i++)
for(j = i + 1; j < N; j++)
for(k = j + 1; k < N; k++)
if(v[i] + v[j] >= v[k])
sol ++;
else
break;
printf("%i\n", sol);
return 0;
}
