Cod sursa(job #1126085)
Utilizator | Data | 26 februarie 2014 21:12:53 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int n,k,i,v[19];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare()
{
for(i=1;i<=k;i++)fout<<v[i]<<' ';
fout<<'\n';
}
void re(int x)
{
if(x>k)afisare();
else for(v[x]=v[x-1]+1;v[x]<=n;v[x]++)re(x+1);
}
int main()
{
fin>>n>>k;
re(1);
return 0;
}