Cod sursa(job #2096561)
| Utilizator | Data | 29 decembrie 2017 13:56:01 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <fstream>
#include <algorithm>
#define DEF 810
using namespace std;
ifstream fin ("nrtri.in");
ofstream fout ("nrtri.out");
int n, v[DEF], sol;
int main () {
fin >> n;
for (int i = 1; i <= n; ++ i) {
fin >> v[i];
}
sort (v + 1, v + n + 1);
for (int i = 1; i <= n - 2; ++ i) {
for (int j = i + 1; j <= n - 1; ++ j) {
for (int l = j + 1; l <= n; ++ l) {
if (v[l] > v[i] + v[j])
++ sol;
}
}
}
fout << sol;
return 0;
}
