Cod sursa(job #2036263)
Utilizator | Mihail Turcan mihailraz | Data | 10 octombrie 2017 16:02:09 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,k;
int S[19],F[19];
void g(int niv)
{
if(niv==k)
{
for(int i=1; i<=k; i++)
fo<<S[i]<<" ";
fo<<"\n";
}
else
for(int i=1; i<=n; i++)
{
if(F[i]==0 && S[niv]<i)
{
F[i]=1;
S[niv+1]=i;
g(niv+1);
F[i]=0;
}
}
}
int main()
{
fi>>n>>k;
g(0);
fi.close();
fo.close();
return 0;
}