Cod sursa(job #2156460)
Utilizator | Data | 8 martie 2018 19:05:30 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,x[50];
void comb(int k)
{
int i;
if(k==m+1)
{
for(int i=1; i<=m; i++)
g<<x[i]<<" ";
g<<'\n';
}
else
for(i=x[k-1]+1; i<=n-m+k; i++)
{
x[k]=i;
comb(k+1);
}
}
int main()
{
f>>n>>m;
comb(1);
return 0;
}