Pagini recente » Cod sursa (job #799606) | Cod sursa (job #799967) | Cod sursa (job #2517195) | Cod sursa (job #2864407) | Cod sursa (job #3284384)
#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000
#define MOD 1000000007
using namespace std;
ifstream fin("submultimi.in");
ofstream fout("submultimi.out");
int st[25], fr[25],n,k;
void Back(int top)
{
if (top > 1)
{
for (int i = 1; i < top; i++)
fout << st[i] << " ";
fout << endl;
}
if (top > n)return;
for (int i = st[top-1]+1; i <= n; i++)
{
if (fr[i] == 0)
{
fr[i] = 1;
st[top] = i;
Back(top + 1);
fr[i] = 0;
}
}
}
int main()
{
fin >> n>>k;
Back(1);
}