Pagini recente » Cod sursa (job #1435547) | Cod sursa (job #2513360) | Cod sursa (job #1160) | Cod sursa (job #2649228) | Cod sursa (job #1937478)
#include <iostream>
#include <fstream>
#define maxx 20
#include <vector>
#include <algorithm>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int v[maxx];
int n,x,a,j,i,l;
void baack(int K)
{
int i,j;
for(int i=v[K-1]+1; i<=n; i++)
{
v[K]=i;
if(K<=n)
{
for(int j=1; j<=K; j++)
g<<v[j]<<" ";
g<<endl;
}
baack(K+1);
}
}
int main()
{
f>>n;
baack(1);
return 0;
}