Pagini recente » Cod sursa (job #3162191) | Cod sursa (job #2989240) | Cod sursa (job #1916462) | Cod sursa (job #1517592) | Cod sursa (job #1553142)
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int i,n,sol[50],a[50],m,pus[50];
void afis ()
{
int i;
for(i=1; i<=m; i++)
g<<a[sol[i]]<<" ";
g<<'\n';
}
void back (int k)
{
int i;
if(k>m) afis ( );
else
{
for(i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
back(k+1);
}
}
}
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
f>>a[i];
back(1);
return 0;
}