Cod sursa(job #1527478)
Utilizator | Data | 18 noiembrie 2015 09:49:20 | |
---|---|---|---|
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 v[101];
int main()
{
int n,i,s,c=0,j,k;
cin>>n;
for(i=1;i<=n;i++)
cin>>v[i];
sort(v+1, v+n+1);
for(i=1;i+2<=n;i++)
for(j=i+1;j+1<=n;j++)
for(k=j+1;k<=n;k++)
{
if(v[i]+v[j]>v[k])
c++;
}
cout<<c;
return 0;
}