Cod sursa(job #1539039)
| Utilizator | Data | 30 noiembrie 2015 08:45:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[100],n,p;
void afis(){
for(int i=1;i<=p;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
int valid(int k){
if(k>1 && st[k]<=st[k-1])return 0;
return 1;
}
void bkt(int k){
int i;
for(i=1;i<=n;i++){
st[k]=i;
if(valid(k))
if(k==p)
afis();
else bkt(k+1);
}
}
int main()
{
fin>>n>>p;
bkt(1);
fin.close();
fout.close();
return 0;
}
