Cod sursa(job #921908)
Utilizator | Data | 21 martie 2013 20:25:33 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
int Sol[20],Visited[20];
int N,K;
ofstream fout("combinari.out");
void Write()
{
for(int i=1;i<=K;i++)
fout<<Sol[i]<<" ";
fout<<'\n';
}
void Back(int k)
{
if(k>K)
Write();
else
{
for(int i=Sol[k-1]+1;i<=N;i++)
{
Sol[k]=i;
if(Visited[i]==0)
{
Visited[i]=1;
Back(k+1);
Visited[i]=0;
}
}
}
}
int main()
{
ifstream fin("combinari.in");
fin>>N>>K;
fin.close();
Back(1);
fout.close();
return 0;
}