Cod sursa(job #1367883)
Utilizator | Data | 2 martie 2015 11:12:20 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20],n,p;
void afisare(int k)
{
for (int i=1; i<=k; ++i) g<<st[i]<<' ';
g<<'\n';
}
void Back(int k)
{
if (k==p+1)
{
afisare(k-1);
return;
}
for (int i=st[k-1]+1; i<=n; ++i)
{
st[k]=i;
Back(k+1);
}
}
int main()
{
f>>n;
f>>p;
Back(1);
f.close(); g.close();
return 0;
}