Cod sursa(job #696097)
Utilizator | Data | 28 februarie 2012 16:45:36 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include<algorithm>
#include <fstream>
using namespace std;
int a[20],i,n,k;
int main ()
{ifstream f("combinari.in");
ofstream g("combinari.out");
f>>n>>k;
for(i=1;i<=k;i++)
a[i]=1;
do
{for(i=1;i<=n;i++)
if(a[i]) g<<i<<" ";
g<<'\n';
}while(prev_permutation(a+1,a+n+1));
f.close(); g.close();
return 0;
}