Cod sursa(job #667371)
| Utilizator | Data | 22 ianuarie 2012 23:03:20 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int n,k,uz[20],sol[20];
ofstream fout("combinari.out");
void back(int kk)
{
if(kk==k+1)
{
for(int i=1;i<=k;++i)
fout<<sol[i]<<" ";
fout<<"\n";
}
else
for(int i=sol[kk-1]+1;i<=n;++i)
if(!uz[i])
{
uz[i]=1;
sol[kk]=i;
back(kk+1);
uz[i]=0;
}
}
int main()
{
ifstream fin("combinari.in");
fin>>n>>k;
back(1);
}