Cod sursa(job #1139594)
Utilizator | Data | 11 martie 2014 12:11:03 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int st[20];
int n,m;
void Back(int k)
{
int i;
if(k==m+1)
{
for(i=1;i<=m;++i) g<<st[i]<<" ";
g<<'\n';
}
else
{
for(i=st[k-1]+1;i<=n-m+k;++i)
{
st[k]=i;
Back(k+1);
}
}
}
int main()
{
f>>n>>m;
Back(1);
return 0;
}