Pagini recente » Cod sursa (job #2423830) | Borderou de evaluare (job #2426234) | Borderou de evaluare (job #2424195) | Borderou de evaluare (job #2427543) | Cod sursa (job #696097)
Cod sursa(job #696097)
#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;
}