Cod sursa(job #547647)
Utilizator | Data | 6 martie 2011 16:22:59 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,q,x[20];
void afis(int k)
{
for(int i=1;i<=q;i++)
g<<x[i]<<" ";
g<<"\n";
}
int valid(int k)
{
for(int i=1;i<k;i++)
if(x[k]==x[i]) return 0;
for(int i=2;i<=k;i++)
if(x[i-1]>x[i]) return 0;
return 1;
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
x[k]=i;
if(valid(k))
if(k==q) afis(k);
else
back(k+1);
}
}
int main()
{
f>>n>>q;
back(1);
return 0;
}