Cod sursa(job #761613)
Utilizator | Data | 26 iunie 2012 20:02:36 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int nr,i,j,k,n,v[801];
int main()
{f>>n;
for(i=1;i<=n;++i)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<n;++i)
for(j=i+1;j<n;++j)
for(k=j+1;k<=n;++k)
if(v[i]+v[j]>=v[k])
++nr;
else
break;
g<<nr<<'\n';
return 0;
}