Cod sursa(job #2326324)
| Utilizator | Data | 23 ianuarie 2019 13:54:50 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | simulare_preoli | Marime | 0.55 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int N, cont;
int main()
{
in >> N;
int v[N];
for(int i = 0; i < N; ++i)
in >> v[i];
sort(v, v + N);
for(int i = 0; i < N - 2; ++i)
for(int j = i + 1; j < N - 1; ++j)
for(int k = j + 1; k < N; ++k)
if(v[i] <= v[j] + v[k] && v[j] <= v[i] + v[k] && v[k] <= v[i] + v[j])
++cont;
else break;
out << cont;
return 0;
}
