Cod sursa(job #1320859)
Utilizator | Data | 18 ianuarie 2015 16:46:50 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <math.h>
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,m,a[20];
void back(int k)
{
int i;
if (k==m+1){for(i=1;i<=m;++i) fo<<a[i]<<" ";
fo<<'\n';}
else for(i=a[k-1]+1;i<=n;++i){a[k]=i;
back(k+1);
}
}
int main()
{ fi>>n;
fi>>m;
back(1);
return 0;
}