Cod sursa(job #1937462)
| Utilizator | Data | 23 martie 2017 23:08:16 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#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];
long long n,x;
void baack(int K)
{
for(int i=1; i<=n; i++)
{
if(K==1 or v[K-1]<i )
{
v[K]=i;
for (int j=1; j<=K; j++)
g<<v[j]<<" ";
g<<endl;
baack(K+1);
}
}
}
int main()
{
f>>n;
baack(1);
return 0;
}
