Cod sursa(job #3175019)
Utilizator | Ceclan Tudor Tudor28 | Data | 25 noiembrie 2023 11:33:55 |
---|---|---|---|
Problema | Numarare triunghiuri | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <iostream>
#include <algorithm>
using namespace std;
int v[805];
int main()
{
int n;
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>v[i];
}
sort(v+1,v+1+n);
for(int i=1; i<=n; i++)
{
for(int j=i+1; j<=n; j++)
{
for(int k=j+1; k<=n; k++)
{
if(v[i] + v[j] > v[k]){
cout<<v[i]<<" "<<v[j]<<" "<<v[k]<<'\n';
cout<<i<<" "<<j<<" "<<k<<'\n'<<'\n';
}
}
}
}
//
return 0;
}