Cod sursa(job #1905924)
Utilizator | Data | 6 martie 2017 11:40:48 | |
---|---|---|---|
Problema | Combinari | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
short n,v[10],c;
bool viz[10];
void back(int k)
{
for(int i=v[k-1]+1;i<=n;++i)
{
if(!viz[i])
{
viz[i]=1;
v[k]=i;
if(k==c)
{
for(int j=1;j<=c;++j) g<<v[j]<<' ';
g<<'\n';
}
else back(k+1);
viz[i]=0;
}
}
}
int main()
{
f>>n>>c;
back(1);
return 0;
}