Pagini recente » Cod sursa (job #1795201) | Cod sursa (job #1781537) | Borderou de evaluare (job #1516021) | Atasamentele paginii nusemaipoate | Cod sursa (job #2760484)
#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<<"\n";
return;
}
{
for(int i=ar[ln-1]+1;i<=n;++i){
ar[ln]=i;combin(ln+1);
}
}
}
int main(){
fin>>n>>k;
combin(1);
}