Cod sursa(job #958011)
Utilizator | Data | 6 iunie 2013 19:29:20 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 85 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.35 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,k,x[801];
int main()
{ f>>n;
for(i=1;i<=n;++i) f>>x[i];
sort(x+1,x+n+1);
int nr=0;
for(i=1;i<n-1;++i)
for(j=i+1;j<n;++j)
for(k=j+1;k<=n;k++)
if(x[k]<=x[i]+x[j]) nr+=1;
g<<nr;
return 0;
g.close();
}