Cod sursa(job #1646651)
Utilizator | Data | 10 martie 2016 17:04:06 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int n,v[801],nr,i,j;
int main()
{fin>>n;
nr=0;
for(i=1;i<=n;i++)fin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;++i)
for(j=i+1;j<=n-1;++j)
{
int k=j+1;
while(v[i]+v[j]>=v[k] && k<=n)
++k;
nr+=k-j-1;
}
fout<<nr;
return 0;
}