Pagini recente » Cod sursa (job #1023790) | Cod sursa (job #2672667) | Cod sursa (job #19327) | Cod sursa (job #96748) | Cod sursa (job #2930928)
#include <cstdio>
#include <climits>
#include <vector>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <bitset>
#include <map>
#include <cstring>
#include <algorithm>
#define NMAX 2003
#define MOD 1000000007
using namespace std;
int n;
int sol[17];
FILE* fin, * fout;
void afis(int niv)
{
for (int i = 1; i <= niv; i++)
{
fprintf(fout, "%d ", sol[i]);
}
fprintf(fout, "\n");
}
void submult(int nivel)
{
if (nivel <= n)
{
for (int i = sol[nivel - 1]+1; i <= n; i++)
{
sol[nivel] = i;
afis(nivel);
submult(nivel + 1);
sol[nivel] = 0;
}
}
}
int main()
{
fin = fopen("submultimi.in", "r");
fout = fopen("submultimi.out", "w");
fscanf(fin,"%d", &n);
submult(1);
return 0;
}