Cod sursa(job #3375661)
| Utilizator | Data | 12 noiembrie 2026 21:05:39 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 35 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.6 kb |
#include<bits/stdc++.h>
using namespace std;
const int NMAX = 805;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int v[NMAX];
int main() {
int n;
fin >> n;
for (int i = 1; i <= n; i++) {
fin >> v[i];
}
sort(v + 1, v + n + 1);
int cnt = 0;
for (int i = 1; i <= n - 2; i++) {
int left = i + 1;
int right = i + 2;
while (left <= n - 1) {
while (right + 1 <= n && (v[i] + v[left] >= v[right + 1]))
right++;
cnt += (right - left);
left++;
}
}
fout << cnt << '\n';
return 0;
}