Cod sursa(job #1523277)
| Utilizator | Data | 12 noiembrie 2015 15:57:47 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int main()
{
int n;
in >>n;
int v[8000];
for(int i = 0 ; i <n ; i++)
in>> v[i];
sort(v,v+n);
int nr = 0;
for(int i = 0 ; i < n-2 ; i++)
for(int j = i+1 ; j <n-1 ; j ++)
{
int dis=0;
int k = n-1;
while(v[k]> v[i]+v[j])
k--;
dis = k-j;
nr+=dis;
}
out<<nr;
return 0;
}
