Cod sursa(job #589398)
| Utilizator | Data | 12 mai 2011 08:40:03 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
#define Nmax 19
int st[Nmax], k, N, M;
bitset<Nmax> viz;
void back(int k) {
if(k==M+1) {
int i;
for(i=1; i<=M; i++)
g<<st[i]<<" ";
g<<"\n";
}
else {
int i;
for(i=st[k-1]+1; i<=N; i++)
if(!viz[i]) {
st[k]=i;
viz[i]=1;
back(k+1);
viz[i]=0;
}
}
}
int main() {
f>>N>>M;
back(1);
f.close();
g.close();
return 0;
}
