Cod sursa(job #1143889)
| Utilizator | Data | 16 martie 2014 11:35:01 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include<fstream>
#include<algorithm>
using namespace std;
int v[801];
int main()
{
int n,sol=0,i,j,k;
ifstream f("nrtri.in");
ofstream g("nrtri.out");
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])
{
sol++;
}
else
{
break;
}
}
}
}
g<<sol;
}
