Pagini recente » Cod sursa (job #2572249) | Cod sursa (job #441249) | Istoria paginii runda/baraj2010_ziua2 | Cod sursa (job #1339582) | Cod sursa (job #1483077)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("submultimi.in");
ofstream out("submultimi.out");
int n;
int A[20];
int v[20];
void rec(int poz)
{
if(poz != 1) {
for(int i = 1; i < poz; i++)
out << v[i] << " ";
out << "\n";
}
if(poz == n + 1)
return ;
for(int i = v[poz - 1] + 1 ; i <= n ; ++ i) {
v[poz] = i;
rec(poz + 1);
}
}
int main()
{
in >> n;
rec(1);
return 0;
}