Cod sursa(job #693916)
| Utilizator | Data | 27 februarie 2012 17:42:05 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int sol[20];
bool v[20];
void afis(int n,int m)
{
int i;
for(i=1; i<=m; i++)
g<<sol[i]<<" ";
g<<'\n';
}
void back(int k, int n,int m,int i)
{
if(k>m)
afis(n,m);
else
for(i; i<=n; i++)
if(v[i]==0)
{
sol[k]=i;
v[i]=1;
back(k+1,n,m,i+1);
v[i]=0;
}
}
int main()
{
int n,m;
f>>n;
f>>m;
back(1,n,m,1);
}