Cod sursa(job #645721)
Utilizator | Data | 10 decembrie 2011 12:58:49 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int e[101],a,n,i,j,d=0,l;
int main()
{
ifstream q("nrtri.in");
ofstream w("nrtri.out");
q>>n;
for(i=1; i<=n; i++)
q>>e[i];
sort(e+1,e+n+1);
for(i=1; i<=n; i++)
for(l=i+1; l<=n; l++)
for(j=n; j>=l+1; j--)
if(e[j]<=e[i]+e[l])
{
d=d+(j-l);
break;
}
w<<d;
return 0;
}