Cod sursa(job #3361538)
| Utilizator | Data | 25 iulie 2026 00:17:48 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <fstream>
using namespace std;
ifstream fin("sort.in");
ofstream fout("sort.out");
int v[805];
int main() {
int n;
fin >> n;
for (int i = 0; i < n; i++) {
fin >> v[i];
}
int cnt = 0;
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = i + 2; k < n; k++) {
if (v[i] + v[j] >= v[k] &&
v[i] + v[k] >= v[j] &&
v[j] + v[k] >= v[i])
cnt++;
}
}
}
fout << cnt;
return 0;
}