Cod sursa(job #720994)
Utilizator | Vasilescu Ioan Cameleonul | Data | 23 martie 2012 09:45:19 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int triunghi(int a, int b, int c)
{
if(c>=a+b)
return 1;
else return 0;
}
int main()
{
int v[801], n,i,nr=0,k,j;
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(k=j+1;k<=n;j++)
if(triunghi(v[i],v[j],v[k]))
nr++;
else break;
g<<nr;
f.close();
g.close();
return 0;
}