Cod sursa(job #1908769)
Utilizator | Data | 7 martie 2017 10:20:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,k,x[20];
void c(int l)
{
x[0]=1;
int i;
if(l==k)
{
for(int i=2;i<=k;i++)
g<<x[i]<<' ';
g<<'\n';
}
else
{
for(i=x[l]+1;i<=n;i++)
{
x[l+1]=i;
c(l+1);
}
}
}
int main()
{
f>>n>>k;
k++;
c(1);
return 0;
}