Cod sursa(job #2084990)
Utilizator | Data | 9 decembrie 2017 14:43:39 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int v[801];
int main()
{
int n,cnt=0;
cin>>n;
for (int i=0;i<n;i++)
{
cin>>v[i];
}
for (int i=0;i<n;i++)
{
for (int j=0;j<i;j++)
{
for (int k=0;k<j;k++)
{
int a=v[i],b=v[j],c=v[k];
if (a<=b+c&&c<=b+a&&b<=a+c&&i!=j&&j!=k&&k!=i)
cnt++;
}
}
}
cout<<cnt;
return 0;
}