Cod sursa(job #1955944)
Utilizator | Data | 6 aprilie 2017 13:10:18 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
#include <vector>
using namespace std;
int n,k,contor=0;
vector <int> multime(20);
ifstream f("combinari.in");
ofstream g("combinari.out");
void generare(int j)
{
if(contor==k)
{
for(int i=1;i<=contor;i++)
g<<multime[i]<<" ";
g<<"\n";
}
for(int i=j+1;i<=n;i++)
{
contor++;
multime[contor]=i;
generare(i);
contor--;
}
}
int main()
{
f>>n>>k;
generare(0);
f.close();
g.close();
}