Cod sursa(job #1362251)
| Utilizator | Data | 26 februarie 2015 11:17:23 | |
|---|---|---|---|
| Problema | Combinari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int a[1001],sol[1001],n,i,k,m;
void afis ()
{int i;
for(i=1;i<=m;i++)
g<<a[sol[i]]<<" ";
g<<endl;
}
void back(int k)
{
int i;
if(k>m) afis();
else
for(i=sol[k-1]+1;i<=n;i++)
{
sol[k]=i;
back(k+1);
}
}
int main()
{
f>>n>>m;
k=n;
for(i=1;i<=n;i++) a[i]=i;
back(1);
}
