Cod sursa(job #868735)
Utilizator | Data | 31 ianuarie 2013 15:59:47 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int x[20], n,m;
void afisez()
{
for(int i=1; i<=m; i++)
g<<x[i]<<' ';
g<<'\n';
}
int back(int k)
{
if(k==m+1)
afisez();
else
for(int i=x[k-1]+1; i<=n; i++)
{
x[k]= i;
back(k+1);
}
}
int main()
{
f>>n>>m;
back(1);
return 0;
}