Cod sursa(job #2072032)
| Utilizator | Data | 21 noiembrie 2017 12:34:08 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fi("nrtri.in");
ofstream fo("nrtri.out");
int v[800];
int main()
{
long long n, i, j, pas, rez, rasp;
fi >> n;
for(i = 0; i < n; i++)
fi >> v[i];
sort(v, v + n);
rasp = 0;
for(i = 0; i < n; i++)
for(j = i + 1; j < n; j++){
rez = 0;
for(pas = 1 << 10; pas > 0; pas /= 2)
if(rez + pas < n && v[rez + pas] <= v[i] + v[j])
rez += pas;
rasp += rez - j;
}
fo << rasp;
return 0;
}
