Cod sursa(job #1327634)
Utilizator | Data | 26 ianuarie 2015 22:12:22 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int k,n,x[20];
void afis(){
for(int i=1;i<=k;i++)
fout<<x[i]<<" ";
fout<<'\n';}
int cond(int i){
for(int j=1;j<i;j++)
if(x[j]>=x[i])
return 0;
return 1;}
void back(int i){
if(i>k)
afis();
else
for(int j=1;j<=n;j++){
x[i]=j;
if(cond(i))
back(i+1);}
}
int main()
{
fin>>n>>k;
back(1);
return 0;
}