Cod sursa(job #1840722)
Utilizator | Data | 4 ianuarie 2017 19:25:46 | |
---|---|---|---|
Problema | Combinari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, k, uz[20], rs[20];
void back(int l){
int i;
if (l==k) {
for(i=1; i<=k; i++) g<<rs[i]<<" ";
g<<endl;
} else for(i=rs[l]+1; i<=n;i++){
rs[l+1]=i;
back(l+1);
}
}
int main(){
f>>n>>k;
back(0);
return 0;
}