Cod sursa(job #2201107)
Utilizator | Data | 3 mai 2018 16:47:45 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[20],n,k;
void afis()
{
for(int i=1;i<=k;i++)
g<<sol[i]<<" ";
g<<"\n";
}
void comb(int poz)
{
if(poz==k+1) afis();
else
{
for(int i=sol[poz-1]+1;i<=n;i++)
{
sol[poz]=i;
comb(poz+1);
}
}
}
int main()
{
f>>n>>k;
comb(1);
return 0;
}