Cod sursa(job #2139076)
Utilizator | Data | 22 februarie 2018 01:25:03 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,v[21],k;
void back(int q){
if(q == k){
for(int i = 1; i <= k; i++) fout<<v[i]<<" ";
fout<<"\n";
}
else{
for(int i = v[q]+1; i <= n; i++){
v[q+1] = i;
back(q+1);
}
}
}
int main()
{
fin>>n>>k;
back(0);
}