Cod sursa(job #1939386)
Utilizator | Data | 25 martie 2017 18:10:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include<fstream>
using namespace std;
int n,k,v[19],p=1;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main()
{f>>n>>k;
while(p)
{v[p]++;
if(v[p]<=n-k+p)
if(p==k)
{for(int i=1;i<=p;i++)
g<<v[i]<<' ';
g<<'\n';
}
else
v[++p]=v[p-1];
else
p--;
}
return 0;
}