Pagini recente » Cod sursa (job #2335899) | Cod sursa (job #2845674) | Cod sursa (job #2083638) | Cod sursa (job #254088) | Cod sursa (job #663951)
Cod sursa(job #663951)
#include<fstream>
using namespace std;
int i,n,sol[25],r,m;
ifstream f("combinari.in");
ofstream g("combinari.out");
bool ok(int k)
{
if (k>1 & sol[k-1]>=sol[k]) return false;
else return true;
}
void back(int k)
{
int i;
if (k>m) {
for (i=1;i<=m;i++)
g<<sol[i]<<" ";
g<<"\n";
}
else {
for (i=1;i<=n;i++){
sol[k]=i;if (ok(k)) back(r+1);
}
}
}
int main(){
f>>n>>m;
back(1);
return 0;
}