Pagini recente » Cod sursa (job #2079598) | Istoria paginii preoni-2007/runda-finala/11-12 | Cod sursa (job #1680550) | Cod sursa (job #62979) | Cod sursa (job #490071)
Cod sursa(job #490071)
#include<fstream>
#include<cmath>
using namespace std;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,x[801],i,j,l,m=0;
f>>n;
for(i=1;i<=n;i++)f>>x[i];
sort(x+1,x+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
for(l=j+1;l<=n;l++)
if(x[i]+x[j]>=x[l]) m++;
g<<m;
f.close();
g.close();
return 0;
}