Cod sursa(job #2374872)
Utilizator | Data | 7 martie 2019 21:01:13 | |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include<fstream>
int n,p,s[18];
std::ifstream x("combinari.in");
std::ofstream o("combinari.out");
std::string xf;
void c(int h,int l)
{
if(l==p)
{
xf="";
for(int i=0; i<l; i++)
xf+=s[i]+" ";
o<<xf<<'\n';
return;
}
for(int i=h+1; i<=n; i++)
{
s[l]=i;
c(i,l+1);
}
}
int main()
{
x>>n>>p;
c(0,0);
}