Cod sursa(job #716034)
| Utilizator | Data | 18 martie 2012 10:00:01 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,a[20],m;
void back(int k)
{
int i;
if(k-1==m)
{
for(i=1;i<=m;i++)
fout<<a[i]<<' ';
fout<<'\n';
}
else for(i=a[k-1]+1;i<=n-m+k;i++)
{
a[k]=i;
back(k+1);
}
}
int main()
{
fin>>n>>m;
back(1);
fin.close();
fout.close();
return 0;
}
