Cod sursa(job #1501005)
| Utilizator | Data | 12 octombrie 2015 22:37:05 | |
|---|---|---|---|
| Problema | Numarare triunghiuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.5 kb |
#include<fstream>
using namespace std;
int main()
{
long i,n,v[1001],a,b,c,k;
ifstream cin("ntri.in");
ofstream cout("ntri.out");
cin>>n;
k=0;
for(i=1;i<=n;i++) cin>>v[i];
for(a=1;a<=n-2;a++)
{
for(b=a+1;b<=n-1;b++)
{
for(c=b+1;c<=n;c++)
{
if(v[a]<=v[b]+v[c] && v[b]<=v[a]+v[c] && v[c]<=v[a]+v[b])
{
k++;
}
}
}
}
cout<<k;
return 0;
}