Cod sursa(job #1535378)
| Utilizator | Data | 24 noiembrie 2015 18:13:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,st[100],K;
int check(int k)
{
for(int i=1;i<k;i++)
if(st[i]>=st[k]){return 0;}
return 1;
}
void afis()
{
for(int i=1;i<=K;i++)
fout<<st[i]<<" ";
fout<<"\n";
}
void perm(int k)
{
if(k<=K)
for(int i=1;i<=n;i++)
{
st[k]=i;
if(check(k))
perm(k+1);
}
else
afis();
}
int main()
{
fin>>n>>K;
perm(1);
}
