Pagini recente » Borderou de evaluare (job #1185021) | Cod sursa (job #2973291) | Cod sursa (job #847067) | Cod sursa (job #3265236) | Cod sursa (job #2813396)
#include <fstream>
using namespace std;
int n,p, x[100];
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
void afis(){
for (int i = 1;i <=p;++i)
cout << x[i] << " ";
cout << "\n";
}
void back(int k){
if (k == p+1)
afis();
else
for (int i = x[k-1] +1; i <=n +p - k;++i){
x[k] = i;
back(k+1);
}
}
int main(){
cin >>n >> p;
back(1);
}