Cod sursa(job #2285627)
Utilizator | Data | 18 noiembrie 2018 20:35:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
int k,n,s[20],i,l;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
void backt(int l)
{
int i;
for(i=s[l-1]+1; i<=n; ++i)
{
s[l]=i;
if(l==k)
{
for(int j=1; j<=k; ++j)
{
fout<<s[j]<<" ";
}
fout<<"\n";
}
else backt(l+1);
}
}
int main()
{
fin>>n>>k;
backt(1);
}