Cod sursa(job #2782555)
| Utilizator | Data | 12 octombrie 2021 18:16:11 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[19],k,n;
void afis()
{
int i;
for(i=1;i<=k;i++)
g<<sol[i]<<" ";
g<<'\n';
}
void combinari(int pas)
{
int i;
for(i=sol[pas-1]+1;i<=n-k+pas;i++)
{
sol[pas]=i;
if(pas<k)
combinari(pas+1);
else
afis();
}
}
int main()
{
f>>n>>k;
combinari(1);
return 0;
}
