Pagini recente » Cod sursa (job #1478071) | Cod sursa (job #2602400) | Cod sursa (job #1124773) | Cod sursa (job #3280178) | Cod sursa (job #1164145)
#include<fstream>
#include<cstdio>
#include<set>
#include<vector>
#include<algorithm>
#define FOR(a,b,c) for(int a=b;a<=c;++a)
#include<cstring>
#include<bitset>
#include<cmath>
#include<iomanip>
#include<queue>
#define f cin
#define g cout
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define mod 1000000007
#define ll unsigned long long
#define bit 20
#define inf 500000000
#define N 100
#define mod 1999999973
#define inu "combinari.in"
#define outu "combinari.out"
using namespace std;
ifstream f(inu);
ofstream g(outu);
//int dx[]={0,0,0,1,-1};
//int dy[]={0,1,-1,0,0};
int v[N],viz[N],n,m;
void back(int k)
{
if(k>m)
{
FOR(i,1,m)
g<<v[i]<<" ";
g<<"\n";
return ;
}
FOR(i,v[k-1]+1,n)
{
if(!viz[i])
{
v[k]=i;
viz[i]=1;
back(k+1);
viz[i]=0;
}
}
}
int main ()
{
f>>n>>m;
back(1);
return 0;
}