Cod sursa(job #851736)
Utilizator | Data | 10 ianuarie 2013 13:29:49 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int main()
{
int v[802],i,j,l,k=0,n;
f >> n;
for(i=1;i<=n;i++)f >> v[i];
sort(v+1,v+n+1);
for(i=1;i<n-1;i++)
for(j=i+1;j<n;j++)
for(l=j+1;l<=n;l++)
if(v[i]+v[j]>=v[l])k++;else break;
g << k;
return 0;
}