Cod sursa(job #422041)
Utilizator | Data | 22 martie 2010 07:33:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
bool b[20];
short i,n,k;
int main()
{
in>>n>>k;
for(i=0; i<k; i++)
b[i] = true;
do
{
for(i=0; i<n; i++)
if(b[i])
out<<i+1<<' ';
out<<'\n';
}
while(prev_permutation(b,b+n));
return 0;
}