Cod sursa(job #2503605)
Utilizator | Data | 3 decembrie 2019 15:05:42 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,v[20],i,p;
void combinari(int n, int p,int k)
{
int i;
if(k>p)
{
for(i=1;i<k;i++)
g<<v[i]<<" ";
g<<'\n';
}
else
{
for(v[k]=v[k-1]+1;v[k]<=n-p+k;v[k]++)
combinari(n,p,k+1);
}
}
int main()
{
f>>n>>p;
v[0]=0;
combinari(n,p,1);
}