Pagini recente » Cod sursa (job #2419293) | Cod sursa (job #2129012) | Cod sursa (job #1217885) | Cod sursa (job #1894703) | Cod sursa (job #1519637)
#include <fstream>
#include<string.h>
using namespace std;
int main()
{
ifstream f("madi.in");
ofstream g("madi.out");
int v[100],i,j,k,n,ok,aux;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
do{ok=0;
for(i=1;i<=n-1;i++)
if(v[i]>v[i+1])
{
aux=v[i];
v[i]=v[i+1];
v[i+1]=aux;
ok=1;
}
}
while(ok==1);
for(i=1;i<=n-2;i++)
{j=i+1;
while(j<=n-1)
{k=j+1;
while(v[i]+v[j]>=v[k])
k++;
for(int l=j+1;l<k;l++)
g<<v[i]<<" "<<v[j]<<" "<<v[l]<<endl;
j++;}
}
return 0;
}