Cod sursa(job #1995446)
| Utilizator | Data | 27 iunie 2017 23:37:50 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int v[20],n,k;
bool valid(int nr, int k)
{
for(int i=1; i<k; i++)
if(v[i]==nr) return false;
return true;
}
void comb(int k, int l)
{
for(int i=v[k-1]; i<=n; i++)
{
v[k]=i;
if(valid(i,k))
if(k==l)
{
for(int j=1; j<=k; j++)
fout<<v[j]<<' ';
fout<<'\n';
}
else
comb(k+1,l);
}
}
int main()
{
fin>>n>>k;
v[0]=1;
comb(1,k);
fin.close();
fout.close();
return 0;
}
