Cod sursa(job #1565627)
| Utilizator | Data | 11 ianuarie 2016 04:11:30 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int v[2000];
int main() {
int n, i, j, nr = 0, k;
f >> n;
for(i = 0; i < n; ++i)
f >> v[i];
sort(v, v + n);
for(i = 0; i < n - 2; ++i) {
k = i + 2;
for(j = i + 1; j < n; ++j) {
while(k < n && v[i] + v[j] >= v[k]) ++k;
nr += k - j - 1;
}
}
g << nr << "\n";
f.close();
g.close();
return 0;
}
