Cod sursa(job #1923294)
Utilizator | Data | 10 martie 2017 22:08:02 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in"); ofstream g("combinari.out");
int n,k; int a[20];
void back(int l)
{
int i;
if (l==k)
{
for(i=1;i<=l;i++) g<<a[i]<<' ';
g<<'\n';
}
else
{
for(i=a[l]+1;i<=n;i++)
{
a[l+1]=i;
back(l+1);
}
}
}
int main()
{
f>>n>>k;
a[0]=0;
back(0);
return 0;
}