Cod sursa(job #716072)
Utilizator | Data | 18 martie 2012 11:33:02 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
using namespace std;
#include<algorithm>
int main()
{
ifstream fcin("nrtri.in");
ofstream fcout("nrtri.out");
int n,i,v[800],nr=0,j,k;
fcin>>n;
for(i=0;i<n;i++)
fcin>>v[i];
sort(v,v+n);
for(i=0;i<n-2;i++)
for(j=i+1;j<n-1;j++)
for(k=j+1;k<n;k++)
if(v[i]+v[j]>=v[k])
nr++;
else
break;
cout<<nr;
return 0;
}