Cod sursa(job #2515392)
Utilizator | Data | 28 decembrie 2019 15:02:46 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <algorithm>
#include<bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");ofstream fout("combinari.out");
int n,k;int ar[20];
void combin(long int ln){
if(ln>k){
for(int i=1;i<=k;++i)fout<<ar[i]<<' ';fout<<endl;
return;
}
{
for(int i=ar[ln-1]+1;i<=n;++i){
ar[ln]=i;combin(ln+1);
}
}
}
int main(){
fin>>n>>k;
combin(1);
}