Pagini recente » Cod sursa (job #117189) | Cod sursa (job #1782370) | Cod sursa (job #821764) | Cod sursa (job #1870376) | Cod sursa (job #1937390)
#include <iostream>
#include <fstream>
#define maxx 22
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
bool c[2000001];
long long i,j,k,n;
int v[maxx],m,int K=0;
void Afisare(int v[],int &m)
{
for(int i=1; i<=m; i++)
g<<v[i]<<" ";
g<<endl;
}
void baack (int k)
{
int i;
if(k==m)
Afisare(v,m);
else
for(i=v[k]+1; i<=n; i++)
{
v[k+1]=i;
baack(k+1);
}
}
int main()
{
f >> n >>m;
baack(K);
return 0;
}