Cod sursa(job #1808769)
Utilizator | Data | 18 noiembrie 2016 08:21:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
int n,m,v[19];
ifstream f("combinari.in");
ofstream g("combinari.out");
void afis(){
int i;
for(i=1;i<=m;++i)
g<<v[i]<<' ';
g<<'\n';
}
void combina(int k){
int i;
if(k==m+1){afis();}
else for(i=v[k-1]+1;i<=n;++i){
v[k]=i;
combina(k+1);
}
}
int main()
{
f >> n >> m;
combina(1);
return 0;
}