Cod sursa(job #1506948)
Utilizator | Data | 21 octombrie 2015 09:08:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[20],uz[20];
inline void afisare(int n)
{
for(int i=1;i<=n;i++) fout<<v[i]<<" ";
fout<<"\n";
}
inline void combinari(int j,int n,int k)
{
if(j==k+1) afisare(k);
else
{
for(int i=v[j-1];i<=n;i++)
{
if(uz[i]==0)
{
uz[i]=1;
v[j]=i;
combinari(j+1,n,k);
uz[i]=0;
}
}
}
}
int main()
{
int n,k;
fin>>n>>k;
v[0]=1;
combinari(1,n,k);
}