Cod sursa(job #1259993)
Utilizator | Data | 10 noiembrie 2014 19:34:01 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,x[19],e[19];
void combinari(int k)
{
for(int i=x[k-1]+1;i<=n;++i) { x[k]=i;
if(!e[i]) { e[i]=1;
if(k==m) { for(int j=1;j<=m;++j) g<<x[j]<<" ";
g<<'\n';
}
else combinari(k+1);
e[i]=0;
}
}
}
int main()
{
f>>n>>m;
combinari(1);
return 0;
}