Pagini recente » Cod sursa (job #935155) | Cod sursa (job #2790912) | Cod sursa (job #2025324) | Cod sursa (job #1645620) | Cod sursa (job #1010083)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,i,a[10],t,k,sol[10],m;
bool ok[10];
void afis()
{
int i;
for(i=1; i<=m; i++)
g<<a[sol[i]]<<' ';
}
void back(int k)
{
int i;
if(k>m) {afis();g<<'\n';}
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++)
a[i]=i;
k=1;
back(k);
return 0;
}