Cod sursa(job #2374863)
Utilizator | Data | 7 martie 2019 20:58:13 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.26 kb |
#include <iostream>
#include<fstream>
int n,p,s[18];std::ifstream x("combinari.in");std::ofstream o("combinari.out");void c(int h,int l){if(l==p){for(int i=0; i<l; i++)o<<s[i]<<" ";o<<'\n';return;}for(int i=h+1; i<=n; i++){s[l]=i;c(i,l+1);}}int main(){x>>n>>p;c(0,0);}