Cod sursa(job #2079854)
Utilizator | Data | 1 decembrie 2017 21:35:54 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, v[20], m;
void P(int k) {
int bun, i, j;
if(k<=m)
for(i=v[k-1]+1; i<=n; i++) {
v[k]=i;
P(k+1);
}
else {
for(i=1; i<=m; i++)
g<<v[i]<<' ';
g<<'\n';
}
}
int main()
{
f>>n>>m;
P(1);
return 0;
}