Cod sursa(job #1963205)
Utilizator | Data | 12 aprilie 2017 13:00:38 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
int n,k,A[20];
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
void backtr(int q){
if (q==k){
for (int i=1; i<=k; i++) fout<<A[i]<<" ";
fout<<"\n";
}
else{
for (int i=A[q]+1; i<=n; i++) A[q+1]=i,backtr(q+1);
}
}
int main(){
fin>>n>>k;
backtr(0);
return 0;
}