Cod sursa(job #301420)
Utilizator | Data | 8 aprilie 2009 10:52:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
#include <iostream>
using namespace std;
int x[20],n,k;
ofstream fout ("combinari.out");
void Combinari(int p)
{
if (p==k+1)
{
for (int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
else
for (int i=x[p-1]+1;i<=n-k+p;i++)
{
x[p]=i;
Combinari(p+1);
}
}
int main ()
{
ifstream fin ("combinari.in");
fin>>n>>k;
fin.close();
Combinari(1);
fout.close();
return 0;
}