Cod sursa(job #1513434)
| Utilizator | Data | 29 octombrie 2015 15:44:28 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <fstream>
#include <algorithm>
using namespace std;
int v[2010];
int main()
{
ifstream cin("nrtri.in");
ofstream cout("nrtri.out");
int n,c=0,sum;
cin>>n;
for(int i=1;i<=n;++i)
{
cin>>v[i];
}
sort(v+1,v+n+1);
for(int i=1;i<n;i++)
{
for(int j=i+1;j<=n;++j)
{
sum=v[i]+v[j];
for(int k=j+1;k<=n;++k)
{
if(sum>v[k]){++c;}
else break;
}
}
}
cout<<c;
}
