Cod sursa(job #1473487)
| Utilizator | Data | 19 august 2015 15:00:07 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,k;
vector<int> sol;
void back(int i)
{
if (sol.size() == k)
{
for (int j = 0; j < k; ++j)
fout << sol[j] << " ";
fout << "\n";
}
if (sol.size() == k || n-i+1 < k-sol.size())
return;
sol.push_back(i);
back(i+1);
sol.pop_back();
back(i+1);
}
int main()
{
fin >> n >> k;
back(1);
}
