Cod sursa(job #679376)
Utilizator | Data | 13 februarie 2012 10:44:47 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("nrtri.in");
ofstream out("nrtri.out");
int n,v[805],i,j,k,numarTriunghiuri;
int main()
{
in>>n;
for(i=1;i<=n;i++)
in>>v[i];
sort(v+1,v+n);
for(i=1;i<=n-2;i++)
for(j=i+1;j<n;j++)
for(k=j+1;k<=n;k++)
if(v[i]+v[j]>=v[k]&&v[j]+v[k]>=v[i]&&v[k]+v[i]>=v[j])
numarTriunghiuri++;
else
break;
out<<numarTriunghiuri<<'\n';
return 0;
}