Cod sursa(job #1846624)
| Utilizator | Data | 13 ianuarie 2017 18:11:45 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <iostream>
#include <cstring>
#include <utility>
#include <queue>
#include <climits>
#include <cctype>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int s[20],n,k;;
void combinari(int l){
int i;
if(l==k){
for(i=1;i<=k;i++)
fout<<s[i]<<" ";
fout<<"\n";
}
else{
for(i=s[l]+1;i<=n;i++){
s[l+1]=i;
combinari(l+1);
}
}
}
int main(){
fin>>n>>k;
combinari(0);
return 0;
}
