Cod sursa(job #1673244)
Utilizator | Data | 3 aprilie 2016 16:28:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
ifstream f("combinari.in");
ofstream cout("combinari.out");
int n, k, v[18];
f >> n >> k;
for(int i = 0; i < n; ++i)
v[i] = (i >= k);
do
{
for(int i = 0; i < n; ++i)
if(!v[i]) cout << i+1 << ' ';
cout << '\n';
}while(next_permutation(v, v+n));
return 0;
}