Cod sursa(job #1511943)
Utilizator | Data | 27 octombrie 2015 13:18:59 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int z[100], n, k;
void afisare(int c)
{
for(int i=1; i<=c; i++)
fout<<z[i]<<" ";
fout<<'\n';
}
void inapoi(int c){
for (int i=z[c-1]+1; i<=n; i++){
z[c]=i;
if(c==k) afisare(c);
else
inapoi(c+1);
}
}
int main(){
fin>>n>>k;
inapoi(1);
return 0;
}