Pagini recente » Istoria paginii runda/preoji.bdc.19/clasament | Cod sursa (job #1614046) | Cod sursa (job #1779137) | Cod sursa (job #786271) | Cod sursa (job #1693593)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int main(){
int X[20],k,n,m,as,ev,i;
X[0]=0;k=0;
f>> n >> m;
while(k>=0){
do{
as=0;
if(X[k]<n){
X[k]++;
as=1;
ev=1;
for(i=0;i<k;i++)
if(X[i]>=X[k])ev=0;
}
}while(as&&(!as||!ev));
if(as)
if(k==m-1){
for(i=0;i<m;i++)g << X[i] << " ";g<< '\n';
}
else
k++,X[k]=0;
else
k--;
}
f.close();
g.close();
return 0;
}