Cod sursa(job #889313)
Utilizator | Data | 24 februarie 2013 13:26:47 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
long long a[25001],i,j,k,n,nr=0,s;
int main()
{
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a+1,a+n+1);
for (i=1;i<n;i++)
{
for (j=i+1;j<=n;j++)
{
s=a[i]+a[j];
for (k=j+1;k<=n;k++)
if( s>=a[k] )
nr++;
}
}
g<<nr;
return 0;
}