Cod sursa(job #1934974)
Utilizator | Marin Vasile Peptenaru MarinPeptenaru | Data | 21 martie 2017 22:12:11 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20];
int n,p;
void back (int k)
{
if(k>p)
{
for(int i=1; i<=p; i++)
g<<st[i]<<" ";
g<<'\n';
}
else
{
for(int i=st[k-1]+1;i<=n; i++)
{
st[k]=i;
bool q=1;
for(int j=1; j<k; j++)
if(st[j]==st[k])
{
q=0;
break;
}
if(q)
back(k+1);
}
}
}
int main()
{
f>>n>>p;
back(1);
return 0;
}