Cod sursa(job #2214283)
Utilizator | Data | 18 iunie 2018 18:10:57 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int st[102], n, K;
void combinari (int k)
{
int i;
if(k==K+1)
{
for(i=1; i<=K; i++)
{
fout<<st[i]<<" ";
}
fout<<"\n";
}
else
{
for(i=1+st[k-1]; i<=n; i++)
{
st[k]=i;
combinari(k+1);
}
}
}
int main()
{
fin>>n>>K;
st[0]=0;
combinari(1);
fout.close();
return 0;
}