Cod sursa(job #2569294)
Utilizator | Data | 4 martie 2020 11:46:07 | |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
int v[801];
int main()
{
int n,nr=0;
cin>>n;
for (int i=1; i<=n; i++)
cin>>v[i];
for (int i=1; i<=n-1; i++)
for (int j=i+1; j<=n; j++)
for (int k=j+1; k<=n; k++)
if (v[i]+v[j]>=v[k] && v[i]+v[k]>=v[j] && v[k]+v[j]>=v[i])
{
nr++;
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<" "<<endl;
}
cout<<nr;
return 0;
}