Cod sursa(job #2105567)
Utilizator | Data | 13 ianuarie 2018 17:00:50 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int n,m,k[20];
void combinari(int x,int nr)
{ if(x<=m)
{ for(int i=nr+1;i<=n-(m-x);i++)
k[x]=i,combinari(x+1,i);
}
else
{ for(int i=1;i<=m;i++)
out<<k[i]<<" ";
out<<'\n';
}
}
int main()
{ in>>n>>m;
combinari(1,0);
in.close();
out.close();
return 0;
}