Cod sursa(job #2571622)
Utilizator | Data | 5 martie 2020 08:57:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,x[100],ok[10],p;
void bkt(int k)
{
if(k==p+1)
{
for(int i=1;i<=p;i++) g<<x[i]<<" ";
g<<'\n';
return;
}
for(int i=1;i<=n;i++)
{
if(i>x[k-1])
{
x[k]=i;
bkt(k+1);
}
}
}
int main()
{
f>>n>>p;
bkt(1);
}