Pagini recente » Cod sursa (job #1718397) | Cod sursa (job #1814744) | Cod sursa (job #1455071) | Borderou de evaluare (job #1036342) | Cod sursa (job #1240018)
#include <fstream>
using namespace std;
ifstream is ("combinari.in");
ofstream os ("combinari.out");
int n, p, a[20];
void Comb(int k)
{
if( k > p)
{
for(int i = 1; i <= p; ++i)
os << a[i] << ' ';
os << '\n';
return;
}
for(int i = a[k-1]+1; i <= n-p+k; ++i)
{
a[k] = i;
Comb(k+1);
}
}
int main()
{
is >> n >> p;
Comb(1);
is.close();
os.close();
return 0;
}