Cod sursa(job #2191858)
| Utilizator | Data | 3 aprilie 2018 21:33:21 | |
|---|---|---|---|
| Problema | Submultimi | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
using namespace std;
ifstream f("submultimi.in");
ofstream g("submultimi.out");
int n, sol[30];
bool ok (int k)
{
for(int i=1; i<k; i++)
if(sol[i]==sol[k])
return false;
return true;
}
void afis (int k)
{
for(int i=1; i<=k; i++)
g<<sol[i]<<' ';
g<<'\n';
}
void backtracking (int k)
{
if(k<=n)
{
for(int i=sol[k-1]+1; i<=n; i++)
{
sol[k]=i;
afis(k);
if(ok(k))
backtracking(k+1);
}
}
}
int main()
{
f>>n;
backtracking(1);
return 0;
}
