Pagini recente » Rating 123456789 (dilraba) | Cod sursa (job #1348531) | Cod sursa (job #2863400) | Cod sursa (job #2752867) | Cod sursa (job #1411218)
#include <fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n,a[50],i,j,k;
bool ok;
int main()
{
fi>>n>>k;
i=1;
while(i>0){
if(i==k+1){
for(j=1;j<=i-1;j++) fo<<a[j]<<" ";
fo<<'\n';
i--;
}
else
if(a[i]<n){
a[i]++;
ok=true;
for(j=1;j<i;j++){
if(a[i]==a[j])ok=false;
if(a[i]<a[j])ok=false;
}
if(ok==true) i++;
}
else {a[i]=0;i--;}
}
return 0;
}