Cod sursa(job #577754)
Utilizator | Data | 10 aprilie 2011 16:06:58 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
int a[1000],n,i,j,k,nr;
int main()
{fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
sort(a,a+n+1);
for(i=1;i<n-1;i++)
for(j=i+1,k=i+2;j<n;j++)
{
while(k<=n&&a[j]+a[i]>=a[k])
k++;
nr+=k-j-1;
}
fout<<nr;
return 0;
}