Cod sursa(job #1738737)
Utilizator | Data | 7 august 2016 16:13:05 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
int n,v[100],i,j,m,k=0,gasit=0,aux;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1,v+n+1);
for(i=1;i<=n;i++)
{
for(j=i+1;j<=n;j++)
{
for(m=j+1;m<=n;m++)
if(v[i]+v[j]>=v[m])
k++;
}
}
cout<<k;
}