Cod sursa(job #1570196)
Utilizator | Data | 16 ianuarie 2016 11:35:37 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
const int maxn=20;
int n,k,st[maxn];
void afisare()
{
for(int i=1;i<=k;++i)
g<<st[i]<<' ';
g<<'\n';
}
void back(int p)
{
if(p==k+1)
{
afisare();
return;
}
for(int i=st[p-1]+1;i<=n;++i)
{
st[p]=i;
back(p+1);
}
}
int main()
{
f>>n>>k;
back(1);
return 0;
}