Cod sursa(job #1348769)
Utilizator | Data | 19 februarie 2015 20:54:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
std::ifstream in("combinari.in");
std::ofstream out("combinari.out");
int V[19];
int n,k;
int comb(int l)
{
if(l==k)
{
for (int i=1;i<=k;i++)
out<<V[i]<<' ';
out<<'\n';
}
else
for(int i=V[l]+1;i<=n;i++)
{
V[l+1]=i;
comb(l+1);
}
}
int main()
{
in>>n>>k;
comb(0);
in.close();
out.close();
return 0;
}