Cod sursa(job #2260881)
Utilizator | Data | 15 octombrie 2018 18:34:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,x,a[101];
void bacK(int k)
{
for(int i=1;i<=n;i++)
{
if(i>a[k-1]&&k<=x)
{
a[k]=i;
bacK(k+1);
}
if(k==x+1)
{
for(int j=1;j<=x;j++)
{
out<<a[j]<<' ';
}
out<<'\n';
return;
}
}
}
int main()
{
in>>n>>x;
bacK(1);
return 0;
}