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