Cod sursa(job #1251482)
| Utilizator | Data | 29 octombrie 2014 16:32:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,v[20],m;
void afis()
{
int i;
for(i=1;i<=m;++i) g<<v[i]<<" ";
g<<'\n';
}
int cont(int k)
{
int i;
for(i=1;i<k;++i) if(v[i]==v[k]||v[i]>v[i+1]) return 0;
return 1;
}
void back(int k)
{
int i;
if(k==m+1) afis();
else for(i=1;i<=n;++i)
{
v[k]=i;
if(cont(k)) back(k+1);
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}
