Cod sursa(job #1414137)
| Utilizator | Data | 2 aprilie 2015 13:21:00 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int N, used[20], st[20];
void print(int K)
{
for (int i=1; i<=K; ++i)
g<<st[i]<<' '; g<<'\n';
}
void backtr(int K)
{
for (int i=st[K-1]+1; i<=N; ++i)
if (!used[i])
{
used[i]=1; st[K]=i;
print(K); backtr(K+1);
used[i]=0;
}
}
int main()
{
f>>N;
backtr(1);
return 0;
}
