Cod sursa(job #1014161)
Utilizator | Data | 22 octombrie 2013 11:52:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k,v[19];
void back(int l)
{
int i;
if (l==k)
{
for (i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<"\n";
}
else
for (i=v[l]+1;i<=n;i++)
{
v[l+1]=i;
back(l+1);
}
}
int main()
{
fin>>n>>k;
back(0);
return 0;
}