Cod sursa(job #941941)
| Utilizator | Data | 20 aprilie 2013 10:57:19 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[801];
int main()
{
ifstream f("nrtri.in");
ofstream g("nrtri.out");
int n,i,j,k,a,b,c,nr=0;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n-2;i++)
{
a=v[i];
for(j=i+1;j<=n-1;j++)
{
b=v[j];
for(k=j+1;k<=n;k++)
{
c=v[k];
if(a+b>=c&&b+c>=a&&a+c>=b)
nr++;
else
if(c>a+b)
break;
}
}
}
g<<nr;
f.close();
g.close();
return 0;
}
