Cod sursa(job #2296258)
Utilizator | Data | 4 decembrie 2018 16:22:25 | |
---|---|---|---|
Problema | Combinari | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,K;
int x[9];
void Print()
{
int i;
for(i=1;i<=K;++i)
fout<<x[i]<<" ";
fout<<"\n";
}
void Back(int k)
{
int i;
for(i=1;i<=n;++i)
if(x[k-1]<i)
{
x[k]=i;
if(k<K)Back(k+1);
else Print();
}
}
int main()
{
fin>>n>>K;
Back(1);
return 0;
}