Cod sursa(job #1541765)
Utilizator | Porcescu Ion ion_1997 | Data | 4 decembrie 2015 15:43:22 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
using namespace std;
ifstream f ("combinari.in");
ofstream g ("combinari.out");
int v[1000] , n , p;
void afis()
{
for ( int i = 1 ; i <= p; ++i)
{g << v[i] << ' ';}
g << '\n';
}
void vback()
{
int k = 1;
v[k] = 0;
do
{
while (v[k] < n - p + k)
{
v[k]++;
if(k == p)
afis();
else
{
k++;
v[k] = v[k - 1];
}
}
k--;
}while(k > 0);
}
int main ()
{
f >> n >> p;
vback();
return 0;
}