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