Pagini recente » Cod sursa (job #2583237) | Borderou de evaluare (job #158772) | Rezultatele filtrării | Cod sursa (job #2405594) | Cod sursa (job #273977)
Cod sursa(job #273977)
#include <fstream.h>
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k, v[20];
void afis()
{for (int i=1;i<=k;i++)
fout<<v[i]<<" ";
fout<<'\n';
}
void comb(int pas)
{if (pas==k+1) afis();
else
for (int i=v[pas-1]+1;i<=n;i++)
{v[pas]=i;
comb(pas+1);
}
}
int main()
{fin>>n>>k;
comb(1);
fout.close();
return 0;
}