Cod sursa(job #2101033)
Utilizator | Data | 6 ianuarie 2018 18:48:12 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[20];
void combinari(int k)
{
if(k==m+1)
{
for(int i=1;i<=m;i++)
g<<v[i]<<' ';
g<<"\n";
}
else
{
for(int i=v[k-1]+1;i<=n;i++)
{
v[k]=i;
combinari(k+1);
}
}
}
int main()
{
f>>n>>m;
combinari(1);
return 0;
}