Cod sursa(job #1212491)
| Utilizator | Data | 24 iulie 2014 21:33:18 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m,a[20],fr[20];
void scrie()
{
for(int i=1;i<=m;i++)
out<<a[i]<<' ';
out<<'\n';
}
void back(int k)
{
for(int i=1;i<=n;i++)
if(!fr[i]&&a[k-1]<i)
{
a[k] = i;
fr[i] = 1;
if(k>m) scrie();
else back(k+1);
fr[i] = 0;
}
}
int main()
{
in>>n>>m;
back(1);
out.close();
return 0;
}
