Cod sursa(job #573202)
Utilizator | Data | 5 aprilie 2011 23:55:43 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int n,i,j,k,nr,a[151],s;
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
sort(a,a+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<=n;k++)
if(a[i]+a[j]>=a[k])
nr++;
g<<nr;
return 0;
}