Cod sursa(job #3360505)
| Utilizator | Data | 14 iulie 2026 14:30:57 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <bits/stdc++.h>
#define NMAX 800
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
unsigned short v[NMAX];
int main(){
int n, i, j, k, cnt;
fin >> n;
for (i = 0; i < n; i++)
fin >> v[i];
sort(v, v + n);
cnt = 0;
for (i = 0; i < n - 2; i++)
for (j = i + 1; j < n - 1; j++)
for (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])
cnt++;
fout << cnt << '\n';
return 0;
}
