Pagini recente » Cod sursa (job #411059) | Cod sursa (job #316340) | Cod sursa (job #2594901) | Cod sursa (job #2062037) | Cod sursa (job #1018242)
#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("nrtri.in");
ofstream fout("nrtri.out");
#define MAX 800
int main()
{
int n,a[MAX],k=0,j,z;
fin >> n;
int i;
for(i=1;i<=n;i++)
fin >> a[i];
sort(a+1,a+n+1);
for(i=1;i<=n-2;i++)
for(j=i+1;j<=n-1;j++)
for(z=j+1;z<=n;z++)
if(a[i]+a[j]>=a[z] && a[i]+a[z]>=a[j] && a[j]+a[z]>=a[i] )
{
cout<<i<<" "<<j<<" "<<z<<"\n";
k++;
}
fout << k<< "\n";
return 0;
}